All OpenAI manuscripts

OpenAI · 099-03 · 2026-09-27 · Convex and metric geometry

Tree Constructions for the l1 Distortion of Binary Edit Distance

preprints/Tree-Constructions-for-the-l1-Distortion-of-Binary-Edit-Distance-September-27-2026

Family 099. The sharp distortion of edit distance into .

The authors are OpenAI. This companion does not verify the proof and does not adopt it as a theorem of Ngo Cheung’s series. It is not a premise. O.1 stays NOT_CLOSED. Anti-de Sitter results are not a de Sitter state, not Em02-E’s relational lapse, not XVI-P’s QdS scheme, and not XVI-Q’s sigma-image record. No quantum coefficient is admitted. No compilation is asserted.

Read against the standing problems

Standing problems. No standing problem is named in this text. It was still read against the nine problems and does not close any of them. The authors are OpenAI. The companion does not verify the proof. This is not a premise of a manuscript by Ngo Cheung. O.1 stays NOT_CLOSED. No quantum coefficient is admitted. No compilation is asserted. XVI-P · XVI-N

Determines the least distortion of embedding edit distance on words of length at most into real : it is . Insertions, deletions and substitutions have unit cost. The constants are uniform over all finite alphabets with at least two symbols, even when the alphabet grows with ; binary words already force the lower bound.

We give two independent constructions of binary words of one length at most d whose ordinary edit-distance metrics require ℓ1 distortion for every sufficiently large d. We also prove a constant-distortion binary conversion for one prescribed input length. Together with the companion upper embedding theorem, these lower bounds determine the order of logarithmic distortion uniformly over finite alphabets with at least two symbols.

Preprint source and Lean scope

The abstract above is the catalogue abstract. The sections below are the full preprint source, 0 sections. This page is not only the abstract. The manuscript file is loading.

This preprint is named in the Lean scope note for 099: The sharp exponential scale of edit-distance distortion. The authors are OpenAI. This companion does not verify the formalization. It is not a premise. The OAI library is not imported. No compilation is asserted. O.1 stays NOT_CLOSED.

EditDistance.lean · EditDistance.lean

Statement file

FiniteCircle.lean · FiniteCircle.lean

Statement file

BinaryEditLower.lean · BinaryEditLower.lean

Statement file

TreeEdit.lean · TreeEdit.lean

Statement file