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: Sylvester–Gallai configuration theorem | Statement: [Sylvester–Gallai theorem, alsoKnownAs, Sylvester–Gallai configuration theorem]

Target entity: Sylvester–Gallai configuration theorem
Context triple: [Sylvester–Gallai theorem, alsoKnownAs, Sylvester–Gallai configuration theorem]

• A. Sylvester–Gallai theorem chosen
  The Sylvester–Gallai theorem is a result in incidence geometry stating that for any finite set of points in the Euclidean plane not all on a single line, there exists a line that passes through exactly two of the points.
• B. Szemerédi–Trotter theorem
  The Szemerédi–Trotter theorem is a fundamental result in combinatorial geometry that gives near-optimal upper bounds on the number of incidences between points and lines in the plane.
• C. Dirac–Motzkin conjecture
  The Dirac–Motzkin conjecture is a statement in combinatorial geometry about the minimum number of ordinary lines (lines containing exactly two points) determined by a finite set of points in the plane.
• D. de Bruijn–Erdős theorem
  The de Bruijn–Erdős theorem is a fundamental result in combinatorics and graph theory that relates finite and infinite structures, notably asserting that certain properties of infinite graphs or set systems are determined by their finite substructures.
• E. Tverberg’s theorem
  Tverberg’s theorem is a fundamental result in combinatorial geometry that guarantees any sufficiently large set of points in Euclidean space can be partitioned into subsets whose convex hulls all intersect.
• F. None of above.
• G. Unsure - the case is ambiguous/there is not enough information to decide.