{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:367I5VQYDICLNHG36B5XMPGP44","short_pith_number":"pith:367I5VQY","schema_version":"1.0","canonical_sha256":"dfbe8ed6181a04b69cdbf07b763ccfe7239eabf78203ac1759d4455c8b8476f3","source":{"kind":"arxiv","id":"1807.05322","version":2},"attestation_state":"computed","paper":{"title":"Token Sliding on Split Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eun Jung Kim, Florian Sikora, Michael Lampis, R\\'emy Belmonte, Valia Mitsou, Yota Otachi","submitted_at":"2018-07-14T01:49:50Z","abstract_excerpt":"We consider the complexity of the Independent Set Reconfiguration problem under the Token Sliding rule. In this problem we are given two independent sets of a graph and are asked if we can transform one to the other by repeatedly exchanging a vertex that is currently in the set with one of its neighbors, while maintaining the set independent. Our main result is to show that this problem is PSPACE-complete on split graphs (and hence also on chordal graphs), thus resolving an open problem in this area. We then go on to consider the $c$-Colorable Reconfiguration problem under the same rule, where"},"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":"1807.05322","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-14T01:49:50Z","cross_cats_sorted":[],"title_canon_sha256":"03467419bed9c1ebff9e6ca557276daef12896d07c11bc8da7f09724fd85a457","abstract_canon_sha256":"b33d80ab282ee9a14013cea99e45c2a2964555ab80456d92cb369be8d2e076eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:29.141389Z","signature_b64":"lo17Z/StOfDDedzV7qo+TpvToiyz040TioxLVyj9i86uKhjQ9JeRH3m76AGOkrOjIBEVm3Dj2d/UVCbmPDdlDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfbe8ed6181a04b69cdbf07b763ccfe7239eabf78203ac1759d4455c8b8476f3","last_reissued_at":"2026-05-17T23:55:29.140848Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:29.140848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Token Sliding on Split Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eun Jung Kim, Florian Sikora, Michael Lampis, R\\'emy Belmonte, Valia Mitsou, Yota Otachi","submitted_at":"2018-07-14T01:49:50Z","abstract_excerpt":"We consider the complexity of the Independent Set Reconfiguration problem under the Token Sliding rule. In this problem we are given two independent sets of a graph and are asked if we can transform one to the other by repeatedly exchanging a vertex that is currently in the set with one of its neighbors, while maintaining the set independent. Our main result is to show that this problem is PSPACE-complete on split graphs (and hence also on chordal graphs), thus resolving an open problem in this area. We then go on to consider the $c$-Colorable Reconfiguration problem under the same rule, where"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05322","kind":"arxiv","version":2},"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":"1807.05322","created_at":"2026-05-17T23:55:29.140934+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.05322v2","created_at":"2026-05-17T23:55:29.140934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05322","created_at":"2026-05-17T23:55:29.140934+00:00"},{"alias_kind":"pith_short_12","alias_value":"367I5VQYDICL","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"367I5VQYDICLNHG3","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"367I5VQY","created_at":"2026-05-18T12:32:02.567920+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/367I5VQYDICLNHG36B5XMPGP44","json":"https://pith.science/pith/367I5VQYDICLNHG36B5XMPGP44.json","graph_json":"https://pith.science/api/pith-number/367I5VQYDICLNHG36B5XMPGP44/graph.json","events_json":"https://pith.science/api/pith-number/367I5VQYDICLNHG36B5XMPGP44/events.json","paper":"https://pith.science/paper/367I5VQY"},"agent_actions":{"view_html":"https://pith.science/pith/367I5VQYDICLNHG36B5XMPGP44","download_json":"https://pith.science/pith/367I5VQYDICLNHG36B5XMPGP44.json","view_paper":"https://pith.science/paper/367I5VQY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.05322&json=true","fetch_graph":"https://pith.science/api/pith-number/367I5VQYDICLNHG36B5XMPGP44/graph.json","fetch_events":"https://pith.science/api/pith-number/367I5VQYDICLNHG36B5XMPGP44/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/367I5VQYDICLNHG36B5XMPGP44/action/timestamp_anchor","attest_storage":"https://pith.science/pith/367I5VQYDICLNHG36B5XMPGP44/action/storage_attestation","attest_author":"https://pith.science/pith/367I5VQYDICLNHG36B5XMPGP44/action/author_attestation","sign_citation":"https://pith.science/pith/367I5VQYDICLNHG36B5XMPGP44/action/citation_signature","submit_replication":"https://pith.science/pith/367I5VQYDICLNHG36B5XMPGP44/action/replication_record"}},"created_at":"2026-05-17T23:55:29.140934+00:00","updated_at":"2026-05-17T23:55:29.140934+00:00"}