Triple

T231156
Position Surface form Disambiguated ID Type / Status
Subject John H. Conway E4412 entity
Predicate coAuthor P398 FINISHED
Object Elwyn R. Berlekamp
Elwyn R. Berlekamp was an American mathematician and engineer known for his influential work in coding theory, combinatorial game theory, and algorithms.
 E31309 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: Elwyn R. Berlekamp | Statement: [John H. Conway, coAuthor, Elwyn R. Berlekamp]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Elwyn R. Berlekamp
Context triple: [John H. Conway, coAuthor, Elwyn R. Berlekamp]
  • A. John H. Conway
    John H. Conway was a British mathematician renowned for his work in group theory, number theory, and recreational mathematics, including the invention of the cellular automaton "Game of Life."
  • B. Manuel Blum
    Manuel Blum is a Venezuelan-American computer scientist and Turing Award laureate renowned for his foundational contributions to computational complexity theory and cryptography.
  • C. Ralph Merkle
    Ralph Merkle is an American computer scientist and cryptographer known as a pioneer of public-key cryptography and for contributions such as Merkle trees and Merkle–Damgård hashing.
  • D. Johan Håstad
    Johan Håstad is a Swedish theoretical computer scientist renowned for his groundbreaking work in computational complexity theory, particularly optimal inapproximability results and contributions to the PCP theorem.
  • E. Zellig Harris
    Zellig Harris was an influential American linguist known for his pioneering work in structural linguistics and discourse analysis, and for mentoring Noam Chomsky.
  • 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: Elwyn R. Berlekamp
Triple: [John H. Conway, coAuthor, Elwyn R. Berlekamp]
Generated description
Elwyn R. Berlekamp was an American mathematician and engineer known for his influential work in coding theory, combinatorial game theory, and algorithms.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: Elwyn R. Berlekamp
Target entity description: Elwyn R. Berlekamp was an American mathematician and engineer known for his influential work in coding theory, combinatorial game theory, and algorithms.
  • A. John H. Conway
    John H. Conway was a British mathematician renowned for his work in group theory, number theory, and recreational mathematics, including the invention of the cellular automaton "Game of Life."
  • B. Manuel Blum
    Manuel Blum is a Venezuelan-American computer scientist and Turing Award laureate renowned for his foundational contributions to computational complexity theory and cryptography.
  • C. Ralph Merkle
    Ralph Merkle is an American computer scientist and cryptographer known as a pioneer of public-key cryptography and for contributions such as Merkle trees and Merkle–Damgård hashing.
  • D. Johan Håstad
    Johan Håstad is a Swedish theoretical computer scientist renowned for his groundbreaking work in computational complexity theory, particularly optimal inapproximability results and contributions to the PCP theorem.
  • E. Zellig Harris
    Zellig Harris was an influential American linguist known for his pioneering work in structural linguistics and discourse analysis, and for mentoring Noam Chomsky.
  • 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_69a257363ffc81909757bde7ab3404da completed Feb. 28, 2026, 2:47 a.m.
NER Named-entity recognition batch_69a25cadae1c8190be0e8dcf33351187 completed Feb. 28, 2026, 3:10 a.m.
NED1 Entity disambiguation (via context triple) batch_69a3695d08588190892d271c03fdf1e6 completed Feb. 28, 2026, 10:17 p.m.
NEDg Description generation batch_69a369d2b56c8190a6381b2da3e42e18 completed Feb. 28, 2026, 10:18 p.m.
NED2 Entity disambiguation (via description) batch_69a36a9f31408190b8f0e8273ff3a298 completed Feb. 28, 2026, 10:22 p.m.
Created at: Feb. 28, 2026, 2:53 a.m.