{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5YFJBDTWU5GBZPFR4LNXA6P2EQ","short_pith_number":"pith:5YFJBDTW","schema_version":"1.0","canonical_sha256":"ee0a908e76a74c1cbcb1e2db7079fa240a6e81b019bb976dd34a966d7db4ee87","source":{"kind":"arxiv","id":"1903.02445","version":1},"attestation_state":"computed","paper":{"title":"The Parameterized Complexity of Motion Planning for Snake-Like Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy Sa'ar, Meirav Zehavi, Siddharth Gupta","submitted_at":"2019-03-06T15:20:14Z","abstract_excerpt":"We study the parameterized complexity of a variant of the classic video game Snake that models real-world problems of motion planning. Given a snake-like robot with an initial position and a final position in an environment (modeled by a graph), our objective is to determine whether the robot can reach the final position from the initial position without intersecting itself. Naturally, this problem models a wide-variety of scenarios, ranging from the transportation of linked wagons towed by a locomotor at an airport or a supermarket to the movement of a group of agents that travel in an `ant-l"},"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":"1903.02445","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-06T15:20:14Z","cross_cats_sorted":[],"title_canon_sha256":"40889335c8ba4781d11cd79df8f9baa31f8f450e425d2986f179e6b9aa867e90","abstract_canon_sha256":"0dd07e534e2c25191778e7bffa5c31706b609d3e99276e1d22b55e3c0536611d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:55.289635Z","signature_b64":"dKAG77llEMoE4clj33luCbiNeJsjPdWF4MDJVziFofnfjTmGAJG3CQx1l+AYE2cv449oFXp29YLRf9r6xas2Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee0a908e76a74c1cbcb1e2db7079fa240a6e81b019bb976dd34a966d7db4ee87","last_reissued_at":"2026-05-17T23:51:55.289176Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:55.289176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Parameterized Complexity of Motion Planning for Snake-Like Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy Sa'ar, Meirav Zehavi, Siddharth Gupta","submitted_at":"2019-03-06T15:20:14Z","abstract_excerpt":"We study the parameterized complexity of a variant of the classic video game Snake that models real-world problems of motion planning. Given a snake-like robot with an initial position and a final position in an environment (modeled by a graph), our objective is to determine whether the robot can reach the final position from the initial position without intersecting itself. Naturally, this problem models a wide-variety of scenarios, ranging from the transportation of linked wagons towed by a locomotor at an airport or a supermarket to the movement of a group of agents that travel in an `ant-l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02445","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":"1903.02445","created_at":"2026-05-17T23:51:55.289242+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.02445v1","created_at":"2026-05-17T23:51:55.289242+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02445","created_at":"2026-05-17T23:51:55.289242+00:00"},{"alias_kind":"pith_short_12","alias_value":"5YFJBDTWU5GB","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5YFJBDTWU5GBZPFR","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5YFJBDTW","created_at":"2026-05-18T12:33:10.108867+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/5YFJBDTWU5GBZPFR4LNXA6P2EQ","json":"https://pith.science/pith/5YFJBDTWU5GBZPFR4LNXA6P2EQ.json","graph_json":"https://pith.science/api/pith-number/5YFJBDTWU5GBZPFR4LNXA6P2EQ/graph.json","events_json":"https://pith.science/api/pith-number/5YFJBDTWU5GBZPFR4LNXA6P2EQ/events.json","paper":"https://pith.science/paper/5YFJBDTW"},"agent_actions":{"view_html":"https://pith.science/pith/5YFJBDTWU5GBZPFR4LNXA6P2EQ","download_json":"https://pith.science/pith/5YFJBDTWU5GBZPFR4LNXA6P2EQ.json","view_paper":"https://pith.science/paper/5YFJBDTW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.02445&json=true","fetch_graph":"https://pith.science/api/pith-number/5YFJBDTWU5GBZPFR4LNXA6P2EQ/graph.json","fetch_events":"https://pith.science/api/pith-number/5YFJBDTWU5GBZPFR4LNXA6P2EQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5YFJBDTWU5GBZPFR4LNXA6P2EQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5YFJBDTWU5GBZPFR4LNXA6P2EQ/action/storage_attestation","attest_author":"https://pith.science/pith/5YFJBDTWU5GBZPFR4LNXA6P2EQ/action/author_attestation","sign_citation":"https://pith.science/pith/5YFJBDTWU5GBZPFR4LNXA6P2EQ/action/citation_signature","submit_replication":"https://pith.science/pith/5YFJBDTWU5GBZPFR4LNXA6P2EQ/action/replication_record"}},"created_at":"2026-05-17T23:51:55.289242+00:00","updated_at":"2026-05-17T23:51:55.289242+00:00"}