Triple

T20627317
Position Surface form Disambiguated ID Type / Status
Subject Darboux theorem E506852 entity
Predicate type P0 FINISHED
Object local normal form theorem 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: local normal form theorem | Statement: [Darboux theorem, type, local normal form theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: local normal form theorem
Context triple: [Darboux theorem, type, local normal form theorem]
  • A. Kleene’s normal form theorem
    Kleene’s normal form theorem is a fundamental result in computability theory that characterizes all partial recursive (effectively computable) functions using a universal primitive recursive function and the μ-operator.
  • B. Noether normalization lemma
    The Noether normalization lemma is a fundamental result in commutative algebra and algebraic geometry that shows any finitely generated algebra over a field can be made integral over a polynomial subring, providing a way to relate complicated varieties to affine space.
  • C. Łoś–Tarski preservation theorem
    The Łoś–Tarski preservation theorem is a fundamental result in model theory that characterizes when a first-order sentence is preserved under substructures in terms of its equivalence to a universal sentence.
  • D. 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.
  • E. Artin approximation theorem
    The Artin approximation theorem is a fundamental result in algebraic geometry and commutative algebra that allows formal power series solutions of polynomial equations to be approximated by convergent or algebraic solutions.
  • 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: local normal form theorem
Target entity description: A local normal form theorem is a result in differential geometry that guarantees any geometric structure can be expressed in a particularly simple, standardized form in a neighborhood of each point.
  • A. Kleene’s normal form theorem
    Kleene’s normal form theorem is a fundamental result in computability theory that characterizes all partial recursive (effectively computable) functions using a universal primitive recursive function and the μ-operator.
  • B. Noether normalization lemma
    The Noether normalization lemma is a fundamental result in commutative algebra and algebraic geometry that shows any finitely generated algebra over a field can be made integral over a polynomial subring, providing a way to relate complicated varieties to affine space.
  • C. Łoś–Tarski preservation theorem
    The Łoś–Tarski preservation theorem is a fundamental result in model theory that characterizes when a first-order sentence is preserved under substructures in terms of its equivalence to a universal sentence.
  • D. 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.
  • E. Artin approximation theorem
    The Artin approximation theorem is a fundamental result in algebraic geometry and commutative algebra that allows formal power series solutions of polynomial equations to be approximated by convergent or algebraic solutions.
  • F. None of above. chosen

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_69e0b4bd4a0081908d4e97a590a33fb2 completed April 16, 2026, 10:06 a.m.
NER Named-entity recognition batch_69e6abe645888190b639ebedc5b3041a completed April 20, 2026, 10:42 p.m.
Created at: April 16, 2026, 11:42 a.m.