Triple

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).

Phrase: Unique-SAT | Statement: [Valiant–Vazirani theorem, showsHardnessOf, Unique-SAT]

Target entity: Unique-SAT
Context triple: [Valiant–Vazirani theorem, showsHardnessOf, Unique-SAT]

• A. 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.
• 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. 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.
• D. “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.
• E. TNTSAT
  TNTSAT is a French free-to-air satellite television platform that broadcasts the national digital terrestrial TV channels via satellite.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

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]"

Entity: Unique-SAT
Triple: [Valiant–Vazirani theorem, showsHardnessOf, Unique-SAT]

Unique-SAT is a specialized version of the Boolean satisfiability problem where instances are guaranteed to have at most one satisfying assignment, and it plays a central role in complexity theory due to its connections to randomness and NP-completeness.

Target entity: Unique-SAT
Target entity description: Unique-SAT is a specialized version of the Boolean satisfiability problem where instances are guaranteed to have at most one satisfying assignment, and it plays a central role in complexity theory due to its connections to randomness and NP-completeness.

• A. 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.
• 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. 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.
• D. “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.
• E. TNTSAT
  TNTSAT is a French free-to-air satellite television platform that broadcasts the national digital terrestrial TV channels via satellite.
• F. None of above. chosen

Target predicate: showsHardnessOf
Context triple: [Valiant–Vazirani theorem, showsHardnessOf, Unique-SAT]

• A. hardness
  Indicates the degree to which one entity resists being scratched, indented, or deformed by another.
• B. hardnessMohs
  Indicates the relative hardness of a material as measured on the Mohs scale of mineral hardness.
• C. stoneQuality
  Indicates the quality or grade assigned to a stone in terms of its characteristics or condition.
• D. hardiness
  Indicates the degree to which an entity can withstand or endure harsh, adverse, or challenging conditions.
• E. hasMineral
  Indicates that one entity contains, includes, or is composed of a specified mineral.
• F. None of above. chosen