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: Rogers–Ramanujan identities | Statement: [Bailey lemma, implies, Rogers–Ramanujan identities]

Target entity: Rogers–Ramanujan identities
Context triple: [Bailey lemma, implies, Rogers–Ramanujan identities]

• A. Rogers–Ramanujan-type identities
  Rogers–Ramanujan-type identities are a class of deep q-series and partition identities generalizing the classical Rogers–Ramanujan identities, with rich connections to combinatorics, number theory, and modular forms.
• B. Ramanujan partition congruences
  Ramanujan partition congruences are remarkable number-theoretic results discovered by Srinivasa Ramanujan that describe surprising modular patterns in the partition function, such as specific arithmetic progressions where the number of integer partitions of an integer is divisible by a given prime.
• C. Rogers–Ramanujan continued fraction
  The Rogers–Ramanujan continued fraction is a famous q-continued fraction introduced by Srinivasa Ramanujan that plays a central role in the theory of partitions, modular forms, and q-series.
• D. Ono’s partition congruences
  Ono’s partition congruences are modern number-theoretic results that extend Ramanujan’s classical congruences by proving the existence of infinitely many congruence relations for the partition function modulo various primes.
• E. Hardy–Ramanujan asymptotic formula
  The Hardy–Ramanujan asymptotic formula is a landmark result in number theory that gives an approximate expression for the partition function p(n), describing how the number of integer partitions of n grows rapidly with n.
• 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: Rogers–Ramanujan identities
Triple: [Bailey lemma, implies, Rogers–Ramanujan identities]

The Rogers–Ramanujan identities are two famous q-series equalities in number theory and combinatorics that relate infinite series to infinite products and have deep connections to partition theory and modular forms.

Target entity: Rogers–Ramanujan identities
Target entity description: The Rogers–Ramanujan identities are two famous q-series equalities in number theory and combinatorics that relate infinite series to infinite products and have deep connections to partition theory and modular forms.

• A. Rogers–Ramanujan-type identities
  Rogers–Ramanujan-type identities are a class of deep q-series and partition identities generalizing the classical Rogers–Ramanujan identities, with rich connections to combinatorics, number theory, and modular forms.
• B. Ramanujan partition congruences
  Ramanujan partition congruences are remarkable number-theoretic results discovered by Srinivasa Ramanujan that describe surprising modular patterns in the partition function, such as specific arithmetic progressions where the number of integer partitions of an integer is divisible by a given prime.
• C. Rogers–Ramanujan continued fraction
  The Rogers–Ramanujan continued fraction is a famous q-continued fraction introduced by Srinivasa Ramanujan that plays a central role in the theory of partitions, modular forms, and q-series.
• D. Ono’s partition congruences
  Ono’s partition congruences are modern number-theoretic results that extend Ramanujan’s classical congruences by proving the existence of infinitely many congruence relations for the partition function modulo various primes.
• E. Hardy–Ramanujan asymptotic formula
  The Hardy–Ramanujan asymptotic formula is a landmark result in number theory that gives an approximate expression for the partition function p(n), describing how the number of integer partitions of n grows rapidly with n.
• F. None of above. chosen