Triple

T1451899
Position Surface form Disambiguated ID Type / Status
Subject Elwyn R. Berlekamp E31309 entity
Predicate notableWork P4 FINISHED
Object 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.
E165812 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: Algebraic Coding Theory | Statement: [Elwyn R. Berlekamp, notableWork, Algebraic Coding Theory]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Algebraic Coding Theory
Context triple: [Elwyn R. Berlekamp, notableWork, Algebraic Coding Theory]
  • A. Communication Theory of Secrecy Systems
    Communication Theory of Secrecy Systems is Claude Shannon’s foundational paper that established the mathematical basis of modern cryptography and information-theoretic security.
  • B. Scott encoding
    Scott encoding is a method in lambda calculus for representing algebraic data types and their pattern matching behavior using higher-order functions.
  • C. Elliptic Curve Cryptography
    Elliptic Curve Cryptography is a public-key cryptographic approach that uses the mathematics of elliptic curves over finite fields to provide strong security with relatively small key sizes.
  • D. Kailath factorization in linear systems
    Kailath factorization in linear systems is a matrix factorization technique used in control and signal processing to efficiently analyze and solve linear dynamical systems.
  • E. An Introduction to Information Theory: Symbols, Signals and Noise
    An Introduction to Information Theory: Symbols, Signals and Noise is a classic, accessible textbook that explains the fundamental concepts of information theory, communication, and coding for a broad scientific and engineering audience.
  • 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: Algebraic Coding Theory
Triple: [Elwyn R. Berlekamp, notableWork, Algebraic Coding Theory]
Generated description
Algebraic Coding Theory is a foundational mathematical text that systematically develops the theory and applications of error-correcting codes using algebraic methods.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Algebraic Coding Theory
Target entity description: Algebraic Coding Theory is a foundational mathematical text that systematically develops the theory and applications of error-correcting codes using algebraic methods.
  • A. Communication Theory of Secrecy Systems
    Communication Theory of Secrecy Systems is Claude Shannon’s foundational paper that established the mathematical basis of modern cryptography and information-theoretic security.
  • B. Scott encoding
    Scott encoding is a method in lambda calculus for representing algebraic data types and their pattern matching behavior using higher-order functions.
  • C. Elliptic Curve Cryptography
    Elliptic Curve Cryptography is a public-key cryptographic approach that uses the mathematics of elliptic curves over finite fields to provide strong security with relatively small key sizes.
  • D. Kailath factorization in linear systems
    Kailath factorization in linear systems is a matrix factorization technique used in control and signal processing to efficiently analyze and solve linear dynamical systems.
  • E. An Introduction to Information Theory: Symbols, Signals and Noise
    An Introduction to Information Theory: Symbols, Signals and Noise is a classic, accessible textbook that explains the fundamental concepts of information theory, communication, and coding for a broad scientific and engineering audience.
  • 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_69a499171a28819085b993a3ac78e363 completed March 1, 2026, 7:52 p.m.
NER Named-entity recognition batch_69a4c57d34cc8190801b769d9d9b2e2e completed March 1, 2026, 11:02 p.m.
NED1 Entity disambiguation (via context triple) batch_69ad08c6f7c881908d1ef9f7897895a6 completed March 8, 2026, 5:27 a.m.
NEDg Description generation batch_69ad0a53fa6c8190bc44e8a3f9aec62f completed March 8, 2026, 5:34 a.m.
NED2 Entity disambiguation (via description) batch_69ad0aefb1c88190a368d68454a0b9d0 completed March 8, 2026, 5:36 a.m.
Created at: March 1, 2026, 8 p.m.