Triple
T12597359
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Runge–Kutta methods |
E300766
|
entity |
| Predicate | hasSubclass |
P1244
|
FINISHED |
| Object | Runge–Kutta–Fehlberg methods |
E300766
|
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: Runge–Kutta–Fehlberg methods | Statement: [Runge–Kutta methods, hasSubclass, Runge–Kutta–Fehlberg methods]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Runge–Kutta–Fehlberg methods Context triple: [Runge–Kutta methods, hasSubclass, Runge–Kutta–Fehlberg methods]
-
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.
Heun’s method
Heun’s method is a second-order Runge–Kutta numerical integration technique that improves on Euler’s method by using a predictor-corrector approach to achieve greater accuracy.
-
D.
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.
-
E.
Milstein method
The Milstein method is a numerical scheme for solving stochastic differential equations that improves on the Euler–Maruyama method by including derivative terms of the diffusion coefficient for higher accuracy.
- 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_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_69f65ec75fc08190aa13cbb0161eb35c |
completed | May 2, 2026, 8:29 p.m. |
Created at: April 9, 2026, 5:08 p.m.