Triple
T21610234
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Jakob Steiner |
E533284
|
entity |
| Predicate | hasEponym |
P12247
|
FINISHED |
| Object | Steiner system |
—
|
NE NERFINISHED |
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: Steiner system | Statement: [Jakob Steiner, hasEponym, Steiner system]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Steiner system Context triple: [Jakob Steiner, hasEponym, Steiner system]
-
A.
Steiner system
chosen
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.
-
B.
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.
-
C.
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.
-
D.
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.
-
E.
Sylvester construction
The Sylvester construction is a recursive method for generating larger Hadamard matrices from smaller ones, starting from a 2×2 base matrix.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
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_69e0c46411108190bba0d4176dffc9f3 |
completed | April 16, 2026, 11:13 a.m. |
| NER | Named-entity recognition | batch_69ef17e7d1388190922a90cb91ec9fc4 |
completed | April 27, 2026, 8:01 a.m. |
Created at: April 16, 2026, 6:33 p.m.