Triple

T20836490
Position Surface form Disambiguated ID Type / Status
Subject Cook–Levin theorem E512972 entity
Predicate field P3 FINISHED
Object computational complexity theory — NE NERFINISHED

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: computational complexity theory | Statement: [Cook–Levin theorem, field, computational complexity theory]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: computational complexity theory
Context triple: [Cook–Levin theorem, field, computational complexity theory]
  • A. Complexity Theory chosen
    Complexity Theory is a branch of theoretical computer science that studies the resources, such as time and space, required to solve computational problems and classifies these problems based on their inherent difficulty.
  • B. Computational Complexity blog
    The Computational Complexity blog is a long-running, influential blog on theoretical computer science and complexity theory, co-authored by Lance Fortnow (and often Bill Gasarch), featuring commentary on research, academia, and the theory community.
  • C. Theoretical Computer Science
    Theoretical Computer Science is a branch of computer science that focuses on mathematical and abstract foundations of computation, including algorithms, complexity, automata, and formal languages.
  • D. NP-completeness
    NP-completeness is a central concept in computational complexity theory that classifies decision problems believed to be among the hardest in NP, such that a polynomial-time solution to any one of them would yield polynomial-time solutions to all problems in NP.
  • E. Computational Complexity: A Conceptual Perspective
    Computational Complexity: A Conceptual Perspective is a graduate-level textbook that presents the foundations and key themes of computational complexity theory with an emphasis on conceptual understanding over technical detail.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

Provenance (2 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.
Created at: April 16, 2026, 12:42 p.m.