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: Yao’s theorem on pseudorandom generators | Statement: [Yao’s next-bit test, relatedConcept, Yao’s theorem on pseudorandom generators]

Target entity: Yao’s theorem on pseudorandom generators
Context triple: [Yao’s next-bit test, relatedConcept, Yao’s theorem on pseudorandom generators]

• A. Yao’s pseudorandom generator construction chosen
  Yao’s pseudorandom generator construction is a foundational cryptographic method that transforms any one-way function into a pseudorandom generator, establishing a deep connection between computational hardness and pseudorandomness.
• B. Yao’s next-bit test
  Yao’s next-bit test is a foundational cryptographic criterion that characterizes pseudorandomness by requiring that no efficient algorithm can predict the next bit of a sequence significantly better than random guessing, given all previous bits.
• C. Modern Cryptography, Probabilistic Proofs and Pseudorandomness
  "Modern Cryptography, Probabilistic Proofs and Pseudorandomness" is a foundational textbook that systematically develops the theoretical underpinnings of modern cryptography, focusing on probabilistic proof techniques and the theory of pseudorandomness.
• D. Blum–Micali pseudorandom number generator
  The Blum–Micali pseudorandom number generator is a foundational cryptographic algorithm that produces provably secure pseudorandom bits based on number-theoretic hardness assumptions.
• 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.