Triple
T7666102
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | CM |
E173626
|
entity |
| Predicate | author |
P4
|
FINISHED |
| Object | Ronald L. Graham |
E205446
|
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: Ronald L. Graham | Statement: [CM, author, Ronald L. Graham]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Ronald L. Graham Context triple: [CM, author, Ronald L. Graham]
-
A.
Ronald L. Graham
chosen
Ronald L. Graham was an influential American mathematician known for his pioneering work in combinatorics, discrete mathematics, and computational geometry, as well as for popularizing mathematics through both research and expository writing.
-
B.
Richard K. Guy
Richard K. Guy was a British-Canadian mathematician renowned for his work in number theory, combinatorics, and recreational mathematics, and for coauthoring influential books that popularized mathematical games and puzzles.
-
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.
Elwyn R. Berlekamp
Elwyn R. Berlekamp was an American mathematician and engineer known for his influential work in coding theory, combinatorial game theory, and algorithms.
-
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.