Triple
T6082261
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Jeffrey D. Ullman |
E135550
|
entity |
| Predicate | coauthor |
P2389
|
FINISHED |
| Object |
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."
|
E568994
|
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: John E. Hopcroft | Statement: [Jeffrey D. Ullman, coauthor, John E. Hopcroft]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: John E. Hopcroft Context triple: [Jeffrey D. Ullman, coauthor, John E. Hopcroft]
-
A.
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.
-
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.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
D.
Alfred V. Aho
Alfred V. Aho is a Canadian computer scientist renowned for his foundational contributions to algorithms, programming languages, and compiler design, and as a co-creator of the AWK programming language.
-
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: John E. Hopcroft Triple: [Jeffrey D. Ullman, coauthor, John E. Hopcroft]
Generated description
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."
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: John E. Hopcroft Target entity description: 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."
-
A.
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.
-
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.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
D.
Alfred V. Aho
Alfred V. Aho is a Canadian computer scientist renowned for his foundational contributions to algorithms, programming languages, and compiler design, and as a co-creator of the AWK programming language.
-
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
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_69c0087ad31c8190ab936e0ff28614b6 |
completed | March 22, 2026, 3:19 p.m. |
| NER | Named-entity recognition | batch_69c05774bc948190a446b27e83f7079b |
completed | March 22, 2026, 8:56 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c1252d7bf081909a9610e5b0e6924c |
completed | March 23, 2026, 11:34 a.m. |
| NEDg | Description generation | batch_69c125d888cc819092b765d47f1d9f9f |
completed | March 23, 2026, 11:36 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69c126f308988190ab6cb6c79ea12877 |
completed | March 23, 2026, 11:41 a.m. |
Created at: March 22, 2026, 4:11 p.m.