Triple
T13507179
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Fibonacci heap |
E321043
|
entity |
| Predicate | introducedBy |
P513
|
FINISHED |
| Object | Robert E. Tarjan |
E83180
|
NE FINISHED |
How this triple was built (2 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: Robert E. Tarjan | Statement: [Fibonacci heap, introducedBy, Robert E. Tarjan]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Robert E. Tarjan Context triple: [Fibonacci heap, introducedBy, Robert E. Tarjan]
-
A.
Robert Tarjan
chosen
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.
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.
-
C.
John E. Hopcroft
John E. Hopcroft is an American computer scientist renowned for his foundational contributions to algorithms and automata theory and as a coauthor of the classic textbook "Introduction to Automata Theory, Languages, and Computation."
-
D.
Philip Klein
Philip Klein was an American screenwriter active during the early 20th century, known for his work on silent and early sound films.
-
E.
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.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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_69d807629d6c8190998f1b9bb12d2ed0 |
completed | April 9, 2026, 8:09 p.m. |
| NER | Named-entity recognition | batch_69dbaf8259a08190ada13c4a3078f07d |
completed | April 12, 2026, 2:43 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69f7548e51b881909a3384812556bc3d |
completed | May 3, 2026, 1:58 p.m. |
Created at: April 9, 2026, 9:43 p.m.