Triple

T7338360
Position Surface form Disambiguated ID Type / Status
Subject Leech lattice E169185 entity
Predicate relatedTo P37 FINISHED
Object Golay code
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.
E656670 NE FINISHED

How this triple was built (4 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 code | Statement: [Leech lattice, relatedTo, Golay code]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Golay code
Context triple: [Leech lattice, relatedTo, Golay code]
  • A. 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.
  • B. 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.
  • C. Golomb
    Golomb is a station on the Carmelit underground funicular system in Haifa, Israel.
  • D. Wozencraft ensemble in coding theory
    The Wozencraft ensemble in coding theory is a family of randomly constructed linear codes introduced by John Wozencraft that plays a key role in analyzing the performance limits of coding schemes, particularly for achieving capacity on noisy channels.
  • E. Hamming bound
    The Hamming bound is a fundamental limit in coding theory that specifies the maximum number of codewords a block code can have for a given length and minimum distance while still allowing reliable error detection and correction.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Golay code
Triple: [Leech lattice, relatedTo, Golay code]
Generated description
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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Golay code
Target entity description: 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.
  • A. 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.
  • B. 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.
  • C. Golomb
    Golomb is a station on the Carmelit underground funicular system in Haifa, Israel.
  • D. Wozencraft ensemble in coding theory
    The Wozencraft ensemble in coding theory is a family of randomly constructed linear codes introduced by John Wozencraft that plays a key role in analyzing the performance limits of coding schemes, particularly for achieving capacity on noisy channels.
  • E. Hamming bound
    The Hamming bound is a fundamental limit in coding theory that specifies the maximum number of codewords a block code can have for a given length and minimum distance while still allowing reliable error detection and correction.
  • F. None of above. chosen

Provenance (5 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_69c68a57710481909f0c1f3c6ebdb6f2 completed March 27, 2026, 1:47 p.m.
NER Named-entity recognition batch_69c6f0d599c88190875514eae7084f8d completed March 27, 2026, 9:04 p.m.
NED1 Entity disambiguation (via context triple) batch_69c7ef266fd0819096cf3ece3fff6b90 completed March 28, 2026, 3:09 p.m.
NEDg Description generation batch_69c7efa4f5148190842f30988cbea94c completed March 28, 2026, 3:11 p.m.
NED2 Entity disambiguation (via description) batch_69c7f0092bac819080ded1863f99290a completed March 28, 2026, 3:13 p.m.
Created at: March 27, 2026, 3:04 p.m.