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: Hadamard conjecture | Statement: [Hadamard matrix, hasConjecture, Hadamard conjecture]

Target entity: Hadamard conjecture
Context triple: [Hadamard matrix, hasConjecture, Hadamard conjecture]

• A. Hadamard matrices
  Hadamard matrices are square matrices with entries ±1 whose rows are mutually orthogonal, playing a key role in combinatorics, coding theory, and signal processing.
• B. Alon–Tarsi conjecture
  The Alon–Tarsi conjecture is a prominent open problem in combinatorics and graph theory concerning orientations and colorings of graphs, with deep connections to Latin squares and polynomial method techniques.
• C. Conway's 99-graph problem
  Conway's 99-graph problem is an unsolved combinatorial question in graph theory, posed by John H. Conway, concerning the existence and properties of a hypothetical 99-vertex graph with highly constrained adjacency conditions.
• D. Bieberbach conjecture
  The Bieberbach conjecture, now a theorem, is a landmark result in complex analysis that characterizes the size of Taylor coefficients of normalized univalent (injective) holomorphic functions on the unit disk.
• E. Erdős–Turán conjecture
  The Erdős–Turán conjecture is an unsolved problem in additive number theory asserting that any subset of the positive integers with divergent sum of reciprocals must contain arbitrarily long arithmetic progressions.
• 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: Hadamard conjecture
Triple: [Hadamard matrix, hasConjecture, Hadamard conjecture]

The Hadamard conjecture is an unsolved problem in combinatorial matrix theory asserting that Hadamard matrices exist for every order that is a multiple of four.

Target entity: Hadamard conjecture
Target entity description: The Hadamard conjecture is an unsolved problem in combinatorial matrix theory asserting that Hadamard matrices exist for every order that is a multiple of four.

• A. Hadamard matrices chosen
  Hadamard matrices are square matrices with entries ±1 whose rows are mutually orthogonal, playing a key role in combinatorics, coding theory, and signal processing.
• B. Alon–Tarsi conjecture
  The Alon–Tarsi conjecture is a prominent open problem in combinatorics and graph theory concerning orientations and colorings of graphs, with deep connections to Latin squares and polynomial method techniques.
• C. Conway's 99-graph problem
  Conway's 99-graph problem is an unsolved combinatorial question in graph theory, posed by John H. Conway, concerning the existence and properties of a hypothetical 99-vertex graph with highly constrained adjacency conditions.
• D. Bieberbach conjecture
  The Bieberbach conjecture, now a theorem, is a landmark result in complex analysis that characterizes the size of Taylor coefficients of normalized univalent (injective) holomorphic functions on the unit disk.
• E. Erdős–Turán conjecture
  The Erdős–Turán conjecture is an unsolved problem in additive number theory asserting that any subset of the positive integers with divergent sum of reciprocals must contain arbitrarily long arithmetic progressions.
• F. None of above.