{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4SANWM3M67LX3VEFX637F5MJLA","short_pith_number":"pith:4SANWM3M","schema_version":"1.0","canonical_sha256":"e480db336cf7d77dd485bfb7f2f5895828fc40754cd871bb7eb67c32a1d675d1","source":{"kind":"arxiv","id":"1404.0337","version":2},"attestation_state":"computed","paper":{"title":"The Complexity of Bounded Length Graph Recoloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Amer E. Mouawad, Paul Bonsma","submitted_at":"2014-04-01T18:38:49Z","abstract_excerpt":"We study the following question: Given are two $k$-colorings $\\alpha$ and $\\beta$ of a graph $G$ on $n$ vertices, and integer $\\ell$. The question is whether $\\alpha$ can be modified into $\\beta$, by recoloring vertices one at a time, while maintaining a $k$-coloring throughout, and using at most $\\ell$ such recoloring steps. This problem is weakly PSPACE-hard for every constant $k\\ge 4$. We show that it is also strongly NP-hard for every constant $k\\ge 4$. On the positive side, we give an $O(f(k,\\ell) n^{O(1)})$ algorithm for the problem, for some computable function $f$. Hence the problem is"},"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":"1404.0337","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-04-01T18:38:49Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"57c8670a95ad63b6b61d08fa30cea87a0ded66c42e599b15ca427d8a78359100","abstract_canon_sha256":"46309a10960b0b69c50a7c97b858e1479d99f8e9d43e5cb5f441d68e7afea391"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:06.523421Z","signature_b64":"i0ZaN+exHprmyfURjc1o1jOZuf7SGv885UJIiUHq/T34uCBR4H25DUEtSqgXLsFgG4YJtK+FP+YHnqVFQH+nBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e480db336cf7d77dd485bfb7f2f5895828fc40754cd871bb7eb67c32a1d675d1","last_reissued_at":"2026-05-18T02:54:06.522825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:06.522825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Bounded Length Graph Recoloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Amer E. Mouawad, Paul Bonsma","submitted_at":"2014-04-01T18:38:49Z","abstract_excerpt":"We study the following question: Given are two $k$-colorings $\\alpha$ and $\\beta$ of a graph $G$ on $n$ vertices, and integer $\\ell$. The question is whether $\\alpha$ can be modified into $\\beta$, by recoloring vertices one at a time, while maintaining a $k$-coloring throughout, and using at most $\\ell$ such recoloring steps. This problem is weakly PSPACE-hard for every constant $k\\ge 4$. We show that it is also strongly NP-hard for every constant $k\\ge 4$. On the positive side, we give an $O(f(k,\\ell) n^{O(1)})$ algorithm for the problem, for some computable function $f$. Hence the problem is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0337","kind":"arxiv","version":2},"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":"1404.0337","created_at":"2026-05-18T02:54:06.522924+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.0337v2","created_at":"2026-05-18T02:54:06.522924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0337","created_at":"2026-05-18T02:54:06.522924+00:00"},{"alias_kind":"pith_short_12","alias_value":"4SANWM3M67LX","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4SANWM3M67LX3VEF","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4SANWM3M","created_at":"2026-05-18T12:28:14.216126+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/4SANWM3M67LX3VEFX637F5MJLA","json":"https://pith.science/pith/4SANWM3M67LX3VEFX637F5MJLA.json","graph_json":"https://pith.science/api/pith-number/4SANWM3M67LX3VEFX637F5MJLA/graph.json","events_json":"https://pith.science/api/pith-number/4SANWM3M67LX3VEFX637F5MJLA/events.json","paper":"https://pith.science/paper/4SANWM3M"},"agent_actions":{"view_html":"https://pith.science/pith/4SANWM3M67LX3VEFX637F5MJLA","download_json":"https://pith.science/pith/4SANWM3M67LX3VEFX637F5MJLA.json","view_paper":"https://pith.science/paper/4SANWM3M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.0337&json=true","fetch_graph":"https://pith.science/api/pith-number/4SANWM3M67LX3VEFX637F5MJLA/graph.json","fetch_events":"https://pith.science/api/pith-number/4SANWM3M67LX3VEFX637F5MJLA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4SANWM3M67LX3VEFX637F5MJLA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4SANWM3M67LX3VEFX637F5MJLA/action/storage_attestation","attest_author":"https://pith.science/pith/4SANWM3M67LX3VEFX637F5MJLA/action/author_attestation","sign_citation":"https://pith.science/pith/4SANWM3M67LX3VEFX637F5MJLA/action/citation_signature","submit_replication":"https://pith.science/pith/4SANWM3M67LX3VEFX637F5MJLA/action/replication_record"}},"created_at":"2026-05-18T02:54:06.522924+00:00","updated_at":"2026-05-18T02:54:06.522924+00:00"}