Asymptotic randomization of sofic shifts by linear cellular automata
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Abstract. Let bM/b = bZ/bsupiD/i/sup be a iD/i-dimensional lattice, and let (biA/i/b, +) be an abelian group. biA/isupM/sup/b is then a compact abelian group under componentwise addition. A continuous function Φ : biA/isupM/sup/b → biA/isupM/sup/b is called ia linear cellular automaton/i if there is a finite subset bF/b ⊂ bM/b and non-zero coefficients φf ∈ iZ/i so that, for any ba/b ∈ biA/isupM/sup/b, Φ(ba/b) = Σsubf∈bF/b/subφf · σsupf/sup(ba/b). Suppose that iµ/i is a probability measure on biA/isupM/sup/b whose support is a subshift of finite type or sofic shift. We provide sufficient conditions (on Φ and iµ/i) under which Φ iasymptotically randomizes µ/i, meaning that wk* − limsubbJ/b∋ij,/i→∞/sub Φisupj/supµ/i = iη/i, where iη/i is the Haar measure on biA/isupM/sup/b, and bJ/b ⊂ bN/b has Cesàro density one. In the case when Φ = 1 + σ and biA/i/b = (bZ/bsub/p/sub)sups/sup (ip/i prime), we provide a condition on iµ/i that is both necessary and sufficient. We then use this to construct zero-entropy measures which are randomized by 1 + σ.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 it