Triple
T11090138
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | ACM SIGACT Distinguished Service Prize |
E262228
|
entity |
| Predicate | notableRecipient |
P108
|
FINISHED |
| Object | Christos H. Papadimitriou |
E377214
|
NE FINISHED |
How this triple was built (2 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 SIGACT Distinguished Service Prize, notableRecipient, Christos H. Papadimitriou]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Christos H. Papadimitriou Context triple: [ACM SIGACT Distinguished Service Prize, notableRecipient, Christos H. Papadimitriou]
-
A.
Christos H. Papadimitriou
chosen
Christos H. Papadimitriou is a prominent computer scientist renowned for his foundational contributions to computational complexity theory, algorithms, and game theory.
-
B.
Christos Papadimitriou
Christos Papadimitriou is a prominent Greek computer scientist known for his foundational contributions to computational complexity theory, algorithms, and game theory, and for authoring influential textbooks in theoretical computer science.
-
C.
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."
-
D.
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.
-
E.
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.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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. |
Created at: April 8, 2026, 9:27 p.m.