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: Jacobi’s four-square theorem | Statement: [Carl Gustav Jacob Jacobi, notableWork, Jacobi’s four-square theorem]

Target entity: Jacobi’s four-square theorem
Context triple: [Carl Gustav Jacob Jacobi, notableWork, Jacobi’s four-square theorem]

• A. Lagrange's four-square theorem
  Lagrange's four-square theorem is a fundamental result in number theory stating that every natural number can be expressed as the sum of four integer squares.
• B. Fermat's theorem on sums of two squares
  Fermat's theorem on sums of two squares is a result in number theory stating exactly which prime numbers (and, more generally, which integers) can be expressed as the sum of two perfect squares.
• C. Fermat polygonal number theorem
  The Fermat polygonal number theorem is a result in number theory stating that every positive integer can be expressed as a sum of a fixed number of polygonal numbers of a given order.
• D. 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.
• 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: Jacobi’s four-square theorem
Triple: [Carl Gustav Jacob Jacobi, notableWork, Jacobi’s four-square theorem]

Jacobi’s four-square theorem is a fundamental result in number theory that gives a precise formula for the number of ways an integer can be expressed as a sum of four squares.

Target entity: Jacobi’s four-square theorem
Target entity description: Jacobi’s four-square theorem is a fundamental result in number theory that gives a precise formula for the number of ways an integer can be expressed as a sum of four squares.

• A. Lagrange's four-square theorem
  Lagrange's four-square theorem is a fundamental result in number theory stating that every natural number can be expressed as the sum of four integer squares.
• B. Fermat's theorem on sums of two squares
  Fermat's theorem on sums of two squares is a result in number theory stating exactly which prime numbers (and, more generally, which integers) can be expressed as the sum of two perfect squares.
• C. Fermat polygonal number theorem
  The Fermat polygonal number theorem is a result in number theory stating that every positive integer can be expressed as a sum of a fixed number of polygonal numbers of a given order.
• D. 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.
• 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