Triple
T11090134
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | ACM SIGACT Distinguished Service Prize |
E262228
|
entity |
| Predicate | notableRecipient |
P108
|
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, including co-authoring 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: [ACM SIGACT Distinguished Service Prize, notableRecipient, Michael R. Garey]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Michael R. Garey Context triple: [ACM SIGACT Distinguished Service Prize, notableRecipient, 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.
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."
-
E.
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.
- 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: [ACM SIGACT Distinguished Service Prize, notableRecipient, 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, including co-authoring 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, including co-authoring 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.
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."
-
E.
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.
- 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_69d6aa9a40d88190a373e2c7e48285db |
completed | April 8, 2026, 7:20 p.m. |
| NER | Named-entity recognition | batch_69d799e96ca08190838c8a04d1eb2a16 |
completed | April 9, 2026, 12:22 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69e42d66ded88190877a20a10f012d6b |
completed | April 19, 2026, 1:18 a.m. |
| NEDg | Description generation | batch_69e42e1daa3c8190b598adcf9bac00f3 |
completed | April 19, 2026, 1:21 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69e42f415b1081909f9eedcb3640cdc3 |
completed | April 19, 2026, 1:26 a.m. |
Created at: April 8, 2026, 9:27 p.m.