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: Sperner system | Statement: [Sperner family, alsoKnownAs, Sperner system]

Target entity: Sperner system
Context triple: [Sperner family, alsoKnownAs, Sperner system]

• A. Sperner family chosen
  A Sperner family is a collection of subsets of a finite set in which no subset is contained within another, central in extremal set theory and combinatorics.
• B. Erdős–Ko–Rado theorem
  The Erdős–Ko–Rado theorem is a fundamental result in extremal combinatorics that determines the maximum size of a family of subsets of a finite set in which every pair of subsets has a non-empty intersection.
• C. Sperner's lemma
  Sperner's lemma is a fundamental result in combinatorial topology that guarantees the existence of a fully labeled simplex in certain labeled triangulations, and is widely used to prove fixed-point and equilibrium theorems.
• D. Dilworth theorem
  Dilworth's theorem is a fundamental result in order theory that relates the size of the largest antichain in a finite partially ordered set to the minimum number of chains needed to cover the set.
• E. Szekeres–Lindström theorem
  The Szekeres–Lindström theorem is a result in combinatorics that characterizes the maximum size of intersecting families of subsets, serving as a precursor to and special case of the Erdős–Ko–Rado theorem.
• F. None of above.
• G. Unsure - the case is ambiguous/there is not enough information to decide.