Triple

T11961675
Position Surface form Disambiguated ID Type / Status
Subject Joseph L. Doob E284682 entity
Predicate knownFor P22 FINISHED
Object Doob’s maximal inequalities
Doob’s maximal inequalities are fundamental results in probability theory that provide bounds on the maximum value of a martingale or submartingale in terms of its expected terminal value, playing a key role in convergence and limit theorems.
E956289 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: Doob’s maximal inequalities | Statement: [Joseph L. Doob, knownFor, Doob’s maximal inequalities]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Doob’s maximal inequalities
Context triple: [Joseph L. Doob, knownFor, Doob’s maximal inequalities]
  • A. Khinchin–Kahane type inequalities
    Khinchin–Kahane type inequalities are fundamental results in probability and functional analysis that bound moments or norms of random series (often with Rademacher or Gaussian coefficients) in terms of each other, providing powerful tools for studying the geometry of Banach spaces and random processes.
  • B. Doob–Meyer decomposition
    The Doob–Meyer decomposition is a fundamental result in stochastic process theory that uniquely expresses a submartingale as the sum of a martingale and a predictable, increasing process.
  • C. Young inequality for convolutions
    Young inequality for convolutions is a fundamental result in analysis that provides norm bounds for the convolution of functions in Lebesgue spaces, relating the L^p norms of the factors to the L^r norm of their convolution.
  • D. Modern Probability Theory and Its Applications
    "Modern Probability Theory and Its Applications" is a foundational textbook by Emanuel Parzen that systematically develops modern probability theory and demonstrates its use in a wide range of statistical and applied contexts.
  • E. John–Nirenberg inequality
    The John–Nirenberg inequality is a fundamental result in harmonic analysis that characterizes functions of bounded mean oscillation (BMO) by showing their oscillations have exponentially decaying distribution.
  • 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: Doob’s maximal inequalities
Triple: [Joseph L. Doob, knownFor, Doob’s maximal inequalities]
Generated description
Doob’s maximal inequalities are fundamental results in probability theory that provide bounds on the maximum value of a martingale or submartingale in terms of its expected terminal value, playing a key role in convergence and limit theorems.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Doob’s maximal inequalities
Target entity description: Doob’s maximal inequalities are fundamental results in probability theory that provide bounds on the maximum value of a martingale or submartingale in terms of its expected terminal value, playing a key role in convergence and limit theorems.
  • A. Khinchin–Kahane type inequalities
    Khinchin–Kahane type inequalities are fundamental results in probability and functional analysis that bound moments or norms of random series (often with Rademacher or Gaussian coefficients) in terms of each other, providing powerful tools for studying the geometry of Banach spaces and random processes.
  • B. Doob–Meyer decomposition
    The Doob–Meyer decomposition is a fundamental result in stochastic process theory that uniquely expresses a submartingale as the sum of a martingale and a predictable, increasing process.
  • C. Young inequality for convolutions
    Young inequality for convolutions is a fundamental result in analysis that provides norm bounds for the convolution of functions in Lebesgue spaces, relating the L^p norms of the factors to the L^r norm of their convolution.
  • D. Modern Probability Theory and Its Applications
    "Modern Probability Theory and Its Applications" is a foundational textbook by Emanuel Parzen that systematically develops modern probability theory and demonstrates its use in a wide range of statistical and applied contexts.
  • E. John–Nirenberg inequality
    The John–Nirenberg inequality is a fundamental result in harmonic analysis that characterizes functions of bounded mean oscillation (BMO) by showing their oscillations have exponentially decaying distribution.
  • 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_69d6ab2eaeb881909f7914758f859413 completed April 8, 2026, 7:23 p.m.
NER Named-entity recognition batch_69d9037848f481908276716675464464 completed April 10, 2026, 2:04 p.m.
NED1 Entity disambiguation (via context triple) batch_69f4592fa9a48190a0450e3d0c57c4d3 completed May 1, 2026, 7:41 a.m.
NEDg Description generation batch_69f4645ef63881909b46937f73d637a3 completed May 1, 2026, 8:29 a.m.
NED2 Entity disambiguation (via description) batch_69f465be4db08190882898a17d077019 completed May 1, 2026, 8:35 a.m.
Created at: April 8, 2026, 9:45 p.m.