Triple

T4094377
Position Surface form Disambiguated ID Type / Status
Subject Crank–Nicolson scheme E87777 entity
Predicate relatedTo P37 FINISHED
Object theta-method
The theta-method is a family of numerical time-stepping schemes for solving ordinary and partial differential equations that unifies explicit, implicit, and Crank–Nicolson methods through a single weighting parameter.
E413442 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: theta-method | Statement: [Crank–Nicolson scheme, relatedTo, theta-method]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: theta-method
Context triple: [Crank–Nicolson scheme, relatedTo, theta-method]
  • A. 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.
  • B. 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.
  • C. Euler–Maruyama method
    The Euler–Maruyama method is a basic time-stepping scheme for numerically approximating solutions to stochastic differential equations, widely used in simulations of systems with noise such as Langevin dynamics.
  • D. 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.
  • E. Crank–Nicolson scheme
    The Crank–Nicolson scheme is a finite difference method for numerically solving time-dependent partial differential equations, especially parabolic ones like the heat equation, known for its second-order accuracy and unconditional stability.
  • 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: theta-method
Triple: [Crank–Nicolson scheme, relatedTo, theta-method]
Generated description
The theta-method is a family of numerical time-stepping schemes for solving ordinary and partial differential equations that unifies explicit, implicit, and Crank–Nicolson methods through a single weighting parameter.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: theta-method
Target entity description: The theta-method is a family of numerical time-stepping schemes for solving ordinary and partial differential equations that unifies explicit, implicit, and Crank–Nicolson methods through a single weighting parameter.
  • A. 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.
  • B. 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.
  • C. Euler–Maruyama method
    The Euler–Maruyama method is a basic time-stepping scheme for numerically approximating solutions to stochastic differential equations, widely used in simulations of systems with noise such as Langevin dynamics.
  • D. 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.
  • E. Crank–Nicolson scheme
    The Crank–Nicolson scheme is a finite difference method for numerically solving time-dependent partial differential equations, especially parabolic ones like the heat equation, known for its second-order accuracy and unconditional stability.
  • F. None of above. chosen

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_69aed94425148190be337845d56fac22 completed March 9, 2026, 2:29 p.m.
NER Named-entity recognition batch_69aefcdc1ce08190922f55f812b0fda3 completed March 9, 2026, 5:01 p.m.
NED1 Entity disambiguation (via context triple) batch_69b56b6f8bb081908aa2d126fe3c9502 completed March 14, 2026, 2:06 p.m.
NEDg Description generation batch_69b56f3cf1d081908e2fb778433fb2e8 completed March 14, 2026, 2:22 p.m.
NED2 Entity disambiguation (via description) batch_69b56f99d490819093f92b4db63c5375 completed March 14, 2026, 2:24 p.m.
Created at: March 9, 2026, 3:40 p.m.