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: Borsuk’s partition problem | Statement: [Karol Borsuk, notableIdea, Borsuk’s partition problem]

Target entity: Borsuk’s partition problem
Context triple: [Karol Borsuk, notableIdea, Borsuk’s partition problem]

• A. Sylvester’s theorem on partitions
  Sylvester’s theorem on partitions is a result in number theory that provides a systematic way to count integer partitions subject to certain congruence or restriction conditions, forming part of the foundational work in partition theory.
• B. Knaster–Reichbach covering
  The Knaster–Reichbach covering is a construction in set-theoretic topology used to extend homeomorphisms between dense subsets of Polish spaces to global homeomorphisms.
• C. Mazur’s theorem on convex sets
  Mazur’s theorem on convex sets is a fundamental result in functional analysis that characterizes the structure and approximation properties of convex sets in Banach spaces, particularly via convex combinations of sequences.
• D. Knaster–Ulam theorem
  The Knaster–Ulam theorem is a result in topology and measure theory that, roughly speaking, guarantees the existence of points with certain symmetry or invariance properties under measure-preserving transformations.
• E. Mazurkiewicz–Sierpiński paradox
  The Mazurkiewicz–Sierpiński paradox is a result in set-theoretic geometry showing that a sphere can be decomposed and reassembled in a counterintuitive way, illustrating the existence of paradoxical decompositions similar to the Banach–Tarski paradox.
• 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: Borsuk’s partition problem
Triple: [Karol Borsuk, notableIdea, Borsuk’s partition problem]

Borsuk’s partition problem is a famous unsolved problem in geometry that asks whether every bounded set in n-dimensional Euclidean space can be divided into n+1 smaller-diameter subsets.

Target entity: Borsuk’s partition problem
Target entity description: Borsuk’s partition problem is a famous unsolved problem in geometry that asks whether every bounded set in n-dimensional Euclidean space can be divided into n+1 smaller-diameter subsets.

• A. Sylvester’s theorem on partitions
  Sylvester’s theorem on partitions is a result in number theory that provides a systematic way to count integer partitions subject to certain congruence or restriction conditions, forming part of the foundational work in partition theory.
• B. Knaster–Reichbach covering
  The Knaster–Reichbach covering is a construction in set-theoretic topology used to extend homeomorphisms between dense subsets of Polish spaces to global homeomorphisms.
• C. Mazur’s theorem on convex sets
  Mazur’s theorem on convex sets is a fundamental result in functional analysis that characterizes the structure and approximation properties of convex sets in Banach spaces, particularly via convex combinations of sequences.
• D. Knaster–Ulam theorem
  The Knaster–Ulam theorem is a result in topology and measure theory that, roughly speaking, guarantees the existence of points with certain symmetry or invariance properties under measure-preserving transformations.
• E. Mazurkiewicz–Sierpiński paradox
  The Mazurkiewicz–Sierpiński paradox is a result in set-theoretic geometry showing that a sphere can be decomposed and reassembled in a counterintuitive way, illustrating the existence of paradoxical decompositions similar to the Banach–Tarski paradox.
• F. None of above. chosen