Triple
T7871813
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Jacobi polynomials |
E182753
|
entity |
| Predicate | usedIn |
P98
|
FINISHED |
| Object |
Gaussian quadrature rules
Gaussian quadrature rules are numerical integration methods that approximate definite integrals by optimally choosing evaluation points and weights to achieve exactness for polynomials up to a high degree.
|
E697759
|
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: Gaussian quadrature rules | Statement: [Jacobi polynomials, usedIn, Gaussian quadrature rules]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Gaussian quadrature rules Context triple: [Jacobi polynomials, usedIn, Gaussian quadrature rules]
-
A.
Simpson's rule
Simpson's rule is a numerical integration technique that approximates the area under a curve by fitting parabolas through groups of data points.
-
B.
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.
-
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.
Runge–Kutta methods
Runge–Kutta methods are a family of iterative techniques for numerically solving ordinary differential equations with higher accuracy than simple one-step schemes.
-
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. 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: Gaussian quadrature rules Triple: [Jacobi polynomials, usedIn, Gaussian quadrature rules]
Generated description
Gaussian quadrature rules are numerical integration methods that approximate definite integrals by optimally choosing evaluation points and weights to achieve exactness for polynomials up to a high degree.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Gaussian quadrature rules Target entity description: Gaussian quadrature rules are numerical integration methods that approximate definite integrals by optimally choosing evaluation points and weights to achieve exactness for polynomials up to a high degree.
-
A.
Simpson's rule
Simpson's rule is a numerical integration technique that approximates the area under a curve by fitting parabolas through groups of data points.
-
B.
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.
-
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.
Runge–Kutta methods
Runge–Kutta methods are a family of iterative techniques for numerically solving ordinary differential equations with higher accuracy than simple one-step schemes.
-
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. 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_69ca82894d9081908a832bfce71a4714 |
completed | March 30, 2026, 2:02 p.m. |
| NER | Named-entity recognition | batch_69cb39a5950481908399211c5dfe2569 |
completed | March 31, 2026, 3:04 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69cb5b6bc7248190adbf4377c52e16a9 |
completed | March 31, 2026, 5:28 a.m. |
| NEDg | Description generation | batch_69cb5f1daac88190a162132bbd40fdc6 |
completed | March 31, 2026, 5:43 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69cb768ac1a48190bc6a59a64adf7144 |
completed | March 31, 2026, 7:23 a.m. |
Created at: March 30, 2026, 4:56 p.m.