Triple

T7678212
Position Surface form Disambiguated ID Type / Status
Subject Godunov-type schemes E173919 entity
Predicate require P100 FINISHED
Object Courant–Friedrichs–Lewy condition E87775 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: Courant–Friedrichs–Lewy condition | Statement: [Godunov-type schemes, require, Courant–Friedrichs–Lewy condition]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Courant–Friedrichs–Lewy condition
Context triple: [Godunov-type schemes, require, Courant–Friedrichs–Lewy condition]
  • A. Courant–Friedrichs–Lewy condition chosen
    The Courant–Friedrichs–Lewy condition is a fundamental stability criterion in numerical analysis that restricts the time step size in discretized partial differential equations to ensure convergence of the computed solution.
  • B. von Neumann stability analysis
    Von Neumann stability analysis is a mathematical technique used in numerical analysis to determine the stability of finite difference schemes for solving partial differential equations by examining the growth of Fourier modes.
  • C. 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.
  • D. 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.
  • E. Lax equivalence theorem
    The Lax equivalence theorem is a fundamental result in numerical analysis stating that for a well-posed linear initial value problem, consistency and stability of a finite difference scheme together imply its convergence.
  • 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_69c6995703e0819081de77361b602e78 completed March 27, 2026, 2:51 p.m.
NER Named-entity recognition batch_69c701fd18d88190888144a7d0f228d9 completed March 27, 2026, 10:17 p.m.
NED1 Entity disambiguation (via context triple) batch_69c8a240057081908826a5371ef5215b completed March 29, 2026, 3:53 a.m.
Created at: March 27, 2026, 4:01 p.m.