{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RJXIEEUXAZZEI3LCVHFMOITO42","short_pith_number":"pith:RJXIEEUX","canonical_record":{"source":{"id":"1706.09932","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-06-29T19:24:38Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"1f09f410332707c0438aa0c1b1917bc29b57a2cab95b58e46281c4dddf6ecfcf","abstract_canon_sha256":"b7e9b840b1b562870bb287ac183c1a63e0b0b9f0f46b8dd43a0194c89ac421d9"},"schema_version":"1.0"},"canonical_sha256":"8a6e8212970672446d62a9cac7226ee6b1dcd4dbdf644073002951650298e403","source":{"kind":"arxiv","id":"1706.09932","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09932","created_at":"2026-05-18T00:40:57Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09932v2","created_at":"2026-05-18T00:40:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09932","created_at":"2026-05-18T00:40:57Z"},{"alias_kind":"pith_short_12","alias_value":"RJXIEEUXAZZE","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RJXIEEUXAZZEI3LC","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RJXIEEUX","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RJXIEEUXAZZEI3LCVHFMOITO42","target":"record","payload":{"canonical_record":{"source":{"id":"1706.09932","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-06-29T19:24:38Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"1f09f410332707c0438aa0c1b1917bc29b57a2cab95b58e46281c4dddf6ecfcf","abstract_canon_sha256":"b7e9b840b1b562870bb287ac183c1a63e0b0b9f0f46b8dd43a0194c89ac421d9"},"schema_version":"1.0"},"canonical_sha256":"8a6e8212970672446d62a9cac7226ee6b1dcd4dbdf644073002951650298e403","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:57.256490Z","signature_b64":"mM/HhQi7Hz9dcVbVpV3Ll0U5Nh/WneQOFP2pQ79yHBE/KvjwO3fpUpKHVMowwvYvt/XUnWRJQcywTc9hgnUIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a6e8212970672446d62a9cac7226ee6b1dcd4dbdf644073002951650298e403","last_reissued_at":"2026-05-18T00:40:57.255993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:57.255993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.09932","source_version":2,"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:40:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s0U17k91a/ngTh5FnPVNDoS4VymUHm+ZH3RjVMpgd3IYoRNRzwuD3L7ZTyOI4Aiofhadan5bVwg9FCzzmByiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:49:19.752917Z"},"content_sha256":"04c8999401ade9d7cf3dcf8d91684f168d787535302013b02506892ba73ee910","schema_version":"1.0","event_id":"sha256:04c8999401ade9d7cf3dcf8d91684f168d787535302013b02506892ba73ee910"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RJXIEEUXAZZEI3LCVHFMOITO42","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Asymptotically-Optimal Multi-Robot Motion Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.MA","authors_text":"Andrew Dobson, Dan Halperin, Kiril Solovey, Kostas E. Bekris, Rahul Shome","submitted_at":"2017-06-29T19:24:38Z","abstract_excerpt":"Finding asymptotically-optimal paths in multi-robot motion planning problems could be achieved, in principle, using sampling-based planners in the composite configuration space of all of the robots in the space. The dimensionality of this space increases with the number of robots, rendering this approach impractical. This work focuses on a scalable sampling-based planner for coupled multi-robot problems that provides asymptotic optimality. It extends the dRRT approach, which proposed building roadmaps for each robot and searching an implicit roadmap in the composite configuration space. This w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09932","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"},"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:40:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VS91f4cdD3x2lorxuKNjMKepG9WrUJb0ZABB5lL3d6JdRL3vJoX3jmmPKdX3Lonevg3pyqkJjfrPWvwyNl7lDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:49:19.753275Z"},"content_sha256":"b73da717429c2f79a5895d2338e08dc0c85e106ab175b4d5fa2c40fb2a9fb881","schema_version":"1.0","event_id":"sha256:b73da717429c2f79a5895d2338e08dc0c85e106ab175b4d5fa2c40fb2a9fb881"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RJXIEEUXAZZEI3LCVHFMOITO42/bundle.json","state_url":"https://pith.science/pith/RJXIEEUXAZZEI3LCVHFMOITO42/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RJXIEEUXAZZEI3LCVHFMOITO42/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-06-04T04:49:19Z","links":{"resolver":"https://pith.science/pith/RJXIEEUXAZZEI3LCVHFMOITO42","bundle":"https://pith.science/pith/RJXIEEUXAZZEI3LCVHFMOITO42/bundle.json","state":"https://pith.science/pith/RJXIEEUXAZZEI3LCVHFMOITO42/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RJXIEEUXAZZEI3LCVHFMOITO42/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RJXIEEUXAZZEI3LCVHFMOITO42","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":"b7e9b840b1b562870bb287ac183c1a63e0b0b9f0f46b8dd43a0194c89ac421d9","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-06-29T19:24:38Z","title_canon_sha256":"1f09f410332707c0438aa0c1b1917bc29b57a2cab95b58e46281c4dddf6ecfcf"},"schema_version":"1.0","source":{"id":"1706.09932","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09932","created_at":"2026-05-18T00:40:57Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09932v2","created_at":"2026-05-18T00:40:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09932","created_at":"2026-05-18T00:40:57Z"},{"alias_kind":"pith_short_12","alias_value":"RJXIEEUXAZZE","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RJXIEEUXAZZEI3LC","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RJXIEEUX","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:b73da717429c2f79a5895d2338e08dc0c85e106ab175b4d5fa2c40fb2a9fb881","target":"graph","created_at":"2026-05-18T00:40:57Z","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":"Finding asymptotically-optimal paths in multi-robot motion planning problems could be achieved, in principle, using sampling-based planners in the composite configuration space of all of the robots in the space. The dimensionality of this space increases with the number of robots, rendering this approach impractical. This work focuses on a scalable sampling-based planner for coupled multi-robot problems that provides asymptotic optimality. It extends the dRRT approach, which proposed building roadmaps for each robot and searching an implicit roadmap in the composite configuration space. This w","authors_text":"Andrew Dobson, Dan Halperin, Kiril Solovey, Kostas E. Bekris, Rahul Shome","cross_cats":["cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-06-29T19:24:38Z","title":"Scalable Asymptotically-Optimal Multi-Robot Motion Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09932","kind":"arxiv","version":2},"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:04c8999401ade9d7cf3dcf8d91684f168d787535302013b02506892ba73ee910","target":"record","created_at":"2026-05-18T00:40:57Z","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":"b7e9b840b1b562870bb287ac183c1a63e0b0b9f0f46b8dd43a0194c89ac421d9","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-06-29T19:24:38Z","title_canon_sha256":"1f09f410332707c0438aa0c1b1917bc29b57a2cab95b58e46281c4dddf6ecfcf"},"schema_version":"1.0","source":{"id":"1706.09932","kind":"arxiv","version":2}},"canonical_sha256":"8a6e8212970672446d62a9cac7226ee6b1dcd4dbdf644073002951650298e403","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a6e8212970672446d62a9cac7226ee6b1dcd4dbdf644073002951650298e403","first_computed_at":"2026-05-18T00:40:57.255993Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:57.255993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mM/HhQi7Hz9dcVbVpV3Ll0U5Nh/WneQOFP2pQ79yHBE/KvjwO3fpUpKHVMowwvYvt/XUnWRJQcywTc9hgnUIAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:57.256490Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.09932","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04c8999401ade9d7cf3dcf8d91684f168d787535302013b02506892ba73ee910","sha256:b73da717429c2f79a5895d2338e08dc0c85e106ab175b4d5fa2c40fb2a9fb881"],"state_sha256":"920dbfe369e2c83cf1e576c0d53885f88c4ce480ded5a5bc07efce4e120dbe23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4xEIWEmOtb63XfgzZ5xO/Pz8MbfSC9aDe9kCqBHNT9iZ5Ew+DkIdn7pygu/vA0cNAJSghqyvyaQE3CE1BPIHBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T04:49:19.756474Z","bundle_sha256":"fe3cc6edbf49671f22e55306f81edb6a6e70399246d52a90028f8ec5859ea738"}}