Triple

T21494588
Position Surface form Disambiguated ID Type / Status
Subject Steiner tree problem E530318 entity
Predicate relatedTo P37 FINISHED
Object Steiner system 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: Steiner system | Statement: [Steiner tree problem, relatedTo, Steiner system]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Steiner system
Context triple: [Steiner tree problem, relatedTo, Steiner system]
  • A. Bose construction of Steiner systems
    The Bose construction of Steiner systems is a combinatorial method introduced by mathematician Raj Chandra Bose to systematically build certain highly regular block designs known as Steiner systems.
  • B. Goethals–Seidel construction
    The Goethals–Seidel construction is a classical combinatorial method for building large Hadamard matrices from smaller ones using structured block and circulant matrix arrangements.
  • C. Bose–Bush construction of orthogonal arrays
    The Bose–Bush construction of orthogonal arrays is a foundational combinatorial method that systematically builds highly structured experimental designs and error-correcting codes with strong balance and symmetry properties.
  • D. Sylvester construction
    The Sylvester construction is a recursive method for generating larger Hadamard matrices from smaller ones, starting from a 2×2 base matrix.
  • E. Szekeres configuration
    The Szekeres configuration is a notable geometric arrangement in projective geometry consisting of points and lines with specific incidence properties, studied for its combinatorial and symmetry characteristics.
  • 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: Steiner system
Target entity description: A Steiner system is a highly regular combinatorial design in which a finite set of points is arranged into subsets (blocks) so that every smaller subset of points is contained in exactly one block.
  • A. Bose construction of Steiner systems
    The Bose construction of Steiner systems is a combinatorial method introduced by mathematician Raj Chandra Bose to systematically build certain highly regular block designs known as Steiner systems.
  • B. Goethals–Seidel construction
    The Goethals–Seidel construction is a classical combinatorial method for building large Hadamard matrices from smaller ones using structured block and circulant matrix arrangements.
  • C. Bose–Bush construction of orthogonal arrays
    The Bose–Bush construction of orthogonal arrays is a foundational combinatorial method that systematically builds highly structured experimental designs and error-correcting codes with strong balance and symmetry properties.
  • D. Sylvester construction
    The Sylvester construction is a recursive method for generating larger Hadamard matrices from smaller ones, starting from a 2×2 base matrix.
  • E. Szekeres configuration
    The Szekeres configuration is a notable geometric arrangement in projective geometry consisting of points and lines with specific incidence properties, studied for its combinatorial and symmetry characteristics.
  • 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_69e0c45bd15481909fba5910765cdda2 completed April 16, 2026, 11:13 a.m.
NER Named-entity recognition batch_69e9ea567244819091863350fedae3ae completed April 23, 2026, 9:45 a.m.
Created at: April 16, 2026, 6:23 p.m.