Triple

T5642216

Position	Surface form	Disambiguated ID	Type / Status
Subject	Inapproximability results for SAT and other problems	`E124291`	entity
Predicate	relatedConcept	`P37`	FINISHED
Object	Max-SAT Max-SAT is the optimization variant of the Boolean satisfiability problem in which the goal is to find an assignment that satisfies the maximum possible number of clauses, making it a central problem in approximation algorithms and complexity theory.	`E537213`	NE FINISHED

How this triple was built (4 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: Max-SAT | Statement: [Inapproximability results for SAT and other problems, relatedConcept, Max-SAT]

NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07

Target entity: Max-SAT
Context triple: [Inapproximability results for SAT and other problems, relatedConcept, Max-SAT]

A. TNTSAT
TNTSAT is a French free-to-air satellite television platform that broadcasts the national digital terrestrial TV channels via satellite.
B. Satisfiability Modulo Theories (SMT)
Satisfiability Modulo Theories (SMT) is a framework in computer science and mathematical logic for deciding the satisfiability of logical formulas with respect to background theories such as arithmetic, bit-vectors, arrays, and data types, widely used in verification, synthesis, and automated reasoning.
C. SCIP
SCIP is the ICAO airport code for Mataveri International Airport, the main air gateway to Easter Island in Chile.
D. GSAT
GSAT is a series of Indian communications satellites operated by ISRO to provide services such as telecommunication, broadcasting, and broadband connectivity.
E. “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.
F. None of above. chosen
G. Unsure - the case is ambiguous/there is not enough information to decide.

NEDg Description generation gpt-5.1

Instruction

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Input

Entity: Max-SAT
Triple: [Inapproximability results for SAT and other problems, relatedConcept, Max-SAT]

Generated description

Max-SAT is the optimization variant of the Boolean satisfiability problem in which the goal is to find an assignment that satisfies the maximum possible number of clauses, making it a central problem in approximation algorithms and complexity theory.

NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07

Target entity: Max-SAT
Target entity description: Max-SAT is the optimization variant of the Boolean satisfiability problem in which the goal is to find an assignment that satisfies the maximum possible number of clauses, making it a central problem in approximation algorithms and complexity theory.

A. TNTSAT
TNTSAT is a French free-to-air satellite television platform that broadcasts the national digital terrestrial TV channels via satellite.
B. Satisfiability Modulo Theories (SMT)
Satisfiability Modulo Theories (SMT) is a framework in computer science and mathematical logic for deciding the satisfiability of logical formulas with respect to background theories such as arithmetic, bit-vectors, arrays, and data types, widely used in verification, synthesis, and automated reasoning.
C. SCIP
SCIP is the ICAO airport code for Mataveri International Airport, the main air gateway to Easter Island in Chile.
D. GSAT
GSAT is a series of Indian communications satellites operated by ISRO to provide services such as telecommunication, broadcasting, and broadband connectivity.
E. “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.
F. None of above. chosen

Provenance (5 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_69c00824643c81909ffdb888a2d35189`	completed	March 22, 2026, 3:17 p.m.
NER	Named-entity recognition	`batch_69c022a6a22881908d16f4df564ed2a2`	completed	March 22, 2026, 5:11 p.m.
NED1	Entity disambiguation (via context triple)	`batch_69c04d7c98008190b79528596eca4208`	completed	March 22, 2026, 8:13 p.m.
NEDg	Description generation	`batch_69c04edbf1f081908d74d0ac29601a35`	completed	March 22, 2026, 8:19 p.m.
NED2	Entity disambiguation (via description)	`batch_69c04f7e64c88190bbced2f2460c1913`	completed	March 22, 2026, 8:22 p.m.

Created at: March 22, 2026, 3:41 p.m.