{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4SANWM3M67LX3VEFX637F5MJLA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"46309a10960b0b69c50a7c97b858e1479d99f8e9d43e5cb5f441d68e7afea391","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-04-01T18:38:49Z","title_canon_sha256":"57c8670a95ad63b6b61d08fa30cea87a0ded66c42e599b15ca427d8a78359100"},"schema_version":"1.0","source":{"id":"1404.0337","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0337","created_at":"2026-05-18T02:54:06Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0337v2","created_at":"2026-05-18T02:54:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0337","created_at":"2026-05-18T02:54:06Z"},{"alias_kind":"pith_short_12","alias_value":"4SANWM3M67LX","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4SANWM3M67LX3VEF","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4SANWM3M","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:24439d25f6b0c96d52da50e975399ce22fa83b4e285445c19eedd26a1fb4c27d","target":"graph","created_at":"2026-05-18T02:54:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Amer E. Mouawad, Paul Bonsma","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-04-01T18:38:49Z","title":"The Complexity of Bounded Length Graph Recoloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0337","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5d258fa70ac8bc40a346114c3f1920e7ca138859f2bcda3bbea02604c5e2a661","target":"record","created_at":"2026-05-18T02:54:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"46309a10960b0b69c50a7c97b858e1479d99f8e9d43e5cb5f441d68e7afea391","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-04-01T18:38:49Z","title_canon_sha256":"57c8670a95ad63b6b61d08fa30cea87a0ded66c42e599b15ca427d8a78359100"},"schema_version":"1.0","source":{"id":"1404.0337","kind":"arxiv","version":2}},"canonical_sha256":"e480db336cf7d77dd485bfb7f2f5895828fc40754cd871bb7eb67c32a1d675d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e480db336cf7d77dd485bfb7f2f5895828fc40754cd871bb7eb67c32a1d675d1","first_computed_at":"2026-05-18T02:54:06.522825Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:06.522825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i0ZaN+exHprmyfURjc1o1jOZuf7SGv885UJIiUHq/T34uCBR4H25DUEtSqgXLsFgG4YJtK+FP+YHnqVFQH+nBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:06.523421Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.0337","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d258fa70ac8bc40a346114c3f1920e7ca138859f2bcda3bbea02604c5e2a661","sha256:24439d25f6b0c96d52da50e975399ce22fa83b4e285445c19eedd26a1fb4c27d"],"state_sha256":"d9254dad3da9f6f3c319d863e294074890c5476cea2d3649142b97012de78a12"}