Triple
T21088262
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Reducibility Among Combinatorial Problems |
E519559
|
entity |
| Predicate | establishesNPCompletenessOf |
P142028
|
FINISHED |
| Object | Exact Cover by 3-Sets problem |
—
|
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: Exact Cover by 3-Sets problem | Statement: [Reducibility Among Combinatorial Problems, establishesNPCompletenessOf, Exact Cover by 3-Sets problem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Exact Cover by 3-Sets problem Context triple: [Reducibility Among Combinatorial Problems, establishesNPCompletenessOf, Exact Cover by 3-Sets problem]
-
A.
Exact Cover problem
chosen
The Exact Cover problem is a classic NP-complete decision problem in combinatorics and computer science that asks whether a collection of subsets contains a subcollection that covers each element of a universe exactly once.
-
B.
3-Dimensional Matching problem
The 3-Dimensional Matching problem is a classic NP-complete combinatorial decision problem that asks whether there exists a perfect matching selecting disjoint triples from three equally sized sets.
-
C.
Hitting Set problem
The Hitting Set problem is a classic NP-complete combinatorial decision problem that asks whether there exists a small subset of elements that intersects every set in a given collection.
-
D.
Set Covering problem
The Set Covering problem is a classic NP-complete combinatorial optimization problem that asks for the smallest collection of sets whose union covers all elements in a given universe.
-
E.
3-SAT
3-SAT is a classic Boolean satisfiability problem where each clause has exactly three literals and which serves as a fundamental NP-complete benchmark in computational complexity theory.
- 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_69e0b507dd9081908fb8bfcbef4c8b46 |
completed | April 16, 2026, 10:08 a.m. |
| NER | Named-entity recognition | batch_69e7094cebe08190bb10f51a45c244ec |
completed | April 21, 2026, 5:21 a.m. |
Created at: April 16, 2026, 2:50 p.m.