Triple
T20836470
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | NP-hardness |
E512971
|
entity |
| Predicate | historicalWork |
P142020
|
FINISHED |
| Object | Karp's 21 NP-complete problems paper (1972) |
—
|
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: Karp's 21 NP-complete problems paper (1972) | Statement: [NP-hardness, historicalWork, Karp's 21 NP-complete problems paper (1972)]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Karp's 21 NP-complete problems paper (1972) Context triple: [NP-hardness, historicalWork, Karp's 21 NP-complete problems paper (1972)]
-
A.
"Reducibility Among Combinatorial Problems" (1972)
chosen
"Reducibility Among Combinatorial Problems" (1972) is a landmark paper by Richard Karp that introduced NP-completeness to a broad audience by showing polynomial-time reductions among 21 classic combinatorial decision problems.
-
B.
Garey and Johnson: Computers and Intractability
"Garey and Johnson: Computers and Intractability" is a foundational textbook in theoretical computer science that systematically develops the theory of NP-completeness and computational complexity.
-
C.
P, NP, and NP-Completeness: The Basics of Complexity Theory
"P, NP, and NP-Completeness: The Basics of Complexity Theory" is a foundational textbook by Oded Goldreich that introduces the core concepts, problems, and techniques of computational complexity theory, with a focus on the classes P, NP, and NP-complete problems.
-
D.
Papadimitriou: Computational Complexity
"Papadimitriou: Computational Complexity" is a widely used graduate-level textbook that systematically develops the theory of computational complexity, including classes like P and NP and the foundations of NP-completeness.
-
E.
Cook–Levin theorem
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.
- 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.