{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LKZSCIR5PAWAJHPNCEHN7KF4B7","short_pith_number":"pith:LKZSCIR5","schema_version":"1.0","canonical_sha256":"5ab321223d782c049ded110edfa8bc0ffd5728339aaea7fef7b35b5c06128dd1","source":{"kind":"arxiv","id":"1609.00109","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.00109","created_at":"2026-05-18T01:06:27.897294+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.00109v1","created_at":"2026-05-18T01:06:27.897294+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00109","created_at":"2026-05-18T01:06:27.897294+00:00"},{"alias_kind":"pith_short_12","alias_value":"LKZSCIR5PAWA","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LKZSCIR5PAWAJHPN","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LKZSCIR5","created_at":"2026-05-18T12:30:29.479603+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/LKZSCIR5PAWAJHPNCEHN7KF4B7","json":"https://pith.science/pith/LKZSCIR5PAWAJHPNCEHN7KF4B7.json","graph_json":"https://pith.science/api/pith-number/LKZSCIR5PAWAJHPNCEHN7KF4B7/graph.json","events_json":"https://pith.science/api/pith-number/LKZSCIR5PAWAJHPNCEHN7KF4B7/events.json","paper":"https://pith.science/paper/LKZSCIR5"},"agent_actions":{"view_html":"https://pith.science/pith/LKZSCIR5PAWAJHPNCEHN7KF4B7","download_json":"https://pith.science/pith/LKZSCIR5PAWAJHPNCEHN7KF4B7.json","view_paper":"https://pith.science/paper/LKZSCIR5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.00109&json=true","fetch_graph":"https://pith.science/api/pith-number/LKZSCIR5PAWAJHPNCEHN7KF4B7/graph.json","fetch_events":"https://pith.science/api/pith-number/LKZSCIR5PAWAJHPNCEHN7KF4B7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LKZSCIR5PAWAJHPNCEHN7KF4B7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LKZSCIR5PAWAJHPNCEHN7KF4B7/action/storage_attestation","attest_author":"https://pith.science/pith/LKZSCIR5PAWAJHPNCEHN7KF4B7/action/author_attestation","sign_citation":"https://pith.science/pith/LKZSCIR5PAWAJHPNCEHN7KF4B7/action/citation_signature","submit_replication":"https://pith.science/pith/LKZSCIR5PAWAJHPNCEHN7KF4B7/action/replication_record"}},"created_at":"2026-05-18T01:06:27.897294+00:00","updated_at":"2026-05-18T01:06:27.897294+00:00"}