Triple
T5191864
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Charles Hermite |
E117173
|
entity |
| Predicate | hasConceptNamedAfter |
P3325
|
FINISHED |
| Object | Hermite polynomial |
E502189
|
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: Hermite polynomial | Statement: [Charles Hermite, hasConceptNamedAfter, Hermite polynomial]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Hermite polynomial Context triple: [Charles Hermite, hasConceptNamedAfter, Hermite polynomial]
-
A.
Hermite
Hermite is a French surname most famously associated with the 19th-century mathematician Charles Hermite, known for his contributions to number theory, algebra, and analysis.
-
B.
Hermite functions
chosen
Hermite functions are a family of orthogonal functions built from Hermite polynomials and a Gaussian weight, widely used in quantum mechanics, signal processing, and approximation theory.
-
C.
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.
-
D.
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.
-
E.
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.
- 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_69bd44620ff48190bcac01782107a397 |
completed | March 20, 2026, 12:58 p.m. |
| NER | Named-entity recognition | batch_69bd79ed61c88190bda492f6489f44de |
completed | March 20, 2026, 4:46 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69bef7f9a1c48190939a5073bd779be6 |
completed | March 21, 2026, 7:56 p.m. |
Created at: March 20, 2026, 1:46 p.m.