Triple

T7678176
Position Surface form Disambiguated ID Type / Status
Subject Godunov-type schemes E173919 entity
Predicate basedOn P98 FINISHED
Object Godunov's method
Godunov's method is a numerical scheme for solving hyperbolic partial differential equations that uses exact or approximate Riemann solvers to compute fluxes at cell interfaces in finite-volume discretizations.
E680772 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: Godunov's method | Statement: [Godunov-type schemes, basedOn, Godunov's method]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Godunov's method
Context triple: [Godunov-type schemes, basedOn, Godunov's method]
  • A. Gauss–Seidel method
    The Gauss–Seidel method is an iterative numerical technique used to solve systems of linear equations, particularly in large, sparse problems arising in scientific and engineering computations.
  • B. Picard iteration
    Picard iteration is a successive approximation method used to construct solutions to ordinary differential equations and establish their existence and uniqueness.
  • C. Jacobi method
    The Jacobi method is an iterative numerical algorithm used to solve systems of linear equations by repeatedly updating each variable using values from the previous iteration.
  • D. Richardson iteration
    Richardson iteration is an early iterative method for solving linear systems and other operator equations, based on repeated relaxation steps to progressively improve an approximate solution.
  • E. Successive Over-Relaxation
    Successive Over-Relaxation is an iterative numerical method that accelerates the convergence of the Gauss–Seidel algorithm for solving large systems of linear equations by introducing a relaxation factor.
  • 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: Godunov's method
Triple: [Godunov-type schemes, basedOn, Godunov's method]
Generated description
Godunov's method is a numerical scheme for solving hyperbolic partial differential equations that uses exact or approximate Riemann solvers to compute fluxes at cell interfaces in finite-volume discretizations.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Godunov's method
Target entity description: Godunov's method is a numerical scheme for solving hyperbolic partial differential equations that uses exact or approximate Riemann solvers to compute fluxes at cell interfaces in finite-volume discretizations.
  • A. Gauss–Seidel method
    The Gauss–Seidel method is an iterative numerical technique used to solve systems of linear equations, particularly in large, sparse problems arising in scientific and engineering computations.
  • B. Picard iteration
    Picard iteration is a successive approximation method used to construct solutions to ordinary differential equations and establish their existence and uniqueness.
  • C. Jacobi method
    The Jacobi method is an iterative numerical algorithm used to solve systems of linear equations by repeatedly updating each variable using values from the previous iteration.
  • D. Richardson iteration
    Richardson iteration is an early iterative method for solving linear systems and other operator equations, based on repeated relaxation steps to progressively improve an approximate solution.
  • E. Successive Over-Relaxation
    Successive Over-Relaxation is an iterative numerical method that accelerates the convergence of the Gauss–Seidel algorithm for solving large systems of linear equations by introducing a relaxation factor.
  • 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_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.
NEDg Description generation batch_69c8a2d073b08190a056e23cfdf13983 completed March 29, 2026, 3:56 a.m.
NED2 Entity disambiguation (via description) batch_69c8a37fabe481908c7da8a5d71a3f1c completed March 29, 2026, 3:58 a.m.
Created at: March 27, 2026, 4:01 p.m.