Triple
T19531999
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Coding and Information Theory |
E488677
|
entity |
| Predicate | topic |
P261
|
FINISHED |
| Object | Hamming codes |
E488671
|
NE FINISHED |
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: Hamming codes | Statement: [Coding and Information Theory, topic, Hamming codes]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Hamming codes Context triple: [Coding and Information Theory, topic, Hamming codes]
-
A.
Hamming code
chosen
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.
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.
-
C.
Hamming
Hamming is a surname most notably associated with Richard W. Hamming, an American mathematician and computer scientist known for his pioneering work in error-correcting codes and numerical methods.
-
D.
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.
-
E.
Error detecting and error correcting codes
"Error detecting and error correcting codes" is a seminal 1950 paper by Richard W. Hamming that founded the modern theory of error-correcting codes in digital communication and data storage.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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. |
| NED1 | Entity disambiguation (via context triple) | batch_6a0771a1ebac819090982f36b4c02446 |
completed | May 15, 2026, 7:18 p.m. |
Created at: April 10, 2026, 1:41 p.m.