{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DP2NSNPJCZDN36GHSSKUIWT7DG","short_pith_number":"pith:DP2NSNPJ","schema_version":"1.0","canonical_sha256":"1bf4d935e91646ddf8c79495445a7f19998e6a5ecf1481705b60ebdb5bdfddc7","source":{"kind":"arxiv","id":"1406.6576","version":2},"attestation_state":"computed","paper":{"title":"Linear-Time Algorithm for Sliding Tokens on Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Duc A. Hoang, Eli Fox-Epstein, Erik D. Demaine, Hirotaka Ono, Martin L. Demaine, Ryuhei Uehara, Takehiro Ito, Takeshi Yamada, Yota Otachi","submitted_at":"2014-06-25T14:06:40Z","abstract_excerpt":"Suppose that we are given two independent sets $I_b$ and $I_r$ of a graph such that $|I_b|=|I_r|$, and imagine that a token is placed on each vertex in $I_b$. Then, the sliding token problem is to determine whether there exists a sequence of independent sets which transforms $I_b$ into $I_r$ so that each independent set in the sequence results from the previous one by sliding exactly one token along an edge in the graph. This problem is known to be PSPACE-complete even for planar graphs, and also for bounded treewidth graphs. In this paper, we thus study the problem restricted to trees, and gi"},"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":"1406.6576","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-06-25T14:06:40Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"594373267231f24c903a0b44c0e705426a53830046e9049122db7cbc4fe69e47","abstract_canon_sha256":"a5d311eee6ef354bfa6544230f6f4ae92b8f00fc69a3820fa2ec77d5daa389b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:46.777237Z","signature_b64":"SbIvApxDHf5g88pIFJO93f2C45XEVQ9z22bhECBPly2h0bnYnIApOqKlV1VL4NoduHltjQcwoOil3zR7BsuuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bf4d935e91646ddf8c79495445a7f19998e6a5ecf1481705b60ebdb5bdfddc7","last_reissued_at":"2026-05-18T02:43:46.776776Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:46.776776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear-Time Algorithm for Sliding Tokens on Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Duc A. Hoang, Eli Fox-Epstein, Erik D. Demaine, Hirotaka Ono, Martin L. Demaine, Ryuhei Uehara, Takehiro Ito, Takeshi Yamada, Yota Otachi","submitted_at":"2014-06-25T14:06:40Z","abstract_excerpt":"Suppose that we are given two independent sets $I_b$ and $I_r$ of a graph such that $|I_b|=|I_r|$, and imagine that a token is placed on each vertex in $I_b$. Then, the sliding token problem is to determine whether there exists a sequence of independent sets which transforms $I_b$ into $I_r$ so that each independent set in the sequence results from the previous one by sliding exactly one token along an edge in the graph. This problem is known to be PSPACE-complete even for planar graphs, and also for bounded treewidth graphs. In this paper, we thus study the problem restricted to trees, and gi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6576","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":"1406.6576","created_at":"2026-05-18T02:43:46.776887+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.6576v2","created_at":"2026-05-18T02:43:46.776887+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6576","created_at":"2026-05-18T02:43:46.776887+00:00"},{"alias_kind":"pith_short_12","alias_value":"DP2NSNPJCZDN","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DP2NSNPJCZDN36GH","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DP2NSNPJ","created_at":"2026-05-18T12:28:25.294606+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/DP2NSNPJCZDN36GHSSKUIWT7DG","json":"https://pith.science/pith/DP2NSNPJCZDN36GHSSKUIWT7DG.json","graph_json":"https://pith.science/api/pith-number/DP2NSNPJCZDN36GHSSKUIWT7DG/graph.json","events_json":"https://pith.science/api/pith-number/DP2NSNPJCZDN36GHSSKUIWT7DG/events.json","paper":"https://pith.science/paper/DP2NSNPJ"},"agent_actions":{"view_html":"https://pith.science/pith/DP2NSNPJCZDN36GHSSKUIWT7DG","download_json":"https://pith.science/pith/DP2NSNPJCZDN36GHSSKUIWT7DG.json","view_paper":"https://pith.science/paper/DP2NSNPJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.6576&json=true","fetch_graph":"https://pith.science/api/pith-number/DP2NSNPJCZDN36GHSSKUIWT7DG/graph.json","fetch_events":"https://pith.science/api/pith-number/DP2NSNPJCZDN36GHSSKUIWT7DG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DP2NSNPJCZDN36GHSSKUIWT7DG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DP2NSNPJCZDN36GHSSKUIWT7DG/action/storage_attestation","attest_author":"https://pith.science/pith/DP2NSNPJCZDN36GHSSKUIWT7DG/action/author_attestation","sign_citation":"https://pith.science/pith/DP2NSNPJCZDN36GHSSKUIWT7DG/action/citation_signature","submit_replication":"https://pith.science/pith/DP2NSNPJCZDN36GHSSKUIWT7DG/action/replication_record"}},"created_at":"2026-05-18T02:43:46.776887+00:00","updated_at":"2026-05-18T02:43:46.776887+00:00"}