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: Hardy–Littlewood conjectures | Statement: [G. H. Hardy, knownFor, Hardy–Littlewood conjectures]

Target entity: Hardy–Littlewood conjectures
Context triple: [G. H. Hardy, knownFor, Hardy–Littlewood conjectures]

• A. Riemann hypothesis
  The Riemann hypothesis is a famous unsolved conjecture in number theory asserting that all nontrivial zeros of the Riemann zeta function lie on a critical line in the complex plane, with deep implications for the distribution of prime numbers.
• B. Über die Anzahl der Primzahlen unter einer gegebenen Grösse
  Über die Anzahl der Primzahlen unter einer gegebenen Grösse is Bernhard Riemann’s seminal 1859 paper that introduced the Riemann zeta function and laid the foundations of analytic number theory, including the famous Riemann Hypothesis.
• C. Gauss’s lemma in number theory
  Gauss’s lemma in number theory is a result that relates the Legendre symbol to the number of sign changes in a certain sequence of multiples, providing a practical criterion for determining quadratic residues modulo an odd prime.
• D. Dyson’s transform in number theory
  Dyson’s transform in number theory is a combinatorial technique introduced by Freeman Dyson to manipulate and relate integer partitions, particularly in the study of partition identities and congruences.
• E. Riemann–Siegel formula
  The Riemann–Siegel formula is an asymptotic expression that efficiently approximates the Riemann zeta function on the critical line, playing a key role in the numerical study of its zeros.
• 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: Hardy–Littlewood conjectures
Triple: [G. H. Hardy, knownFor, Hardy–Littlewood conjectures]

The Hardy–Littlewood conjectures are a collection of influential unproven hypotheses in analytic number theory that generalize the prime number theorem to describe the distribution of prime numbers and prime constellations.

Target entity: Hardy–Littlewood conjectures
Target entity description: The Hardy–Littlewood conjectures are a collection of influential unproven hypotheses in analytic number theory that generalize the prime number theorem to describe the distribution of prime numbers and prime constellations.

• A. Riemann hypothesis
  The Riemann hypothesis is a famous unsolved conjecture in number theory asserting that all nontrivial zeros of the Riemann zeta function lie on a critical line in the complex plane, with deep implications for the distribution of prime numbers.
• B. Über die Anzahl der Primzahlen unter einer gegebenen Grösse
  Über die Anzahl der Primzahlen unter einer gegebenen Grösse is Bernhard Riemann’s seminal 1859 paper that introduced the Riemann zeta function and laid the foundations of analytic number theory, including the famous Riemann Hypothesis.
• C. Gauss’s lemma in number theory
  Gauss’s lemma in number theory is a result that relates the Legendre symbol to the number of sign changes in a certain sequence of multiples, providing a practical criterion for determining quadratic residues modulo an odd prime.
• D. Dyson’s transform in number theory
  Dyson’s transform in number theory is a combinatorial technique introduced by Freeman Dyson to manipulate and relate integer partitions, particularly in the study of partition identities and congruences.
• E. Riemann–Siegel formula
  The Riemann–Siegel formula is an asymptotic expression that efficiently approximates the Riemann zeta function on the critical line, playing a key role in the numerical study of its zeros.
• F. None of above. chosen