{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XJQHGOW6SH6VCPDWIKDDPPOCHG","short_pith_number":"pith:XJQHGOW6","schema_version":"1.0","canonical_sha256":"ba60733ade91fd513c76428637bdc239b6c0761d00f2ecbeb19145e5c8c074f3","source":{"kind":"arxiv","id":"1411.6997","version":1},"attestation_state":"computed","paper":{"title":"Fast Recoloring of Sparse Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Guillem Perarnau, Nicolas Bousquet","submitted_at":"2014-11-25T20:09:23Z","abstract_excerpt":"In this paper, we show that for every graph of maximum average degree bounded away from $d$, any $(d+1)$-coloring can be transformed into any other one within a polynomial number of vertex recolorings so that, at each step, the current coloring is proper. In particular, it implies that we can transform any $8$-coloring of a planar graph into any other $8$-coloring with a polynomial number of recolorings. These results give some evidence on a conjecture of Cereceda, van den Heuvel and Johnson which asserts that any $(d+2)$ coloring of a $d$-degenerate graph can be transformed into any other one"},"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":"1411.6997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-25T20:09:23Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d5be6cfeda632fd13cc7d71a93fbd272c2b02b1d0fbbae1d20cf40185084d3ac","abstract_canon_sha256":"fb3c2c9f83fbc49f0d3de35fdae026d90c9681b7ecc5e95b33a2b74a216880de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:46.796489Z","signature_b64":"osU7eHuXAex3wKS4n4i6Ae7+fyyxzDYGuRb5hBI2eeuHzJzQyb3m7Vw6cOpYN7F18oIKF+pemY2sxQJCPnecDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba60733ade91fd513c76428637bdc239b6c0761d00f2ecbeb19145e5c8c074f3","last_reissued_at":"2026-05-18T02:32:46.795859Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:46.795859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Recoloring of Sparse Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Guillem Perarnau, Nicolas Bousquet","submitted_at":"2014-11-25T20:09:23Z","abstract_excerpt":"In this paper, we show that for every graph of maximum average degree bounded away from $d$, any $(d+1)$-coloring can be transformed into any other one within a polynomial number of vertex recolorings so that, at each step, the current coloring is proper. In particular, it implies that we can transform any $8$-coloring of a planar graph into any other $8$-coloring with a polynomial number of recolorings. These results give some evidence on a conjecture of Cereceda, van den Heuvel and Johnson which asserts that any $(d+2)$ coloring of a $d$-degenerate graph can be transformed into any other one"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6997","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":"1411.6997","created_at":"2026-05-18T02:32:46.795950+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.6997v1","created_at":"2026-05-18T02:32:46.795950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6997","created_at":"2026-05-18T02:32:46.795950+00:00"},{"alias_kind":"pith_short_12","alias_value":"XJQHGOW6SH6V","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XJQHGOW6SH6VCPDW","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XJQHGOW6","created_at":"2026-05-18T12:28:57.508820+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/XJQHGOW6SH6VCPDWIKDDPPOCHG","json":"https://pith.science/pith/XJQHGOW6SH6VCPDWIKDDPPOCHG.json","graph_json":"https://pith.science/api/pith-number/XJQHGOW6SH6VCPDWIKDDPPOCHG/graph.json","events_json":"https://pith.science/api/pith-number/XJQHGOW6SH6VCPDWIKDDPPOCHG/events.json","paper":"https://pith.science/paper/XJQHGOW6"},"agent_actions":{"view_html":"https://pith.science/pith/XJQHGOW6SH6VCPDWIKDDPPOCHG","download_json":"https://pith.science/pith/XJQHGOW6SH6VCPDWIKDDPPOCHG.json","view_paper":"https://pith.science/paper/XJQHGOW6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.6997&json=true","fetch_graph":"https://pith.science/api/pith-number/XJQHGOW6SH6VCPDWIKDDPPOCHG/graph.json","fetch_events":"https://pith.science/api/pith-number/XJQHGOW6SH6VCPDWIKDDPPOCHG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XJQHGOW6SH6VCPDWIKDDPPOCHG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XJQHGOW6SH6VCPDWIKDDPPOCHG/action/storage_attestation","attest_author":"https://pith.science/pith/XJQHGOW6SH6VCPDWIKDDPPOCHG/action/author_attestation","sign_citation":"https://pith.science/pith/XJQHGOW6SH6VCPDWIKDDPPOCHG/action/citation_signature","submit_replication":"https://pith.science/pith/XJQHGOW6SH6VCPDWIKDDPPOCHG/action/replication_record"}},"created_at":"2026-05-18T02:32:46.795950+00:00","updated_at":"2026-05-18T02:32:46.795950+00:00"}