Triple
T14704223
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Émile Borel |
E345382
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | Borel–Cantelli lemma |
E1041768
|
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: Borel–Cantelli lemma | Statement: [Émile Borel, notableWork, Borel–Cantelli lemma]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Borel–Cantelli lemma Context triple: [Émile Borel, notableWork, Borel–Cantelli lemma]
-
A.
Borel–Cantelli lemmas
chosen
The Borel–Cantelli lemmas are fundamental results in probability theory that characterize when events occur infinitely often or only finitely often, based on the convergence or divergence of the sum of their probabilities.
-
B.
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.
-
C.
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.
-
D.
Kronecker’s lemma
Kronecker’s lemma is a result in real analysis and summability theory that links the convergence of series with weighted averages of their partial sums, often used in the study of Fourier series and ergodic theorems.
-
E.
Bailey lemma
The Bailey lemma is a key result in the theory of basic hypergeometric series that provides a systematic method for generating Rogers–Ramanujan-type identities and other q-series relations.
- 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_69d822e4a8c08190a155df736bb7bc13 |
completed | April 9, 2026, 10:06 p.m. |
| NER | Named-entity recognition | batch_69deb6071e5c8190bb5509c859135c2d |
completed | April 14, 2026, 9:47 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69fdf087ce8c819081a7186df67bcf1f |
completed | May 8, 2026, 2:17 p.m. |
Created at: April 10, 2026, 1:28 a.m.