Triple
T20836489
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Cook–Levin theorem |
E512972
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | NP-completeness theorem |
C7186
|
CONCEPT FINISHED |
How this triple was built (1 step)
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.
CD
Concept disambiguation
gpt-5-mini-2025-08-07
Target class: NP-completeness theorem Context triple: [Cook–Levin theorem, instanceOf, NP-completeness theorem]
-
A.
complexity theory paper
A complexity theory paper is a scholarly work that rigorously analyzes the computational resources required to solve problems, classifies them into complexity classes, and explores relationships or separations between these classes.
-
B.
impossibility result
An impossibility result is a formal theorem showing that no system, algorithm, or method can satisfy a specified set of requirements or achieve a particular goal under given assumptions.
-
C.
theorem in distributed computing
A theorem in distributed computing is a formally proven statement that characterizes fundamental limits, guarantees, or behaviors of distributed systems under specified models, assumptions, and failure conditions.
-
D.
foundational principle in theoretical computer science
chosen
A foundational principle in theoretical computer science is a core, abstract concept or rule—such as computability, complexity, or formal language theory—that underlies and unifies the study of algorithms, computation models, and their inherent limits.
-
E.
complexity measure
A complexity measure is a quantitative function or criterion used to assess and compare the intricacy, difficulty, or resource requirements of objects, systems, or problems.
- F. None of above.
Provenance (1 batch)
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. |
Created at: April 16, 2026, 12:42 p.m.