Triple

T364207
Position Surface form Disambiguated ID Type / Status
Subject Boltzmann machines E7922 entity
Predicate hasSamplingMethod P89 FINISHED
Object 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.
E46140 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 chain Monte Carlo | Statement: [Boltzmann machines, hasSamplingMethod, Markov chain Monte Carlo]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Markov chain Monte Carlo
Context triple: [Boltzmann machines, hasSamplingMethod, Markov chain Monte Carlo]
  • A. Bayesian inference
    Bayesian inference is a statistical framework that updates the probability of hypotheses as more evidence or data becomes available, using Bayes’ theorem to combine prior beliefs with observed information.
  • B. Langevin dynamics
    Langevin dynamics is a stochastic approach to modeling the motion of particles in a fluid by combining deterministic forces with random thermal fluctuations, often used to simulate Brownian motion and other nonequilibrium processes.
  • C. Boltzmann machines
    Boltzmann machines are stochastic recurrent neural networks used for learning complex probability distributions, foundational in unsupervised learning and energy-based models.
  • D. Euler–Maruyama method
    The Euler–Maruyama method is a basic time-stepping scheme for numerically approximating solutions to stochastic differential equations, widely used in simulations of systems with noise such as Langevin dynamics.
  • E. Randomness and Computation
    "Randomness and Computation" is Shafi Goldwasser's influential doctoral thesis that helped lay the foundations of modern complexity theory and cryptography by rigorously exploring the role of randomness in efficient computation.
  • 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 chain Monte Carlo
Triple: [Boltzmann machines, hasSamplingMethod, Markov chain Monte Carlo]
Generated description
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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Markov chain Monte Carlo
Target entity description: 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.
  • A. Bayesian inference
    Bayesian inference is a statistical framework that updates the probability of hypotheses as more evidence or data becomes available, using Bayes’ theorem to combine prior beliefs with observed information.
  • B. Langevin dynamics
    Langevin dynamics is a stochastic approach to modeling the motion of particles in a fluid by combining deterministic forces with random thermal fluctuations, often used to simulate Brownian motion and other nonequilibrium processes.
  • C. Boltzmann machines
    Boltzmann machines are stochastic recurrent neural networks used for learning complex probability distributions, foundational in unsupervised learning and energy-based models.
  • D. Euler–Maruyama method
    The Euler–Maruyama method is a basic time-stepping scheme for numerically approximating solutions to stochastic differential equations, widely used in simulations of systems with noise such as Langevin dynamics.
  • E. Randomness and Computation
    "Randomness and Computation" is Shafi Goldwasser's influential doctoral thesis that helped lay the foundations of modern complexity theory and cryptography by rigorously exploring the role of randomness in efficient computation.
  • 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_69a2e7e880008190a6ad7e06e5d03007 completed Feb. 28, 2026, 1:04 p.m.
NER Named-entity recognition batch_69a2ee29ede0819095279af95b53e350 completed Feb. 28, 2026, 1:31 p.m.
NED1 Entity disambiguation (via context triple) batch_69a3e86533a481909bab5f0b52114c6a completed March 1, 2026, 7:19 a.m.
NEDg Description generation batch_69a3e99fd210819099e83cd183a4daa7 completed March 1, 2026, 7:24 a.m.
NED2 Entity disambiguation (via description) batch_69a3ea45c86c8190a6c215430601ad15 completed March 1, 2026, 7:27 a.m.
Created at: Feb. 28, 2026, 1:08 p.m.