Triple
T21763285
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Max-3-SAT |
E537214
|
entity |
| Predicate | hasReductionFrom |
P3630
|
FINISHED |
| Object | 3-SAT |
—
|
NE NERFINISHED |
How this triple was built (3 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: 3-SAT | Statement: [Max-3-SAT, hasReductionFrom, 3-SAT]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: 3-SAT Context triple: [Max-3-SAT, hasReductionFrom, 3-SAT]
-
A.
3-SAT
chosen
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.
-
B.
Max-3-SAT
Max-3-SAT is an optimization variant of the Boolean satisfiability problem where the goal is to maximize the number of satisfied clauses, each containing exactly three literals, and it serves as a central problem in the study of approximation algorithms and hardness of approximation.
-
C.
3sat
3sat is a public, advertising-free cultural television channel jointly operated by German, Austrian, and Swiss broadcasters, focusing on highbrow arts, culture, and educational programming.
-
D.
k-SAT
k-SAT is a canonical NP-complete decision problem in Boolean logic where one asks whether there exists a truth assignment satisfying a formula expressed as a conjunction of clauses, each containing at most k literals.
-
E.
Boolean satisfiability problem
The Boolean satisfiability problem (SAT) is the canonical NP-complete decision problem of determining whether there exists an assignment of truth values to variables that makes a given Boolean formula evaluate to true.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: hasReductionFrom Context triple: [Max-3-SAT, hasReductionFrom, 3-SAT]
-
A.
hasRedistributionsBy
Indicates that something is associated with one or more redistribution events, specifying which agent or process performed those redistributions.
-
B.
reducesTo
chosen
Indicates that one expression, structure, or state can be transformed or simplified into another, typically more basic or canonical, form.
-
C.
reduces
Indicates that one entity causes a decrease in the amount, intensity, degree, or impact of another entity.
-
D.
hasRedistributions
Indicates that one entity is associated with one or more instances of redistributing resources, items, or values related to another entity.
-
E.
reducedRepresentationOf
Indicates that one entity is a simplified, compressed, or lower-detail version of another entity while preserving its essential information or structure.
- 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_69e0c46f5d1c8190bf830409e98464e5 |
completed | April 16, 2026, 11:13 a.m. |
| NER | Named-entity recognition | batch_69f031a711dc8190a786c9849dc344e8 |
completed | April 28, 2026, 4:03 a.m. |
| PD | Predicate disambiguation | batch_69e6be6299988190a34c98fa76d94700 |
completed | April 21, 2026, 12:01 a.m. |
Created at: April 16, 2026, 6:51 p.m.