Triple

T3037541
Position Surface form Disambiguated ID Type / Status
Subject Andrei Kolmogorov E83045 entity
Predicate notableWork P4 FINISHED
Object Kolmogorov continuity theorem
The Kolmogorov continuity theorem is a fundamental result in probability theory that provides conditions under which a stochastic process admits a modification with continuous (or Hölder-continuous) sample paths.
E320436 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: Kolmogorov continuity theorem | Statement: [Andrei Kolmogorov, notableWork, Kolmogorov continuity theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Kolmogorov continuity theorem
Context triple: [Andrei Kolmogorov, notableWork, Kolmogorov continuity theorem]
  • A. Cameron–Martin theorem
    The Cameron–Martin theorem is a fundamental result in probability theory and functional analysis that characterizes how Gaussian measures on infinite-dimensional spaces change under shifts by elements of a special Hilbert subspace (the Cameron–Martin space).
  • B. Clark–Ocone formula
    The Clark–Ocone formula is a key result in stochastic calculus and Malliavin calculus that provides an explicit integral representation of square-integrable random variables with respect to Brownian motion.
  • C. Berry–Esseen theorem
    The Berry–Esseen theorem is a quantitative refinement of the central limit theorem that provides explicit bounds on the rate of convergence of normalized sums of independent random variables to the normal distribution.
  • D. Malliavin calculus
    Malliavin calculus is a branch of stochastic analysis that extends differential calculus to functionals of stochastic processes, particularly Brownian motion, enabling probabilistic proofs of regularity and smoothness for solutions to stochastic differential equations.
  • E. Kolmogorov distance
    Kolmogorov distance is a statistical metric that measures the maximum difference between two cumulative distribution functions, commonly used to quantify convergence in distribution and in goodness-of-fit tests.
  • 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: Kolmogorov continuity theorem
Triple: [Andrei Kolmogorov, notableWork, Kolmogorov continuity theorem]
Generated description
The Kolmogorov continuity theorem is a fundamental result in probability theory that provides conditions under which a stochastic process admits a modification with continuous (or Hölder-continuous) sample paths.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Kolmogorov continuity theorem
Target entity description: The Kolmogorov continuity theorem is a fundamental result in probability theory that provides conditions under which a stochastic process admits a modification with continuous (or Hölder-continuous) sample paths.
  • A. Cameron–Martin theorem
    The Cameron–Martin theorem is a fundamental result in probability theory and functional analysis that characterizes how Gaussian measures on infinite-dimensional spaces change under shifts by elements of a special Hilbert subspace (the Cameron–Martin space).
  • B. Clark–Ocone formula
    The Clark–Ocone formula is a key result in stochastic calculus and Malliavin calculus that provides an explicit integral representation of square-integrable random variables with respect to Brownian motion.
  • C. Berry–Esseen theorem
    The Berry–Esseen theorem is a quantitative refinement of the central limit theorem that provides explicit bounds on the rate of convergence of normalized sums of independent random variables to the normal distribution.
  • D. Malliavin calculus
    Malliavin calculus is a branch of stochastic analysis that extends differential calculus to functionals of stochastic processes, particularly Brownian motion, enabling probabilistic proofs of regularity and smoothness for solutions to stochastic differential equations.
  • E. Kolmogorov distance
    Kolmogorov distance is a statistical metric that measures the maximum difference between two cumulative distribution functions, commonly used to quantify convergence in distribution and in goodness-of-fit tests.
  • 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_69ad8b2298908190a7cb4e9bdbf064d0 completed March 8, 2026, 2:43 p.m.
NER Named-entity recognition batch_69ad9b2cd4988190b52fe3616ecbe9ef completed March 8, 2026, 3:52 p.m.
NED1 Entity disambiguation (via context triple) batch_69b1dec8778c8190a5e06a29a0218404 completed March 11, 2026, 9:29 p.m.
NEDg Description generation batch_69b1e2c4aaa88190bb5e39c51d0583f0 completed March 11, 2026, 9:46 p.m.
NED2 Entity disambiguation (via description) batch_69b1e3228f488190b13c948c6c5d13d0 completed March 11, 2026, 9:48 p.m.
Created at: March 8, 2026, 3:01 p.m.