Remark: Family 121. Almost-linear expected-time approximation of edit distance

For every fixed rational $\epsilon \in (0,1)$, gives a randomized $(1+\epsilon )$ approximation to unit-cost edit distance in worst-case expected time $N^{1+o(1)}$, with success probability at least $2/3$. The strings have total length $N$ and polynomially bounded integer symbols. This is an asymptotic guarantee at fixed accuracy.

The authors are OpenAI. This companion does not verify the proof. The claim is not a theorem of the Enter series and not a premise of any registered sheet. It does not close O.1. O.1 stays NOT_CLOSED. It is not a de Sitter state and not the QdS external-leg scheme. No quantum coefficient is admitted. No compilation is asserted.