Triple

T13507007
Position Surface form Disambiguated ID Type / Status
Subject The Complexity of Theorem-Proving Procedures E321037 entity
Predicate author P4 FINISHED
Object 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.
 E1045586 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: Stephen A. Cook | Statement: [The Complexity of Theorem-Proving Procedures, author, Stephen A. Cook]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Stephen A. Cook
Context triple: [The Complexity of Theorem-Proving Procedures, author, Stephen A. Cook]
  • 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. 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.
  • C. Juris Hartmanis
    Juris Hartmanis was a pioneering computer scientist best known for co-founding the field of computational complexity theory and sharing the 1993 Turing Award for his fundamental contributions.
  • 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. 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. 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: Stephen A. Cook
Triple: [The Complexity of Theorem-Proving Procedures, author, Stephen A. Cook]
Generated description
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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: Stephen A. Cook
Target entity description: 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.
  • 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. 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.
  • C. Juris Hartmanis
    Juris Hartmanis was a pioneering computer scientist best known for co-founding the field of computational complexity theory and sharing the 1993 Turing Award for his fundamental contributions.
  • 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. 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. 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_69d807629d6c8190998f1b9bb12d2ed0 completed April 9, 2026, 8:09 p.m.
NER Named-entity recognition batch_69dbaf8259a08190ada13c4a3078f07d completed April 12, 2026, 2:43 p.m.
NED1 Entity disambiguation (via context triple) batch_69f7548e51b881909a3384812556bc3d completed May 3, 2026, 1:58 p.m.
NEDg Description generation batch_69f757108e088190aeec031eccc9aca3 completed May 3, 2026, 2:09 p.m.
NED2 Entity disambiguation (via description) batch_69f757e7322c8190b0e36e8373d42ac4 completed May 3, 2026, 2:12 p.m.
Created at: April 9, 2026, 9:43 p.m.