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: Hilbert’s fifteenth problem | Statement: [Hilbert problems, hasPart, Hilbert’s fifteenth problem]

Target entity: Hilbert’s fifteenth problem
Context triple: [Hilbert problems, hasPart, Hilbert’s fifteenth problem]

• A. Hilbert problems
  The Hilbert problems are a famous list of 23 unsolved mathematical problems presented by David Hilbert in 1900 that profoundly influenced the development of 20th-century mathematics.
• B. Hilbert’s fourteenth problem
  Hilbert’s fourteenth problem is one of David Hilbert’s famous list of 23 problems, concerning the finite generation of certain algebras of invariants in algebraic geometry and invariant theory.
• C. Hilbert’s tenth problem
  Hilbert’s tenth problem is a famous unsolved question in mathematics that asked for a general algorithm to determine whether any given Diophantine equation has an integer solution, and whose negative answer helped establish fundamental limits of computability.
• D. Hilbert’s Nullstellensatz
  Hilbert’s Nullstellensatz is a foundational theorem in algebraic geometry that establishes a deep correspondence between ideals in polynomial rings and algebraic sets, linking algebra and geometry.
• E. Hilbert’s irreducibility theorem
  Hilbert’s irreducibility theorem is a fundamental result in number theory and algebraic geometry that ensures many polynomial equations with parameterized coefficients retain irreducibility for infinitely many specializations of those parameters.
• 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: Hilbert’s fifteenth problem
Triple: [Hilbert problems, hasPart, Hilbert’s fifteenth problem]

Hilbert’s fifteenth problem is one of David Hilbert’s famous list of 23 problems, concerning the rigorous mathematical foundation and general theory of Schubert’s enumerative calculus in algebraic geometry.

Target entity: Hilbert’s fifteenth problem
Target entity description: Hilbert’s fifteenth problem is one of David Hilbert’s famous list of 23 problems, concerning the rigorous mathematical foundation and general theory of Schubert’s enumerative calculus in algebraic geometry.

• A. Hilbert problems chosen
  The Hilbert problems are a famous list of 23 unsolved mathematical problems presented by David Hilbert in 1900 that profoundly influenced the development of 20th-century mathematics.
• B. Hilbert’s fourteenth problem
  Hilbert’s fourteenth problem is one of David Hilbert’s famous list of 23 problems, concerning the finite generation of certain algebras of invariants in algebraic geometry and invariant theory.
• C. Hilbert’s tenth problem
  Hilbert’s tenth problem is a famous unsolved question in mathematics that asked for a general algorithm to determine whether any given Diophantine equation has an integer solution, and whose negative answer helped establish fundamental limits of computability.
• D. Hilbert’s Nullstellensatz
  Hilbert’s Nullstellensatz is a foundational theorem in algebraic geometry that establishes a deep correspondence between ideals in polynomial rings and algebraic sets, linking algebra and geometry.
• E. Hilbert’s irreducibility theorem
  Hilbert’s irreducibility theorem is a fundamental result in number theory and algebraic geometry that ensures many polynomial equations with parameterized coefficients retain irreducibility for infinitely many specializations of those parameters.
• F. None of above.