{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZK3KM7LXDVQHUPP7SVCAMLCCA6","short_pith_number":"pith:ZK3KM7LX","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"},"canonical_sha256":"cab6a67d771d607a3dff9544062c4207ad0a64bd677da056c9602e018c29ce2d","source":{"kind":"arxiv","id":"1407.4235","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4235","created_at":"2026-05-18T01:22:43Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4235v1","created_at":"2026-05-18T01:22:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4235","created_at":"2026-05-18T01:22:43Z"},{"alias_kind":"pith_short_12","alias_value":"ZK3KM7LXDVQH","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZK3KM7LXDVQHUPP7","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZK3KM7LX","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZK3KM7LXDVQHUPP7SVCAMLCCA6","target":"record","payload":{"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"},"canonical_sha256":"cab6a67d771d607a3dff9544062c4207ad0a64bd677da056c9602e018c29ce2d","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"},"source_kind":"arxiv","source_id":"1407.4235","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:22:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jHmecv80Ew85iqkC977OrOUiq9QT2zK6wFW52XSqfORRh5HGDAdtINS9iEEz3oKNmfQB5PaengeiN+n74GKbDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:34:05.278218Z"},"content_sha256":"1793c31aa57e92b4d6ab56cab75dd2a41efe2434ccb0af5e8259c1b05a2399e3","schema_version":"1.0","event_id":"sha256:1793c31aa57e92b4d6ab56cab75dd2a41efe2434ccb0af5e8259c1b05a2399e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZK3KM7LXDVQHUPP7SVCAMLCCA6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:22:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zDOwvTrrvxQQsDXqknPCAtiYHhBOYmpYUrDlxdOOdOyXaUYGpnmsoXDziuwYz+/3pB2tFMk0G44RVEawhhDYCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:34:05.278947Z"},"content_sha256":"77184097065f311136d4fe61324b1e5f24986ba1e454edae5ebd72f93185bcd3","schema_version":"1.0","event_id":"sha256:77184097065f311136d4fe61324b1e5f24986ba1e454edae5ebd72f93185bcd3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZK3KM7LXDVQHUPP7SVCAMLCCA6/bundle.json","state_url":"https://pith.science/pith/ZK3KM7LXDVQHUPP7SVCAMLCCA6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZK3KM7LXDVQHUPP7SVCAMLCCA6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T18:34:05Z","links":{"resolver":"https://pith.science/pith/ZK3KM7LXDVQHUPP7SVCAMLCCA6","bundle":"https://pith.science/pith/ZK3KM7LXDVQHUPP7SVCAMLCCA6/bundle.json","state":"https://pith.science/pith/ZK3KM7LXDVQHUPP7SVCAMLCCA6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZK3KM7LXDVQHUPP7SVCAMLCCA6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZK3KM7LXDVQHUPP7SVCAMLCCA6","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":"8eec7d46b7eb47174868492b7649e7afadbecacc25c9c4835a21fb3382b5bb65","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-16T08:55:12Z","title_canon_sha256":"570721400c84f3b3b3cb3ec6672c8220ddf12845490f903a085d72eed97f267c"},"schema_version":"1.0","source":{"id":"1407.4235","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4235","created_at":"2026-05-18T01:22:43Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4235v1","created_at":"2026-05-18T01:22:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4235","created_at":"2026-05-18T01:22:43Z"},{"alias_kind":"pith_short_12","alias_value":"ZK3KM7LXDVQH","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZK3KM7LXDVQHUPP7","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZK3KM7LX","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:77184097065f311136d4fe61324b1e5f24986ba1e454edae5ebd72f93185bcd3","target":"graph","created_at":"2026-05-18T01:22:43Z","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 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","authors_text":"Takehiro Ito, Tatsuhiko Hatanaka, Xiao Zhou","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-16T08:55:12Z","title":"The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4235","kind":"arxiv","version":1},"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:1793c31aa57e92b4d6ab56cab75dd2a41efe2434ccb0af5e8259c1b05a2399e3","target":"record","created_at":"2026-05-18T01:22:43Z","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":"8eec7d46b7eb47174868492b7649e7afadbecacc25c9c4835a21fb3382b5bb65","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-16T08:55:12Z","title_canon_sha256":"570721400c84f3b3b3cb3ec6672c8220ddf12845490f903a085d72eed97f267c"},"schema_version":"1.0","source":{"id":"1407.4235","kind":"arxiv","version":1}},"canonical_sha256":"cab6a67d771d607a3dff9544062c4207ad0a64bd677da056c9602e018c29ce2d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cab6a67d771d607a3dff9544062c4207ad0a64bd677da056c9602e018c29ce2d","first_computed_at":"2026-05-18T01:22:43.503761Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:43.503761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"abPykEklQnkvBBcIisbOC+BVC/vCsKJFkSI9YsKnWJu+bswDkdPPfAb3zL7e8/Ri9t53a4SsZ38qTaqzyuXTBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:43.504344Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.4235","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1793c31aa57e92b4d6ab56cab75dd2a41efe2434ccb0af5e8259c1b05a2399e3","sha256:77184097065f311136d4fe61324b1e5f24986ba1e454edae5ebd72f93185bcd3"],"state_sha256":"f354ffef19469da078a9cb04a73aa7b71012185286d47783147fa6b8a0b2bd39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3TiCL5APu0r5WeIXV73pYy7Vttoc65dO8QDhINR2ukzQ7XfdnHZ2AM7tUwJpUAI5Uxtu6jp8nYQpDT6ZmpSZDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:34:05.282624Z","bundle_sha256":"535d21a4065478ef3923621b04567f3e0ecd839e3d637a514c40b8289abd0ba8"}}