Triple
T19532128
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Hamming bound |
E488680
|
entity |
| Predicate | satisfiedWithEqualityBy |
P136674
|
FINISHED |
| Object | Golay codes |
—
|
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: Golay codes | Statement: [Hamming bound, satisfiedWithEqualityBy, Golay codes]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Golay codes Context triple: [Hamming bound, satisfiedWithEqualityBy, Golay codes]
-
A.
Golay code
chosen
The Golay code is a highly symmetric, perfect error-correcting code in coding theory, notable for its deep connections to sporadic simple groups, sphere packings, and the Leech lattice.
-
B.
extended binary Golay code
The extended binary Golay code is a famous 24-bit error-correcting code with exceptional symmetry and optimal properties, central to constructions in coding theory and lattice theory such as the Leech lattice.
-
C.
Reed–Solomon codes
Reed–Solomon codes are a class of powerful error-correcting codes based on polynomial evaluation over finite fields, widely used in digital communications and data storage to detect and correct multiple symbol errors.
-
D.
Hamming code
Hamming code is a family of error-detecting and error-correcting binary codes that enable the automatic detection and correction of single-bit errors in transmitted or stored data.
-
E.
Algebraic Coding Theory
Algebraic Coding Theory is a foundational mathematical text that systematically develops the theory and applications of error-correcting codes using algebraic methods.
- 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_69d8e8db5b6c8190984b61f91981f575 |
completed | April 10, 2026, 12:11 p.m. |
| NER | Named-entity recognition | batch_69e6363fd1f8819080805346efad2579 |
completed | April 20, 2026, 2:20 p.m. |
Created at: April 10, 2026, 1:41 p.m.