Triple

T16076529
Position Surface form Disambiguated ID Type / Status
Subject LINPACK E389991 entity
Predicate usesAlgorithm P89 FINISHED
Object Gaussian elimination E29360 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: Gaussian elimination | Statement: [LINPACK, usesAlgorithm, Gaussian elimination]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Gaussian elimination
Context triple: [LINPACK, usesAlgorithm, Gaussian elimination]
  • A. Gaussian elimination chosen
    Gaussian elimination is a fundamental algorithm in linear algebra used to solve systems of linear equations by systematically transforming matrices into row-echelon form.
  • B. Bartels–Stewart algorithm
    The Bartels–Stewart algorithm is a numerical linear algebra method that efficiently solves certain matrix equations, particularly Sylvester and Lyapunov equations, using Schur decompositions.
  • C. gauss
    The gauss is a unit of magnetic flux density in the centimeter–gram–second (CGS) system, commonly used in physics to measure the strength of magnetic fields.
  • D. 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.
  • E. LinearAlgebra
    LinearAlgebra is Julia’s standard library module providing core functionality for vectors, matrices, and advanced linear algebra operations.
  • 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_69d86daf32ec8190a8c0466c8f49c3c0 completed April 10, 2026, 3:25 a.m.
NER Named-entity recognition batch_69e183c27aac81909c56d200c0c51a0c completed April 17, 2026, 12:50 a.m.
NED1 Entity disambiguation (via context triple) batch_69ffe48907148190ab04520717141788 completed May 10, 2026, 1:51 a.m.
Created at: April 10, 2026, 4:57 a.m.