Triple

T19532127
Position Surface form Disambiguated ID Type / Status
Subject Hamming bound E488680 entity
Predicate satisfiedWithEqualityBy P136674 FINISHED
Object Hamming codes 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: Hamming codes | Statement: [Hamming bound, satisfiedWithEqualityBy, Hamming codes]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Hamming codes
Context triple: [Hamming bound, satisfiedWithEqualityBy, 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.
PD Predicate disambiguation gpt-5-mini-2025-08-07
Target predicate: satisfiedWithEqualityBy
Context triple: [Hamming bound, satisfiedWithEqualityBy, Hamming codes]
  • A. satisfies
    Indicates that one entity meets, fulfills, or complies with the requirements, conditions, or expectations specified by another.
  • B. mayBeEqualTo
    Indicates that two entities are possibly equal, but their equality is uncertain or not definitively established.
  • C. hasEqualRepresentationFrom
    Indicates that two or more sources, groups, or categories contribute or are represented in equal proportion within a given context.
  • D. equalityCondition
    Indicates that two values, expressions, or attributes must be exactly the same for the condition to be satisfied.
  • E. requiresEquatableElements
    Indicates that the relationship or operation can only be applied when the involved elements support equality comparison with one another.
  • F. None of above. chosen

Provenance (4 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.
PD Predicate disambiguation batch_69e514c9c00481909b76bda67957e58b completed April 19, 2026, 5:45 p.m.
PDg Predicate description generation batch_69e51a23300c8190988552491d9783d7 completed April 19, 2026, 6:08 p.m.
Created at: April 10, 2026, 1:41 p.m.