Triple
T2426176
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | John H. Conway |
E53530
|
entity |
| Predicate | hasConcept |
P531
|
FINISHED |
| Object |
Conway circle theorem
The Conway circle theorem is a geometric result in triangle geometry that identifies a special circle associated with a triangle and certain constructed points, revealing notable collinearities and concyclicity relationships.
|
E266109
|
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: Conway circle theorem | Statement: [John H. Conway, hasConcept, Conway circle theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Conway circle theorem Context triple: [John H. Conway, hasConcept, Conway circle theorem]
-
A.
de Bruijn–Erdős theorem
The de Bruijn–Erdős theorem is a fundamental result in combinatorics and graph theory that relates finite and infinite structures, notably asserting that certain properties of infinite graphs or set systems are determined by their finite substructures.
-
B.
Conway sphere
The Conway sphere is a mathematical construct in knot theory used to decompose knots and links into simpler tangles, named after mathematician John Horton Conway.
-
C.
Sperner's lemma
Sperner's lemma is a fundamental result in combinatorial topology that guarantees the existence of a fully labeled simplex in certain labeled triangulations, and is widely used to prove fixed-point and equilibrium theorems.
-
D.
Euler’s polyhedron formula
Euler’s polyhedron formula is a fundamental result in topology and geometry that relates the numbers of vertices, edges, and faces of a convex polyhedron through the equation V − E + F = 2.
-
E.
Fermat polygonal number theorem
The Fermat polygonal number theorem is a result in number theory stating that every positive integer can be expressed as a sum of a fixed number of polygonal numbers of a given order.
- 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: Conway circle theorem Triple: [John H. Conway, hasConcept, Conway circle theorem]
Generated description
The Conway circle theorem is a geometric result in triangle geometry that identifies a special circle associated with a triangle and certain constructed points, revealing notable collinearities and concyclicity relationships.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Conway circle theorem Target entity description: The Conway circle theorem is a geometric result in triangle geometry that identifies a special circle associated with a triangle and certain constructed points, revealing notable collinearities and concyclicity relationships.
-
A.
de Bruijn–Erdős theorem
The de Bruijn–Erdős theorem is a fundamental result in combinatorics and graph theory that relates finite and infinite structures, notably asserting that certain properties of infinite graphs or set systems are determined by their finite substructures.
-
B.
Conway sphere
The Conway sphere is a mathematical construct in knot theory used to decompose knots and links into simpler tangles, named after mathematician John Horton Conway.
-
C.
Sperner's lemma
Sperner's lemma is a fundamental result in combinatorial topology that guarantees the existence of a fully labeled simplex in certain labeled triangulations, and is widely used to prove fixed-point and equilibrium theorems.
-
D.
Euler’s polyhedron formula
Euler’s polyhedron formula is a fundamental result in topology and geometry that relates the numbers of vertices, edges, and faces of a convex polyhedron through the equation V − E + F = 2.
-
E.
Fermat polygonal number theorem
The Fermat polygonal number theorem is a result in number theory stating that every positive integer can be expressed as a sum of a fixed number of polygonal numbers of a given order.
- 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_69ab495c44d48190b7235b23719bc3f6 |
completed | March 6, 2026, 9:38 p.m. |
| NER | Named-entity recognition | batch_69abc99b95548190b77d36de9adfe3bb |
completed | March 7, 2026, 6:45 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69aebf637be4819096874a24e87f84ab |
completed | March 9, 2026, 12:38 p.m. |
| NEDg | Description generation | batch_69aec7698e9881909c75137cb5cf2a0c |
completed | March 9, 2026, 1:13 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69aec87df0648190b8099b4eaa3d9b22 |
completed | March 9, 2026, 1:17 p.m. |
Created at: March 6, 2026, 9:42 p.m.