Triple

T3665772
Position Surface form Disambiguated ID Type / Status
Subject ACM SIGMETRICS Achievement Award E77754 entity
Predicate notableRecipient P108 FINISHED
Object Christos H. Papadimitriou
Christos H. Papadimitriou is a prominent computer scientist renowned for his foundational contributions to computational complexity theory, algorithms, and game theory.
 E377214 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: Christos H. Papadimitriou | Statement: [ACM SIGMETRICS Achievement Award, notableRecipient, Christos H. Papadimitriou]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Christos H. Papadimitriou
Context triple: [ACM SIGMETRICS Achievement Award, notableRecipient, Christos H. Papadimitriou]
  • A. Richard Karp
    Richard Karp is a renowned American computer scientist best known for his foundational work in computational complexity theory and combinatorial algorithms, including the theory of NP-completeness.
  • B. Michael Sipser
    Michael Sipser is an American theoretical computer scientist known for his influential work in computational complexity theory and for authoring a widely used textbook on the theory of computation.
  • C. David S. Johnson
    David S. Johnson was a prominent American computer scientist known for his influential work in algorithms and computational complexity, particularly in the study of NP-completeness and approximation algorithms.
  • D. 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.
  • E. Jeffrey D. Ullman
    Jeffrey D. Ullman is a prominent American computer scientist known for his foundational contributions to database theory, algorithms, and formal languages, and for coauthoring several classic textbooks in computer science.
  • 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: Christos H. Papadimitriou
Triple: [ACM SIGMETRICS Achievement Award, notableRecipient, Christos H. Papadimitriou]
Generated description
Christos H. Papadimitriou is a prominent computer scientist renowned for his foundational contributions to computational complexity theory, algorithms, and game theory.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: Christos H. Papadimitriou
Target entity description: Christos H. Papadimitriou is a prominent computer scientist renowned for his foundational contributions to computational complexity theory, algorithms, and game theory.
  • A. Richard Karp
    Richard Karp is a renowned American computer scientist best known for his foundational work in computational complexity theory and combinatorial algorithms, including the theory of NP-completeness.
  • B. Michael Sipser
    Michael Sipser is an American theoretical computer scientist known for his influential work in computational complexity theory and for authoring a widely used textbook on the theory of computation.
  • C. David S. Johnson
    David S. Johnson was a prominent American computer scientist known for his influential work in algorithms and computational complexity, particularly in the study of NP-completeness and approximation algorithms.
  • D. 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.
  • E. Jeffrey D. Ullman
    Jeffrey D. Ullman is a prominent American computer scientist known for his foundational contributions to database theory, algorithms, and formal languages, and for coauthoring several classic textbooks in computer science.
  • 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_69ad85dfc4dc8190a441864202ab2a7a completed March 8, 2026, 2:21 p.m.
NER Named-entity recognition batch_69adc40188988190b1b7ac9c8240a5ff completed March 8, 2026, 6:46 p.m.
NED1 Entity disambiguation (via context triple) batch_69b4884bd50c8190a334e9aadc734364 completed March 13, 2026, 9:57 p.m.
NEDg Description generation batch_69b4906d6190819086bd51f96d3ffdcc completed March 13, 2026, 10:32 p.m.
NED2 Entity disambiguation (via description) batch_69b4add30904819082ed6f6ee5918e57 completed March 14, 2026, 12:37 a.m.
Created at: March 8, 2026, 3:25 p.m.