{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:LF632AO67UTWNSQEMKH5P47XOZ","short_pith_number":"pith:LF632AO6","canonical_record":{"source":{"id":"2306.01193","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2023-06-01T23:13:08Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"37ebf8caa33f46262be3074bd7909f2779e51867521e9d8b2872b8ae4b0205a3","abstract_canon_sha256":"6a35caa65d1fa7d59aaa9e0de0e722d70ac04825f560282fb14dfcb60fbd84ce"},"schema_version":"1.0"},"canonical_sha256":"597dbd01defd2766ca04628fd7f3f77655697555c4f24f64de994e8482344d69","source":{"kind":"arxiv","id":"2306.01193","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.01193","created_at":"2026-07-05T07:12:50Z"},{"alias_kind":"arxiv_version","alias_value":"2306.01193v1","created_at":"2026-07-05T07:12:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.01193","created_at":"2026-07-05T07:12:50Z"},{"alias_kind":"pith_short_12","alias_value":"LF632AO67UTW","created_at":"2026-07-05T07:12:50Z"},{"alias_kind":"pith_short_16","alias_value":"LF632AO67UTWNSQE","created_at":"2026-07-05T07:12:50Z"},{"alias_kind":"pith_short_8","alias_value":"LF632AO6","created_at":"2026-07-05T07:12:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:LF632AO67UTWNSQEMKH5P47XOZ","target":"record","payload":{"canonical_record":{"source":{"id":"2306.01193","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2023-06-01T23:13:08Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"37ebf8caa33f46262be3074bd7909f2779e51867521e9d8b2872b8ae4b0205a3","abstract_canon_sha256":"6a35caa65d1fa7d59aaa9e0de0e722d70ac04825f560282fb14dfcb60fbd84ce"},"schema_version":"1.0"},"canonical_sha256":"597dbd01defd2766ca04628fd7f3f77655697555c4f24f64de994e8482344d69","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:12:50.570289Z","signature_b64":"qhgIkLbCXf7d0+6hLNz5ISCMb1we1tW/eT1bkK65kRRHoyHbCQB6RFqK1hYfGEGrbpU2WAGH1PC+hILwCe6JDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"597dbd01defd2766ca04628fd7f3f77655697555c4f24f64de994e8482344d69","last_reissued_at":"2026-07-05T07:12:50.569859Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:12:50.569859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2306.01193","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-07-05T07:12:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DaAMF+s/xZFP9QGnCb3yTBZ1XrHb+huYR8HUcR7rOZK3+OW4AsWPIFkU9Bs5P4u2ucgQpacZSXNYg4xzg4V5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T18:42:49.207435Z"},"content_sha256":"6f321fcc1bd866cae9f4fc49a6ce6e9879a5710008baf6fbcd21be94b89127f8","schema_version":"1.0","event_id":"sha256:6f321fcc1bd866cae9f4fc49a6ce6e9879a5710008baf6fbcd21be94b89127f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:LF632AO67UTWNSQEMKH5P47XOZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Dylan Hendrickson, Erik D. Demaine, Hayashi Ani, Jayson Lynch, Jenny Diomidova, Michael Coulombe, Timothy Gomez","submitted_at":"2023-06-01T23:13:08Z","abstract_excerpt":"We extend the motion-planning-through-gadgets framework to several new scenarios involving various numbers of robots/agents, and analyze the complexity of the resulting motion-planning problems. While past work considers just one robot or one robot per player, most of our models allow for one or more locations to spawn new robots in each time step, leading to arbitrarily many robots. In the 0-player context, where all motion is deterministically forced, we prove that deciding whether any robot ever reaches a specified location is undecidable, by representing a counter machine. In the 1-player "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.01193","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.01193/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T07:12:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ujUFCcENWGkrFbf7IDo80ZpL7CH3YOs3tR6agUibG54KfInD6xf4jCJelUAmWkr+iNxUWdjggUazbCRo+qugCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T18:42:49.207950Z"},"content_sha256":"9e8ac2dea3b48248925f20936cfddd868eaadcdbd610864451e2af6e5b22353c","schema_version":"1.0","event_id":"sha256:9e8ac2dea3b48248925f20936cfddd868eaadcdbd610864451e2af6e5b22353c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LF632AO67UTWNSQEMKH5P47XOZ/bundle.json","state_url":"https://pith.science/pith/LF632AO67UTWNSQEMKH5P47XOZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LF632AO67UTWNSQEMKH5P47XOZ/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-07-31T18:42:49Z","links":{"resolver":"https://pith.science/pith/LF632AO67UTWNSQEMKH5P47XOZ","bundle":"https://pith.science/pith/LF632AO67UTWNSQEMKH5P47XOZ/bundle.json","state":"https://pith.science/pith/LF632AO67UTWNSQEMKH5P47XOZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LF632AO67UTWNSQEMKH5P47XOZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:LF632AO67UTWNSQEMKH5P47XOZ","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":"6a35caa65d1fa7d59aaa9e0de0e722d70ac04825f560282fb14dfcb60fbd84ce","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2023-06-01T23:13:08Z","title_canon_sha256":"37ebf8caa33f46262be3074bd7909f2779e51867521e9d8b2872b8ae4b0205a3"},"schema_version":"1.0","source":{"id":"2306.01193","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.01193","created_at":"2026-07-05T07:12:50Z"},{"alias_kind":"arxiv_version","alias_value":"2306.01193v1","created_at":"2026-07-05T07:12:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.01193","created_at":"2026-07-05T07:12:50Z"},{"alias_kind":"pith_short_12","alias_value":"LF632AO67UTW","created_at":"2026-07-05T07:12:50Z"},{"alias_kind":"pith_short_16","alias_value":"LF632AO67UTWNSQE","created_at":"2026-07-05T07:12:50Z"},{"alias_kind":"pith_short_8","alias_value":"LF632AO6","created_at":"2026-07-05T07:12:50Z"}],"graph_snapshots":[{"event_id":"sha256:9e8ac2dea3b48248925f20936cfddd868eaadcdbd610864451e2af6e5b22353c","target":"graph","created_at":"2026-07-05T07:12:50Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2306.01193/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We extend the motion-planning-through-gadgets framework to several new scenarios involving various numbers of robots/agents, and analyze the complexity of the resulting motion-planning problems. While past work considers just one robot or one robot per player, most of our models allow for one or more locations to spawn new robots in each time step, leading to arbitrarily many robots. In the 0-player context, where all motion is deterministically forced, we prove that deciding whether any robot ever reaches a specified location is undecidable, by representing a counter machine. In the 1-player ","authors_text":"Dylan Hendrickson, Erik D. Demaine, Hayashi Ani, Jayson Lynch, Jenny Diomidova, Michael Coulombe, Timothy Gomez","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2023-06-01T23:13:08Z","title":"Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.01193","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:6f321fcc1bd866cae9f4fc49a6ce6e9879a5710008baf6fbcd21be94b89127f8","target":"record","created_at":"2026-07-05T07:12:50Z","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":"6a35caa65d1fa7d59aaa9e0de0e722d70ac04825f560282fb14dfcb60fbd84ce","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2023-06-01T23:13:08Z","title_canon_sha256":"37ebf8caa33f46262be3074bd7909f2779e51867521e9d8b2872b8ae4b0205a3"},"schema_version":"1.0","source":{"id":"2306.01193","kind":"arxiv","version":1}},"canonical_sha256":"597dbd01defd2766ca04628fd7f3f77655697555c4f24f64de994e8482344d69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"597dbd01defd2766ca04628fd7f3f77655697555c4f24f64de994e8482344d69","first_computed_at":"2026-07-05T07:12:50.569859Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:12:50.569859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qhgIkLbCXf7d0+6hLNz5ISCMb1we1tW/eT1bkK65kRRHoyHbCQB6RFqK1hYfGEGrbpU2WAGH1PC+hILwCe6JDA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:12:50.570289Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.01193","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f321fcc1bd866cae9f4fc49a6ce6e9879a5710008baf6fbcd21be94b89127f8","sha256:9e8ac2dea3b48248925f20936cfddd868eaadcdbd610864451e2af6e5b22353c"],"state_sha256":"5cf1d382094fdb4585c0f70304ff565b52e88ca252bbfef0ff614db62e896029"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m1z4sBM177UaR67KagmXWQHgem/jTRCB3kuyzWnjgx4wk7hU0L537VC1oWir3m+JHee76vfsKy6WkpIcniURCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T18:42:49.212797Z","bundle_sha256":"4c1bd63e1aedc19a314b37e8b534fa4a580f34df696c0facc0c72696cc14af85"}}