Triple
T5335952
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | EATCS Award |
E123825
|
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: [EATCS Award, notableRecipient, Christos H. Papadimitriou]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Christos H. Papadimitriou Context triple: [EATCS Award, 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.
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.
-
C.
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.
-
D.
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.
-
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.
- 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_69bd464b07f8819095aa76577c9829e4 |
completed | March 20, 2026, 1:06 p.m. |
| NER | Named-entity recognition | batch_69bd85af799081909ee60bfbb65149ee |
completed | March 20, 2026, 5:36 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69bf18be4bb88190a2b83e51716e677e |
completed | March 21, 2026, 10:16 p.m. |
Created at: March 20, 2026, 2 p.m.