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: thrackle conjecture | Statement: [Conway's thrackle conjecture, alsoKnownAs, thrackle conjecture]

Target entity: thrackle conjecture
Context triple: [Conway's thrackle conjecture, alsoKnownAs, thrackle conjecture]

• A. Conway's thrackle conjecture chosen
  Conway's thrackle conjecture is an unsolved problem in combinatorial geometry asserting that in any drawing of a graph where every pair of edges meets exactly once, the number of edges cannot exceed the number of vertices.
• B. 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.
• C. Conway circle theorem
  The Conway circle theorem is a geometric result in triangle geometry that identifies a special circle associated with a triangle and certain constructed points, revealing notable collinearities and concyclicity relationships.
• D. Steinhaus chessboard theorem
  The Steinhaus chessboard theorem is a combinatorial result in geometry and topology that gives conditions under which certain colored paths must exist on a checkerboard-like grid.
• E. Tucker’s lemma
  Tucker’s lemma is a combinatorial analog of the Borsuk–Ulam theorem that provides conditions guaranteeing the existence of certain complementary edge labels in triangulated spheres.
• F. None of above.
• G. Unsure - the case is ambiguous/there is not enough information to decide.