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: Interactive Proofs and the Hardness of Approximating Cliques | Statement: [Shafi Goldwasser, notableWork, Interactive Proofs and the Hardness of Approximating Cliques]

Target entity: Interactive Proofs and the Hardness of Approximating Cliques
Context triple: [Shafi Goldwasser, notableWork, Interactive Proofs and the Hardness of Approximating Cliques]

• A. The Knowledge Complexity of Interactive Proof Systems
  "The Knowledge Complexity of Interactive Proof Systems" is a seminal theoretical computer science paper that introduced the notion of zero-knowledge proofs, fundamentally shaping modern cryptography and complexity theory.
• B. Randomness and Computation
  "Randomness and Computation" is Shafi Goldwasser's influential doctoral thesis that helped lay the foundations of modern complexity theory and cryptography by rigorously exploring the role of randomness in efficient computation.
• C. Probabilistic Encryption
  Probabilistic Encryption is a cryptographic technique that uses randomness in the encryption process so that the same message encrypts to different ciphertexts, enhancing security against attackers.
• D. New Directions in Cryptography
  New Directions in Cryptography is a landmark 1976 paper that introduced the concepts of public-key cryptography and digital signatures, fundamentally reshaping modern cryptography and secure communications.
• E. Kalai–Smorodinsky bargaining solution
  The Kalai–Smorodinsky bargaining solution is a cooperative game theory concept that selects a fair agreement between parties by preserving proportional gains relative to their best possible outcomes.
• 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: Interactive Proofs and the Hardness of Approximating Cliques
Triple: [Shafi Goldwasser, notableWork, Interactive Proofs and the Hardness of Approximating Cliques]

"Interactive Proofs and the Hardness of Approximating Cliques" is a seminal theoretical computer science paper that introduced powerful interactive proof techniques to show that finding near-maximum cliques in graphs is computationally intractable to approximate within strong bounds.

Target entity: Interactive Proofs and the Hardness of Approximating Cliques
Target entity description: "Interactive Proofs and the Hardness of Approximating Cliques" is a seminal theoretical computer science paper that introduced powerful interactive proof techniques to show that finding near-maximum cliques in graphs is computationally intractable to approximate within strong bounds.

• A. The Knowledge Complexity of Interactive Proof Systems
  "The Knowledge Complexity of Interactive Proof Systems" is a seminal theoretical computer science paper that introduced the notion of zero-knowledge proofs, fundamentally shaping modern cryptography and complexity theory.
• B. Randomness and Computation
  "Randomness and Computation" is Shafi Goldwasser's influential doctoral thesis that helped lay the foundations of modern complexity theory and cryptography by rigorously exploring the role of randomness in efficient computation.
• C. Probabilistic Encryption
  Probabilistic Encryption is a cryptographic technique that uses randomness in the encryption process so that the same message encrypts to different ciphertexts, enhancing security against attackers.
• D. New Directions in Cryptography
  New Directions in Cryptography is a landmark 1976 paper that introduced the concepts of public-key cryptography and digital signatures, fundamentally reshaping modern cryptography and secure communications.
• E. Kalai–Smorodinsky bargaining solution
  The Kalai–Smorodinsky bargaining solution is a cooperative game theory concept that selects a fair agreement between parties by preserving proportional gains relative to their best possible outcomes.
• F. None of above. chosen