Triple
T8021468
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | IBM Thomas J. Watson Research Center |
E186749
|
entity |
| Predicate | employer |
P7
|
FINISHED |
| Object | John Hopcroft |
E568994
|
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: John Hopcroft | Statement: [IBM Thomas J. Watson Research Center, employer, John Hopcroft]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: John Hopcroft Context triple: [IBM Thomas J. Watson Research Center, employer, John Hopcroft]
-
A.
John E. Hopcroft
chosen
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."
-
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.
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.
-
D.
Jack Edmonds
Jack Edmonds is a pioneering Canadian mathematician and computer scientist renowned for his foundational work in combinatorial optimization and polyhedral theory, including the development of efficient algorithms for matching and matroid intersection.
-
E.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
- 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_69ca82ac7fc081909b1398cf025423af |
completed | March 30, 2026, 2:03 p.m. |
| NER | Named-entity recognition | batch_69cb3e8d90488190b57d1e748e272061 |
completed | March 31, 2026, 3:25 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69cc63c6a9208190841ed55b8c6ec73f |
completed | April 1, 2026, 12:16 a.m. |
Created at: March 30, 2026, 5:20 p.m.