{"URL":"https://we-solve.github.io/contributions/let-g-be-a-bicolored-graph-and-let-h-be-the-graph-whose-vertices-are-the-valid-pressing-sequences-of-g-and-whose-edges/attempt-1/r2/","author":[{"literal":"we-solve research archive"}],"id":"wesolve:TOP-3100089-A1-r2","issued":{"date-parts":[[2026,10,11]]},"license":"CC-BY-4.0","note":"Revision r2 of TOP-3100089-A1. Unverified research record. LLMs and submitter roles are disclosed in the record. Date: first posted.","number":"TOP-3100089-A1 r2","title":"A six-vertex counterexample to four-total-edit pressing connectivity","type":"document"}