Triple
T12597366
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Runge–Kutta methods |
E300766
|
entity |
| Predicate | hasSubclass |
P1244
|
FINISHED |
| Object |
Lobatto Runge–Kutta methods
Lobatto Runge–Kutta methods are a family of implicit, high-order numerical integration schemes for solving ordinary differential equations, notable for their collocation at Lobatto quadrature points and favorable stability and conservation properties.
|
E300766
|
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: Lobatto Runge–Kutta methods | Statement: [Runge–Kutta methods, hasSubclass, Lobatto Runge–Kutta methods]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Lobatto Runge–Kutta methods Context triple: [Runge–Kutta methods, hasSubclass, Lobatto Runge–Kutta methods]
-
A.
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.
-
B.
classical fourth-order Runge–Kutta method
The classical fourth-order Runge–Kutta method is a widely used, higher-accuracy numerical technique for solving ordinary differential equations by combining multiple intermediate slope evaluations within each integration step.
-
C.
Euler’s method for numerical integration
Euler’s method for numerical integration is a simple first-order numerical procedure used to approximate solutions to ordinary differential equations by stepping forward in small increments.
-
D.
Lax–Wendroff method
The Lax–Wendroff method is a numerical scheme for solving hyperbolic partial differential equations that achieves second-order accuracy in both space and time by using a Taylor series expansion and flux approximations.
-
E.
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.
- 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: Lobatto Runge–Kutta methods Triple: [Runge–Kutta methods, hasSubclass, Lobatto Runge–Kutta methods]
Generated description
Lobatto Runge–Kutta methods are a family of implicit, high-order numerical integration schemes for solving ordinary differential equations, notable for their collocation at Lobatto quadrature points and favorable stability and conservation properties.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Lobatto Runge–Kutta methods Target entity description: Lobatto Runge–Kutta methods are a family of implicit, high-order numerical integration schemes for solving ordinary differential equations, notable for their collocation at Lobatto quadrature points and favorable stability and conservation properties.
-
A.
Runge–Kutta methods
chosen
Runge–Kutta methods are a family of iterative techniques for numerically solving ordinary differential equations with higher accuracy than simple one-step schemes.
-
B.
classical fourth-order Runge–Kutta method
The classical fourth-order Runge–Kutta method is a widely used, higher-accuracy numerical technique for solving ordinary differential equations by combining multiple intermediate slope evaluations within each integration step.
-
C.
Euler’s method for numerical integration
Euler’s method for numerical integration is a simple first-order numerical procedure used to approximate solutions to ordinary differential equations by stepping forward in small increments.
-
D.
Lax–Wendroff method
The Lax–Wendroff method is a numerical scheme for solving hyperbolic partial differential equations that achieves second-order accuracy in both space and time by using a Taylor series expansion and flux approximations.
-
E.
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.
- F. None of above.
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_69d7bdea2ca881908f379526c13b1145 |
completed | April 9, 2026, 2:55 p.m. |
| NER | Named-entity recognition | batch_69d954cf33b88190bff339fcd3142cc8 |
completed | April 10, 2026, 7:51 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69f671926a7c8190a41725cfde7836b1 |
completed | May 2, 2026, 9:50 p.m. |
| NEDg | Description generation | batch_69f672d16f8881908c6d5cfed0b3ec3a |
completed | May 2, 2026, 9:55 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69f67396fdac8190970068b2c39ad2f7 |
completed | May 2, 2026, 9:58 p.m. |
Created at: April 9, 2026, 5:08 p.m.