Triple
T8657119
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Ronald L. Graham |
E205446
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | Ramsey Theory (book) |
E381617
|
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: Ramsey Theory (book) | Statement: [Ronald L. Graham, notableWork, Ramsey Theory (book)]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Ramsey Theory (book) Context triple: [Ronald L. Graham, notableWork, Ramsey Theory (book)]
-
A.
Ramsey theory
chosen
Ramsey theory is a branch of combinatorics that studies the conditions under which order or structure must appear within sufficiently large or complex mathematical objects.
-
B.
Erdős on Graphs: His Legacy
Erdős on Graphs: His Legacy is a mathematical monograph by Fan Chung and Ronald Graham that surveys and extends Paul Erdős’s influential work in graph theory and combinatorics.
-
C.
Erdős–Ko–Rado theorem
The Erdős–Ko–Rado theorem is a fundamental result in extremal combinatorics that determines the maximum size of a family of subsets of a finite set in which every pair of subsets has a non-empty intersection.
-
D.
Conway's 99-graph problem
Conway's 99-graph problem is an unsolved combinatorial question in graph theory, posed by John H. Conway, concerning the existence and properties of a hypothetical 99-vertex graph with highly constrained adjacency conditions.
-
E.
Erdős–Stone theorem
The Erdős–Stone theorem is a fundamental result in extremal graph theory that asymptotically determines the maximum number of edges in an n-vertex graph that avoids containing a given subgraph.
- 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_69ca8350897c819086cde7596fbe5fe7 |
completed | March 30, 2026, 2:06 p.m. |
| NER | Named-entity recognition | batch_69cc484569788190aa41395854684e6f |
completed | March 31, 2026, 10:18 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ceccec941881908263cd3205f10ccd |
completed | April 2, 2026, 8:09 p.m. |
Created at: March 30, 2026, 6:30 p.m.