Triple

T5256293
Position Surface form Disambiguated ID Type / Status
Subject Carathéodory’s theorem in convex geometry E118706 entity
Predicate relatedTo P37 FINISHED
Object 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.
E506847 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: Helly’s theorem | Statement: [Carathéodory’s theorem in convex geometry, relatedTo, Helly’s theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Helly’s theorem
Context triple: [Carathéodory’s theorem in convex geometry, relatedTo, Helly’s theorem]
  • A. 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.
  • B. Erdős–Szekeres theorem
    The Erdős–Szekeres theorem is a fundamental result in combinatorial geometry that guarantees the existence of large convex polygons within sufficiently large sets of points in the plane in general position.
  • C. Tucker’s lemma
    Tucker’s lemma is a combinatorial analog of the Borsuk–Ulam theorem that provides conditions guaranteeing the existence of certain complementary edge labels in triangulated spheres.
  • D. 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.
  • E. Steinhaus theorem
    The Steinhaus theorem is a fundamental result in measure theory stating that the difference set of any subset of the real numbers with positive Lebesgue measure contains an open interval around zero.
  • 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: Helly’s theorem
Triple: [Carathéodory’s theorem in convex geometry, relatedTo, Helly’s theorem]
Generated description
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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Helly’s theorem
Target entity description: 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.
  • A. 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.
  • B. Erdős–Szekeres theorem
    The Erdős–Szekeres theorem is a fundamental result in combinatorial geometry that guarantees the existence of large convex polygons within sufficiently large sets of points in the plane in general position.
  • C. Tucker’s lemma
    Tucker’s lemma is a combinatorial analog of the Borsuk–Ulam theorem that provides conditions guaranteeing the existence of certain complementary edge labels in triangulated spheres.
  • D. 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.
  • E. Steinhaus theorem
    The Steinhaus theorem is a fundamental result in measure theory stating that the difference set of any subset of the real numbers with positive Lebesgue measure contains an open interval around zero.
  • 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_69bd446978108190bb5f9c5c23d93f88 completed March 20, 2026, 12:58 p.m.
NER Named-entity recognition batch_69bd7ba4ecd88190800b5e4eea3abed5 completed March 20, 2026, 4:53 p.m.
NED1 Entity disambiguation (via context triple) batch_69befe7a1f448190acfcdfe37c962028 completed March 21, 2026, 8:24 p.m.
NEDg Description generation batch_69beff55faec8190a75a1b5f339a2c20 completed March 21, 2026, 8:28 p.m.
NED2 Entity disambiguation (via description) batch_69bf001f0d9c8190a67909a06ea41898 completed March 21, 2026, 8:31 p.m.
Created at: March 20, 2026, 1:50 p.m.