Triple
T20627454
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Schur algorithm |
E506855
|
entity |
| Predicate | usedFor |
P98
|
FINISHED |
| Object | Carathéodory–Fejér interpolation |
—
|
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: Carathéodory–Fejér interpolation | Statement: [Schur algorithm, usedFor, Carathéodory–Fejér interpolation]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Carathéodory–Fejér interpolation Context triple: [Schur algorithm, usedFor, Carathéodory–Fejér interpolation]
-
A.
Carathéodory–Fejér interpolation
chosen
Carathéodory–Fejér interpolation is a classical result in complex analysis and approximation theory that concerns constructing analytic functions, typically with bounded or positive real part, that match prescribed initial Taylor coefficients.
-
B.
Nevanlinna–Pick interpolation
Nevanlinna–Pick interpolation is a classical problem in complex analysis and operator theory that seeks analytic functions, typically bounded by one in the unit disk, which match prescribed values at given points.
-
C.
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.
-
D.
Szegő polynomials
Szegő polynomials are a fundamental family of orthogonal polynomials on the unit circle that play a key role in complex analysis, approximation theory, and spectral theory.
-
E.
Chebyshev rational approximation
Chebyshev rational approximation is a mathematical technique that uses rational functions to approximate other functions with near-optimal uniform accuracy over a given interval.
- 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_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.