Triple

T9958188
Position Surface form Disambiguated ID Type / Status
Subject Moni Naor E195495 entity
Predicate researchArea P3 FINISHED
Object locally decodable codes
Locally decodable codes are error-correcting codes that allow the recovery of any specific symbol of the original message by querying only a small number of positions in a possibly corrupted codeword.
 E831746 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: locally decodable codes | Statement: [Moni Naor, researchArea, locally decodable codes]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: locally decodable codes
Context triple: [Moni Naor, researchArea, locally decodable codes]
  • A. 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.
  • B. 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.
  • C. LDPC
    LDPC (Low-Density Parity-Check) is a powerful class of linear error-correcting codes known for near-Shannon-limit performance and widespread use in modern high-throughput communication systems.
  • 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. 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. 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: locally decodable codes
Triple: [Moni Naor, researchArea, locally decodable codes]
Generated description
Locally decodable codes are error-correcting codes that allow the recovery of any specific symbol of the original message by querying only a small number of positions in a possibly corrupted codeword.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: locally decodable codes
Target entity description: Locally decodable codes are error-correcting codes that allow the recovery of any specific symbol of the original message by querying only a small number of positions in a possibly corrupted codeword.
  • A. 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.
  • B. 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.
  • C. LDPC
    LDPC (Low-Density Parity-Check) is a powerful class of linear error-correcting codes known for near-Shannon-limit performance and widespread use in modern high-throughput communication systems.
  • 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. 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. 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_69ca82eaaa008190a54fa1a9f954b9ad completed March 30, 2026, 2:04 p.m.
NER Named-entity recognition batch_69cdb6cec7dc8190bb7e43c82a317707 completed April 2, 2026, 12:22 a.m.
NED1 Entity disambiguation (via context triple) batch_69d23d7988948190bae81c1020f2b605 completed April 5, 2026, 10:46 a.m.
NEDg Description generation batch_69d23e6ee6d48190ae724d0ee96b64bf completed April 5, 2026, 10:50 a.m.
NED2 Entity disambiguation (via description) batch_69d23fd274dc8190b7af27cf503d7dc6 completed April 5, 2026, 10:56 a.m.
Created at: March 30, 2026, 8:46 p.m.