Triple

T2652937
Position Surface form Disambiguated ID Type / Status
Subject Whitney approximation theorem E53941 entity
Predicate relatedTo P37 FINISHED
Object Stone–Weierstrass theorem E110605 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: Stone–Weierstrass theorem | Statement: [Whitney approximation theorem, relatedTo, Stone–Weierstrass theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Stone–Weierstrass theorem
Context triple: [Whitney approximation theorem, relatedTo, Stone–Weierstrass theorem]
  • A. Weierstrass approximation theorem chosen
    The Weierstrass approximation theorem is a fundamental result in real analysis stating that any continuous function on a closed interval can be uniformly approximated by polynomials.
  • B. Cauchy–Hadamard theorem
    The Cauchy–Hadamard theorem is a fundamental result in complex analysis that characterizes the radius of convergence of a power series in terms of the growth rate of its coefficients.
  • C. Montel theorem
    Montel's theorem is a fundamental result in complex analysis stating that a family of holomorphic functions that is uniformly bounded on every compact subset of a domain is a normal family, meaning every sequence in it has a subsequence that converges uniformly on compact sets.
  • D. Gelfand–Naimark theorem
    The Gelfand–Naimark theorem is a foundational result in functional analysis that characterizes C*-algebras as algebras of bounded operators on a Hilbert space (and, in the commutative case, as algebras of continuous functions on a locally compact Hausdorff space).
  • E. Weierstrass preparation theorem
    The Weierstrass preparation theorem is a fundamental result in complex analysis and analytic geometry that locally expresses analytic functions near a zero as a product of a polynomial and a unit, enabling a power-series analogue of factorization.
  • 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_69ab495e192081909c77b622e8e7e15a completed March 6, 2026, 9:38 p.m.
NER Named-entity recognition batch_69abd93197f48190b04faf358b503204 completed March 7, 2026, 7:52 a.m.
NED1 Entity disambiguation (via context triple) batch_69af98ce81fc8190b7c6c66acfcb87c7 completed March 10, 2026, 4:06 a.m.
Created at: March 6, 2026, 9:53 p.m.