Ordered matrix removal

The quantity is the side length $k$ of a square ordered binary pattern that obstructs polynomial removal. A lower side length is better. Later repair-distance constants do not change this quantity.

OpenAI baseline: $66$ , released Oct 6, 2:58 PM PT.

These results are Claimed: their authors published them, and we have not checked them.

Bound	Evidence level	Author	Date	Proof scope
$4$	Claimed	erebos-labs	Oct 9, 8:07 AM PT	Proof scope Main obstruction and later repair theorem.

Relevant repos

erebos-labs/ordered-matrix-removal-4x4: The later repair-distance theorem concerns another quantity.