{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LEVB6TO5K2R6NV5Q3QNOLK6VAZ","short_pith_number":"pith:LEVB6TO5","schema_version":"1.0","canonical_sha256":"592a1f4ddd56a3e6d7b0dc1ae5abd5064ed08c5c31c4742932c701adb0b42cb8","source":{"kind":"arxiv","id":"1403.6347","version":4},"attestation_state":"computed","paper":{"title":"Finding Shortest Paths between Graph Colourings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Dani\\\"el Paulusma, Dieter Kratsch, Matthew Johnson, Stefan Kratsch, Viresh Patel","submitted_at":"2014-03-25T13:56:21Z","abstract_excerpt":"The $k$-colouring reconfiguration problem asks whether, for a given graph $G$, two proper $k$-colourings $\\alpha$ and $\\beta$ of $G$, and a positive integer $\\ell$, there exists a sequence of at most $\\ell+1$ proper $k$-colourings of $G$ which starts with $\\alpha$ and ends with $\\beta$ and where successive colourings in the sequence differ on exactly one vertex of $G$. We give a complete picture of the parameterized complexity of the $k$-colouring reconfiguration problem for each fixed $k$ when parameterized by $\\ell$. First we show that the $k$-colouring reconfiguration problem is polynomial-"},"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.6347","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-03-25T13:56:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"cd2d0fe513456134990e10a27ed38c4761a506ed258958314f11fd758ef5aa84","abstract_canon_sha256":"a730d16d274cd977c49959427ec9d800d1c5e646ea9f910c3763581342ae257a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:08.824773Z","signature_b64":"W3hApC2K9dSbcNcNngVl7ZbY+Nh9j+V0rQj+TNHMJX8j8e/9RCwjrbxHi5HvkMuO3BnkMXWWLUWGYsPbTqWEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"592a1f4ddd56a3e6d7b0dc1ae5abd5064ed08c5c31c4742932c701adb0b42cb8","last_reissued_at":"2026-05-18T02:39:08.824269Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:08.824269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Shortest Paths between Graph Colourings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Dani\\\"el Paulusma, Dieter Kratsch, Matthew Johnson, Stefan Kratsch, Viresh Patel","submitted_at":"2014-03-25T13:56:21Z","abstract_excerpt":"The $k$-colouring reconfiguration problem asks whether, for a given graph $G$, two proper $k$-colourings $\\alpha$ and $\\beta$ of $G$, and a positive integer $\\ell$, there exists a sequence of at most $\\ell+1$ proper $k$-colourings of $G$ which starts with $\\alpha$ and ends with $\\beta$ and where successive colourings in the sequence differ on exactly one vertex of $G$. We give a complete picture of the parameterized complexity of the $k$-colouring reconfiguration problem for each fixed $k$ when parameterized by $\\ell$. First we show that the $k$-colouring reconfiguration problem is polynomial-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6347","kind":"arxiv","version":4},"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.6347","created_at":"2026-05-18T02:39:08.824358+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.6347v4","created_at":"2026-05-18T02:39:08.824358+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6347","created_at":"2026-05-18T02:39:08.824358+00:00"},{"alias_kind":"pith_short_12","alias_value":"LEVB6TO5K2R6","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LEVB6TO5K2R6NV5Q","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LEVB6TO5","created_at":"2026-05-18T12:28:38.356838+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/LEVB6TO5K2R6NV5Q3QNOLK6VAZ","json":"https://pith.science/pith/LEVB6TO5K2R6NV5Q3QNOLK6VAZ.json","graph_json":"https://pith.science/api/pith-number/LEVB6TO5K2R6NV5Q3QNOLK6VAZ/graph.json","events_json":"https://pith.science/api/pith-number/LEVB6TO5K2R6NV5Q3QNOLK6VAZ/events.json","paper":"https://pith.science/paper/LEVB6TO5"},"agent_actions":{"view_html":"https://pith.science/pith/LEVB6TO5K2R6NV5Q3QNOLK6VAZ","download_json":"https://pith.science/pith/LEVB6TO5K2R6NV5Q3QNOLK6VAZ.json","view_paper":"https://pith.science/paper/LEVB6TO5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.6347&json=true","fetch_graph":"https://pith.science/api/pith-number/LEVB6TO5K2R6NV5Q3QNOLK6VAZ/graph.json","fetch_events":"https://pith.science/api/pith-number/LEVB6TO5K2R6NV5Q3QNOLK6VAZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LEVB6TO5K2R6NV5Q3QNOLK6VAZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LEVB6TO5K2R6NV5Q3QNOLK6VAZ/action/storage_attestation","attest_author":"https://pith.science/pith/LEVB6TO5K2R6NV5Q3QNOLK6VAZ/action/author_attestation","sign_citation":"https://pith.science/pith/LEVB6TO5K2R6NV5Q3QNOLK6VAZ/action/citation_signature","submit_replication":"https://pith.science/pith/LEVB6TO5K2R6NV5Q3QNOLK6VAZ/action/replication_record"}},"created_at":"2026-05-18T02:39:08.824358+00:00","updated_at":"2026-05-18T02:39:08.824358+00:00"}