Triple

T13507370
Position Surface form Disambiguated ID Type / Status
Subject David S. Johnson E321047 entity
Predicate coAuthor P398 FINISHED
Object Michael R. Garey
Michael R. Garey is an American computer scientist best known for his foundational work in computational complexity and NP-completeness, particularly through the influential book "Computers and Intractability."
 E321047 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: Michael R. Garey | Statement: [David S. Johnson, coAuthor, Michael R. Garey]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Michael R. Garey
Context triple: [David S. Johnson, coAuthor, Michael R. Garey]
  • A. John E. Hopcroft
    John E. Hopcroft is an American computer scientist renowned for his foundational contributions to algorithms and automata theory and as a coauthor of the classic textbook "Introduction to Automata Theory, Languages, and Computation."
  • B. 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.
  • C. 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.
  • D. Stephen A. Cook
    Stephen A. Cook is a Canadian-American computer scientist best known for founding the theory of NP-completeness and making seminal contributions to computational complexity theory.
  • E. Jay Gruska
    Jay Gruska is an American composer and songwriter best known for his extensive television scoring work, including co-composing the music for the series "Supernatural."
  • 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: Michael R. Garey
Triple: [David S. Johnson, coAuthor, Michael R. Garey]
Generated description
Michael R. Garey is an American computer scientist best known for his foundational work in computational complexity and NP-completeness, particularly through the influential book "Computers and Intractability."
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: Michael R. Garey
Target entity description: Michael R. Garey is an American computer scientist best known for his foundational work in computational complexity and NP-completeness, particularly through the influential book "Computers and Intractability."
  • A. John E. Hopcroft
    John E. Hopcroft is an American computer scientist renowned for his foundational contributions to algorithms and automata theory and as a coauthor of the classic textbook "Introduction to Automata Theory, Languages, and Computation."
  • B. David S. Johnson chosen
    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.
  • C. 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.
  • D. Stephen A. Cook
    Stephen A. Cook is a Canadian-American computer scientist best known for founding the theory of NP-completeness and making seminal contributions to computational complexity theory.
  • E. Jay Gruska
    Jay Gruska is an American composer and songwriter best known for his extensive television scoring work, including co-composing the music for the series "Supernatural."
  • F. None of above.

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_69d807629d6c8190998f1b9bb12d2ed0 completed April 9, 2026, 8:09 p.m.
NER Named-entity recognition batch_69dbaf8259a08190ada13c4a3078f07d completed April 12, 2026, 2:43 p.m.
NED1 Entity disambiguation (via context triple) batch_69f75d9009688190b8f18bb3525c6afd completed May 3, 2026, 2:37 p.m.
NEDg Description generation batch_69f75ec5101081909652b0c0998b36c8 completed May 3, 2026, 2:42 p.m.
NED2 Entity disambiguation (via description) batch_69f75f4a3b0c81908c0ca0351771953b completed May 3, 2026, 2:44 p.m.
Created at: April 9, 2026, 9:43 p.m.