Bibliographic record
Abstract
We consider versions of the grasshopper problem [1] on the circle and the sphere, which are relevant to Bell inequalities. For a circle of circumference 2π, we show that for unconstrained lawns of any length and arbitrary jump lengths, the supremum of the probability for the grasshopper’s jump to stay on the lawn is one. For antipodal lawns, which by definition contain precisely one of each pair of opposite points and have length π, we show this is true except when the jump length φ is of the form π p/q with p, q coprime and p odd. For these jump lengths we show the optimal probability is 1 − 1/q and construct optimal lawns. For a pair of antipodal lawns, we show that the optimal probability of jumping from one onto the other is 1 − 1/q for p, q coprime, p odd and q even, and one in all other cases. For an antipodal lawn on the sphere, it is known [2] that if φ = π/q, where q ∈ ℕ, then the optimal retention probability of 1 − 1/q for the grasshopper’s jump is provided by a hemispherical lawn. We show that in all other cases where 0 < φ < π/2, hemispherical lawns are not optimal, disproving the hemispherical colouring maximality hypotheses [2]. We discuss the implications for Bell experiments and related cryptographic tests.
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.001 | 0.009 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.002 | 0.002 |
| Scholarly communication | 0.002 | 0.004 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.003 | 0.003 |
| Insufficient payload (model declined to judge) | 0.020 | 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".