Triple

T998592
Position Surface form Disambiguated ID Type / Status
Subject Constantin Carathéodory E21550 entity
Predicate notableWork P4 FINISHED
Object 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.
E118706 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: Carathéodory’s theorem in convex geometry | Statement: [Constantin Carathéodory, notableWork, Carathéodory’s theorem in convex geometry]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Carathéodory’s theorem in convex geometry
Context triple: [Constantin Carathéodory, notableWork, Carathéodory’s theorem in convex geometry]
  • A. 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.
  • B. 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.
  • C. Hilbert’s Nullstellensatz
    Hilbert’s Nullstellensatz is a foundational theorem in algebraic geometry that establishes a deep correspondence between ideals in polynomial rings and algebraic sets, linking algebra and geometry.
  • D. Israel–Carter–Robinson uniqueness theorems
    The Israel–Carter–Robinson uniqueness theorems are a set of results in general relativity showing that stationary, asymptotically flat black holes in four-dimensional spacetime are completely characterized by just their mass, charge, and angular momentum.
  • E. Kakutani fixed-point theorem
    The Kakutani fixed-point theorem is a fundamental result in mathematical analysis and game theory that guarantees the existence of fixed points for certain set-valued (multivalued) functions, underpinning key existence proofs such as Nash equilibria.
  • 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: Carathéodory’s theorem in convex geometry
Triple: [Constantin Carathéodory, notableWork, Carathéodory’s theorem in convex geometry]
Generated description
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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Carathéodory’s theorem in convex geometry
Target entity description: 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.
  • A. 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.
  • B. 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.
  • C. Hilbert’s Nullstellensatz
    Hilbert’s Nullstellensatz is a foundational theorem in algebraic geometry that establishes a deep correspondence between ideals in polynomial rings and algebraic sets, linking algebra and geometry.
  • D. Israel–Carter–Robinson uniqueness theorems
    The Israel–Carter–Robinson uniqueness theorems are a set of results in general relativity showing that stationary, asymptotically flat black holes in four-dimensional spacetime are completely characterized by just their mass, charge, and angular momentum.
  • E. Kakutani fixed-point theorem
    The Kakutani fixed-point theorem is a fundamental result in mathematical analysis and game theory that guarantees the existence of fixed points for certain set-valued (multivalued) functions, underpinning key existence proofs such as Nash equilibria.
  • 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_69a493c476b48190b41fc5e793171cc6 completed March 1, 2026, 7:30 p.m.
NER Named-entity recognition batch_69a4b4e2ad9c81908a0f488d3f261fc3 completed March 1, 2026, 9:51 p.m.
NED1 Entity disambiguation (via context triple) batch_69ac2a1aab68819091537958818fce48 completed March 7, 2026, 1:37 p.m.
NEDg Description generation batch_69ac2a9b66b48190a3c14c431fe41c1e completed March 7, 2026, 1:39 p.m.
NED2 Entity disambiguation (via description) batch_69ac2b18ea44819086cd9ead0d8e0d01 completed March 7, 2026, 1:41 p.m.
Created at: March 1, 2026, 7:41 p.m.