{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WFIRZWP3FYMZSA5FKWUSVIY3UU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ec7c52ff648a5257d45c68b270b00fb01cbc8cb44471ae6b9399c12c6166b7d1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-02-14T17:43:07Z","title_canon_sha256":"a96fb3972f0c25e128e7efe8f26a4320e5c4ec52fb52a77cd17b62d8497b266b"},"schema_version":"1.0","source":{"id":"1302.3486","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3486","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3486v1","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3486","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"pith_short_12","alias_value":"WFIRZWP3FYMZ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WFIRZWP3FYMZSA5F","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WFIRZWP3","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:0d39bbf5bbb4bfb3e22a8414482f53ee5024a13d302655b6771aec94473d73d5","target":"graph","created_at":"2026-05-18T03:33:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Let $k$ be an integer. Two vertex $k$-colorings of a graph are \\emph{adjacent} if they differ on exactly one vertex. A graph is \\emph{$k$-mixing} if any proper $k$-coloring can be transformed into any other through a sequence of adjacent proper $k$-colorings. Any graph is $(tw+2)$-mixing, where $tw$ is the treewidth of the graph (Cereceda 2006). We prove that the shortest sequence between any two $(tw+2)$-colorings is at most quadratic, a problem left open in Bonamy et al. (2012).\n  Jerrum proved that any graph is $k$-mixing if $k$ is at least the maximum degree plus two. We improve Jerrum's b","authors_text":"Marthe Bonamy, Nicolas Bousquet","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-02-14T17:43:07Z","title":"Recoloring bounded treewidth graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3486","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4d96c4203e4a3fd24684d60e467e4dbae60c00c1719740ac3c44632e9ba81e2c","target":"record","created_at":"2026-05-18T03:33:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ec7c52ff648a5257d45c68b270b00fb01cbc8cb44471ae6b9399c12c6166b7d1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-02-14T17:43:07Z","title_canon_sha256":"a96fb3972f0c25e128e7efe8f26a4320e5c4ec52fb52a77cd17b62d8497b266b"},"schema_version":"1.0","source":{"id":"1302.3486","kind":"arxiv","version":1}},"canonical_sha256":"b1511cd9fb2e199903a555a92aa31ba52ce47d7cba1fe84e1c71b189bad89ac3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1511cd9fb2e199903a555a92aa31ba52ce47d7cba1fe84e1c71b189bad89ac3","first_computed_at":"2026-05-18T03:33:38.459358Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:38.459358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I1ipa1uLfQFxLF2Y+kCBI5eg9caUD+Zb8c+5NbLv9pKoKoMYhSVPtviS6Op3v8+5RvYJ418MeyseClN2EQ9vDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:38.459821Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.3486","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d96c4203e4a3fd24684d60e467e4dbae60c00c1719740ac3c44632e9ba81e2c","sha256:0d39bbf5bbb4bfb3e22a8414482f53ee5024a13d302655b6771aec94473d73d5"],"state_sha256":"7bee8f269cb9c31d505d726e797f35a4cbfe9c0c4a219709a9e9993e7c4d3858"}