Triple
T6790379
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Bézier curve |
E155915
|
entity |
| Predicate | definedBy |
P773
|
FINISHED |
| Object | De Casteljau algorithm |
E155915
|
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: De Casteljau algorithm | Statement: [Bézier curve, definedBy, De Casteljau algorithm]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: De Casteljau algorithm Context triple: [Bézier curve, definedBy, De Casteljau algorithm]
-
A.
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.
-
B.
Bezier curves
chosen
Bézier curves are mathematically defined parametric curves widely used in computer graphics and digital design to model smooth, scalable shapes and paths.
-
C.
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.
-
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.
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.
- 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_69c6881770fc8190972b2906390380f5 |
completed | March 27, 2026, 1:37 p.m. |
| NER | Named-entity recognition | batch_69c6d2acbfc0819081f2d6cebfb91765 |
completed | March 27, 2026, 6:55 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c71a8c445c8190abea97a04d648f52 |
completed | March 28, 2026, 12:02 a.m. |
Created at: March 27, 2026, 2:15 p.m.