Triple
T16991920
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Coxeter–Dynkin diagrams |
E412212
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | Coxeter diagrams |
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 diagrams | Statement: [Coxeter–Dynkin diagrams, relatedTo, Coxeter diagrams]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Coxeter diagrams Context triple: [Coxeter–Dynkin diagrams, relatedTo, Coxeter diagrams]
-
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.
Schläfli symbols
Schläfli symbols are a concise notation system used in geometry to describe regular polygons, polyhedra, and higher-dimensional regular polytopes by encoding their face and vertex configuration.
-
D.
Young diagrams
Young diagrams are combinatorial diagrams consisting of left-justified rows of boxes that visually represent integer partitions and play a central role in the representation theory of symmetric and general linear groups.
-
E.
Hasse diagram (in lattice theory)
A Hasse diagram is a simplified graphical representation of a finite partially ordered set that shows the order relations by connecting elements with upward lines without drawing implied transitive relations.
- 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_6a011b433e688190ac8dda10638a197f |
completed | May 10, 2026, 11:56 p.m. |
Created at: April 10, 2026, 5:32 a.m.