Triple
T5429771
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Richard Karp |
E121454
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object | Karp’s 21 NP-complete problems |
E173625
|
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: Karp’s 21 NP-complete problems | Statement: [Richard Karp, knownFor, Karp’s 21 NP-complete problems]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Karp’s 21 NP-complete problems Context triple: [Richard Karp, knownFor, Karp’s 21 NP-complete problems]
-
A.
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.
-
B.
“Inapproximability results for SAT and other problems”
“Inapproximability results for SAT and other problems” is a seminal theoretical computer science paper by Johan Håstad that establishes tight hardness-of-approximation bounds for satisfiability and related optimization problems using probabilistically checkable proofs.
-
C.
NP-completeness
chosen
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.
-
D.
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.
-
E.
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.
- 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_69bd463c65f0819082ee6483ab4b466a |
completed | March 20, 2026, 1:06 p.m. |
| NER | Named-entity recognition | batch_69bd883d1bfc8190859bb05cfab065c8 |
completed | March 20, 2026, 5:47 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69bf3ac6285081909afa6e91a023f6d5 |
completed | March 22, 2026, 12:41 a.m. |
Created at: March 20, 2026, 2:06 p.m.