{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TH7JFH4BWNAHQYVDYJ5OZLEB2M","short_pith_number":"pith:TH7JFH4B","schema_version":"1.0","canonical_sha256":"99fe929f81b3407862a3c27aecac81d3185ca7bd24275619572e8a56c0c43e87","source":{"kind":"arxiv","id":"1501.05800","version":1},"attestation_state":"computed","paper":{"title":"A Reconfigurations Analogue of Brooks' Theorem and its Consequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.CC","authors_text":"Carl Feghali, Dani\\\"el Paulusma, Matthew Johnson","submitted_at":"2015-01-23T13:50:07Z","abstract_excerpt":"Let $G$ be a simple undirected graph on $n$ vertices with maximum degree~$\\Delta$. Brooks' Theorem states that $G$ has a $\\Delta$-colouring unless~$G$ is a complete graph, or a cycle with an odd number of vertices. To recolour $G$ is to obtain a new proper colouring by changing the colour of one vertex. We show an analogue of Brooks' Theorem by proving that from any $k$-colouring, $k>\\Delta$, a $\\Delta$-colouring of $G$ can be obtained by a sequence of $O(n^2)$ recolourings using only the original $k$ colours unless $G$ is a complete graph or a cycle with an odd number of vertices, or $k=\\Delt"},"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":"1501.05800","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-01-23T13:50:07Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"b4d5a3e6cd9fcd1c3ae5b4a8b12a25a86c3acbfbccf9e3a56f4299ec97c8fcb6","abstract_canon_sha256":"7d91f6455ac04ae2e212856478c5d4e488f192251a5e7cdc38c2ddd5f69fb3da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:48.954414Z","signature_b64":"/W/D3CEleRy+OUbbXopES7DY3Sox1WrRghWG0OChasw6tcxViInH6EzIyt1qTui1fPTXlMYyelh5o0CdZM7zCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99fe929f81b3407862a3c27aecac81d3185ca7bd24275619572e8a56c0c43e87","last_reissued_at":"2026-05-18T02:28:48.954036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:48.954036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Reconfigurations Analogue of Brooks' Theorem and its Consequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.CC","authors_text":"Carl Feghali, Dani\\\"el Paulusma, Matthew Johnson","submitted_at":"2015-01-23T13:50:07Z","abstract_excerpt":"Let $G$ be a simple undirected graph on $n$ vertices with maximum degree~$\\Delta$. Brooks' Theorem states that $G$ has a $\\Delta$-colouring unless~$G$ is a complete graph, or a cycle with an odd number of vertices. To recolour $G$ is to obtain a new proper colouring by changing the colour of one vertex. We show an analogue of Brooks' Theorem by proving that from any $k$-colouring, $k>\\Delta$, a $\\Delta$-colouring of $G$ can be obtained by a sequence of $O(n^2)$ recolourings using only the original $k$ colours unless $G$ is a complete graph or a cycle with an odd number of vertices, or $k=\\Delt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05800","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":"1501.05800","created_at":"2026-05-18T02:28:48.954094+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.05800v1","created_at":"2026-05-18T02:28:48.954094+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05800","created_at":"2026-05-18T02:28:48.954094+00:00"},{"alias_kind":"pith_short_12","alias_value":"TH7JFH4BWNAH","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TH7JFH4BWNAHQYVD","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TH7JFH4B","created_at":"2026-05-18T12:29:42.218222+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/TH7JFH4BWNAHQYVDYJ5OZLEB2M","json":"https://pith.science/pith/TH7JFH4BWNAHQYVDYJ5OZLEB2M.json","graph_json":"https://pith.science/api/pith-number/TH7JFH4BWNAHQYVDYJ5OZLEB2M/graph.json","events_json":"https://pith.science/api/pith-number/TH7JFH4BWNAHQYVDYJ5OZLEB2M/events.json","paper":"https://pith.science/paper/TH7JFH4B"},"agent_actions":{"view_html":"https://pith.science/pith/TH7JFH4BWNAHQYVDYJ5OZLEB2M","download_json":"https://pith.science/pith/TH7JFH4BWNAHQYVDYJ5OZLEB2M.json","view_paper":"https://pith.science/paper/TH7JFH4B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.05800&json=true","fetch_graph":"https://pith.science/api/pith-number/TH7JFH4BWNAHQYVDYJ5OZLEB2M/graph.json","fetch_events":"https://pith.science/api/pith-number/TH7JFH4BWNAHQYVDYJ5OZLEB2M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TH7JFH4BWNAHQYVDYJ5OZLEB2M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TH7JFH4BWNAHQYVDYJ5OZLEB2M/action/storage_attestation","attest_author":"https://pith.science/pith/TH7JFH4BWNAHQYVDYJ5OZLEB2M/action/author_attestation","sign_citation":"https://pith.science/pith/TH7JFH4BWNAHQYVDYJ5OZLEB2M/action/citation_signature","submit_replication":"https://pith.science/pith/TH7JFH4BWNAHQYVDYJ5OZLEB2M/action/replication_record"}},"created_at":"2026-05-18T02:28:48.954094+00:00","updated_at":"2026-05-18T02:28:48.954094+00:00"}