Triple
T21610213
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Jakob Steiner |
E533284
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | Steiner’s porism |
—
|
NE NERFINISHED |
How this triple was built (3 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: Steiner’s porism | Statement: [Jakob Steiner, notableWork, Steiner’s porism]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Steiner’s porism Context triple: [Jakob Steiner, notableWork, Steiner’s porism]
-
A.
Poncelet’s porism
Poncelet’s porism is a classical geometric theorem stating that if a closed polygon can be inscribed in one conic and circumscribed about another, then infinitely many such polygons exist, forming a one-parameter family.
-
B.
Poncelet polygon
A Poncelet polygon is a cyclic polygon that can be simultaneously inscribed in one conic and circumscribed about another, illustrating Poncelet’s porism in projective geometry.
-
C.
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.
-
D.
Kepler–Poinsot polyhedra
The Kepler–Poinsot polyhedra are the four regular star polyhedra that extend the concept of Platonic solids into non-convex, self-intersecting forms.
-
E.
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.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Steiner’s porism Target entity description: Steiner’s porism is a classical result in geometry describing a chain of circles tangent to two given nonconcentric circles, where the existence of one such closed chain guarantees infinitely many.
-
A.
Poncelet’s porism
chosen
Poncelet’s porism is a classical geometric theorem stating that if a closed polygon can be inscribed in one conic and circumscribed about another, then infinitely many such polygons exist, forming a one-parameter family.
-
B.
Poncelet polygon
A Poncelet polygon is a cyclic polygon that can be simultaneously inscribed in one conic and circumscribed about another, illustrating Poncelet’s porism in projective geometry.
-
C.
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.
-
D.
Kepler–Poinsot polyhedra
The Kepler–Poinsot polyhedra are the four regular star polyhedra that extend the concept of Platonic solids into non-convex, self-intersecting forms.
-
E.
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.
- F. None of above.
Provenance (2 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_69e0c46411108190bba0d4176dffc9f3 |
completed | April 16, 2026, 11:13 a.m. |
| NER | Named-entity recognition | batch_69ef17e7d1388190922a90cb91ec9fc4 |
completed | April 27, 2026, 8:01 a.m. |
Created at: April 16, 2026, 6:33 p.m.