Triple

T5191844
Position Surface form Disambiguated ID Type / Status
Subject Charles Hermite E117173 entity
Predicate knownFor P22 FINISHED
Object Hermite interpolation
Hermite interpolation is a numerical analysis method for constructing a polynomial that matches both function values and specified derivatives at given data points.
E502191 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: Hermite interpolation | Statement: [Charles Hermite, knownFor, Hermite interpolation]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Hermite interpolation
Context triple: [Charles Hermite, knownFor, Hermite interpolation]
  • A. Lagrange interpolation polynomial
    The Lagrange interpolation polynomial is a classical formula in numerical analysis that constructs a unique polynomial passing through a given set of data points, widely used for interpolation and approximation.
  • B. Carathéodory–Fejér interpolation
    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.
  • C. 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.
  • D. Catmull–Rom spline
    The Catmull–Rom spline is a type of interpolating spline commonly used in computer graphics and animation to create smooth curves that pass through a given set of control points.
  • E. B-splines
    B-splines are piecewise polynomial functions widely used in computer graphics and numerical analysis to create smooth, flexible curves and surfaces controlled by a set of control points.
  • 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: Hermite interpolation
Triple: [Charles Hermite, knownFor, Hermite interpolation]
Generated description
Hermite interpolation is a numerical analysis method for constructing a polynomial that matches both function values and specified derivatives at given data points.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Hermite interpolation
Target entity description: Hermite interpolation is a numerical analysis method for constructing a polynomial that matches both function values and specified derivatives at given data points.
  • A. Lagrange interpolation polynomial
    The Lagrange interpolation polynomial is a classical formula in numerical analysis that constructs a unique polynomial passing through a given set of data points, widely used for interpolation and approximation.
  • B. Carathéodory–Fejér interpolation
    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.
  • C. 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.
  • D. Catmull–Rom spline
    The Catmull–Rom spline is a type of interpolating spline commonly used in computer graphics and animation to create smooth curves that pass through a given set of control points.
  • E. B-splines
    B-splines are piecewise polynomial functions widely used in computer graphics and numerical analysis to create smooth, flexible curves and surfaces controlled by a set of control points.
  • 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_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_69bee0943ce48190838aff0cfd12c655 completed March 21, 2026, 6:16 p.m.
NEDg Description generation batch_69bee5fc0c408190b4ad4b77e0045182 completed March 21, 2026, 6:39 p.m.
NED2 Entity disambiguation (via description) batch_69bee6b954c08190a353ebcfe829888a completed March 21, 2026, 6:43 p.m.
Created at: March 20, 2026, 1:46 p.m.