Triple

T2373628
Position Surface form Disambiguated ID Type / Status
Subject Ising model E46143 entity
Predicate usedFor P98 FINISHED
Object Markov random fields
Markov random fields are probabilistic graphical models that represent the joint distribution of a set of random variables with local dependencies encoded by an undirected graph, widely used in areas like statistical physics, computer vision, and spatial statistics.
E260046 NE FINISHED

How this triple was built (4 steps)

Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.

NER Named-entity recognition gpt-5-mini
Instruction
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).
Input
Phrase: Markov random fields | Statement: [Ising model, usedFor, Markov random fields]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Markov random fields
Context triple: [Ising model, usedFor, Markov random fields]
  • A. Bayesian networks
    Bayesian networks are probabilistic graphical models that represent variables and their conditional dependencies using directed acyclic graphs, enabling structured reasoning and inference under uncertainty.
  • B. Boltzmann machines
    Boltzmann machines are stochastic recurrent neural networks used for learning complex probability distributions, foundational in unsupervised learning and energy-based models.
  • C. Markov processes
    Markov processes are stochastic processes in which the future evolution depends only on the present state and not on the past history.
  • D. Markov chain Monte Carlo
    Markov chain Monte Carlo is a class of algorithms that uses Markov chains to generate samples from complex probability distributions, widely used in Bayesian inference, statistical physics, and machine learning.
  • E. Bayesian Occam factor
    The Bayesian Occam factor is a term in Bayesian model comparison that automatically penalizes overly complex models by integrating over their larger parameter spaces, thereby implementing Occam’s razor in probabilistic inference.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg Description generation gpt-5.1
Instruction
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]"
Input
Entity: Markov random fields
Triple: [Ising model, usedFor, Markov random fields]
Generated description
Markov random fields are probabilistic graphical models that represent the joint distribution of a set of random variables with local dependencies encoded by an undirected graph, widely used in areas like statistical physics, computer vision, and spatial statistics.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Markov random fields
Target entity description: Markov random fields are probabilistic graphical models that represent the joint distribution of a set of random variables with local dependencies encoded by an undirected graph, widely used in areas like statistical physics, computer vision, and spatial statistics.
  • A. Bayesian networks
    Bayesian networks are probabilistic graphical models that represent variables and their conditional dependencies using directed acyclic graphs, enabling structured reasoning and inference under uncertainty.
  • B. Boltzmann machines
    Boltzmann machines are stochastic recurrent neural networks used for learning complex probability distributions, foundational in unsupervised learning and energy-based models.
  • C. Markov processes
    Markov processes are stochastic processes in which the future evolution depends only on the present state and not on the past history.
  • D. Markov chain Monte Carlo
    Markov chain Monte Carlo is a class of algorithms that uses Markov chains to generate samples from complex probability distributions, widely used in Bayesian inference, statistical physics, and machine learning.
  • E. Bayesian Occam factor
    The Bayesian Occam factor is a term in Bayesian model comparison that automatically penalizes overly complex models by integrating over their larger parameter spaces, thereby implementing Occam’s razor in probabilistic inference.
  • F. None of above. chosen

Provenance (5 batches)

The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.

Step Stage Batch ID Status When
creating Elicitation batch_69a88a145268819083e2736cb835c696 completed March 4, 2026, 7:37 p.m.
NER Named-entity recognition batch_69abc791c4688190a4b8f0e540e84eb4 completed March 7, 2026, 6:37 a.m.
NED1 Entity disambiguation (via context triple) batch_69aea8a8c2b88190a18dbf35d745958f completed March 9, 2026, 11:02 a.m.
NEDg Description generation batch_69aea92cc66c81909a46b83200960fe2 completed March 9, 2026, 11:04 a.m.
NED2 Entity disambiguation (via description) batch_69aea9b8dff08190a09f0c965dfd6738 completed March 9, 2026, 11:06 a.m.
Created at: March 4, 2026, 7:56 p.m.