{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZK3KM7LXDVQHUPP7SVCAMLCCA6","short_pith_number":"pith:ZK3KM7LX","schema_version":"1.0","canonical_sha256":"cab6a67d771d607a3dff9544062c4207ad0a64bd677da056c9602e018c29ce2d","source":{"kind":"arxiv","id":"1407.4235","version":1},"attestation_state":"computed","paper":{"title":"The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Takehiro Ito, Tatsuhiko Hatanaka, Xiao Zhou","submitted_at":"2014-07-16T08:55:12Z","abstract_excerpt":"We study the problem of transforming one list (vertex) coloring of a graph into another list coloring by changing only one vertex color assignment at a time, while at all times maintaining a list coloring, given a list of allowed colors for each vertex. This problem is known to be PSPACE-complete for bipartite planar graphs. In this paper, we first show that the problem remains PSPACE-complete even for bipartite series-parallel graphs, which form a proper subclass of bipartite planar graphs. We note that our reduction indeed shows the PSPACE-completeness for graphs with pathwidth two, and it c"},"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":"1407.4235","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-16T08:55:12Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"570721400c84f3b3b3cb3ec6672c8220ddf12845490f903a085d72eed97f267c","abstract_canon_sha256":"8eec7d46b7eb47174868492b7649e7afadbecacc25c9c4835a21fb3382b5bb65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:43.504344Z","signature_b64":"abPykEklQnkvBBcIisbOC+BVC/vCsKJFkSI9YsKnWJu+bswDkdPPfAb3zL7e8/Ri9t53a4SsZ38qTaqzyuXTBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cab6a67d771d607a3dff9544062c4207ad0a64bd677da056c9602e018c29ce2d","last_reissued_at":"2026-05-18T01:22:43.503761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:43.503761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Takehiro Ito, Tatsuhiko Hatanaka, Xiao Zhou","submitted_at":"2014-07-16T08:55:12Z","abstract_excerpt":"We study the problem of transforming one list (vertex) coloring of a graph into another list coloring by changing only one vertex color assignment at a time, while at all times maintaining a list coloring, given a list of allowed colors for each vertex. This problem is known to be PSPACE-complete for bipartite planar graphs. In this paper, we first show that the problem remains PSPACE-complete even for bipartite series-parallel graphs, which form a proper subclass of bipartite planar graphs. We note that our reduction indeed shows the PSPACE-completeness for graphs with pathwidth two, and it c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4235","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":"1407.4235","created_at":"2026-05-18T01:22:43.503841+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.4235v1","created_at":"2026-05-18T01:22:43.503841+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4235","created_at":"2026-05-18T01:22:43.503841+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZK3KM7LXDVQH","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZK3KM7LXDVQHUPP7","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZK3KM7LX","created_at":"2026-05-18T12:28:59.999130+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/ZK3KM7LXDVQHUPP7SVCAMLCCA6","json":"https://pith.science/pith/ZK3KM7LXDVQHUPP7SVCAMLCCA6.json","graph_json":"https://pith.science/api/pith-number/ZK3KM7LXDVQHUPP7SVCAMLCCA6/graph.json","events_json":"https://pith.science/api/pith-number/ZK3KM7LXDVQHUPP7SVCAMLCCA6/events.json","paper":"https://pith.science/paper/ZK3KM7LX"},"agent_actions":{"view_html":"https://pith.science/pith/ZK3KM7LXDVQHUPP7SVCAMLCCA6","download_json":"https://pith.science/pith/ZK3KM7LXDVQHUPP7SVCAMLCCA6.json","view_paper":"https://pith.science/paper/ZK3KM7LX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.4235&json=true","fetch_graph":"https://pith.science/api/pith-number/ZK3KM7LXDVQHUPP7SVCAMLCCA6/graph.json","fetch_events":"https://pith.science/api/pith-number/ZK3KM7LXDVQHUPP7SVCAMLCCA6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZK3KM7LXDVQHUPP7SVCAMLCCA6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZK3KM7LXDVQHUPP7SVCAMLCCA6/action/storage_attestation","attest_author":"https://pith.science/pith/ZK3KM7LXDVQHUPP7SVCAMLCCA6/action/author_attestation","sign_citation":"https://pith.science/pith/ZK3KM7LXDVQHUPP7SVCAMLCCA6/action/citation_signature","submit_replication":"https://pith.science/pith/ZK3KM7LXDVQHUPP7SVCAMLCCA6/action/replication_record"}},"created_at":"2026-05-18T01:22:43.503841+00:00","updated_at":"2026-05-18T01:22:43.503841+00:00"}