Triple

T6833242
Position Surface form Disambiguated ID Type / Status
Subject Successive Over-Relaxation E157387 entity
Predicate relatedTo P37 FINISHED
Object Successive Under-Relaxation
Successive Under-Relaxation is a numerical technique for iteratively solving linear systems that deliberately uses a relaxation factor less than one to slow updates and improve stability or convergence in certain problems.
E621091 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: Successive Under-Relaxation | Statement: [Successive Over-Relaxation, relatedTo, Successive Under-Relaxation]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Successive Under-Relaxation
Context triple: [Successive Over-Relaxation, relatedTo, Successive Under-Relaxation]
  • A. 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.
  • B. 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.
  • C. 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.
  • D. 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.
  • E. Picard iteration
    Picard iteration is a successive approximation method used to construct solutions to ordinary differential equations and establish their existence and uniqueness.
  • 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: Successive Under-Relaxation
Triple: [Successive Over-Relaxation, relatedTo, Successive Under-Relaxation]
Generated description
Successive Under-Relaxation is a numerical technique for iteratively solving linear systems that deliberately uses a relaxation factor less than one to slow updates and improve stability or convergence in certain problems.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Successive Under-Relaxation
Target entity description: Successive Under-Relaxation is a numerical technique for iteratively solving linear systems that deliberately uses a relaxation factor less than one to slow updates and improve stability or convergence in certain problems.
  • A. 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.
  • B. 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.
  • C. 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.
  • D. 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.
  • E. Picard iteration
    Picard iteration is a successive approximation method used to construct solutions to ordinary differential equations and establish their existence and uniqueness.
  • 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_69c6882c53608190b99aebef079b23bd completed March 27, 2026, 1:37 p.m.
NER Named-entity recognition batch_69c6d62b1e8c8190a81d91191a54b073 completed March 27, 2026, 7:10 p.m.
NED1 Entity disambiguation (via context triple) batch_69c723fd50c88190af005fd58ca0aee6 completed March 28, 2026, 12:42 a.m.
NEDg Description generation batch_69c7247806808190ac60c134cec612c8 completed March 28, 2026, 12:44 a.m.
NED2 Entity disambiguation (via description) batch_69c7253b94f081909e7cee870a12af6b completed March 28, 2026, 12:47 a.m.
Created at: March 27, 2026, 2:18 p.m.