Triple

T10881174
Position Surface form Disambiguated ID Type / Status
Subject Peter Lax E256920 entity
Predicate notableWork P4 FINISHED
Object Lax–Richtmyer theorem E87776 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: Lax–Richtmyer theorem | Statement: [Peter Lax, notableWork, Lax–Richtmyer theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Lax–Richtmyer theorem
Context triple: [Peter Lax, notableWork, Lax–Richtmyer theorem]
  • A. Lax equivalence theorem chosen
    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.
  • B. Courant–Friedrichs–Lewy condition
    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.
  • C. Cauchy–Kovalevskaya theorem
    The Cauchy–Kovalevskaya theorem is a fundamental result in partial differential equations that guarantees the existence and uniqueness of analytic solutions to certain initial value problems under appropriate analyticity conditions.
  • D. 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.
  • E. Painlevé–Kruskal theorem
    The Painlevé–Kruskal theorem is a result in the theory of nonlinear differential equations that characterizes integrability through the analytic structure of their solutions, particularly via the Painlevé property.
  • 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_69d6aa848804819081b2713ca0bedf06 completed April 8, 2026, 7:20 p.m.
NER Named-entity recognition batch_69d751b031a88190b1182dfc1f520264 completed April 9, 2026, 7:13 a.m.
NED1 Entity disambiguation (via context triple) batch_69dff7e479cc81909fb8510364d6fc0e completed April 15, 2026, 8:41 p.m.
Created at: April 8, 2026, 9:21 p.m.