Triple
T3982741
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Iannis Xenakis |
E86795
|
entity |
| Predicate | usedMathematicalConcept |
P4746
|
FINISHED |
| Object | Markov chains |
E48274
|
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: Markov chains | Statement: [Iannis Xenakis, usedMathematicalConcept, Markov chains]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Markov chains Context triple: [Iannis Xenakis, usedMathematicalConcept, Markov chains]
-
A.
Markov processes
chosen
Markov processes are stochastic processes in which the future evolution depends only on the present state and not on the past history.
-
B.
Stochastic Processes
"Stochastic Processes" is a foundational textbook by Emanuel Parzen that rigorously introduces the theory and applications of random processes in probability and statistics.
-
C.
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.
-
D.
Markov semigroup
A Markov semigroup is a family of linear operators describing the time evolution of probability distributions in a Markov process, forming a semigroup under composition and preserving positivity and total mass.
-
E.
Chapman–Kolmogorov equation
The Chapman–Kolmogorov equation is a fundamental relation in the theory of stochastic processes that expresses how transition probabilities of a Markov process over longer time intervals can be obtained by integrating over intermediate states.
- 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_69aed93fd9d4819085d3b2137d2346cb |
completed | March 9, 2026, 2:29 p.m. |
| NER | Named-entity recognition | batch_69af0197a0a0819085d746f51c7fc51b |
completed | March 9, 2026, 5:21 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b540257c188190899b00bf1d0247d2 |
completed | March 14, 2026, 11:01 a.m. |
Created at: March 9, 2026, 3:33 p.m.