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 construction of Steiner systems | Statement: [Raj Chandra Bose, notableWork, Bose construction of Steiner systems]

Target entity: Bose construction of Steiner systems
Context triple: [Raj Chandra Bose, notableWork, Bose construction of Steiner systems]

• A. Graham–Pollak theorem
  The Graham–Pollak theorem is a result in graph theory that states the edges of a complete graph on n vertices cannot be partitioned into fewer than n−1 complete bipartite subgraphs.
• B. Conway's 99-graph problem
  Conway's 99-graph problem is an unsolved combinatorial question in graph theory, posed by John H. Conway, concerning the existence and properties of a hypothetical 99-vertex graph with highly constrained adjacency conditions.
• 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. Hadamard matrices
  Hadamard matrices are square matrices with entries ±1 whose rows are mutually orthogonal, playing a key role in combinatorics, coding theory, and signal processing.
• E. Sylvester’s theorem on partitions
  Sylvester’s theorem on partitions is a result in number theory that provides a systematic way to count integer partitions subject to certain congruence or restriction conditions, forming part of the foundational work in partition theory.
• 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 construction of Steiner systems
Triple: [Raj Chandra Bose, notableWork, Bose construction of Steiner systems]

The Bose construction of Steiner systems is a combinatorial method introduced by mathematician Raj Chandra Bose to systematically build certain highly regular block designs known as Steiner systems.

Target entity: Bose construction of Steiner systems
Target entity description: The Bose construction of Steiner systems is a combinatorial method introduced by mathematician Raj Chandra Bose to systematically build certain highly regular block designs known as Steiner systems.

• A. Graham–Pollak theorem
  The Graham–Pollak theorem is a result in graph theory that states the edges of a complete graph on n vertices cannot be partitioned into fewer than n−1 complete bipartite subgraphs.
• B. Conway's 99-graph problem
  Conway's 99-graph problem is an unsolved combinatorial question in graph theory, posed by John H. Conway, concerning the existence and properties of a hypothetical 99-vertex graph with highly constrained adjacency conditions.
• 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. Hadamard matrices
  Hadamard matrices are square matrices with entries ±1 whose rows are mutually orthogonal, playing a key role in combinatorics, coding theory, and signal processing.
• E. Sylvester’s theorem on partitions
  Sylvester’s theorem on partitions is a result in number theory that provides a systematic way to count integer partitions subject to certain congruence or restriction conditions, forming part of the foundational work in partition theory.
• F. None of above. chosen