Triple
T3677835
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Aleksandr Khinchin |
E78037
|
entity |
| Predicate | notableIdea |
P4
|
FINISHED |
| Object | Khinchin's law of the iterated logarithm |
E378993
|
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: Khinchin's law of the iterated logarithm | Statement: [Aleksandr Khinchin, notableIdea, Khinchin's law of the iterated logarithm]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Khinchin's law of the iterated logarithm Context triple: [Aleksandr Khinchin, notableIdea, Khinchin's law of the iterated logarithm]
-
A.
Khinchin's law of the iterated logarithm
chosen
Khinchin's law of the iterated logarithm is a fundamental result in probability theory that precisely characterizes the almost-sure fluctuations of partial sums of independent random variables on the scale of the square root of twice the product of their variance and the iterated logarithm of the sample size.
-
B.
Khinchin–Kolmogorov theorem
The Khinchin–Kolmogorov theorem is a fundamental result in probability theory that provides conditions under which series of independent random variables converge almost surely.
-
C.
Khinchin's representation theorem
Khinchin's representation theorem is a result in probability theory that characterizes stationary stochastic processes by representing them in terms of simpler, more fundamental random components.
-
D.
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.
-
E.
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.
- 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_69ad85e18c1c8190be8aafb227f39f48 |
completed | March 8, 2026, 2:21 p.m. |
| NER | Named-entity recognition | batch_69adc46599188190a046eddb0d85c483 |
completed | March 8, 2026, 6:48 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b4cde8bc5081909cfaa4a391b8aca1 |
completed | March 14, 2026, 2:54 a.m. |
Created at: March 8, 2026, 3:25 p.m.