Triple
T1807296
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Bayesian inference |
E40249
|
entity |
| Predicate | uses |
P98
|
FINISHED |
| Object | Metropolis-Hastings algorithm |
E46140
|
NE FINISHED |
How this triple was built (2 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: Metropolis-Hastings algorithm | Statement: [Bayesian inference, uses, Metropolis-Hastings algorithm]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Metropolis-Hastings algorithm Context triple: [Bayesian inference, uses, Metropolis-Hastings algorithm]
-
A.
Markov chain Monte Carlo
chosen
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.
-
B.
Monte Carlo method
The Monte Carlo method is a computational technique that uses random sampling to approximate numerical results, especially for complex integrals, simulations, and probabilistic systems.
-
C.
Monte Carlo
Monte Carlo is a famous district of Monaco renowned for its luxury casinos, upscale resorts, and role as a glamorous hub for high-end tourism and events like the Monaco Grand Prix.
-
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.
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.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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_69a88643a3388190a612f2ebe1fb29e7 |
completed | March 4, 2026, 7:21 p.m. |
| NER | Named-entity recognition | batch_69aa6598bd388190b5aa69b972cc8f0a |
completed | March 6, 2026, 5:26 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69adb5e137bc81908294dd6b67789526 |
completed | March 8, 2026, 5:46 p.m. |
Created at: March 4, 2026, 7:32 p.m.