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: Kesten–Stigum theorem | Statement: [Harry Kesten, notableConcept, Kesten–Stigum theorem]

Target entity: Kesten–Stigum theorem
Context triple: [Harry Kesten, notableConcept, Kesten–Stigum theorem]

• A. Slepian–Wolf coding theorem
  The Slepian–Wolf coding theorem is a fundamental result in information theory that characterizes the limits of lossless data compression for correlated sources encoded separately but decoded jointly.
• B. 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.
• C. Blum axioms
  Blum axioms are a set of formal conditions introduced by Manuel Blum that rigorously define what constitutes a valid complexity measure in computational complexity theory.
• D. Shannon–Hartley theorem
  The Shannon–Hartley theorem is a fundamental result in information theory that quantifies the maximum error-free data transmission rate over a communication channel with a given bandwidth and signal-to-noise ratio.
• E. 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.
• 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: Kesten–Stigum theorem
Triple: [Harry Kesten, notableConcept, Kesten–Stigum theorem]

The Kesten–Stigum theorem is a fundamental result in branching process theory that characterizes when a suitably normalized supercritical branching process converges to a non-degenerate limit.

Target entity: Kesten–Stigum theorem
Target entity description: The Kesten–Stigum theorem is a fundamental result in branching process theory that characterizes when a suitably normalized supercritical branching process converges to a non-degenerate limit.

• A. Slepian–Wolf coding theorem
  The Slepian–Wolf coding theorem is a fundamental result in information theory that characterizes the limits of lossless data compression for correlated sources encoded separately but decoded jointly.
• B. 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.
• C. Blum axioms
  Blum axioms are a set of formal conditions introduced by Manuel Blum that rigorously define what constitutes a valid complexity measure in computational complexity theory.
• D. Shannon–Hartley theorem
  The Shannon–Hartley theorem is a fundamental result in information theory that quantifies the maximum error-free data transmission rate over a communication channel with a given bandwidth and signal-to-noise ratio.
• E. 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.
• F. None of above. chosen