Triple
T20836562
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | SAT problem |
E512973
|
entity |
| Predicate | NPCompletenessProvedBy |
P142028
|
FINISHED |
| Object | Stephen Cook |
—
|
NE NERFINISHED |
How this triple was built (3 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: Stephen Cook | Statement: [SAT problem, NPCompletenessProvedBy, Stephen Cook]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Stephen Cook Context triple: [SAT problem, NPCompletenessProvedBy, Stephen Cook]
-
A.
Stephen Cook
chosen
Stephen Cook is a Canadian-American computer scientist renowned for founding the field of computational complexity theory, particularly through his seminal work on NP-completeness.
-
B.
Stephen Cole
Stephen Cole was an early American settler and pioneer after whom Cole County in Missouri was named.
-
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.
John Ritchie
John Ritchie was the father of John Simon Ritchie, better known as Sid Vicious of the Sex Pistols.
-
E.
Colin Allen
Colin Allen is an author known for his work on the book "Medicine Jar."
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: NPCompletenessProvedBy Context triple: [SAT problem, NPCompletenessProvedBy, Stephen Cook]
-
A.
firstNPCompleteProblem
Indicates that the subject is the earliest or original problem proven to be NP-complete within a given context or theory.
-
B.
complexityClassRelation
Indicates a relationship between two computational complexity classes, such as inclusion, equivalence, or separation, within the hierarchy of complexity theory.
-
C.
provedUndecidableUsing
Indicates that the undecidability of one problem, theory, or statement was established by applying or reducing it to another specific method, result, or formal system.
-
D.
isUnconditionalPolynomialTime
Indicates that an algorithm or computation runs in polynomial time without relying on any unproven assumptions or conjectures.
-
E.
hasElementaryProof
Indicates that there exists a proof of the statement using only elementary methods, without relying on advanced or sophisticated theories.
- F. None of above. chosen
Provenance (4 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_69e0b4cf62a88190bbf92351e9e57259 |
completed | April 16, 2026, 10:07 a.m. |
| NER | Named-entity recognition | batch_69e6c326daec8190bd4caa41a4b38833 |
completed | April 21, 2026, 12:21 a.m. |
| PD | Predicate disambiguation | batch_69e5c9a1f4f48190aa9fb4ef8f8aea5a |
completed | April 20, 2026, 6:37 a.m. |
| PDg | Predicate description generation | batch_69e5d53c4d6881909b4d0a716fa5ed4a |
completed | April 20, 2026, 7:26 a.m. |
Created at: April 16, 2026, 12:42 p.m.