Triple
T12138868
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Pafnuty Chebyshev |
E289130
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Chebyshev center
The Chebyshev center is a concept in geometry and optimization referring to the center of the smallest-radius ball that encloses a given set.
|
E968220
|
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: Chebyshev center | Statement: [Pafnuty Chebyshev, notableWork, Chebyshev center]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Chebyshev center Context triple: [Pafnuty Chebyshev, notableWork, Chebyshev center]
-
A.
Fermat point
The Fermat point is a special point inside a triangle that minimizes the total distance to the triangle’s three vertices.
-
B.
Carathéodory’s theorem in convex geometry
Carathéodory’s theorem in convex geometry is a fundamental result stating that any point in the convex hull of a set in ℝⁿ can be expressed as a convex combination of at most n+1 points from that set.
-
C.
Helly’s theorem
Helly’s theorem is a fundamental result in convex geometry that gives conditions under which a family of convex sets in Euclidean space has a nonempty common intersection.
-
D.
Radon’s theorem
Radon’s theorem is a fundamental result in convex geometry stating that any set of sufficiently many points in Euclidean space can be partitioned into two disjoint subsets whose convex hulls intersect.
-
E.
Soddy circle
A Soddy circle is one of the circles in a configuration of four mutually tangent circles, central to the geometric problem described by Descartes' circle theorem.
- 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: Chebyshev center Triple: [Pafnuty Chebyshev, notableWork, Chebyshev center]
Generated description
The Chebyshev center is a concept in geometry and optimization referring to the center of the smallest-radius ball that encloses a given set.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Chebyshev center Target entity description: The Chebyshev center is a concept in geometry and optimization referring to the center of the smallest-radius ball that encloses a given set.
-
A.
Fermat point
The Fermat point is a special point inside a triangle that minimizes the total distance to the triangle’s three vertices.
-
B.
Carathéodory’s theorem in convex geometry
Carathéodory’s theorem in convex geometry is a fundamental result stating that any point in the convex hull of a set in ℝⁿ can be expressed as a convex combination of at most n+1 points from that set.
-
C.
Helly’s theorem
Helly’s theorem is a fundamental result in convex geometry that gives conditions under which a family of convex sets in Euclidean space has a nonempty common intersection.
-
D.
Radon’s theorem
Radon’s theorem is a fundamental result in convex geometry stating that any set of sufficiently many points in Euclidean space can be partitioned into two disjoint subsets whose convex hulls intersect.
-
E.
Soddy circle
A Soddy circle is one of the circles in a configuration of four mutually tangent circles, central to the geometric problem described by Descartes' circle theorem.
- 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_69d6ab4b5e4c81909950b17151eb0951 |
completed | April 8, 2026, 7:23 p.m. |
| NER | Named-entity recognition | batch_69d9158eef48819083bdce283a363414 |
completed | April 10, 2026, 3:21 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69f5f690ae408190966bb4fe8feaa7d2 |
completed | May 2, 2026, 1:05 p.m. |
| NEDg | Description generation | batch_69f6022ecf38819080f0eb6a3a815c5b |
completed | May 2, 2026, 1:54 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69f606560934819092ba4d4fa162b799 |
completed | May 2, 2026, 2:12 p.m. |
Created at: April 8, 2026, 9:49 p.m.