Triple
T11215183
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Dehn complex |
E265417
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
van Kampen diagram
A van Kampen diagram is a planar, combinatorial 2-complex used in combinatorial group theory to visually represent relations in a group presentation and to prove that a word equals the identity.
|
E911230
|
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: van Kampen diagram | Statement: [Dehn complex, relatedTo, van Kampen diagram]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: van Kampen diagram Context triple: [Dehn complex, relatedTo, van Kampen diagram]
-
A.
Reidemeister moves
Reidemeister moves are the three local diagrammatic transformations in knot theory that characterize when two knot or link diagrams represent the same topological knot.
-
B.
Dehn algorithm
The Dehn algorithm is a decision procedure in combinatorial group theory that solves the word problem for certain groups by systematically reducing words using defining relations.
-
C.
Dehn complex
The Dehn complex is a topological construction introduced by Max Dehn in the study of group presentations and decision problems, encoding relations of a group as a 2-dimensional cell complex.
-
D.
Kerr Penrose diagram
The Kerr Penrose diagram is a conformal spacetime diagram depicting the causal structure of a rotating (Kerr) black hole, including its event horizons, ergoregions, and extended regions.
-
E.
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.
- 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: van Kampen diagram Triple: [Dehn complex, relatedTo, van Kampen diagram]
Generated description
A van Kampen diagram is a planar, combinatorial 2-complex used in combinatorial group theory to visually represent relations in a group presentation and to prove that a word equals the identity.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: van Kampen diagram Target entity description: A van Kampen diagram is a planar, combinatorial 2-complex used in combinatorial group theory to visually represent relations in a group presentation and to prove that a word equals the identity.
-
A.
Reidemeister moves
Reidemeister moves are the three local diagrammatic transformations in knot theory that characterize when two knot or link diagrams represent the same topological knot.
-
B.
Dehn algorithm
The Dehn algorithm is a decision procedure in combinatorial group theory that solves the word problem for certain groups by systematically reducing words using defining relations.
-
C.
Dehn complex
The Dehn complex is a topological construction introduced by Max Dehn in the study of group presentations and decision problems, encoding relations of a group as a 2-dimensional cell complex.
-
D.
Kerr Penrose diagram
The Kerr Penrose diagram is a conformal spacetime diagram depicting the causal structure of a rotating (Kerr) black hole, including its event horizons, ergoregions, and extended regions.
-
E.
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.
- 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.