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: Cramér–Rao bound | Statement: [Gauss–Markov theorem, relatedTo, Cramér–Rao bound]

Target entity: Cramér–Rao bound
Context triple: [Gauss–Markov theorem, relatedTo, Cramér–Rao bound]

• A. Gauss–Markov theorem
  The Gauss–Markov theorem is a fundamental result in statistics stating that, under certain conditions, the ordinary least squares estimator is the best linear unbiased estimator (BLUE) of the coefficients in a linear regression model.
• B. Berry–Esseen theorem
  The Berry–Esseen theorem is a quantitative refinement of the central limit theorem that provides explicit bounds on the rate of convergence of normalized sums of independent random variables to the normal distribution.
• C. Bekenstein bound
  The Bekenstein bound is a theoretical limit in physics on the maximum amount of information or entropy that can be contained within a finite region of space with a given amount of energy.
• D. Rényi divergence
  Rényi divergence is a family of information-theoretic measures that generalize Kullback–Leibler divergence to quantify the dissimilarity between probability distributions, parameterized by an order α.
• E. Linear Estimation
  Linear Estimation is a foundational text in signal processing and control theory that systematically develops the theory and applications of optimal estimation, including Kalman filtering and related methods.
• 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: Cramér–Rao bound
Triple: [Gauss–Markov theorem, relatedTo, 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.

Target entity: Cramér–Rao bound
Target entity description: 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.

• A. Gauss–Markov theorem
  The Gauss–Markov theorem is a fundamental result in statistics stating that, under certain conditions, the ordinary least squares estimator is the best linear unbiased estimator (BLUE) of the coefficients in a linear regression model.
• B. Berry–Esseen theorem
  The Berry–Esseen theorem is a quantitative refinement of the central limit theorem that provides explicit bounds on the rate of convergence of normalized sums of independent random variables to the normal distribution.
• C. Bekenstein bound
  The Bekenstein bound is a theoretical limit in physics on the maximum amount of information or entropy that can be contained within a finite region of space with a given amount of energy.
• D. Rényi divergence
  Rényi divergence is a family of information-theoretic measures that generalize Kullback–Leibler divergence to quantify the dissimilarity between probability distributions, parameterized by an order α.
• E. Linear Estimation
  Linear Estimation is a foundational text in signal processing and control theory that systematically develops the theory and applications of optimal estimation, including Kalman filtering and related methods.
• F. None of above. chosen