Triple

T10076743
Position Surface form Disambiguated ID Type / Status
Subject Harry Kesten E213782 entity
Predicate notableWork P4 FINISHED
Object Kesten’s theorem on random walks on groups
Kesten’s theorem on random walks on groups is a fundamental result in probability theory that characterizes amenability of groups via the spectral radius of associated random walks.
E839308 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: Kesten’s theorem on random walks on groups | Statement: [Harry Kesten, notableWork, Kesten’s theorem on random walks on groups]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Kesten’s theorem on random walks on groups
Context triple: [Harry Kesten, notableWork, Kesten’s theorem on random walks on groups]
  • A. Pólya’s theorem on random walks
    Pólya’s theorem on random walks is a fundamental result in probability theory stating that simple random walks on one- and two-dimensional lattices are recurrent (almost surely return to the starting point infinitely often), while in three or more dimensions they are transient.
  • B. Kac walk
    The Kac walk is a probabilistic model introduced by mathematician Mark Kac to study the approach to equilibrium in kinetic theory via a simplified random process.
  • C. Kolmogorov zero–one law
    The Kolmogorov zero–one law is a fundamental result in probability theory stating that certain events determined by the tail behavior of independent random variables must have probability either zero or one.
  • D. Kakutani’s random ergodic theorem
    Kakutani’s random ergodic theorem is a fundamental result in ergodic theory that extends classical ergodic theorems to sequences of randomly chosen measure-preserving transformations.
  • E. Harmonic Analysis and the Theory of Probability
    Harmonic Analysis and the Theory of Probability is a seminal mathematical monograph that connects Fourier-analytic methods with probabilistic concepts, helping to lay the foundations of modern probability theory.
  • 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: Kesten’s theorem on random walks on groups
Triple: [Harry Kesten, notableWork, Kesten’s theorem on random walks on groups]
Generated description
Kesten’s theorem on random walks on groups is a fundamental result in probability theory that characterizes amenability of groups via the spectral radius of associated random walks.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Kesten’s theorem on random walks on groups
Target entity description: Kesten’s theorem on random walks on groups is a fundamental result in probability theory that characterizes amenability of groups via the spectral radius of associated random walks.
  • A. Pólya’s theorem on random walks
    Pólya’s theorem on random walks is a fundamental result in probability theory stating that simple random walks on one- and two-dimensional lattices are recurrent (almost surely return to the starting point infinitely often), while in three or more dimensions they are transient.
  • B. Kac walk
    The Kac walk is a probabilistic model introduced by mathematician Mark Kac to study the approach to equilibrium in kinetic theory via a simplified random process.
  • C. Kolmogorov zero–one law
    The Kolmogorov zero–one law is a fundamental result in probability theory stating that certain events determined by the tail behavior of independent random variables must have probability either zero or one.
  • D. Kakutani’s random ergodic theorem
    Kakutani’s random ergodic theorem is a fundamental result in ergodic theory that extends classical ergodic theorems to sequences of randomly chosen measure-preserving transformations.
  • E. Harmonic Analysis and the Theory of Probability
    Harmonic Analysis and the Theory of Probability is a seminal mathematical monograph that connects Fourier-analytic methods with probabilistic concepts, helping to lay the foundations of modern probability theory.
  • 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_69ca839bf730819086900c323c9b8c95 completed March 30, 2026, 2:07 p.m.
NER Named-entity recognition batch_69cdd0190d808190847ea0fa401ef06c completed April 2, 2026, 2:10 a.m.
NED1 Entity disambiguation (via context triple) batch_69d29ac67cb48190ba53a87c3749a245 completed April 5, 2026, 5:24 p.m.
NEDg Description generation batch_69d29c98e470819098bdf9fa51f40d1f completed April 5, 2026, 5:32 p.m.
NED2 Entity disambiguation (via description) batch_69d29d0190988190891c264556856f60 completed April 5, 2026, 5:33 p.m.
Created at: March 30, 2026, 8:59 p.m.