Triple
T439348
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Harold Pender Award |
E10079
|
entity |
| Predicate | notableRecipient |
P108
|
FINISHED |
| Object |
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
|
E69521
|
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: Leslie Valiant | Statement: [Harold Pender Award, notableRecipient, Leslie Valiant]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Leslie Valiant Context triple: [Harold Pender Award, notableRecipient, Leslie Valiant]
-
A.
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.
-
B.
Leonard Adleman
Leonard Adleman is an American computer scientist and cryptographer best known as one of the co-inventors of the RSA public-key cryptosystem.
-
C.
J Strother Moore
J Strother Moore is an American computer scientist best known for his pioneering work in automated theorem proving and formal methods, including co-developing the Boyer–Moore theorem prover and the ACL2 system.
-
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.
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.
- 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: Leslie Valiant Triple: [Harold Pender Award, notableRecipient, Leslie Valiant]
Generated description
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Leslie Valiant Target entity description: Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
A.
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.
-
B.
Leonard Adleman
Leonard Adleman is an American computer scientist and cryptographer best known as one of the co-inventors of the RSA public-key cryptosystem.
-
C.
J Strother Moore
J Strother Moore is an American computer scientist best known for his pioneering work in automated theorem proving and formal methods, including co-developing the Boyer–Moore theorem prover and the ACL2 system.
-
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.
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.
- 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_69a2e8465ef481909655c681b01e2986 |
completed | Feb. 28, 2026, 1:06 p.m. |
| NER | Named-entity recognition | batch_69a2ef2977888190a0590b2c1bd2f5da |
completed | Feb. 28, 2026, 1:35 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69a4e62e2b3c81908215dab8c0717495 |
completed | March 2, 2026, 1:21 a.m. |
| NEDg | Description generation | batch_69a4e6b3f570819087fe28f3225afe88 |
completed | March 2, 2026, 1:24 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69a4e706d3e88190822eeb4a724a9b6a |
completed | March 2, 2026, 1:25 a.m. |
Created at: Feb. 28, 2026, 1:11 p.m.