Triple
T18479813
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Vitali covering lemma |
E451527
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
Besicovitch covering theorem
The Besicovitch covering theorem is a fundamental result in geometric measure theory that provides conditions under which a set in Euclidean space can be efficiently covered by a countable subcollection of balls with bounded overlap.
|
E1327674
|
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: Besicovitch covering theorem | Statement: [Vitali covering lemma, relatedTo, Besicovitch covering theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Besicovitch covering theorem Context triple: [Vitali covering lemma, relatedTo, Besicovitch covering theorem]
-
A.
Vitali covering lemma
The Vitali covering lemma is a fundamental result in measure theory that provides conditions under which a collection of sets can be reduced to a disjoint subcollection that still covers almost all of the original set, and it underpins many key theorems in real analysis and differentiation.
-
B.
Cover’s theorem
Cover’s theorem is a result in statistical pattern recognition stating that data cast nonlinearly into a higher-dimensional space is more likely to be linearly separable than in a lower-dimensional space.
-
C.
Borel–Lebesgue theorem
The Borel–Lebesgue theorem is a fundamental result in real analysis and topology that characterizes compact subsets of Euclidean space via the property that every open cover admits a finite subcover.
-
D.
Jarník–Besicovitch theorem
The Jarník–Besicovitch theorem is a fundamental result in metric number theory that determines the Hausdorff dimension of sets of real numbers that are very well approximable by rationals.
-
E.
Carathéodory measurability criterion
The Carathéodory measurability criterion is a fundamental condition in measure theory that characterizes measurable sets via an outer measure by requiring additivity over intersections and complements.
- 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: Besicovitch covering theorem Triple: [Vitali covering lemma, relatedTo, Besicovitch covering theorem]
Generated description
The Besicovitch covering theorem is a fundamental result in geometric measure theory that provides conditions under which a set in Euclidean space can be efficiently covered by a countable subcollection of balls with bounded overlap.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Besicovitch covering theorem Target entity description: The Besicovitch covering theorem is a fundamental result in geometric measure theory that provides conditions under which a set in Euclidean space can be efficiently covered by a countable subcollection of balls with bounded overlap.
-
A.
Vitali covering lemma
The Vitali covering lemma is a fundamental result in measure theory that provides conditions under which a collection of sets can be reduced to a disjoint subcollection that still covers almost all of the original set, and it underpins many key theorems in real analysis and differentiation.
-
B.
Cover’s theorem
Cover’s theorem is a result in statistical pattern recognition stating that data cast nonlinearly into a higher-dimensional space is more likely to be linearly separable than in a lower-dimensional space.
-
C.
Borel–Lebesgue theorem
The Borel–Lebesgue theorem is a fundamental result in real analysis and topology that characterizes compact subsets of Euclidean space via the property that every open cover admits a finite subcover.
-
D.
Jarník–Besicovitch theorem
The Jarník–Besicovitch theorem is a fundamental result in metric number theory that determines the Hausdorff dimension of sets of real numbers that are very well approximable by rationals.
-
E.
Carathéodory measurability criterion
The Carathéodory measurability criterion is a fundamental condition in measure theory that characterizes measurable sets via an outer measure by requiring additivity over intersections and complements.
- 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_69d8d38465a0819099b9b42d2a662ac1 |
completed | April 10, 2026, 10:40 a.m. |
| NER | Named-entity recognition | batch_69e53066a7108190a50eda9b489c90ca |
completed | April 19, 2026, 7:43 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_6a04713658008190bacb6a16cd6cb719 |
completed | May 13, 2026, 12:40 p.m. |
| NEDg | Description generation | batch_6a0472a21b588190ba1fce35f34166cd |
completed | May 13, 2026, 12:46 p.m. |
| NED2 | Entity disambiguation (via description) | batch_6a04743126f88190983910523394649f |
completed | May 13, 2026, 12:53 p.m. |
Created at: April 10, 2026, 11:35 a.m.