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: Spielman–Srivastava restricted invertibility results | Statement: [Bourgain–Tzafriri restricted invertibility principle, hasGeneralization, Spielman–Srivastava restricted invertibility results]

Target entity: Spielman–Srivastava restricted invertibility results
Context triple: [Bourgain–Tzafriri restricted invertibility principle, hasGeneralization, Spielman–Srivastava restricted invertibility results]

• A. Bourgain–Tzafriri restricted invertibility principle
  The Bourgain–Tzafriri restricted invertibility principle is a fundamental result in functional analysis and operator theory that guarantees the existence of large, well-invertible submatrices within certain classes of linear operators.
• B. Gowers–Hatami stability theorem
  The Gowers–Hatami stability theorem is a result in functional analysis and group theory that characterizes when approximate representations of finite groups are close to genuine representations, providing a quantitative form of stability for such structures.
• C. Alon–Boppana bound
  The Alon–Boppana bound is a fundamental result in spectral graph theory that gives an asymptotic lower bound on the second-largest eigenvalue of large regular graphs, showing inherent limitations on how well such graphs can approximate expanders.
• D. Grothendieck inequality
  The Grothendieck inequality is a fundamental result in functional analysis and theoretical computer science that bounds certain bilinear forms and has deep implications for Banach space theory, operator theory, and approximation algorithms.
• E. Babai–Fortnow–Lund–Safra–Szegedy theorem
  The Babai–Fortnow–Lund–Safra–Szegedy theorem is a landmark result in computational complexity theory that characterizes the power of multi-prover interactive proofs by showing they capture exactly the class of nondeterministic exponential-time problems.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Spielman–Srivastava restricted invertibility results
Target entity description: The Spielman–Srivastava restricted invertibility results are refined theorems in functional analysis and matrix theory that strengthen and generalize the Bourgain–Tzafriri restricted invertibility principle by providing sharper bounds and more flexible conditions for extracting well-invertible submatrices or coordinate restrictions.

• A. Bourgain–Tzafriri restricted invertibility principle
  The Bourgain–Tzafriri restricted invertibility principle is a fundamental result in functional analysis and operator theory that guarantees the existence of large, well-invertible submatrices within certain classes of linear operators.
• B. Gowers–Hatami stability theorem
  The Gowers–Hatami stability theorem is a result in functional analysis and group theory that characterizes when approximate representations of finite groups are close to genuine representations, providing a quantitative form of stability for such structures.
• C. Alon–Boppana bound
  The Alon–Boppana bound is a fundamental result in spectral graph theory that gives an asymptotic lower bound on the second-largest eigenvalue of large regular graphs, showing inherent limitations on how well such graphs can approximate expanders.
• D. Grothendieck inequality
  The Grothendieck inequality is a fundamental result in functional analysis and theoretical computer science that bounds certain bilinear forms and has deep implications for Banach space theory, operator theory, and approximation algorithms.
• E. Babai–Fortnow–Lund–Safra–Szegedy theorem
  The Babai–Fortnow–Lund–Safra–Szegedy theorem is a landmark result in computational complexity theory that characterizes the power of multi-prover interactive proofs by showing they capture exactly the class of nondeterministic exponential-time problems.
• F. None of above. chosen