Triple
T21088244
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Reducibility Among Combinatorial Problems |
E519559
|
entity |
| Predicate | establishesNPCompletenessOf |
P142028
|
FINISHED |
| Object | Satisfiability problem |
—
|
LITERAL 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: Satisfiability problem | Statement: [Reducibility Among Combinatorial Problems, establishesNPCompletenessOf, Satisfiability problem]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: establishesNPCompletenessOf Context triple: [Reducibility Among Combinatorial Problems, establishesNPCompletenessOf, Satisfiability problem]
-
A.
isNPComplete
Indicates that a decision problem is both in NP and NP-hard, meaning it can be verified in polynomial time and is at least as hard as any problem in NP.
-
B.
yearNPCompletenessProved
Indicates the year in which the NP-completeness of a given problem was formally proved.
-
C.
NPCompletenessProvedBy
chosen
Indicates that the NP-completeness of a problem is established through a proof provided by a particular person, work, or method.
-
D.
isNPHard
Indicates that solving the associated problem is at least as hard as the hardest problems in NP, so no known polynomial-time algorithm can solve all its instances unless P = NP.
-
E.
firstNPCompleteProblem
Indicates that the subject is the earliest or original problem proven to be NP-complete within a given context or theory.
- F. None of above.
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_69e0b507dd9081908fb8bfcbef4c8b46 |
completed | April 16, 2026, 10:08 a.m. |
| NER | Named-entity recognition | batch_69e7094cebe08190bb10f51a45c244ec |
completed | April 21, 2026, 5:21 a.m. |
| PD | Predicate disambiguation | batch_69e5dbfcd5e881908f1e4e0d2d237856 |
completed | April 20, 2026, 7:55 a.m. |
Created at: April 16, 2026, 2:50 p.m.