Triple
T3043274
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Robert Tarjan |
E83180
|
entity |
| Predicate | doctoralStudent |
P167
|
FINISHED |
| Object |
S. Rao Kosaraju
S. Rao Kosaraju is a computer scientist known for his contributions to algorithm design and graph theory, including early work on strongly connected components algorithms.
|
E323101
|
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: S. Rao Kosaraju | Statement: [Robert Tarjan, doctoralStudent, S. Rao Kosaraju]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: S. Rao Kosaraju Context triple: [Robert Tarjan, doctoralStudent, S. Rao Kosaraju]
-
A.
Robert Tarjan
Robert Tarjan is an American computer scientist renowned for his pioneering work in algorithms and data structures, including the development of efficient graph algorithms and the union–find data structure.
-
B.
David S. Johnson
David S. Johnson was a prominent American computer scientist known for his influential work in algorithms and computational complexity, particularly in the study of NP-completeness and approximation algorithms.
-
C.
Jeffrey D. Ullman
Jeffrey D. Ullman is a prominent American computer scientist known for his foundational contributions to database theory, algorithms, and formal languages, and for coauthoring several classic textbooks in computer science.
-
D.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
E.
Richard Karp
Richard Karp is a renowned American computer scientist best known for his foundational work in computational complexity theory and combinatorial algorithms, including the theory of NP-completeness.
- 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: S. Rao Kosaraju Triple: [Robert Tarjan, doctoralStudent, S. Rao Kosaraju]
Generated description
S. Rao Kosaraju is a computer scientist known for his contributions to algorithm design and graph theory, including early work on strongly connected components algorithms.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: S. Rao Kosaraju Target entity description: S. Rao Kosaraju is a computer scientist known for his contributions to algorithm design and graph theory, including early work on strongly connected components algorithms.
-
A.
Robert Tarjan
Robert Tarjan is an American computer scientist renowned for his pioneering work in algorithms and data structures, including the development of efficient graph algorithms and the union–find data structure.
-
B.
David S. Johnson
David S. Johnson was a prominent American computer scientist known for his influential work in algorithms and computational complexity, particularly in the study of NP-completeness and approximation algorithms.
-
C.
Jeffrey D. Ullman
Jeffrey D. Ullman is a prominent American computer scientist known for his foundational contributions to database theory, algorithms, and formal languages, and for coauthoring several classic textbooks in computer science.
-
D.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
E.
Richard Karp
Richard Karp is a renowned American computer scientist best known for his foundational work in computational complexity theory and combinatorial algorithms, including the theory of NP-completeness.
- 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_69ad8b2298908190a7cb4e9bdbf064d0 |
completed | March 8, 2026, 2:43 p.m. |
| NER | Named-entity recognition | batch_69ad9b5ec5988190b8b6c95c743c6d1e |
completed | March 8, 2026, 3:53 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b1eef43da8819094cd438c93c64c86 |
completed | March 11, 2026, 10:38 p.m. |
| NEDg | Description generation | batch_69b1f071a53481908fb1d7b9803c65a6 |
completed | March 11, 2026, 10:45 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69b1f16489e881909368470bb53a900c |
completed | March 11, 2026, 10:49 p.m. |
Created at: March 8, 2026, 3:01 p.m.