{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HTCLUEN5UXRIIVQNVDQSNB7WQ2","short_pith_number":"pith:HTCLUEN5","schema_version":"1.0","canonical_sha256":"3cc4ba11bda5e284560da8e12687f686afcebda671eada31c00e5fd32cd3d0b7","source":{"kind":"arxiv","id":"1406.6567","version":2},"attestation_state":"computed","paper":{"title":"Fixed-Parameter Tractability of Token Jumping on Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Hirotaka Ono, Marcin Kami\\'nski, Takehiro Ito","submitted_at":"2014-06-25T13:49:56Z","abstract_excerpt":"Suppose that we are given two independent sets $I_0$ and $I_r$ of a graph such that $|I_0| = |I_r|$, and imagine that a token is placed on each vertex in $I_0$. The token jumping problem is to determine whether there exists a sequence of independent sets which transforms $I_0$ into $I_r$ so that each independent set in the sequence results from the previous one by moving exactly one token to another vertex. This problem is known to be PSPACE-complete even for planar graphs of maximum degree three, and W[1]-hard for general graphs when parameterized by the number of tokens. In this paper, we pr"},"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.6567","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-06-25T13:49:56Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"dc5b275a178a353e42d7591b56d82a451f9ff46b4a70be556cb75c8fe82f4d1d","abstract_canon_sha256":"27ada780a816525f72913d452ecd8e7d776c9f8c515c0c1c83fbea16c7869847"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:04.759477Z","signature_b64":"HvbM/xRCKmetWG0RPte22WvS5hEw6FlWhtNzEmMc9fnt3gFnCG+3qHUcV8d3cJzs0xTJxjxnDgBbI00Rkf5CDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cc4ba11bda5e284560da8e12687f686afcebda671eada31c00e5fd32cd3d0b7","last_reissued_at":"2026-05-18T02:25:04.759105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:04.759105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fixed-Parameter Tractability of Token Jumping on Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Hirotaka Ono, Marcin Kami\\'nski, Takehiro Ito","submitted_at":"2014-06-25T13:49:56Z","abstract_excerpt":"Suppose that we are given two independent sets $I_0$ and $I_r$ of a graph such that $|I_0| = |I_r|$, and imagine that a token is placed on each vertex in $I_0$. The token jumping problem is to determine whether there exists a sequence of independent sets which transforms $I_0$ into $I_r$ so that each independent set in the sequence results from the previous one by moving exactly one token to another vertex. This problem is known to be PSPACE-complete even for planar graphs of maximum degree three, and W[1]-hard for general graphs when parameterized by the number of tokens. In this paper, we pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6567","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.6567","created_at":"2026-05-18T02:25:04.759163+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.6567v2","created_at":"2026-05-18T02:25:04.759163+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6567","created_at":"2026-05-18T02:25:04.759163+00:00"},{"alias_kind":"pith_short_12","alias_value":"HTCLUEN5UXRI","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HTCLUEN5UXRIIVQN","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HTCLUEN5","created_at":"2026-05-18T12:28:30.664211+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/HTCLUEN5UXRIIVQNVDQSNB7WQ2","json":"https://pith.science/pith/HTCLUEN5UXRIIVQNVDQSNB7WQ2.json","graph_json":"https://pith.science/api/pith-number/HTCLUEN5UXRIIVQNVDQSNB7WQ2/graph.json","events_json":"https://pith.science/api/pith-number/HTCLUEN5UXRIIVQNVDQSNB7WQ2/events.json","paper":"https://pith.science/paper/HTCLUEN5"},"agent_actions":{"view_html":"https://pith.science/pith/HTCLUEN5UXRIIVQNVDQSNB7WQ2","download_json":"https://pith.science/pith/HTCLUEN5UXRIIVQNVDQSNB7WQ2.json","view_paper":"https://pith.science/paper/HTCLUEN5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.6567&json=true","fetch_graph":"https://pith.science/api/pith-number/HTCLUEN5UXRIIVQNVDQSNB7WQ2/graph.json","fetch_events":"https://pith.science/api/pith-number/HTCLUEN5UXRIIVQNVDQSNB7WQ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HTCLUEN5UXRIIVQNVDQSNB7WQ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HTCLUEN5UXRIIVQNVDQSNB7WQ2/action/storage_attestation","attest_author":"https://pith.science/pith/HTCLUEN5UXRIIVQNVDQSNB7WQ2/action/author_attestation","sign_citation":"https://pith.science/pith/HTCLUEN5UXRIIVQNVDQSNB7WQ2/action/citation_signature","submit_replication":"https://pith.science/pith/HTCLUEN5UXRIIVQNVDQSNB7WQ2/action/replication_record"}},"created_at":"2026-05-18T02:25:04.759163+00:00","updated_at":"2026-05-18T02:25:04.759163+00:00"}