Triple
T3196691
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | PageRank |
E66951
|
entity |
| Predicate | basedOn |
P98
|
FINISHED |
| Object |
Markov chain
A Markov chain is a mathematical model of a stochastic process where the probability of each future state depends only on the current state and not on the sequence of events that preceded it.
|
E48274
|
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 | Statement: [PageRank, basedOn, Markov chain]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Markov chain Context triple: [PageRank, basedOn, Markov chain]
-
A.
Markov processes
Markov processes are stochastic processes in which the future evolution depends only on the present state and not on the past history.
-
B.
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.
-
C.
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.
-
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.
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.
- 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 Triple: [PageRank, basedOn, Markov chain]
Generated description
A Markov chain is a mathematical model of a stochastic process where the probability of each future state depends only on the current state and not on the sequence of events that preceded it.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Markov chain Target entity description: A Markov chain is a mathematical model of a stochastic process where the probability of each future state depends only on the current state and not on the sequence of events that preceded it.
-
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.
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.
-
C.
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.
-
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.
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.
- F. None of above.
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_69ad8588ba18819086a10951c32ecb80 |
completed | March 8, 2026, 2:19 p.m. |
| NER | Named-entity recognition | batch_69ada7177b488190b7a1b40ff3fae15f |
completed | March 8, 2026, 4:43 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b24bb2c9908190b3abc395537e22ac |
completed | March 12, 2026, 5:14 a.m. |
| NEDg | Description generation | batch_69b24cda28308190b33f189b8c7f3c58 |
completed | March 12, 2026, 5:19 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69b24d84f29c819087c15fd3883d6657 |
completed | March 12, 2026, 5:22 a.m. |
Created at: March 8, 2026, 3:07 p.m.