Triple
T364392
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Herbrand Award |
E7926
|
entity |
| Predicate | notableRecipient |
P108
|
FINISHED |
| Object |
Edmund M. Clarke
Edmund M. Clarke was an American computer scientist best known for co-inventing model checking, a breakthrough technique in formal verification that earned him the Turing Award.
|
E46990
|
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: Edmund M. Clarke | Statement: [Herbrand Award, notableRecipient, Edmund M. Clarke]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Edmund M. Clarke Context triple: [Herbrand Award, notableRecipient, Edmund M. Clarke]
-
A.
Martin Davis
Martin Davis was an American mathematician and logician renowned for his foundational work in computability theory and the Entscheidungsproblem, including contributions to the Davis–Putnam algorithm.
-
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.
Peter J. Denning
Peter J. Denning is an American computer scientist renowned for his foundational work in operating systems, particularly virtual memory, and for his leadership in advancing the science and practice of computing.
-
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.
Elwyn R. Berlekamp
Elwyn R. Berlekamp was an American mathematician and engineer known for his influential work in coding theory, combinatorial game theory, and algorithms.
- 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: Edmund M. Clarke Triple: [Herbrand Award, notableRecipient, Edmund M. Clarke]
Generated description
Edmund M. Clarke was an American computer scientist best known for co-inventing model checking, a breakthrough technique in formal verification that earned him the Turing Award.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Edmund M. Clarke Target entity description: Edmund M. Clarke was an American computer scientist best known for co-inventing model checking, a breakthrough technique in formal verification that earned him the Turing Award.
-
A.
Martin Davis
Martin Davis was an American mathematician and logician renowned for his foundational work in computability theory and the Entscheidungsproblem, including contributions to the Davis–Putnam algorithm.
-
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.
Peter J. Denning
Peter J. Denning is an American computer scientist renowned for his foundational work in operating systems, particularly virtual memory, and for his leadership in advancing the science and practice of computing.
-
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.
Elwyn R. Berlekamp
Elwyn R. Berlekamp was an American mathematician and engineer known for his influential work in coding theory, combinatorial game theory, and algorithms.
- 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_69a2e7e880008190a6ad7e06e5d03007 |
completed | Feb. 28, 2026, 1:04 p.m. |
| NER | Named-entity recognition | batch_69a2ebe6c1b4819083335e880c205ed6 |
completed | Feb. 28, 2026, 1:21 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69a3f0a5e5dc81909363a31e9b713368 |
completed | March 1, 2026, 7:54 a.m. |
| NEDg | Description generation | batch_69a3f128b6008190afacdb055a84a9c4 |
completed | March 1, 2026, 7:56 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69a3f181e55c8190a3995775ff6ceeb9 |
completed | March 1, 2026, 7:57 a.m. |
Created at: Feb. 28, 2026, 1:08 p.m.