Triple

T1031121
Position Surface form Disambiguated ID Type / Status
Subject Michael Sipser E22252 entity
Predicate doctoralAdvisor P167 FINISHED
Object 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.
 E121454 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: Richard Karp | Statement: [Michael Sipser, doctoralAdvisor, Richard Karp]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Richard Karp
Context triple: [Michael Sipser, doctoralAdvisor, Richard Karp]
  • A. Leslie Valiant
    Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
  • 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. Leonard Adleman
    Leonard Adleman is an American computer scientist and cryptographer best known as one of the co-inventors of the RSA public-key cryptosystem.
  • D. 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.
  • E. 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.
  • 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: Richard Karp
Triple: [Michael Sipser, doctoralAdvisor, Richard Karp]
Generated description
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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: Richard Karp
Target entity description: 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.
  • A. Leslie Valiant
    Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
  • 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. Leonard Adleman
    Leonard Adleman is an American computer scientist and cryptographer best known as one of the co-inventors of the RSA public-key cryptosystem.
  • D. 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.
  • E. 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.
  • 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_69a493d848848190aed4011b34b2e8d3 completed March 1, 2026, 7:30 p.m.
NER Named-entity recognition batch_69a4b810429081908a97014ca740824b completed March 1, 2026, 10:05 p.m.
NED1 Entity disambiguation (via context triple) batch_69ac3bbf5a1c819086e1ff529d05f311 completed March 7, 2026, 2:52 p.m.
NEDg Description generation batch_69ac3d80db008190b71b893f9d78ba4b completed March 7, 2026, 3 p.m.
NED2 Entity disambiguation (via description) batch_69ac3df3fea8819080b83c840ffd59a8 completed March 7, 2026, 3:02 p.m.
Created at: March 1, 2026, 7:41 p.m.