Triple

T19231113
Position Surface form Disambiguated ID Type / Status
Subject Bernstein polynomials E480872 entity
Predicate relatedTo P37 FINISHED
Object Bernstein operator NE NERFINISHED

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: Bernstein operator | Statement: [Bernstein polynomials, relatedTo, Bernstein operator]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Bernstein operator
Context triple: [Bernstein polynomials, relatedTo, Bernstein operator]
  • A. Bernstein polynomials chosen
    Bernstein polynomials are a family of polynomials used in approximation theory that provide a constructive proof of the Weierstrass approximation theorem by uniformly approximating continuous functions on a closed interval.
  • B. Bernoulli polynomials
    Bernoulli polynomials are a sequence of polynomials deeply connected to number theory and analysis, appearing in the study of special functions, series expansions, and the evaluation of sums of powers of integers.
  • C. Favard's theorem
    Favard's theorem is a fundamental result in the theory of orthogonal polynomials that characterizes such polynomial sequences precisely as those satisfying a three-term recurrence relation with appropriate coefficients.
  • D. Bernstein inequalities
    Bernstein inequalities are fundamental results in approximation theory and probability that provide bounds on the derivatives or deviations of functions and random variables under certain smoothness or moment conditions.
  • E. Birkhoff interpolation
    Birkhoff interpolation is a generalized form of polynomial interpolation that allows prescribing function and derivative values at selected points, not necessarily in a consecutive or complete pattern.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

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_69d8e8ccb8f48190ad420098e74fb1db completed April 10, 2026, 12:10 p.m.
NER Named-entity recognition batch_69e5fa9ce5e081909df994841ce476d5 completed April 20, 2026, 10:06 a.m.
Created at: April 10, 2026, 1:25 p.m.