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: Alon–Boppana bound | Statement: [Noga Alon, notableWork, Alon–Boppana bound]

Target entity: Alon–Boppana bound
Context triple: [Noga Alon, notableWork, Alon–Boppana bound]

• A. Erdős–Stone theorem
  The Erdős–Stone theorem is a fundamental result in extremal graph theory that asymptotically determines the maximum number of edges in an n-vertex graph that avoids containing a given subgraph.
• B. 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.
• C. 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.
• D. Furst–Saxe–Sipser lower bounds
  Furst–Saxe–Sipser lower bounds are foundational results in circuit complexity theory that established superpolynomial lower bounds for constant-depth Boolean circuits (AC⁰), demonstrating inherent limitations of such circuits for computing certain functions.
• E. May–Wigner stability theorem
  The May–Wigner stability theorem is a result in theoretical ecology and random matrix theory showing that large, complex systems with many random interactions are generically unstable beyond a critical level of complexity.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: Alon–Boppana bound
Triple: [Noga Alon, notableWork, 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.

Target entity: Alon–Boppana bound
Target entity description: 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.

• A. Erdős–Stone theorem
  The Erdős–Stone theorem is a fundamental result in extremal graph theory that asymptotically determines the maximum number of edges in an n-vertex graph that avoids containing a given subgraph.
• B. 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.
• C. 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.
• D. Furst–Saxe–Sipser lower bounds
  Furst–Saxe–Sipser lower bounds are foundational results in circuit complexity theory that established superpolynomial lower bounds for constant-depth Boolean circuits (AC⁰), demonstrating inherent limitations of such circuits for computing certain functions.
• E. May–Wigner stability theorem
  The May–Wigner stability theorem is a result in theoretical ecology and random matrix theory showing that large, complex systems with many random interactions are generically unstable beyond a critical level of complexity.
• F. None of above. chosen