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: Laver tables | Statement: [Richard Laver, notableFor, Laver tables]

Target entity: Laver tables
Context triple: [Richard Laver, notableFor, Laver tables]

• A. Tarski’s theorem on amenable groups
  Tarski’s theorem on amenable groups is a fundamental result in group theory and measure theory that characterizes amenable groups as precisely those that do not admit Banach–Tarski-type paradoxical decompositions.
• B. Lattice
  Lattice is a software company that provides people management and performance review tools to help organizations develop and engage their employees.
• C. Knuth–Bendix completion algorithm
  The Knuth–Bendix completion algorithm is a procedure in term rewriting and automated theorem proving that transforms a set of equations into a confluent rewriting system, enabling decision of word problems in algebraic structures.
• D. Dehn’s decision problems in group theory
  Dehn’s decision problems in group theory are foundational early 20th-century problems that introduced algorithmic questions about the solvability of word, conjugacy, and isomorphism problems in finitely presented groups, helping launch the field of algorithmic group theory.
• E. Birkhoff’s representation theorem for finite distributive lattices
  Birkhoff’s representation theorem for finite distributive lattices is a fundamental result in lattice theory that characterizes every finite distributive lattice as isomorphic to the lattice of lower (order) ideals of a finite poset.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Laver tables
Target entity description: Laver tables are finite algebraic structures arising in set theory and large cardinal research, known for their role in studying self-distributive operations and the foundations of mathematics.

• A. Tarski’s theorem on amenable groups
  Tarski’s theorem on amenable groups is a fundamental result in group theory and measure theory that characterizes amenable groups as precisely those that do not admit Banach–Tarski-type paradoxical decompositions.
• B. Lattice
  Lattice is a software company that provides people management and performance review tools to help organizations develop and engage their employees.
• C. Knuth–Bendix completion algorithm
  The Knuth–Bendix completion algorithm is a procedure in term rewriting and automated theorem proving that transforms a set of equations into a confluent rewriting system, enabling decision of word problems in algebraic structures.
• D. Dehn’s decision problems in group theory
  Dehn’s decision problems in group theory are foundational early 20th-century problems that introduced algorithmic questions about the solvability of word, conjugacy, and isomorphism problems in finitely presented groups, helping launch the field of algorithmic group theory.
• E. Birkhoff’s representation theorem for finite distributive lattices
  Birkhoff’s representation theorem for finite distributive lattices is a fundamental result in lattice theory that characterizes every finite distributive lattice as isomorphic to the lattice of lower (order) ideals of a finite poset.
• F. None of above. chosen