Triple
T4927203
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Weierstrass approximation theorem |
E110605
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
Bernstein polynomials
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.
|
E480872
|
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: Bernstein polynomials | Statement: [Weierstrass approximation theorem, relatedTo, Bernstein polynomials]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Bernstein polynomials Context triple: [Weierstrass approximation theorem, relatedTo, Bernstein polynomials]
-
A.
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.
-
B.
Jacobi polynomials
Jacobi polynomials are a family of classical orthogonal polynomials depending on two parameters, widely used in approximation theory, numerical analysis, and solutions of differential equations.
-
C.
Bernoulli numbers
Bernoulli numbers are a sequence of rational numbers that play a central role in number theory and analysis, especially in formulas for sums of powers of integers and in the study of special functions like the Riemann zeta function.
-
D.
Orthogonal Polynomials
Orthogonal Polynomials is a classic mathematical monograph by Gábor Szegő that systematically develops the theory and applications of orthogonal polynomial systems in analysis and approximation theory.
-
E.
Weierstrass approximation theorem
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.
- 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: Bernstein polynomials Triple: [Weierstrass approximation theorem, relatedTo, Bernstein polynomials]
Generated description
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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Bernstein polynomials Target entity description: 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.
-
A.
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.
-
B.
Jacobi polynomials
Jacobi polynomials are a family of classical orthogonal polynomials depending on two parameters, widely used in approximation theory, numerical analysis, and solutions of differential equations.
-
C.
Bernoulli numbers
Bernoulli numbers are a sequence of rational numbers that play a central role in number theory and analysis, especially in formulas for sums of powers of integers and in the study of special functions like the Riemann zeta function.
-
D.
Orthogonal Polynomials
Orthogonal Polynomials is a classic mathematical monograph by Gábor Szegő that systematically develops the theory and applications of orthogonal polynomial systems in analysis and approximation theory.
-
E.
Weierstrass approximation theorem
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.
- 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_69bd4415190c8190817bee7ec9f9f944 |
completed | March 20, 2026, 12:56 p.m. |
| NER | Named-entity recognition | batch_69bd70354bd081909291a43439f42ed3 |
completed | March 20, 2026, 4:05 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69be77ac88148190a51fa2e9085d6897 |
completed | March 21, 2026, 10:49 a.m. |
| NEDg | Description generation | batch_69be7847a378819081687ec783a8b862 |
completed | March 21, 2026, 10:51 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69be7915a26c81909b21a128daebf5b3 |
completed | March 21, 2026, 10:55 a.m. |
Created at: March 20, 2026, 1:30 p.m.