Triple
T11084474
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Markov semigroup |
E262082
|
entity |
| Predicate | usedIn |
P98
|
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: [Markov semigroup, usedIn, Markov chains]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Markov chains Context triple: [Markov semigroup, usedIn, 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.
Markov
Markov is a Russian surname most famously associated with mathematician Andrey Markov, known for his pioneering work on stochastic processes and Markov chains.
-
C.
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.
-
D.
Hidden Markov Model
A Hidden Markov Model is a statistical model that represents systems with unobserved (hidden) states generating observable outputs, widely used for sequence analysis tasks such as speech recognition, bioinformatics, and natural language processing.
-
E.
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.
- 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_69d6aa9983c08190b0ef61603b69feac |
completed | April 8, 2026, 7:20 p.m. |
| NER | Named-entity recognition | batch_69d799c0cc3081908448cfb26c08daf5 |
completed | April 9, 2026, 12:21 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69e3e79854c88190bda69cfbe4ae9d1e |
completed | April 18, 2026, 8:20 p.m. |
Created at: April 8, 2026, 9:27 p.m.