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: Bose–Nair theorem | Statement: [Raj Chandra Bose, notableWork, Bose–Nair theorem]

Target entity: Bose–Nair theorem
Context triple: [Raj Chandra Bose, notableWork, Bose–Nair theorem]

• A. Kesten’s theorem
  Kesten’s theorem is a fundamental result in probability theory that characterizes when a random walk on a group is transient or recurrent, with deep implications for random walks on groups and percolation theory.
• B. Busemann–Feller theorem
  The Busemann–Feller theorem is a result in geometric measure theory that characterizes when a metric space is geodesic by relating distance properties to the existence of shortest paths between points.
• C. 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.
• D. Banach–Saks theorem
  The Banach–Saks theorem is a result in functional analysis stating that every bounded sequence in a reflexive Banach space has a subsequence whose Cesàro means converge in norm.
• E. Birkhoff–von Neumann theorem
  The Birkhoff–von Neumann theorem is a fundamental result in matrix theory and combinatorics stating that every doubly stochastic matrix can be expressed as a convex combination of permutation matrices.
• 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: Bose–Nair theorem
Triple: [Raj Chandra Bose, notableWork, Bose–Nair theorem]

The Bose–Nair theorem is a result in combinatorial design theory that provides conditions for the existence and construction of certain balanced incomplete block designs, contributing to the foundations of modern combinatorics and coding theory.

Target entity: Bose–Nair theorem
Target entity description: The Bose–Nair theorem is a result in combinatorial design theory that provides conditions for the existence and construction of certain balanced incomplete block designs, contributing to the foundations of modern combinatorics and coding theory.

• A. Kesten’s theorem
  Kesten’s theorem is a fundamental result in probability theory that characterizes when a random walk on a group is transient or recurrent, with deep implications for random walks on groups and percolation theory.
• B. Busemann–Feller theorem
  The Busemann–Feller theorem is a result in geometric measure theory that characterizes when a metric space is geodesic by relating distance properties to the existence of shortest paths between points.
• C. 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.
• D. Banach–Saks theorem
  The Banach–Saks theorem is a result in functional analysis stating that every bounded sequence in a reflexive Banach space has a subsequence whose Cesàro means converge in norm.
• E. Birkhoff–von Neumann theorem
  The Birkhoff–von Neumann theorem is a fundamental result in matrix theory and combinatorics stating that every doubly stochastic matrix can be expressed as a convex combination of permutation matrices.
• F. None of above. chosen