Intersections of thick compact sets in $${\mathbb {R}}^d$$
Bibliographic record
Abstract
Abstract We introduce a definition of thickness in $${\mathbb {R}}^d$$ R d and obtain a lower bound for the Hausdorff dimension of the intersection of finitely or countably many thick compact sets using a variant of Schmidt’s game. As an application we prove that given any compact set in $${\mathbb {R}}^d$$ R d with thickness $$\tau $$ τ , there is a number $$N(\tau )$$ N ( τ ) such that the set contains a translate of all sufficiently small similar copies of every set in $${\mathbb {R}}^d$$ R d with at most $$N(\tau )$$ N ( τ ) elements; indeed the set of such translations has positive Hausdorff dimension. We also prove a gap lemma and bounds relating Hausdorff dimension and thickness.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.002 | 0.003 |
| Scholarly communication | 0.006 | 0.007 |
| Open science | 0.002 | 0.008 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.009 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".