Triple
T11215182
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Dehn complex |
E265417
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
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.
|
E911229
|
NE FINISHED |
How this triple was built (4 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: Cayley graph | Statement: [Dehn complex, relatedTo, Cayley graph]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Cayley graph Context triple: [Dehn complex, relatedTo, Cayley graph]
-
A.
Coxeter–Dynkin diagrams
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.
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.
-
C.
Graham–Pollak theorem
The Graham–Pollak theorem is a result in graph theory that states the edges of a complete graph on n vertices cannot be partitioned into fewer than n−1 complete bipartite subgraphs.
-
D.
Introduction to Graph Theory
Introduction to Graph Theory is a widely used textbook that provides a clear and accessible introduction to the fundamental concepts and techniques of graph theory.
-
E.
Penrose graphical notation
Penrose graphical notation is a diagrammatic method for representing and manipulating tensors using networks of shapes and lines, widely used in mathematics and theoretical physics.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Cayley graph Triple: [Dehn complex, relatedTo, Cayley graph]
Generated description
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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Cayley graph Target entity description: 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.
-
A.
Coxeter–Dynkin diagrams
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.
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.
-
C.
Graham–Pollak theorem
The Graham–Pollak theorem is a result in graph theory that states the edges of a complete graph on n vertices cannot be partitioned into fewer than n−1 complete bipartite subgraphs.
-
D.
Introduction to Graph Theory
Introduction to Graph Theory is a widely used textbook that provides a clear and accessible introduction to the fundamental concepts and techniques of graph theory.
-
E.
Penrose graphical notation
Penrose graphical notation is a diagrammatic method for representing and manipulating tensors using networks of shapes and lines, widely used in mathematics and theoretical physics.
- F. None of above. chosen
Provenance (5 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_69d6aac59460819089b9848b27f57848 |
completed | April 8, 2026, 7:21 p.m. |
| NER | Named-entity recognition | batch_69d7e8e8eef48190932a85784ce15c86 |
completed | April 9, 2026, 5:59 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69e49762e3188190ba3c0e01cf04f6a1 |
completed | April 19, 2026, 8:50 a.m. |
| NEDg | Description generation | batch_69e49d37989881909c7e75ddfff06726 |
completed | April 19, 2026, 9:15 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69e49f41a1f8819087cc15527dc7ff63 |
completed | April 19, 2026, 9:24 a.m. |
Created at: April 8, 2026, 9:30 p.m.