{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:L4PZ5GAB6PJJ3IYJ2O2PY3FALF","short_pith_number":"pith:L4PZ5GAB","schema_version":"1.0","canonical_sha256":"5f1f9e9801f3d29da309d3b4fc6ca059455f4d86ba581356eef72e21866d1a0e","source":{"kind":"arxiv","id":"1403.6386","version":1},"attestation_state":"computed","paper":{"title":"Recoloring graphs via tree decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Marthe Bonamy, Nicolas Bousquet","submitted_at":"2014-03-25T15:14:33Z","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1403.6386","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-03-25T15:14:33Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"5e7128489a081f9a885330154c606b6d0e33deede5386b609f930858d88c481c","abstract_canon_sha256":"840f87ced7ab9f9f28d6842bb7790304ac4c9dac6a0032e76434104d3ef500c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:37.032976Z","signature_b64":"hHBKt/vCyaKeYffAdVEG1mGrhcdP6wWdlqxPBlPtjCX9Zhr6KkYh0ZhbP3IKsQdSh55DCOawh2V6P44CHjnhDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f1f9e9801f3d29da309d3b4fc6ca059455f4d86ba581356eef72e21866d1a0e","last_reissued_at":"2026-05-18T02:55:37.032322Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:37.032322Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recoloring graphs via tree decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Marthe Bonamy, Nicolas Bousquet","submitted_at":"2014-03-25T15:14:33Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6386","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1403.6386","created_at":"2026-05-18T02:55:37.032414+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.6386v1","created_at":"2026-05-18T02:55:37.032414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6386","created_at":"2026-05-18T02:55:37.032414+00:00"},{"alias_kind":"pith_short_12","alias_value":"L4PZ5GAB6PJJ","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"L4PZ5GAB6PJJ3IYJ","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"L4PZ5GAB","created_at":"2026-05-18T12:28:35.611951+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L4PZ5GAB6PJJ3IYJ2O2PY3FALF","json":"https://pith.science/pith/L4PZ5GAB6PJJ3IYJ2O2PY3FALF.json","graph_json":"https://pith.science/api/pith-number/L4PZ5GAB6PJJ3IYJ2O2PY3FALF/graph.json","events_json":"https://pith.science/api/pith-number/L4PZ5GAB6PJJ3IYJ2O2PY3FALF/events.json","paper":"https://pith.science/paper/L4PZ5GAB"},"agent_actions":{"view_html":"https://pith.science/pith/L4PZ5GAB6PJJ3IYJ2O2PY3FALF","download_json":"https://pith.science/pith/L4PZ5GAB6PJJ3IYJ2O2PY3FALF.json","view_paper":"https://pith.science/paper/L4PZ5GAB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.6386&json=true","fetch_graph":"https://pith.science/api/pith-number/L4PZ5GAB6PJJ3IYJ2O2PY3FALF/graph.json","fetch_events":"https://pith.science/api/pith-number/L4PZ5GAB6PJJ3IYJ2O2PY3FALF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L4PZ5GAB6PJJ3IYJ2O2PY3FALF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L4PZ5GAB6PJJ3IYJ2O2PY3FALF/action/storage_attestation","attest_author":"https://pith.science/pith/L4PZ5GAB6PJJ3IYJ2O2PY3FALF/action/author_attestation","sign_citation":"https://pith.science/pith/L4PZ5GAB6PJJ3IYJ2O2PY3FALF/action/citation_signature","submit_replication":"https://pith.science/pith/L4PZ5GAB6PJJ3IYJ2O2PY3FALF/action/replication_record"}},"created_at":"2026-05-18T02:55:37.032414+00:00","updated_at":"2026-05-18T02:55:37.032414+00:00"}