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: Kruskal's tree theorem | Statement: [Joseph B. Kruskal, knownFor, Kruskal's tree theorem]

Target entity: Kruskal's tree theorem
Context triple: [Joseph B. Kruskal, knownFor, Kruskal's tree theorem]

• A. Tarski–Mostowski–Robinson theorem
  The Tarski–Mostowski–Robinson theorem is a fundamental result in model theory that characterizes when a class of structures is first-order axiomatizable, linking definability properties with closure under ultraproducts and isomorphisms.
• B. 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.
• 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. Mazurkiewicz–Sierpiński theorem
  The Mazurkiewicz–Sierpiński theorem is a result in topology and measure theory that characterizes certain properties of measurable sets and mappings, particularly concerning continuous images of sets in Euclidean spaces.
• E. Graham–Rothschild theorem
  The Graham–Rothschild theorem is a fundamental result in Ramsey theory that generalizes classical partition theorems to higher-dimensional combinatorial structures.
• 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: Kruskal's tree theorem
Triple: [Joseph B. Kruskal, knownFor, Kruskal's tree theorem]

Kruskal's tree theorem is a fundamental result in combinatorics and mathematical logic stating that finite trees are well-quasi-ordered under homeomorphic embedding, with deep implications in proof theory and computer science.

Target entity: Kruskal's tree theorem
Target entity description: Kruskal's tree theorem is a fundamental result in combinatorics and mathematical logic stating that finite trees are well-quasi-ordered under homeomorphic embedding, with deep implications in proof theory and computer science.

• A. Tarski–Mostowski–Robinson theorem
  The Tarski–Mostowski–Robinson theorem is a fundamental result in model theory that characterizes when a class of structures is first-order axiomatizable, linking definability properties with closure under ultraproducts and isomorphisms.
• B. 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.
• 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. Mazurkiewicz–Sierpiński theorem
  The Mazurkiewicz–Sierpiński theorem is a result in topology and measure theory that characterizes certain properties of measurable sets and mappings, particularly concerning continuous images of sets in Euclidean spaces.
• E. Graham–Rothschild theorem
  The Graham–Rothschild theorem is a fundamental result in Ramsey theory that generalizes classical partition theorems to higher-dimensional combinatorial structures.
• F. None of above. chosen