Triple

T17676368
Position Surface form Disambiguated ID Type / Status
Subject AbstractMatrix E440651 entity
Predicate supertypeOf P1244 FINISHED
Object UnitLowerTriangular NE NERFINISHED

How this triple was built (3 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: UnitLowerTriangular | Statement: [AbstractMatrix, supertypeOf, UnitLowerTriangular]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: UnitLowerTriangular
Context triple: [AbstractMatrix, supertypeOf, UnitLowerTriangular]
  • A. UpperTriangular
    UpperTriangular is a linear algebra type representing square matrices whose entries below the main diagonal are zero, enabling efficient storage and specialized algorithms.
  • B. TRSM
    TRSM is the Ted Rogers School of Management, a major business school at Toronto Metropolitan University in Toronto, Canada.
  • C. SymTridiagonal
    SymTridiagonal is a Julia type representing a symmetric tridiagonal matrix optimized for efficient storage and linear algebra operations.
  • D. Pascal's triangle
    Pascal's triangle is a triangular array of numbers in which each entry is the sum of the two directly above it, widely used in combinatorics, algebra, and probability.
  • E. Cholesky factorization
    Cholesky factorization is a numerical linear algebra method that decomposes a symmetric positive-definite matrix into a product of a lower triangular matrix and its transpose, widely used for efficient solution of linear systems.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: UnitLowerTriangular
Target entity description: UnitLowerTriangular is a specialized matrix type representing lower-triangular matrices with ones on the main diagonal, commonly used to efficiently encode and manipulate such structured linear algebra objects.
  • A. UpperTriangular
    UpperTriangular is a linear algebra type representing square matrices whose entries below the main diagonal are zero, enabling efficient storage and specialized algorithms.
  • B. TRSM
    TRSM is the Ted Rogers School of Management, a major business school at Toronto Metropolitan University in Toronto, Canada.
  • C. SymTridiagonal
    SymTridiagonal is a Julia type representing a symmetric tridiagonal matrix optimized for efficient storage and linear algebra operations.
  • D. Pascal's triangle
    Pascal's triangle is a triangular array of numbers in which each entry is the sum of the two directly above it, widely used in combinatorics, algebra, and probability.
  • E. Cholesky factorization
    Cholesky factorization is a numerical linear algebra method that decomposes a symmetric positive-definite matrix into a product of a lower triangular matrix and its transpose, widely used for efficient solution of linear systems.
  • F. None of above. chosen

Provenance (2 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_69d8b9e940b081908b862bb0e6e89b0d completed April 10, 2026, 8:50 a.m.
NER Named-entity recognition batch_69e46f6d9ab88190ab0e25eac8b0101c completed April 19, 2026, 6 a.m.
Created at: April 10, 2026, 10:01 a.m.