Triple

T2364525
Position Surface form Disambiguated ID Type / Status
Subject Riemann mapping theorem E47349 entity
Predicate relatedTo P37 FINISHED
Object Carathéodory theorem E118706 NE FINISHED

How this triple was built (2 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 theorem | Statement: [Riemann mapping theorem, relatedTo, Carathéodory theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Carathéodory theorem
Context triple: [Riemann mapping theorem, relatedTo, Carathéodory theorem]
  • A. Carathéodory’s theorem in convex geometry chosen
    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. Carathéodory’s extension theorem
    Carathéodory’s extension theorem is a fundamental result in measure theory that guarantees a unique extension of a pre-measure defined on an algebra of sets to a complete measure on the generated σ-algebra.
  • 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. Grothendieck inequality
    The Grothendieck inequality is a fundamental result in functional analysis and theoretical computer science that bounds certain bilinear forms and has deep implications for Banach space theory, operator theory, and approximation algorithms.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

Provenance (3 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_69a88a1a4a6081908645b0f2914521ab completed March 4, 2026, 7:38 p.m.
NER Named-entity recognition batch_69abc7486cb48190acef1891cc87bdb1 completed March 7, 2026, 6:35 a.m.
NED1 Entity disambiguation (via context triple) batch_69aea896e0388190aabff2d70787dc43 completed March 9, 2026, 11:01 a.m.
Created at: March 4, 2026, 7:55 p.m.