{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Q2W7E5WUTOFJMS4ETD42O74WUJ","short_pith_number":"pith:Q2W7E5WU","schema_version":"1.0","canonical_sha256":"86adf276d49b8a964b8498f9a77f96a2407ba6f909a85c928706eaa3a5104834","source":{"kind":"arxiv","id":"1705.07551","version":1},"attestation_state":"computed","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-"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.07551","created_at":"2026-05-18T00:44:05.219718+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.07551v1","created_at":"2026-05-18T00:44:05.219718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07551","created_at":"2026-05-18T00:44:05.219718+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q2W7E5WUTOFJ","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q2W7E5WUTOFJMS4E","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q2W7E5WU","created_at":"2026-05-18T12:31:37.085036+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/Q2W7E5WUTOFJMS4ETD42O74WUJ","json":"https://pith.science/pith/Q2W7E5WUTOFJMS4ETD42O74WUJ.json","graph_json":"https://pith.science/api/pith-number/Q2W7E5WUTOFJMS4ETD42O74WUJ/graph.json","events_json":"https://pith.science/api/pith-number/Q2W7E5WUTOFJMS4ETD42O74WUJ/events.json","paper":"https://pith.science/paper/Q2W7E5WU"},"agent_actions":{"view_html":"https://pith.science/pith/Q2W7E5WUTOFJMS4ETD42O74WUJ","download_json":"https://pith.science/pith/Q2W7E5WUTOFJMS4ETD42O74WUJ.json","view_paper":"https://pith.science/paper/Q2W7E5WU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.07551&json=true","fetch_graph":"https://pith.science/api/pith-number/Q2W7E5WUTOFJMS4ETD42O74WUJ/graph.json","fetch_events":"https://pith.science/api/pith-number/Q2W7E5WUTOFJMS4ETD42O74WUJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q2W7E5WUTOFJMS4ETD42O74WUJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q2W7E5WUTOFJMS4ETD42O74WUJ/action/storage_attestation","attest_author":"https://pith.science/pith/Q2W7E5WUTOFJMS4ETD42O74WUJ/action/author_attestation","sign_citation":"https://pith.science/pith/Q2W7E5WUTOFJMS4ETD42O74WUJ/action/citation_signature","submit_replication":"https://pith.science/pith/Q2W7E5WUTOFJMS4ETD42O74WUJ/action/replication_record"}},"created_at":"2026-05-18T00:44:05.219718+00:00","updated_at":"2026-05-18T00:44:05.219718+00:00"}