{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LKZSCIR5PAWAJHPNCEHN7KF4B7","short_pith_number":"pith:LKZSCIR5","canonical_record":{"source":{"id":"1609.00109","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-01T05:05:47Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4bf64fc8b42902c211542275af52019ccadff7f396267ef100f8f75be699b556","abstract_canon_sha256":"b6e59759a4e2e2dada01c3018e95e50084268b9648ee54b030ace6ad9e6d100e"},"schema_version":"1.0"},"canonical_sha256":"5ab321223d782c049ded110edfa8bc0ffd5728339aaea7fef7b35b5c06128dd1","source":{"kind":"arxiv","id":"1609.00109","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00109","created_at":"2026-05-18T01:06:27Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00109v1","created_at":"2026-05-18T01:06:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00109","created_at":"2026-05-18T01:06:27Z"},{"alias_kind":"pith_short_12","alias_value":"LKZSCIR5PAWA","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LKZSCIR5PAWAJHPN","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LKZSCIR5","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LKZSCIR5PAWAJHPNCEHN7KF4B7","target":"record","payload":{"canonical_record":{"source":{"id":"1609.00109","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-01T05:05:47Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4bf64fc8b42902c211542275af52019ccadff7f396267ef100f8f75be699b556","abstract_canon_sha256":"b6e59759a4e2e2dada01c3018e95e50084268b9648ee54b030ace6ad9e6d100e"},"schema_version":"1.0"},"canonical_sha256":"5ab321223d782c049ded110edfa8bc0ffd5728339aaea7fef7b35b5c06128dd1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:27.897777Z","signature_b64":"p2DR82CbsUq+2JdI0F4vQHDH2DWFsPbDaMwwyaoFbSfBs2VbkwWIGmnEl4TbjgK1FtL/Los9WKwBefbn2DI4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ab321223d782c049ded110edfa8bc0ffd5728339aaea7fef7b35b5c06128dd1","last_reissued_at":"2026-05-18T01:06:27.897222Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:27.897222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.00109","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:06:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yKflfXDXgWzasySapuY3A++v+rP2U435KXeftY16HK9YBRUbdldzU28wTn0a8tBb/D2/92/PMsyB6xdvjYdEDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:08:24.549229Z"},"content_sha256":"75bac6a45dca4e5ce48907a4549f65c76633cb81ae30ff7eae00f0ad75e9136a","schema_version":"1.0","event_id":"sha256:75bac6a45dca4e5ce48907a4549f65c76633cb81ae30ff7eae00f0ad75e9136a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LKZSCIR5PAWAJHPNCEHN7KF4B7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of (List) Edge-Coloring Reconfiguration Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DM","authors_text":"Akira Suzuki, Hiroki Osawa, Takehiro Ito, Xiao Zhou","submitted_at":"2016-09-01T05:05:47Z","abstract_excerpt":"Let $G$ be a graph such that each edge has its list of available colors, and assume that each list is a subset of the common set consisting of $k$ colors. Suppose that we are given two list edge-colorings $f_0$ and $f_r$ of $G$, and asked whether there exists a sequence of list edge-colorings of $G$ between $f_0$ and $f_r$ such that each list edge-coloring can be obtained from the previous one by changing a color assignment of exactly one edge. This problem is known to be PSPACE-complete for every integer $k \\ge 6$ and planar graphs of maximum degree three, but any complexity hardness was unkn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00109","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:06:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b2Xi4Vf+QLk9HANpg4W1VrTsqG6q1o6fe0/8GlUmU7G58eil0hus5CfVElsrhQC/KZrmB47YwfjhZf7fW8MpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:08:24.549835Z"},"content_sha256":"b5db78cd412e070cd364a7015236ac310d73acad0a0ff09b3b958159701f3566","schema_version":"1.0","event_id":"sha256:b5db78cd412e070cd364a7015236ac310d73acad0a0ff09b3b958159701f3566"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LKZSCIR5PAWAJHPNCEHN7KF4B7/bundle.json","state_url":"https://pith.science/pith/LKZSCIR5PAWAJHPNCEHN7KF4B7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LKZSCIR5PAWAJHPNCEHN7KF4B7/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-06T15:08:24Z","links":{"resolver":"https://pith.science/pith/LKZSCIR5PAWAJHPNCEHN7KF4B7","bundle":"https://pith.science/pith/LKZSCIR5PAWAJHPNCEHN7KF4B7/bundle.json","state":"https://pith.science/pith/LKZSCIR5PAWAJHPNCEHN7KF4B7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LKZSCIR5PAWAJHPNCEHN7KF4B7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LKZSCIR5PAWAJHPNCEHN7KF4B7","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":"b6e59759a4e2e2dada01c3018e95e50084268b9648ee54b030ace6ad9e6d100e","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-01T05:05:47Z","title_canon_sha256":"4bf64fc8b42902c211542275af52019ccadff7f396267ef100f8f75be699b556"},"schema_version":"1.0","source":{"id":"1609.00109","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00109","created_at":"2026-05-18T01:06:27Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00109v1","created_at":"2026-05-18T01:06:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00109","created_at":"2026-05-18T01:06:27Z"},{"alias_kind":"pith_short_12","alias_value":"LKZSCIR5PAWA","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LKZSCIR5PAWAJHPN","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LKZSCIR5","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:b5db78cd412e070cd364a7015236ac310d73acad0a0ff09b3b958159701f3566","target":"graph","created_at":"2026-05-18T01:06:27Z","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":"Let $G$ be a graph such that each edge has its list of available colors, and assume that each list is a subset of the common set consisting of $k$ colors. Suppose that we are given two list edge-colorings $f_0$ and $f_r$ of $G$, and asked whether there exists a sequence of list edge-colorings of $G$ between $f_0$ and $f_r$ such that each list edge-coloring can be obtained from the previous one by changing a color assignment of exactly one edge. This problem is known to be PSPACE-complete for every integer $k \\ge 6$ and planar graphs of maximum degree three, but any complexity hardness was unkn","authors_text":"Akira Suzuki, Hiroki Osawa, Takehiro Ito, Xiao Zhou","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-01T05:05:47Z","title":"The Complexity of (List) Edge-Coloring Reconfiguration Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00109","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:75bac6a45dca4e5ce48907a4549f65c76633cb81ae30ff7eae00f0ad75e9136a","target":"record","created_at":"2026-05-18T01:06:27Z","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":"b6e59759a4e2e2dada01c3018e95e50084268b9648ee54b030ace6ad9e6d100e","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-01T05:05:47Z","title_canon_sha256":"4bf64fc8b42902c211542275af52019ccadff7f396267ef100f8f75be699b556"},"schema_version":"1.0","source":{"id":"1609.00109","kind":"arxiv","version":1}},"canonical_sha256":"5ab321223d782c049ded110edfa8bc0ffd5728339aaea7fef7b35b5c06128dd1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ab321223d782c049ded110edfa8bc0ffd5728339aaea7fef7b35b5c06128dd1","first_computed_at":"2026-05-18T01:06:27.897222Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:27.897222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p2DR82CbsUq+2JdI0F4vQHDH2DWFsPbDaMwwyaoFbSfBs2VbkwWIGmnEl4TbjgK1FtL/Los9WKwBefbn2DI4Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:27.897777Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.00109","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75bac6a45dca4e5ce48907a4549f65c76633cb81ae30ff7eae00f0ad75e9136a","sha256:b5db78cd412e070cd364a7015236ac310d73acad0a0ff09b3b958159701f3566"],"state_sha256":"6d3ab9a84496919c27c4dd0a2f1c0f3159c406be4ac5103ce389f7830074ddd4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QbFXQGUySSVPlGseaSo+uaox9V+LOX0DSHyAUGbCpDL8O+tKEh/kKTV4fHneak4rnknaJqfF2hFy+gxteAHJCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T15:08:24.553624Z","bundle_sha256":"f05c28a266f4df71f56b9fd992dd5a562b8e49c092802b94972b5875e0691f0f"}}