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: Hammersley–Clifford theorem | Statement: [Markov random field, isCharacterizedBy, Hammersley–Clifford theorem]

Target entity: Hammersley–Clifford theorem
Context triple: [Markov random field, isCharacterizedBy, Hammersley–Clifford theorem]

• A. 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.
• B. Potts model
  The Potts model is a generalization of the Ising model in statistical mechanics that describes interacting spins with more than two possible states, used to study phase transitions and critical phenomena.
• C. Mayer cluster expansion in statistical mechanics
  The Mayer cluster expansion in statistical mechanics is a mathematical method that expresses the thermodynamic properties of interacting particle systems as a series in terms of cluster integrals, enabling systematic analysis of non-ideal gases and liquids.
• D. de Bruijn–van Aardenne–Ehrenfest theorem
  The de Bruijn–van Aardenne–Ehrenfest theorem is a fundamental result in combinatorics that characterizes the number of Eulerian circuits in directed graphs, particularly de Bruijn graphs, and underpins constructions in coding theory and discrete mathematics.
• 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: Hammersley–Clifford theorem
Triple: [Markov random field, isCharacterizedBy, Hammersley–Clifford theorem]

The Hammersley–Clifford theorem is a fundamental result in probability theory and statistics that links Markov random fields with Gibbs distributions by showing that, under positivity conditions, the Markov property is equivalent to factorization over cliques of an underlying graph.

Target entity: Hammersley–Clifford theorem
Target entity description: The Hammersley–Clifford theorem is a fundamental result in probability theory and statistics that links Markov random fields with Gibbs distributions by showing that, under positivity conditions, the Markov property is equivalent to factorization over cliques of an underlying graph.

• A. 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.
• B. Potts model
  The Potts model is a generalization of the Ising model in statistical mechanics that describes interacting spins with more than two possible states, used to study phase transitions and critical phenomena.
• C. Mayer cluster expansion in statistical mechanics
  The Mayer cluster expansion in statistical mechanics is a mathematical method that expresses the thermodynamic properties of interacting particle systems as a series in terms of cluster integrals, enabling systematic analysis of non-ideal gases and liquids.
• D. de Bruijn–van Aardenne–Ehrenfest theorem
  The de Bruijn–van Aardenne–Ehrenfest theorem is a fundamental result in combinatorics that characterizes the number of Eulerian circuits in directed graphs, particularly de Bruijn graphs, and underpins constructions in coding theory and discrete mathematics.
• 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