{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:L4PZ5GAB6PJJ3IYJ2O2PY3FALF","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":"840f87ced7ab9f9f28d6842bb7790304ac4c9dac6a0032e76434104d3ef500c3","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-03-25T15:14:33Z","title_canon_sha256":"5e7128489a081f9a885330154c606b6d0e33deede5386b609f930858d88c481c"},"schema_version":"1.0","source":{"id":"1403.6386","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.6386","created_at":"2026-05-18T02:55:37Z"},{"alias_kind":"arxiv_version","alias_value":"1403.6386v1","created_at":"2026-05-18T02:55:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6386","created_at":"2026-05-18T02:55:37Z"},{"alias_kind":"pith_short_12","alias_value":"L4PZ5GAB6PJJ","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"L4PZ5GAB6PJJ3IYJ","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"L4PZ5GAB","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:0658fa92c75bb83f92b1c0fef429a4836677a3662db31b495ccedaea7adb691b","target":"graph","created_at":"2026-05-18T02:55:37Z","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. Jerrum proved that any graph is $k$-mixing if $k$ is at least the maximum degree plus two. We first improve Jerrum's bound using the grundy number, which is the worst number of colors in a greedy coloring.\n  Any graph is $(tw+2)$-mixing, where $tw$ is the treewidth of the graph (Cereceda 2006). We prove that the shortest sequence between ","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":"2014-03-25T15:14:33Z","title":"Recoloring graphs via tree decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6386","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:7cc27e7f8b99d421c16eea5950514d70f4eef66192c46f025e602984b0907bf0","target":"record","created_at":"2026-05-18T02:55:37Z","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":"840f87ced7ab9f9f28d6842bb7790304ac4c9dac6a0032e76434104d3ef500c3","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-03-25T15:14:33Z","title_canon_sha256":"5e7128489a081f9a885330154c606b6d0e33deede5386b609f930858d88c481c"},"schema_version":"1.0","source":{"id":"1403.6386","kind":"arxiv","version":1}},"canonical_sha256":"5f1f9e9801f3d29da309d3b4fc6ca059455f4d86ba581356eef72e21866d1a0e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f1f9e9801f3d29da309d3b4fc6ca059455f4d86ba581356eef72e21866d1a0e","first_computed_at":"2026-05-18T02:55:37.032322Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:37.032322Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hHBKt/vCyaKeYffAdVEG1mGrhcdP6wWdlqxPBlPtjCX9Zhr6KkYh0ZhbP3IKsQdSh55DCOawh2V6P44CHjnhDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:37.032976Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.6386","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7cc27e7f8b99d421c16eea5950514d70f4eef66192c46f025e602984b0907bf0","sha256:0658fa92c75bb83f92b1c0fef429a4836677a3662db31b495ccedaea7adb691b"],"state_sha256":"9cc189d3b7400927e96fc1f861a2ec772e0b45b81ad6ea07a5b3f4c23917c613"}