{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Q2W7E5WUTOFJMS4ETD42O74WUJ","short_pith_number":"pith:Q2W7E5WU","canonical_record":{"source":{"id":"1705.07551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-22T04:22:49Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c1e5b6aa408c6ffa058c0f8011db3fba33273353c0a450337f673850f9c2c8b7","abstract_canon_sha256":"f35190c40e201766d80de4341795195eb5d4c7926b782432c5d7e0a32877f602"},"schema_version":"1.0"},"canonical_sha256":"86adf276d49b8a964b8498f9a77f96a2407ba6f909a85c928706eaa3a5104834","source":{"kind":"arxiv","id":"1705.07551","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07551","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07551v1","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07551","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"pith_short_12","alias_value":"Q2W7E5WUTOFJ","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q2W7E5WUTOFJMS4E","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q2W7E5WU","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Q2W7E5WUTOFJMS4ETD42O74WUJ","target":"record","payload":{"canonical_record":{"source":{"id":"1705.07551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-22T04:22:49Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c1e5b6aa408c6ffa058c0f8011db3fba33273353c0a450337f673850f9c2c8b7","abstract_canon_sha256":"f35190c40e201766d80de4341795195eb5d4c7926b782432c5d7e0a32877f602"},"schema_version":"1.0"},"canonical_sha256":"86adf276d49b8a964b8498f9a77f96a2407ba6f909a85c928706eaa3a5104834","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:05.220310Z","signature_b64":"G5429mO3HaI3mtbq0RfTArjQCTH0OQ7nZk7oyYgzc/Y9cFdkXAoDpN+J9u0d1H4h+N3hfyUohHCplxJ7RDppDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86adf276d49b8a964b8498f9a77f96a2407ba6f909a85c928706eaa3a5104834","last_reissued_at":"2026-05-18T00:44:05.219603Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:05.219603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.07551","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-18T00:44:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ycZ5NKyq+2KvjiW1MY7u0NPyruQoMH8tL85LdgzuJpqC3dw7M4DxYUa4R9zDcui+fKAGVOj6ksUFXOnpvaSxDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T17:15:19.393875Z"},"content_sha256":"e07bb1cbd1e088b2a793dff00dfb49ac706672be04c6c18a1cfe4be8edebf289","schema_version":"1.0","event_id":"sha256:e07bb1cbd1e088b2a793dff00dfb49ac706672be04c6c18a1cfe4be8edebf289"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Q2W7E5WUTOFJMS4ETD42O74WUJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters","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":"2017-05-22T04:22:49Z","abstract_excerpt":"Let $G$ be a graph such that each vertex has its list of available colors, and assume that each list is a subset of the common set consisting of $k$ colors. For two given list colorings of $G$, we study the problem of transforming one into the other by changing only one vertex color assignment at a time, while at all times maintaining a list coloring. This problem is known to be PSPACE-complete even for bounded bandwidth graphs and a fixed constant $k$. In this paper, we study the fixed-parameter tractability of the problem when parameterized by several graph parameters. We first give a fixed-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07551","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-18T00:44:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qpp2dBT6aQAx5xezh30UPgZke7TajESsCVpe0J+ZdcknJjjphbKc5cfEQxjX+y3Uj67VP1/ktffwSIzlfnmTBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T17:15:19.394211Z"},"content_sha256":"30ed41736ef1876f55bfed6ae26f77b7f89659d3ffc0f35f6d51aafbccb95e07","schema_version":"1.0","event_id":"sha256:30ed41736ef1876f55bfed6ae26f77b7f89659d3ffc0f35f6d51aafbccb95e07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q2W7E5WUTOFJMS4ETD42O74WUJ/bundle.json","state_url":"https://pith.science/pith/Q2W7E5WUTOFJMS4ETD42O74WUJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q2W7E5WUTOFJMS4ETD42O74WUJ/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-06T17:15:19Z","links":{"resolver":"https://pith.science/pith/Q2W7E5WUTOFJMS4ETD42O74WUJ","bundle":"https://pith.science/pith/Q2W7E5WUTOFJMS4ETD42O74WUJ/bundle.json","state":"https://pith.science/pith/Q2W7E5WUTOFJMS4ETD42O74WUJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q2W7E5WUTOFJMS4ETD42O74WUJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Q2W7E5WUTOFJMS4ETD42O74WUJ","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":"f35190c40e201766d80de4341795195eb5d4c7926b782432c5d7e0a32877f602","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-22T04:22:49Z","title_canon_sha256":"c1e5b6aa408c6ffa058c0f8011db3fba33273353c0a450337f673850f9c2c8b7"},"schema_version":"1.0","source":{"id":"1705.07551","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07551","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07551v1","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07551","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"pith_short_12","alias_value":"Q2W7E5WUTOFJ","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q2W7E5WUTOFJMS4E","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q2W7E5WU","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:30ed41736ef1876f55bfed6ae26f77b7f89659d3ffc0f35f6d51aafbccb95e07","target":"graph","created_at":"2026-05-18T00:44:05Z","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 vertex has its list of available colors, and assume that each list is a subset of the common set consisting of $k$ colors. For two given list colorings of $G$, we study the problem of transforming one into the other by changing only one vertex color assignment at a time, while at all times maintaining a list coloring. This problem is known to be PSPACE-complete even for bounded bandwidth graphs and a fixed constant $k$. In this paper, we study the fixed-parameter tractability of the problem when parameterized by several graph parameters. We first give a fixed-","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":"2017-05-22T04:22:49Z","title":"Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07551","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:e07bb1cbd1e088b2a793dff00dfb49ac706672be04c6c18a1cfe4be8edebf289","target":"record","created_at":"2026-05-18T00:44:05Z","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":"f35190c40e201766d80de4341795195eb5d4c7926b782432c5d7e0a32877f602","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-22T04:22:49Z","title_canon_sha256":"c1e5b6aa408c6ffa058c0f8011db3fba33273353c0a450337f673850f9c2c8b7"},"schema_version":"1.0","source":{"id":"1705.07551","kind":"arxiv","version":1}},"canonical_sha256":"86adf276d49b8a964b8498f9a77f96a2407ba6f909a85c928706eaa3a5104834","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86adf276d49b8a964b8498f9a77f96a2407ba6f909a85c928706eaa3a5104834","first_computed_at":"2026-05-18T00:44:05.219603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:05.219603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G5429mO3HaI3mtbq0RfTArjQCTH0OQ7nZk7oyYgzc/Y9cFdkXAoDpN+J9u0d1H4h+N3hfyUohHCplxJ7RDppDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:05.220310Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07551","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e07bb1cbd1e088b2a793dff00dfb49ac706672be04c6c18a1cfe4be8edebf289","sha256:30ed41736ef1876f55bfed6ae26f77b7f89659d3ffc0f35f6d51aafbccb95e07"],"state_sha256":"87e6dde4c8310cd16054eddd9b73e7a09d6ff8cf6f07c7b8aae3202d31f0b5bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CxsSgqdNZtBnVSQeyDjRlQCDURZb4JJym4mFROtJqmxic5f6G1B5+zFTdfbq38XzPQkI4bssJHrp1NJW7I6cDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T17:15:19.396740Z","bundle_sha256":"c9440ba588e117c384c45ab9670c44ef8e2e2516222b10400717a6c649c46575"}}