Triple

T5425816
Position Surface form Disambiguated ID Type / Status
Subject Picard iteration E121358 entity
Predicate contrastWith P278 FINISHED
Object Runge–Kutta 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 methods | Statement: [Picard iteration, contrastWith, Runge–Kutta methods]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Runge–Kutta methods
Context triple: [Picard iteration, contrastWith, Runge–Kutta 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. 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.
  • C. 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.
  • D. 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.
  • E. Godunov-type schemes
    Godunov-type schemes are a class of finite-volume numerical methods for solving hyperbolic conservation laws that use Riemann solvers to accurately capture shock waves and discontinuities.
  • 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_69bd463b58d88190b258261573de9e91 completed March 20, 2026, 1:06 p.m.
NER Named-entity recognition batch_69bd881598448190a9bb456dee36004b completed March 20, 2026, 5:47 p.m.
NED1 Entity disambiguation (via context triple) batch_69bf3abfc7e88190b8f0a31b61c33973 completed March 22, 2026, 12:41 a.m.
Created at: March 20, 2026, 2:06 p.m.