Triple
T7665957
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Thomas H. Cormen |
E173623
|
entity |
| Predicate | name |
P16
|
FINISHED |
| Object | Thomas H. Cormen |
E173623
|
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: Thomas H. Cormen | Statement: [Thomas H. Cormen, name, Thomas H. Cormen]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Thomas H. Cormen Context triple: [Thomas H. Cormen, name, Thomas H. Cormen]
-
A.
Thomas H. Cormen
chosen
Thomas H. Cormen is a computer scientist and professor emeritus at Dartmouth College, best known as a co-author of the widely used textbook "Introduction to Algorithms."
-
B.
Charles E. Leiserson
Charles E. Leiserson is an American computer scientist and MIT professor renowned for his contributions to algorithms, parallel computing, and computer architecture.
-
C.
Michael Sipser
Michael Sipser is an American theoretical computer scientist known for his influential work in computational complexity theory and for authoring a widely used textbook on the theory of computation.
-
D.
Donald E. Knuth
Donald E. Knuth is an American computer scientist renowned for founding the rigorous analysis of algorithms and authoring the seminal multi-volume work "The Art of Computer Programming."
-
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_69c699562484819086752091e3164a27 |
completed | March 27, 2026, 2:51 p.m. |
| NER | Named-entity recognition | batch_69c701c1383c8190ab5bf803bd6211a9 |
completed | March 27, 2026, 10:16 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c89b1fdccc8190a69b4745dc3b2347 |
completed | March 29, 2026, 3:23 a.m. |
Created at: March 27, 2026, 4 p.m.