Triple
T14721112
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Probably Approximately Correct |
E345815
|
entity |
| Predicate | author |
P4
|
FINISHED |
| Object | Leslie G. Valiant |
E69521
|
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: Leslie G. Valiant | Statement: [Probably Approximately Correct, author, Leslie G. Valiant]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Leslie G. Valiant Context triple: [Probably Approximately Correct, author, Leslie G. Valiant]
-
A.
Leslie Valiant
chosen
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
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.
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.
-
D.
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."
-
E.
Stephen A. Cook
Stephen A. Cook is a Canadian-American computer scientist best known for founding the theory of NP-completeness and making seminal contributions to computational complexity theory.
- 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_69d822e5911c8190ba589f957dbd9ba7 |
completed | April 9, 2026, 10:06 p.m. |
| NER | Named-entity recognition | batch_69dec25d56fc8190871873ca55d49272 |
completed | April 14, 2026, 10:40 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69fe6b43360481908dc73d5e6758fea6 |
completed | May 8, 2026, 11:01 p.m. |
Created at: April 10, 2026, 1:29 a.m.