{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:D6BSZLNFECTZLJLGZCVJG3MGO7","short_pith_number":"pith:D6BSZLNF","canonical_record":{"source":{"id":"1806.03539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-06-09T20:31:11Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"9d0aa1398e64da72743724ce7f0ab5ec709986577146a467c640e1340694ff06","abstract_canon_sha256":"43837074a5c8a3c849b0dc26648c2c96ced8dafa436144fbebebddae42939a88"},"schema_version":"1.0"},"canonical_sha256":"1f832cada520a795a566c8aa936d8677dd376dc7e6b27db9d17e1319c0ce86a4","source":{"kind":"arxiv","id":"1806.03539","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03539","created_at":"2026-05-18T00:13:24Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03539v1","created_at":"2026-05-18T00:13:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03539","created_at":"2026-05-18T00:13:24Z"},{"alias_kind":"pith_short_12","alias_value":"D6BSZLNFECTZ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"D6BSZLNFECTZLJLG","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"D6BSZLNF","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:D6BSZLNFECTZLJLGZCVJG3MGO7","target":"record","payload":{"canonical_record":{"source":{"id":"1806.03539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-06-09T20:31:11Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"9d0aa1398e64da72743724ce7f0ab5ec709986577146a467c640e1340694ff06","abstract_canon_sha256":"43837074a5c8a3c849b0dc26648c2c96ced8dafa436144fbebebddae42939a88"},"schema_version":"1.0"},"canonical_sha256":"1f832cada520a795a566c8aa936d8677dd376dc7e6b27db9d17e1319c0ce86a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:24.903468Z","signature_b64":"YdV70czJHQDgoaWlQL2kb2fEcHhM1WUme+Ukaw/9nCfBc+bT+mauG5ikXHA+xataiJe5fQ9KpU2i+2xzR5gaAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f832cada520a795a566c8aa936d8677dd376dc7e6b27db9d17e1319c0ce86a4","last_reissued_at":"2026-05-18T00:13:24.902782Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:24.902782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.03539","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:13:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kPZV+FlfUpOrEz22u8NFxiRlO2u5OcvXn9CRgcjTEfR/fltpUKb71M96ZrBEzvGfJGFAAHM4VMrKQ2nGP1+vAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:06:59.313742Z"},"content_sha256":"11d7a4ba3516e88e01fbd4705f9e4c3e84fe41e0f77ae3c5bdb66aad1783b762","schema_version":"1.0","event_id":"sha256:11d7a4ba3516e88e01fbd4705f9e4c3e84fe41e0f77ae3c5bdb66aad1783b762"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:D6BSZLNFECTZLJLGZCVJG3MGO7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational Complexity of Motion Planning of a Robot through Simple Gadgets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CC","authors_text":"Erik D. Demaine, Isaac Grosof, Jayson Lynch, Mikhail Rudoy","submitted_at":"2018-06-09T20:31:11Z","abstract_excerpt":"We initiate a general theory for analyzing the complexity of motion planning of a single robot through a graph of \"gadgets\", each with their own state, set of locations, and allowed traversals between locations that can depend on and change the state. This type of setup is common to many robot motion planning hardness proofs. We characterize the complexity for a natural simple case: each gadget connects up to four locations in a perfect matching (but each direction can be traversable or not in the current state), has one or two states, every gadget traversal is immediately undoable, and that g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03539","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:13:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k2SiMk2kHQJ2Fohcb2bhkVpGGhm77btni+a6NKXjQv3ZEHuI0ph3z//Cgg63Snrrq3eMJujnqaB9szZty9R/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:06:59.314096Z"},"content_sha256":"eada6d6f513e7c5e7b82da1ce013bbe6c2f9fd177124ca4fad8a02a94a91e385","schema_version":"1.0","event_id":"sha256:eada6d6f513e7c5e7b82da1ce013bbe6c2f9fd177124ca4fad8a02a94a91e385"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D6BSZLNFECTZLJLGZCVJG3MGO7/bundle.json","state_url":"https://pith.science/pith/D6BSZLNFECTZLJLGZCVJG3MGO7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D6BSZLNFECTZLJLGZCVJG3MGO7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T10:06:59Z","links":{"resolver":"https://pith.science/pith/D6BSZLNFECTZLJLGZCVJG3MGO7","bundle":"https://pith.science/pith/D6BSZLNFECTZLJLGZCVJG3MGO7/bundle.json","state":"https://pith.science/pith/D6BSZLNFECTZLJLGZCVJG3MGO7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D6BSZLNFECTZLJLGZCVJG3MGO7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:D6BSZLNFECTZLJLGZCVJG3MGO7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"43837074a5c8a3c849b0dc26648c2c96ced8dafa436144fbebebddae42939a88","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-06-09T20:31:11Z","title_canon_sha256":"9d0aa1398e64da72743724ce7f0ab5ec709986577146a467c640e1340694ff06"},"schema_version":"1.0","source":{"id":"1806.03539","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03539","created_at":"2026-05-18T00:13:24Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03539v1","created_at":"2026-05-18T00:13:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03539","created_at":"2026-05-18T00:13:24Z"},{"alias_kind":"pith_short_12","alias_value":"D6BSZLNFECTZ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"D6BSZLNFECTZLJLG","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"D6BSZLNF","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:eada6d6f513e7c5e7b82da1ce013bbe6c2f9fd177124ca4fad8a02a94a91e385","target":"graph","created_at":"2026-05-18T00:13:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We initiate a general theory for analyzing the complexity of motion planning of a single robot through a graph of \"gadgets\", each with their own state, set of locations, and allowed traversals between locations that can depend on and change the state. This type of setup is common to many robot motion planning hardness proofs. We characterize the complexity for a natural simple case: each gadget connects up to four locations in a perfect matching (but each direction can be traversable or not in the current state), has one or two states, every gadget traversal is immediately undoable, and that g","authors_text":"Erik D. Demaine, Isaac Grosof, Jayson Lynch, Mikhail Rudoy","cross_cats":["cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-06-09T20:31:11Z","title":"Computational Complexity of Motion Planning of a Robot through Simple Gadgets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03539","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:11d7a4ba3516e88e01fbd4705f9e4c3e84fe41e0f77ae3c5bdb66aad1783b762","target":"record","created_at":"2026-05-18T00:13:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"43837074a5c8a3c849b0dc26648c2c96ced8dafa436144fbebebddae42939a88","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-06-09T20:31:11Z","title_canon_sha256":"9d0aa1398e64da72743724ce7f0ab5ec709986577146a467c640e1340694ff06"},"schema_version":"1.0","source":{"id":"1806.03539","kind":"arxiv","version":1}},"canonical_sha256":"1f832cada520a795a566c8aa936d8677dd376dc7e6b27db9d17e1319c0ce86a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f832cada520a795a566c8aa936d8677dd376dc7e6b27db9d17e1319c0ce86a4","first_computed_at":"2026-05-18T00:13:24.902782Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:24.902782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YdV70czJHQDgoaWlQL2kb2fEcHhM1WUme+Ukaw/9nCfBc+bT+mauG5ikXHA+xataiJe5fQ9KpU2i+2xzR5gaAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:24.903468Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.03539","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11d7a4ba3516e88e01fbd4705f9e4c3e84fe41e0f77ae3c5bdb66aad1783b762","sha256:eada6d6f513e7c5e7b82da1ce013bbe6c2f9fd177124ca4fad8a02a94a91e385"],"state_sha256":"0a985bc57f1ab86fdcde5347b74ff678cd966b7370633285d5b8a395921f798f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F+CkQbCOvTdjQ9BVcVPCdcG8yPzS1cLvuY7VCTJt4uNnFXN2WjrG39S8wLShb4wFSMr3QEkZjQs1qoxBEinrAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:06:59.316481Z","bundle_sha256":"d124003bd9175a9d11a0762059b53b6a671039958c6a285cd64d5175875b6541"}}