Triple
T12597443
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | classical fourth-order Runge–Kutta method |
E300768
|
entity |
| Predicate | hasLocalTruncationErrorOrder |
P105618
|
FINISHED |
| Object | 5 |
—
|
LITERAL 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: 5 | Statement: [classical fourth-order Runge–Kutta method, hasLocalTruncationErrorOrder, 5]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: hasLocalTruncationErrorOrder Context triple: [classical fourth-order Runge–Kutta method, hasLocalTruncationErrorOrder, 5]
-
A.
errorTermOrder
Indicates the ordering or sequence in which error terms are arranged or considered relative to one another.
-
B.
hasOrderInPerturbationTheory
Indicates that a given quantity, interaction, or term is associated with a specific order in a perturbative expansion within perturbation theory.
-
C.
constantExactness
Indicates that a value or relationship holds with complete, unvarying precision, without any approximation or deviation.
-
D.
supportsPrecisionLevels
Indicates that one entity is capable of operating at, or accommodating, multiple specified levels of precision in relation to another entity or process.
-
E.
isLinearRecurrenceOfOrder
Indicates that one sequence or function is defined by a linear recurrence relation of a specified order, where each term is a linear combination of a fixed number of preceding terms.
- F. None of above. chosen
Provenance (4 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_69d954e6e20481908bca684c4b497c48 |
completed | April 10, 2026, 7:52 p.m. |
| PD | Predicate disambiguation | batch_69d95416cbd88190b2c65196162349bc |
completed | April 10, 2026, 7:48 p.m. |
| PDg | Predicate description generation | batch_69d954e351f88190869220d46e0ce282 |
completed | April 10, 2026, 7:52 p.m. |
Created at: April 9, 2026, 5:08 p.m.