A latest-anchor induction with spectrally compact masks for worst-case trace reconstruction
Recorded by the registry's curators from GitHub; the authors did not submit it here.
No author is named in the source.
Partial: for each fixed retention probability, log m(n) = O((log n)^3 (1 + log log 2n)^6), so quasipolynomially many traces suffice; success probability 2/3 is amplified to 0.9 by repetition..
Claims
PARTIALLY RESOLVED
OP-01141 — The number of traces needed for trace reconstruction
Files and sources
- Paper
- math @ 4eaee87, build/main.tex ↗
- Posted on GitHub
- 6 October 2026
No verification run is on record for this version.