Triple
T16991922
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Coxeter–Dynkin diagrams |
E412212
|
entity |
| Predicate | generalizes |
P2372
|
FINISHED |
| Object | Coxeter graphs |
E412212
|
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: Coxeter graphs | Statement: [Coxeter–Dynkin diagrams, generalizes, Coxeter graphs]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Coxeter graphs Context triple: [Coxeter–Dynkin diagrams, generalizes, Coxeter graphs]
-
A.
Coxeter–Dynkin diagrams
chosen
Coxeter–Dynkin diagrams are graphical representations that encode the structure of reflection groups and root systems, widely used in the classification of regular polytopes, Lie algebras, and symmetries.
-
B.
Cayley graph
A Cayley graph is a graphical representation of a group where vertices correspond to group elements and edges represent multiplication by chosen generators, widely used in group theory and geometric group theory.
-
C.
Petersen graph
The Petersen graph is a famous 10-vertex, 15-edge cubic graph in graph theory known for its high symmetry and role as a counterexample in numerous graph-theoretic problems.
-
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.
Conway groups
Conway groups are a set of three closely related sporadic simple groups discovered by John H. Conway in the study of symmetries of the Leech lattice in group theory.
- 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_69d886cb581c8190ab05f4b429c9cd85 |
completed | April 10, 2026, 5:12 a.m. |
| NER | Named-entity recognition | batch_69e3d283d2388190a78bf8d179e83fdc |
completed | April 18, 2026, 6:50 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_6a00dc14d5688190945f7ae72f724922 |
completed | May 10, 2026, 7:27 p.m. |
Created at: April 10, 2026, 5:32 a.m.