Triple
T21763312
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Max-E3-LIN-2 |
E537215
|
entity |
| Predicate | abbreviationOf |
P590
|
FINISHED |
| Object | Maximum Exact 3-Linear Equations Modulo 2 |
—
|
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: Maximum Exact 3-Linear Equations Modulo 2 | Statement: [Max-E3-LIN-2, abbreviationOf, Maximum Exact 3-Linear Equations Modulo 2]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Maximum Exact 3-Linear Equations Modulo 2 Context triple: [Max-E3-LIN-2, abbreviationOf, Maximum Exact 3-Linear Equations Modulo 2]
-
A.
Max-E3-LIN-2
chosen
Max-E3-LIN-2 is a canonical constraint satisfaction optimization problem over linear equations modulo 2 with three variables per equation, widely used as a central example in hardness of approximation theory.
-
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.
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.
-
D.
The Computational Complexity of Boolean Functions
"The Computational Complexity of Boolean Functions" is a foundational monograph in theoretical computer science that systematically studies the resources required to compute Boolean functions, particularly within circuit complexity.
-
E.
Håstad’s switching lemma
Håstad’s switching lemma is a fundamental result in computational complexity theory that provides powerful bounds on the simplification of Boolean formulas under random restrictions, with major applications in circuit lower bounds.
- 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_69e0c46f5d1c8190bf830409e98464e5 |
completed | April 16, 2026, 11:13 a.m. |
| NER | Named-entity recognition | batch_69f031a711dc8190a786c9849dc344e8 |
completed | April 28, 2026, 4:03 a.m. |
Created at: April 16, 2026, 6:51 p.m.