Triple
T20836573
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | SAT problem |
E512973
|
entity |
| Predicate | complexityOfkSATForK≥3 |
P142031
|
FINISHED |
| Object | NP-complete |
—
|
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: NP-complete | Statement: [SAT problem, complexityOfkSATForK≥3, NP-complete]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: complexityOfkSATForK≥3 Context triple: [SAT problem, complexityOfkSATForK≥3, NP-complete]
-
A.
complexityClassRelation
Indicates a relationship between two computational complexity classes, such as inclusion, equivalence, or separation, within the hierarchy of complexity theory.
-
B.
firstNPCompleteProblem
Indicates that the subject is the earliest or original problem proven to be NP-complete within a given context or theory.
-
C.
decidability
Indicates whether a given problem, property, or statement can be algorithmically determined to be true or false for all possible inputs.
-
D.
hasReasoningComplexity
Indicates that an action, process, or decision involves a certain level or type of cognitive or logical complexity in its reasoning.
-
E.
isUnconditionalPolynomialTime
Indicates that an algorithm or computation runs in polynomial time without relying on any unproven assumptions or conjectures.
- F. None of above. chosen
Provenance (4 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. |
| PD | Predicate disambiguation | batch_69e5c9a1f4f48190aa9fb4ef8f8aea5a |
completed | April 20, 2026, 6:37 a.m. |
| PDg | Predicate description generation | batch_69e5d53c4d6881909b4d0a716fa5ed4a |
completed | April 20, 2026, 7:26 a.m. |
Created at: April 16, 2026, 12:42 p.m.