{
  "abstract": "A fully-dynamic Maximum-Cardinality-Search (MCS) ordering algorithm that, on a single-edge insertion or deletion into a loop-free undirected graph, scans the affected window between the two endpoints for the first step at which the current ordering's choice stops being a legal MCS pick, and only then regreedies the suffix (probe-then-repair). Correctness - every order produced stays a valid MCS ordering of the updated graph, and in fact equals the from-scratch canonical ordering - is machine-checked in Lean 4 / Mathlib, together with locality (the first position whose choice can change lies inside the window between the endpoints; after a break the suffix is regreedyed, so positions past the window may also change), an executable boolean-adjacency implementation proved to refine the abstract update, and per-update cost in a unit-cost query model (counting legality checks and pick steps along the real executable control flow): at most n units for an insertion and n + 1 for a deletion, so the worst case matches static recomputation. A stability theorem is also proved: if the neighbour count of every unchosen vertex in one graph exceeds that in the other by at most one along every *proper common MCS prefix* (the sets the constructive proof actually visits -- a hypothesis strictly weaker than the every-subset bound, which is equivalent to adding a matching), the two graphs admit a common MCS ordering; in particular inserting or deleting a matching, or flipping a single edge, always preserves a common MCS ordering. This strengthening (exists_common_ordering_prefix) makes the matching result a genuine corollary; the every-subset version exists_common_ordering is retained as a special case.",
  "authors": [
    {
      "name": "Md Thoriqul Islam Thonmay"
    },
    {
      "name": "Gregory Morse"
    }
  ],
  "challenge_render": {
    "artifact_path": "renders/PALOMAR-2026-10-04-000009-v3/f7dc721f7405cdf93b4a3aee026ce0ccf0c65b56ea8594069dc56fe77e818fde/",
    "artifact_tree_sha256": "f7dc721f7405cdf93b4a3aee026ce0ccf0c65b56ea8594069dc56fe77e818fde",
    "bwrap_source_tag": "v0.12.0",
    "entrypoint": "Challenge/index.html",
    "format": "verso-html",
    "rendered_at": "2026-11-10T13:26:15Z",
    "renderer_commit": "14aa8d6b3c2f14a8540605e37144560b9a00e7e7",
    "verso_commit": "9f8096e40b31715b1d8d5997f15a0bd832f7e37d"
  },
  "classification": {
    "arxiv": [
      "cs.DS",
      "math.CO"
    ],
    "msc2020": [
      "05C85",
      "68Q25"
    ]
  },
  "first_registered_on": "2026-10-04",
  "formalization": {
    "challenge_path": "Challenge.lean",
    "comparator_config_path": "comparator.json",
    "definition_names": [],
    "formalization_metadata_path": "formalization.yaml",
    "lakefile_path": "lakefile.toml",
    "lean_toolchain": "leanprover/lean4:v4.35.0-rc2",
    "permitted_axioms": [
      "propext",
      "Quot.sound",
      "Classical.choice"
    ],
    "project_dependencies": [
      {
        "name": "mathlib",
        "repository": "leanprover-community/mathlib4",
        "revision": "58d6e790080f66348d86c115a1e00ab9b6343f70"
      },
      {
        "name": "plausible",
        "repository": "leanprover-community/plausible",
        "revision": "e50948299c4dc4a4c21b1c34b6a6a4fddc19f912"
      },
      {
        "name": "LeanSearchClient",
        "repository": "leanprover-community/LeanSearchClient",
        "revision": "95e037bfdc31d3916ac615446847fb01960e2719"
      },
      {
        "name": "importGraph",
        "repository": "leanprover-community/import-graph",
        "revision": "f8e94c24111148c9ad1b866212a6e1a0fabb5e76"
      },
      {
        "name": "proofwidgets",
        "repository": "leanprover-community/ProofWidgets4",
        "revision": "4c70ac059693669e5756e32a7a94b57ee1e99dc5"
      },
      {
        "name": "aesop",
        "repository": "leanprover-community/aesop",
        "revision": "75d936c7af167cc93fac0d31237682fc2204591d"
      },
      {
        "name": "Qq",
        "repository": "leanprover-community/quote4",
        "revision": "786b7acdca7eb4e9c76c5d1d5bd810e7e5c56334"
      },
      {
        "name": "batteries",
        "repository": "leanprover-community/batteries",
        "revision": "167242e0621ba382fd6f7b2a7e932ce0811f9ab1"
      },
      {
        "name": "Cli",
        "repository": "leanprover/lean4-cli",
        "revision": "2842b9871b04862f944c032e34052cb9448ccb71"
      }
    ],
    "solution_path": "Solution.lean",
    "theorem_names": [
      "Challenge.init_valid",
      "Challenge.insert_update_valid",
      "Challenge.delete_update_valid",
      "Challenge.greedySuffix_full",
      "Challenge.update_from_prefix",
      "Challenge.setEdge_preserves_symm",
      "Challenge.setEdge_preserves_loopless",
      "Challenge.mcsOrder_eq_greedySuffix",
      "Challenge.exec_insert_recompute_valid",
      "Challenge.exec_delete_recompute_valid",
      "Challenge.IsMCSOrdering_unique",
      "Challenge.insert_update_eq_initOrder",
      "Challenge.delete_update_eq_initOrder",
      "Challenge.legal_upto_earlierPos",
      "Challenge.legal_after_laterPos",
      "Challenge.delete_legal_between",
      "Challenge.insert_break_iff",
      "Challenge.no_break_at_laterPos",
      "Challenge.insert_break_iff_old",
      "Challenge.insert_update_eq_self_iff",
      "Challenge.delete_update_eq_self_iff",
      "Challenge.exec_insert_update_eq",
      "Challenge.exec_delete_update_eq",
      "Challenge.exec_insert_cost_le",
      "Challenge.exec_delete_cost_le",
      "Challenge.exec_insert_cost_of_no_break",
      "Challenge.exec_delete_cost_of_no_break",
      "Challenge.exec_insert_cost_of_break",
      "Challenge.exec_delete_cost_of_break",
      "Challenge.exec_insert_update_c_fst",
      "Challenge.exec_delete_update_c_fst",
      "Challenge.exists_common_ordering",
      "Challenge.exists_common_ordering_prefix",
      "Challenge.common_order_extends_prefix",
      "Challenge.insert_matching_common_order",
      "Challenge.delete_matching_common_order",
      "Challenge.flip_common_order",
      "Challenge.triangle_no_common_order",
      "Challenge.p4_no_common_order",
      "Challenge.mixed_matching_no_common_order",
      "Challenge.two_p3_no_common_order"
    ]
  },
  "id": "PALOMAR-2026-10-04-000009",
  "preservation": {
    "archive_owner": "PalomarArchive",
    "archived_at": "2026-11-10T17:24:22Z",
    "receipt_sha256": "e1debdea62ca76b05c89b329f681d92629da64c7972f02b82ac379be4ccdef1f",
    "repositories": [
      {
        "commit": "75d936c7af167cc93fac0d31237682fc2204591d",
        "fork_repository": "PalomarArchive/leanprover-community--aesop--01b46b609077",
        "ref": "refs/tags/palomar/PALOMAR-2026-10-04-000009-v3/75d936c7af167cc93fac0d31237682fc2204591d",
        "source_repository": "leanprover-community/aesop"
      },
      {
        "commit": "167242e0621ba382fd6f7b2a7e932ce0811f9ab1",
        "fork_repository": "PalomarArchive/leanprover-community--batteries--1b4c776305c9",
        "ref": "refs/tags/palomar/PALOMAR-2026-10-04-000009-v3/167242e0621ba382fd6f7b2a7e932ce0811f9ab1",
        "source_repository": "leanprover-community/batteries"
      },
      {
        "commit": "f8e94c24111148c9ad1b866212a6e1a0fabb5e76",
        "fork_repository": "PalomarArchive/leanprover-community--import-graph--e0a79261b05a",
        "ref": "refs/tags/palomar/PALOMAR-2026-10-04-000009-v3/f8e94c24111148c9ad1b866212a6e1a0fabb5e76",
        "source_repository": "leanprover-community/import-graph"
      },
      {
        "commit": "95e037bfdc31d3916ac615446847fb01960e2719",
        "fork_repository": "PalomarArchive/leanprover-community--LeanSearchClient--9de355ab5f53",
        "ref": "refs/tags/palomar/PALOMAR-2026-10-04-000009-v3/95e037bfdc31d3916ac615446847fb01960e2719",
        "source_repository": "leanprover-community/LeanSearchClient"
      },
      {
        "commit": "58d6e790080f66348d86c115a1e00ab9b6343f70",
        "fork_repository": "PalomarArchive/leanprover-community--mathlib4--67b3d817d8a2",
        "ref": "refs/tags/palomar/PALOMAR-2026-10-04-000009-v3/58d6e790080f66348d86c115a1e00ab9b6343f70",
        "source_repository": "leanprover-community/mathlib4"
      },
      {
        "commit": "e50948299c4dc4a4c21b1c34b6a6a4fddc19f912",
        "fork_repository": "PalomarArchive/leanprover-community--plausible--fb632f6f7bf4",
        "ref": "refs/tags/palomar/PALOMAR-2026-10-04-000009-v3/e50948299c4dc4a4c21b1c34b6a6a4fddc19f912",
        "source_repository": "leanprover-community/plausible"
      },
      {
        "commit": "4c70ac059693669e5756e32a7a94b57ee1e99dc5",
        "fork_repository": "PalomarArchive/leanprover-community--ProofWidgets4--26014acbbaff",
        "ref": "refs/tags/palomar/PALOMAR-2026-10-04-000009-v3/4c70ac059693669e5756e32a7a94b57ee1e99dc5",
        "source_repository": "leanprover-community/ProofWidgets4"
      },
      {
        "commit": "786b7acdca7eb4e9c76c5d1d5bd810e7e5c56334",
        "fork_repository": "PalomarArchive/leanprover-community--quote4--90d31d153685",
        "ref": "refs/tags/palomar/PALOMAR-2026-10-04-000009-v3/786b7acdca7eb4e9c76c5d1d5bd810e7e5c56334",
        "source_repository": "leanprover-community/quote4"
      },
      {
        "commit": "2842b9871b04862f944c032e34052cb9448ccb71",
        "fork_repository": "PalomarArchive/leanprover--lean4-cli--df175a7fc790",
        "ref": "refs/tags/palomar/PALOMAR-2026-10-04-000009-v3/2842b9871b04862f944c032e34052cb9448ccb71",
        "source_repository": "leanprover/lean4-cli"
      },
      {
        "commit": "ab521f20cf66548fd4202c78d7c468e8555b20e3",
        "fork_repository": "PalomarArchive/thonmay--mcs-lean--1a1be965289a",
        "ref": "refs/tags/palomar/PALOMAR-2026-10-04-000009-v3/ab521f20cf66548fd4202c78d7c468e8555b20e3",
        "source_repository": "thonmay/thesis-lean"
      }
    ]
  },
  "provenance": {
    "mathematical_sources": [
      {
        "authors": [
          {
            "name": "Md Thoriqul Islam Thonmay"
          },
          {
            "name": "Gregory Morse"
          }
        ],
        "relationship": "other",
        "title": "Dynamic Maximum-Cardinality-Search ordering maintenance under single-edge insertions and deletions (probe-then-repair algorithm)",
        "type": "original-proof"
      },
      {
        "authors": [
          {
            "name": "Donald J. Rose"
          },
          {
            "name": "Robert Endre Tarjan"
          },
          {
            "name": "George S. Lueker"
          }
        ],
        "relationship": "background",
        "title": "Algorithmic Aspects of Vertex Elimination on Graphs"
      },
      {
        "authors": [
          {
            "name": "Robert Endre Tarjan"
          },
          {
            "name": "Mihalis Yannakakis"
          }
        ],
        "relationship": "background",
        "title": "Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs"
      },
      {
        "authors": [
          {
            "name": "Louis Ibarra"
          }
        ],
        "relationship": "background",
        "title": "Fully Dynamic Algorithms for Chordal Graphs and Split Graphs"
      },
      {
        "authors": [
          {
            "name": "Niranka Banerjee"
          },
          {
            "name": "Venkatesh Raman"
          },
          {
            "name": "Srinivasa Rao Satti"
          }
        ],
        "relationship": "background",
        "title": "Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds"
      },
      {
        "authors": [
          {
            "name": "Andreas Brandstadt"
          },
          {
            "name": "Feodor F. Dragan"
          },
          {
            "name": "Falk Nicolai"
          }
        ],
        "relationship": "background",
        "title": "LexBFS-orderings and powers of chordal graphs"
      }
    ],
    "related_formalizations": [],
    "repository_role": "substantive-development",
    "responsible_maintainers": [
      {
        "name": "Md Thoriqul Islam Thonmay"
      }
    ],
    "result_origin": "original"
  },
  "registered_at": "2026-11-10T17:23:53Z",
  "review": {
    "outcome": "neutral",
    "policy_commit": "28bd48b9b71bbb2a82c718ce761d5a4220ef8e60",
    "report": {
      "sha256": "7ad8df82cd87cd58d59019a1af550be582da7feeb929a4a9d5d8f53e54fdbff0"
    },
    "reviewed_at": "2026-11-10T14:12:34Z",
    "reviewer_models": [
      "codex:gpt-6-sol"
    ],
    "warnings": []
  },
  "schema_version": 5,
  "source": {
    "commit": "ab521f20cf66548fd4202c78d7c468e8555b20e3",
    "license": {
      "declared_identifier": "Apache-2.0",
      "detected_identifier": "Apache-2.0",
      "path": "LICENSE",
      "sha256": "c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4"
    },
    "repository": "thonmay/thesis-lean",
    "repository_url": "https://github.com/thonmay/thesis-lean",
    "tree_url": "https://github.com/thonmay/thesis-lean/tree/ab521f20cf66548fd4202c78d7c468e8555b20e3"
  },
  "status": "registered",
  "submission": {
    "authorization": {
      "relationship": "maintainer"
    },
    "submission_id": "u20ku2c66146"
  },
  "title": "Dynamic MCS Ordering Maintenance",
  "trust": {
    "challenge_bytes": 35357,
    "challenge_dependencies": [
      {
        "provenance": "allowlisted",
        "repository": "leanprover-community/mathlib4"
      }
    ],
    "challenge_imports": [
      "Mathlib"
    ],
    "challenge_lines": 742,
    "level": "high",
    "reasons": [
      "Challenge exceeds the preferred audit surface"
    ]
  },
  "verification": {
    "bwrap_source_tag": "v0.12.0",
    "challenge_sha256": "34ae07f0a2c2c86e504500f89ac711067b96b2560df9be4aab1a1bb9df504ffd",
    "evidence_path": "evidence/PALOMAR-2026-10-04-000009-v3/cc93ffa77391c766aee64fecf7d402dbd335fc30d7180a45b7869d9184114d8e/",
    "evidence_tree_sha256": "cc93ffa77391c766aee64fecf7d402dbd335fc30d7180a45b7869d9184114d8e",
    "kernels": [
      {
        "argv": [
          "/home/runner/.elan/toolchains/leanprover--lean4---v4.35.0-rc2/bin/nanoda_bin"
        ],
        "name": "nanoda"
      },
      {
        "argv": [
          "/home/runner/work/_temp/palomar/trusted-checker-update/con-ron",
          "--jobs=2",
          "--verified"
        ],
        "name": "con-ron"
      }
    ],
    "mechanical_report_sha256": "5121f69a21295b02bf1498da66e918ab25303b32cf2f49233572f1e7a3849d72",
    "protected_config_sha256": "976d0d78ff2ba29fef58f5704703724e4a627dbc4d3e3b6e224968d371441396",
    "repository": "PalomarRegistry/PalomarSubmission",
    "run_id": 42820507414,
    "solution_sha256": "fd9b860d5ca401ca5d3812985b33c7e5f4be111e99839fa1543fe6eec6a7bf45",
    "tool_digests": {
      "bwrap": "4fc258628d44f1aaa6f5e3e3089ca82cf759527faf6a57fc540de1f4abf8aeb2",
      "con-ron": "4e5616d94374cae37324dad2594f6230c2bb2297240249fc78ff508f3bc5acef",
      "lake": "8ba83c98f76562d03b8dbc33f1057151ba6cbb121679dde76b2260ccc90495e1",
      "lean": "bf8d54e4714cc4b03d3f6bb34c83b7202b87e49c8bfcbff6895c085bb90ceb38",
      "leanchecker": "9e36e955a251b1313c8eb5b7fa101282d51df109d34d8bb7c1cfdf51985aba29",
      "leanexport": "c5bc1a10a21e22cbb3671d65987cdef2076833b14182d823ccb2153adf2fa954",
      "nanoda_bin": "8241c5e6baa29490aa118d382f97961b208ae730fdb96545c2abed74c9ece5a8"
    },
    "toolchain_commit": "11acb17ec6b07a8f9e9173e6845197929540936b",
    "verified_at": "2026-11-10T13:09:27Z",
    "workflow_commit": "14aa8d6b3c2f14a8540605e37144560b9a00e7e7",
    "workflow_path": ".github/workflows/submission.yml",
    "workflow_run_attempt": 1,
    "workflow_url": "https://github.com/PalomarRegistry/PalomarSubmission/actions/runs/42820507414"
  },
  "version": 3
}
