{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KEGQROT6GRHGXQIB5LSOHA5ITG","short_pith_number":"pith:KEGQROT6","schema_version":"1.0","canonical_sha256":"510d08ba7e344e6bc101eae4e383a899aac2bc2baab6b125bb1e2a214079bf89","source":{"kind":"arxiv","id":"1605.00442","version":1},"attestation_state":"computed","paper":{"title":"Token Sliding on Chordal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Marthe Bonamy, Nicolas Bousquet","submitted_at":"2016-05-02T11:42:54Z","abstract_excerpt":"Let I be an independent set of a graph G. Imagine that a token is located on any vertex of I. We can now move the tokens of I along the edges of the graph as long as the set of tokens still defines an independent set of G. Given two independent sets I and J, the Token Sliding problem consists in deciding whether there exists a sequence of independent sets which transforms I into J so that every pair of consecutive independent sets of the sequence can be obtained via a token move. This problem is known to be PSPACE-complete even on planar graphs.\n  In 2014, Demaine et al. asked whether the Toke"},"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":"1605.00442","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-05-02T11:42:54Z","cross_cats_sorted":[],"title_canon_sha256":"4444b379c010996eaa69192caa835bdcb80e1d8d2d3d941bf0574cf750b0a9fa","abstract_canon_sha256":"8c2650bbcf44b4c50c587e25a9faf55bfc7c8651f847fc7311bb484458d610e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:55.797514Z","signature_b64":"RMa+qOyTyv0AvhhKfBLt1UhnSmSYYj5nbfzktbEwZd86zEmUwpSYM4sMIUF64afBtHvxVPYlHOFUoRC9h9x5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"510d08ba7e344e6bc101eae4e383a899aac2bc2baab6b125bb1e2a214079bf89","last_reissued_at":"2026-05-18T01:15:55.796833Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:55.796833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Token Sliding on Chordal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Marthe Bonamy, Nicolas Bousquet","submitted_at":"2016-05-02T11:42:54Z","abstract_excerpt":"Let I be an independent set of a graph G. Imagine that a token is located on any vertex of I. We can now move the tokens of I along the edges of the graph as long as the set of tokens still defines an independent set of G. Given two independent sets I and J, the Token Sliding problem consists in deciding whether there exists a sequence of independent sets which transforms I into J so that every pair of consecutive independent sets of the sequence can be obtained via a token move. This problem is known to be PSPACE-complete even on planar graphs.\n  In 2014, Demaine et al. asked whether the Toke"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00442","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":"1605.00442","created_at":"2026-05-18T01:15:55.796943+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.00442v1","created_at":"2026-05-18T01:15:55.796943+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00442","created_at":"2026-05-18T01:15:55.796943+00:00"},{"alias_kind":"pith_short_12","alias_value":"KEGQROT6GRHG","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KEGQROT6GRHGXQIB","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KEGQROT6","created_at":"2026-05-18T12:30:25.849896+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/KEGQROT6GRHGXQIB5LSOHA5ITG","json":"https://pith.science/pith/KEGQROT6GRHGXQIB5LSOHA5ITG.json","graph_json":"https://pith.science/api/pith-number/KEGQROT6GRHGXQIB5LSOHA5ITG/graph.json","events_json":"https://pith.science/api/pith-number/KEGQROT6GRHGXQIB5LSOHA5ITG/events.json","paper":"https://pith.science/paper/KEGQROT6"},"agent_actions":{"view_html":"https://pith.science/pith/KEGQROT6GRHGXQIB5LSOHA5ITG","download_json":"https://pith.science/pith/KEGQROT6GRHGXQIB5LSOHA5ITG.json","view_paper":"https://pith.science/paper/KEGQROT6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.00442&json=true","fetch_graph":"https://pith.science/api/pith-number/KEGQROT6GRHGXQIB5LSOHA5ITG/graph.json","fetch_events":"https://pith.science/api/pith-number/KEGQROT6GRHGXQIB5LSOHA5ITG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KEGQROT6GRHGXQIB5LSOHA5ITG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KEGQROT6GRHGXQIB5LSOHA5ITG/action/storage_attestation","attest_author":"https://pith.science/pith/KEGQROT6GRHGXQIB5LSOHA5ITG/action/author_attestation","sign_citation":"https://pith.science/pith/KEGQROT6GRHGXQIB5LSOHA5ITG/action/citation_signature","submit_replication":"https://pith.science/pith/KEGQROT6GRHGXQIB5LSOHA5ITG/action/replication_record"}},"created_at":"2026-05-18T01:15:55.796943+00:00","updated_at":"2026-05-18T01:15:55.796943+00:00"}