Triple

T1382439
Position Surface form Disambiguated ID Type / Status
Subject Gauss–Seidel method E29368 entity
Predicate relatedTo P37 FINISHED
Object 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.
E157386 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: Jacobi method | Statement: [Gauss–Seidel method, relatedTo, Jacobi method]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Jacobi method
Context triple: [Gauss–Seidel method, relatedTo, Jacobi 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. Gaussian elimination
    Gaussian elimination is a fundamental algorithm in linear algebra used to solve systems of linear equations by systematically transforming matrices into row-echelon form.
  • D. Euler’s method for numerical integration
    Euler’s method for numerical integration is a simple first-order numerical procedure used to approximate solutions to ordinary differential equations by stepping forward in small increments.
  • 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: Jacobi method
Triple: [Gauss–Seidel method, relatedTo, Jacobi method]
Generated description
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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Jacobi method
Target entity description: 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.
  • 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. Gaussian elimination
    Gaussian elimination is a fundamental algorithm in linear algebra used to solve systems of linear equations by systematically transforming matrices into row-echelon form.
  • D. Euler’s method for numerical integration
    Euler’s method for numerical integration is a simple first-order numerical procedure used to approximate solutions to ordinary differential equations by stepping forward in small increments.
  • 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_69a498d883a48190bfdca525296ef7ee completed March 1, 2026, 7:51 p.m.
NER Named-entity recognition batch_69a4c3361bf08190b3f6bbf82e17685b completed March 1, 2026, 10:52 p.m.
NED1 Entity disambiguation (via context triple) batch_69acd48c41f4819092f7e1302d803662 completed March 8, 2026, 1:44 a.m.
NEDg Description generation batch_69acd543a0ac8190b9fd5e921b5ad9ea completed March 8, 2026, 1:47 a.m.
NED2 Entity disambiguation (via description) batch_69acd5b8fa2481908fd52d94e55b6377 completed March 8, 2026, 1:49 a.m.
Created at: March 1, 2026, 7:59 p.m.