Triple

T13507034
Position Surface form Disambiguated ID Type / Status
Subject The Complexity of Theorem-Proving Procedures E321037 entity
Predicate relatedConcept P37 FINISHED
Object Cook–Levin theorem E512972 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: Cook–Levin theorem | Statement: [The Complexity of Theorem-Proving Procedures, relatedConcept, Cook–Levin theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Cook–Levin theorem
Context triple: [The Complexity of Theorem-Proving Procedures, relatedConcept, Cook–Levin theorem]
  • A. Cook–Levin theorem chosen
    The Cook–Levin theorem is a foundational result in computational complexity theory that established the Boolean satisfiability problem (SAT) as the first NP-complete problem, launching the theory of NP-completeness.
  • B. Valiant–Vazirani theorem
    The Valiant–Vazirani theorem is a fundamental result in computational complexity theory showing that solving unique solutions of NP problems is, under randomized reductions, as hard as solving general NP problems, with major implications for the study of randomness and hardness of approximation.
  • C. PCP theorem
    The PCP theorem is a fundamental result in computational complexity theory stating that every problem in NP has probabilistically checkable proofs that can be verified by examining only a constant number of bits, with major implications for the hardness of approximation.
  • D. P versus NP problem
    The P versus NP problem is a central unsolved question in theoretical computer science that asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer.
  • E. Rice's theorem
    Rice's theorem is a fundamental result in computability theory stating that any non-trivial semantic property of the language recognized by a Turing machine is undecidable.
  • 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_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.
Created at: April 9, 2026, 9:43 p.m.