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: Accola–Maclachlan bound | Statement: [Hurwitz bound on automorphism groups of curves, relatedResult, Accola–Maclachlan bound]

Target entity: Accola–Maclachlan bound
Context triple: [Hurwitz bound on automorphism groups of curves, relatedResult, Accola–Maclachlan bound]

• A. Barankin bound
  The Barankin bound is a fundamental lower bound in statistical estimation theory that generalizes and can be tighter than the Cramér–Rao bound for the variance of unbiased estimators, especially in non-regular or finite-sample settings.
• B. 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.
• C. Hamming bound
  The Hamming bound is a fundamental limit in coding theory that specifies the maximum number of codewords a block code can have for a given length and minimum distance while still allowing reliable error detection and correction.
• D. 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.
• E. Cramér–Rao bound
  The Cramér–Rao bound is a fundamental result in statistical estimation theory that gives a lower limit on the variance of any unbiased estimator of a parameter, characterizing the best possible precision achievable.
• 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: Accola–Maclachlan bound
Triple: [Hurwitz bound on automorphism groups of curves, relatedResult, Accola–Maclachlan bound]

The Accola–Maclachlan bound is a refinement in algebraic geometry that gives an improved upper limit on the size of the automorphism group of a compact Riemann surface (or algebraic curve), sharpening the classical Hurwitz bound in certain cases.

Target entity: Accola–Maclachlan bound
Target entity description: The Accola–Maclachlan bound is a refinement in algebraic geometry that gives an improved upper limit on the size of the automorphism group of a compact Riemann surface (or algebraic curve), sharpening the classical Hurwitz bound in certain cases.

• A. Barankin bound
  The Barankin bound is a fundamental lower bound in statistical estimation theory that generalizes and can be tighter than the Cramér–Rao bound for the variance of unbiased estimators, especially in non-regular or finite-sample settings.
• B. 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.
• C. Hamming bound
  The Hamming bound is a fundamental limit in coding theory that specifies the maximum number of codewords a block code can have for a given length and minimum distance while still allowing reliable error detection and correction.
• D. 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.
• E. Cramér–Rao bound
  The Cramér–Rao bound is a fundamental result in statistical estimation theory that gives a lower limit on the variance of any unbiased estimator of a parameter, characterizing the best possible precision achievable.
• F. None of above. chosen