Triple

T10991438
Position Surface form Disambiguated ID Type / Status
Subject Simpson's rule E259761 entity
Predicate specialCaseOf P7025 FINISHED
Object Newton–Cotes formulas
Newton–Cotes formulas are a family of numerical integration methods that approximate definite integrals by interpolating the integrand with equally spaced polynomial points.
E898476 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: Newton–Cotes formulas | Statement: [Simpson's rule, specialCaseOf, Newton–Cotes formulas]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Newton–Cotes formulas
Context triple: [Simpson's rule, specialCaseOf, Newton–Cotes formulas]
  • A. 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.
  • B. 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.
  • C. Euler–Maclaurin summation formula
    The Euler–Maclaurin summation formula is a fundamental result in analysis that connects sums and integrals, providing powerful asymptotic expansions and error estimates for approximating series by integrals.
  • D. 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.
  • E. 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.
  • 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: Newton–Cotes formulas
Triple: [Simpson's rule, specialCaseOf, Newton–Cotes formulas]
Generated description
Newton–Cotes formulas are a family of numerical integration methods that approximate definite integrals by interpolating the integrand with equally spaced polynomial points.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Newton–Cotes formulas
Target entity description: Newton–Cotes formulas are a family of numerical integration methods that approximate definite integrals by interpolating the integrand with equally spaced polynomial points.
  • A. 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.
  • B. 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.
  • C. Euler–Maclaurin summation formula
    The Euler–Maclaurin summation formula is a fundamental result in analysis that connects sums and integrals, providing powerful asymptotic expansions and error estimates for approximating series by integrals.
  • D. 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.
  • E. 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.
  • 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_69d6aa8a6a548190a750f944ccdc8064 completed April 8, 2026, 7:20 p.m.
NER Named-entity recognition batch_69d795d1e918819090c71f5a077fa15a completed April 9, 2026, 12:04 p.m.
NED1 Entity disambiguation (via context triple) batch_69e34504ebec8190a78e4795765b0c24 completed April 18, 2026, 8:47 a.m.
NEDg Description generation batch_69e3556fd3548190a33f04604be947cf completed April 18, 2026, 9:57 a.m.
NED2 Entity disambiguation (via description) batch_69e3593b0f8481909ed7a90f8bb9839d completed April 18, 2026, 10:13 a.m.
Created at: April 8, 2026, 9:24 p.m.