Triple
T12081176
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Linux kernel hardening |
E287680
|
entity |
| Predicate | usesMechanism |
P1687
|
FINISHED |
| Object |
Yama LSM
Yama LSM is a Linux Security Module focused on strengthening process isolation and restricting ptrace and related debugging capabilities to harden the kernel against local attacks.
|
E968044
|
NE FINISHED |
How this triple was built (4 steps)
Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.
NER
Named-entity recognition
gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: Yama LSM | Statement: [Linux kernel hardening, usesMechanism, Yama LSM]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Yama LSM Context triple: [Linux kernel hardening, usesMechanism, Yama LSM]
-
A.
LSM
LSM is an undergraduate dual-degree program at the University of Pennsylvania that integrates rigorous training in life sciences with business and management education.
-
B.
Log-Structured Merge-Tree
A Log-Structured Merge-Tree (LSM-tree) is a write-optimized data structure that organizes data in sequential logs and periodically merges them to provide efficient writes and good read performance for key-value storage systems.
-
C.
RocksDB
RocksDB is a high-performance, embeddable key–value store developed by Facebook, optimized for fast storage on flash and solid-state drives using a Log-Structured Merge-Tree (LSM) architecture.
-
D.
B-tree
A B-tree is a self-balancing tree data structure that maintains sorted data and allows efficient insertion, deletion, and search operations, commonly used to implement database indexes.
-
E.
Jepsen
Jepsen is a surname most notably associated with individuals such as display technology innovator Mary Lou Jepsen.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Yama LSM Triple: [Linux kernel hardening, usesMechanism, Yama LSM]
Generated description
Yama LSM is a Linux Security Module focused on strengthening process isolation and restricting ptrace and related debugging capabilities to harden the kernel against local attacks.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Yama LSM Target entity description: Yama LSM is a Linux Security Module focused on strengthening process isolation and restricting ptrace and related debugging capabilities to harden the kernel against local attacks.
-
A.
LSM
LSM is an undergraduate dual-degree program at the University of Pennsylvania that integrates rigorous training in life sciences with business and management education.
-
B.
Log-Structured Merge-Tree
A Log-Structured Merge-Tree (LSM-tree) is a write-optimized data structure that organizes data in sequential logs and periodically merges them to provide efficient writes and good read performance for key-value storage systems.
-
C.
RocksDB
RocksDB is a high-performance, embeddable key–value store developed by Facebook, optimized for fast storage on flash and solid-state drives using a Log-Structured Merge-Tree (LSM) architecture.
-
D.
B-tree
A B-tree is a self-balancing tree data structure that maintains sorted data and allows efficient insertion, deletion, and search operations, commonly used to implement database indexes.
-
E.
Jepsen
Jepsen is a surname most notably associated with individuals such as display technology innovator Mary Lou Jepsen.
- F. None of above. chosen
Provenance (5 batches)
The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.
| Step | Stage | Batch ID | Status | When |
|---|---|---|---|---|
| creating | Elicitation | batch_69d6ab4964708190850585628b287b0c |
completed | April 8, 2026, 7:23 p.m. |
| NER | Named-entity recognition | batch_69d904dc98a88190a5873f3fd8e1a0b2 |
completed | April 10, 2026, 2:10 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69f5f66509208190b7206e78df41c2fe |
completed | May 2, 2026, 1:04 p.m. |
| NEDg | Description generation | batch_69f6022ecf38819080f0eb6a3a815c5b |
completed | May 2, 2026, 1:54 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69f606560934819092ba4d4fa162b799 |
completed | May 2, 2026, 2:12 p.m. |
Created at: April 8, 2026, 9:48 p.m.