Triple
T16991909
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Coxeter–Dynkin diagrams |
E412212
|
entity |
| Predicate | encodes |
P14248
|
FINISHED |
| Object | Coxeter matrix |
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 matrix | Statement: [Coxeter–Dynkin diagrams, encodes, Coxeter matrix]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Coxeter matrix Context triple: [Coxeter–Dynkin diagrams, encodes, Coxeter matrix]
-
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.
Alexander–Briggs notation
Alexander–Briggs notation is a classical system for naming and classifying knots in knot theory, assigning each distinct knot a unique label based on its crossing number and order in knot tables.
-
C.
Bose–Mesner algebra
The Bose–Mesner algebra is a commutative matrix algebra arising from association schemes in algebraic combinatorics, fundamental for studying symmetric relations and distance-regular graphs.
-
D.
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.
-
E.
Sylvester determinant
The Sylvester determinant is a mathematical construct introduced by James Joseph Sylvester, typically referring to a determinant associated with resultants and elimination theory in algebra.
- 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.