{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3HIAQBTG4RHF5HA4TOVK72Y2UY","short_pith_number":"pith:3HIAQBTG","canonical_record":{"source":{"id":"1807.05428","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-07-14T18:49:56Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"8f63af33a8a0f1fa5134a7e18f80a3f6fb8e019f8610288042c1cb4cf3d83d05","abstract_canon_sha256":"d8c22668b52deffcbbb032b8482cb188f3ac170bd314793b54c026f24234b0d6"},"schema_version":"1.0"},"canonical_sha256":"d9d0080666e44e5e9c1c9baaafeb1aa63b7022110aa95a2eaa5c9a70cf90be36","source":{"kind":"arxiv","id":"1807.05428","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05428","created_at":"2026-05-18T00:10:43Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05428v1","created_at":"2026-05-18T00:10:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05428","created_at":"2026-05-18T00:10:43Z"},{"alias_kind":"pith_short_12","alias_value":"3HIAQBTG4RHF","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3HIAQBTG4RHF5HA4","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3HIAQBTG","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3HIAQBTG4RHF5HA4TOVK72Y2UY","target":"record","payload":{"canonical_record":{"source":{"id":"1807.05428","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-07-14T18:49:56Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"8f63af33a8a0f1fa5134a7e18f80a3f6fb8e019f8610288042c1cb4cf3d83d05","abstract_canon_sha256":"d8c22668b52deffcbbb032b8482cb188f3ac170bd314793b54c026f24234b0d6"},"schema_version":"1.0"},"canonical_sha256":"d9d0080666e44e5e9c1c9baaafeb1aa63b7022110aa95a2eaa5c9a70cf90be36","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:43.559833Z","signature_b64":"XU+chOs7VW8C2ASJfSDZFPdmzTvPYuemERyGg8PibuCfpVHoSYZZwx6gnEvtIgvVtZ8fZ49zQcfzwc4OgjisAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9d0080666e44e5e9c1c9baaafeb1aa63b7022110aa95a2eaa5c9a70cf90be36","last_reissued_at":"2026-05-18T00:10:43.559431Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:43.559431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.05428","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:10:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D1Jq+N1EBKGdKfvwgjTNkog/8Y33fD/YeY29P6plmqJqmzQxAlikqSHWAoSw4S3UdKxplUgjHVxBHxxUcrFoDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:55:43.743756Z"},"content_sha256":"47f3d74c09dd559a4ee0cd550a4f8e177bb7c3f9ea32bfdd0d806d25b4caf7be","schema_version":"1.0","event_id":"sha256:47f3d74c09dd559a4ee0cd550a4f8e177bb7c3f9ea32bfdd0d806d25b4caf7be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3HIAQBTG4RHF5HA4TOVK72Y2UY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Motion Planning for Multiple Unit-Ball Robots in $\\mathbb{R}^d$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CG","authors_text":"Dan Halperin, Israela Solomon","submitted_at":"2018-07-14T18:49:56Z","abstract_excerpt":"We present a decoupled algorithm for motion planning for a collection of unit-balls moving among polyhedral obstacles in $\\mathbb{R}^d$, for any $d \\ge 2$. We assume that the robots have revolving areas in the vicinity of their start and target positions: Revolving areas are regions where robots can maneuver in order to give way to another moving robot. Given that this assumption is fulfilled, the algorithm is complete, namely it is guaranteed to find a solution or report that none exists. A key goal in our design is to make the revolving areas as economical as possible and in particular to al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05428","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:10:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6qwOpENZwLBU/NPIQU7Qn19YwOdgrL0/sIcR4FHwgb1sYS3/aY+pCAheDa5XvEQ92jLZRBjJpj5dpRGLFyqBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:55:43.744376Z"},"content_sha256":"6bb17f6783956868467a59c14957d311b53a7364ba216e061520677c6922d305","schema_version":"1.0","event_id":"sha256:6bb17f6783956868467a59c14957d311b53a7364ba216e061520677c6922d305"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3HIAQBTG4RHF5HA4TOVK72Y2UY/bundle.json","state_url":"https://pith.science/pith/3HIAQBTG4RHF5HA4TOVK72Y2UY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3HIAQBTG4RHF5HA4TOVK72Y2UY/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-31T23:55:43Z","links":{"resolver":"https://pith.science/pith/3HIAQBTG4RHF5HA4TOVK72Y2UY","bundle":"https://pith.science/pith/3HIAQBTG4RHF5HA4TOVK72Y2UY/bundle.json","state":"https://pith.science/pith/3HIAQBTG4RHF5HA4TOVK72Y2UY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3HIAQBTG4RHF5HA4TOVK72Y2UY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3HIAQBTG4RHF5HA4TOVK72Y2UY","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":"d8c22668b52deffcbbb032b8482cb188f3ac170bd314793b54c026f24234b0d6","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-07-14T18:49:56Z","title_canon_sha256":"8f63af33a8a0f1fa5134a7e18f80a3f6fb8e019f8610288042c1cb4cf3d83d05"},"schema_version":"1.0","source":{"id":"1807.05428","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05428","created_at":"2026-05-18T00:10:43Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05428v1","created_at":"2026-05-18T00:10:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05428","created_at":"2026-05-18T00:10:43Z"},{"alias_kind":"pith_short_12","alias_value":"3HIAQBTG4RHF","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3HIAQBTG4RHF5HA4","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3HIAQBTG","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:6bb17f6783956868467a59c14957d311b53a7364ba216e061520677c6922d305","target":"graph","created_at":"2026-05-18T00:10:43Z","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 present a decoupled algorithm for motion planning for a collection of unit-balls moving among polyhedral obstacles in $\\mathbb{R}^d$, for any $d \\ge 2$. We assume that the robots have revolving areas in the vicinity of their start and target positions: Revolving areas are regions where robots can maneuver in order to give way to another moving robot. Given that this assumption is fulfilled, the algorithm is complete, namely it is guaranteed to find a solution or report that none exists. A key goal in our design is to make the revolving areas as economical as possible and in particular to al","authors_text":"Dan Halperin, Israela Solomon","cross_cats":["cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-07-14T18:49:56Z","title":"Motion Planning for Multiple Unit-Ball Robots in $\\mathbb{R}^d$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05428","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:47f3d74c09dd559a4ee0cd550a4f8e177bb7c3f9ea32bfdd0d806d25b4caf7be","target":"record","created_at":"2026-05-18T00:10:43Z","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":"d8c22668b52deffcbbb032b8482cb188f3ac170bd314793b54c026f24234b0d6","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-07-14T18:49:56Z","title_canon_sha256":"8f63af33a8a0f1fa5134a7e18f80a3f6fb8e019f8610288042c1cb4cf3d83d05"},"schema_version":"1.0","source":{"id":"1807.05428","kind":"arxiv","version":1}},"canonical_sha256":"d9d0080666e44e5e9c1c9baaafeb1aa63b7022110aa95a2eaa5c9a70cf90be36","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9d0080666e44e5e9c1c9baaafeb1aa63b7022110aa95a2eaa5c9a70cf90be36","first_computed_at":"2026-05-18T00:10:43.559431Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:43.559431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XU+chOs7VW8C2ASJfSDZFPdmzTvPYuemERyGg8PibuCfpVHoSYZZwx6gnEvtIgvVtZ8fZ49zQcfzwc4OgjisAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:43.559833Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.05428","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47f3d74c09dd559a4ee0cd550a4f8e177bb7c3f9ea32bfdd0d806d25b4caf7be","sha256:6bb17f6783956868467a59c14957d311b53a7364ba216e061520677c6922d305"],"state_sha256":"a7d1587edf269a440d1cc53d5c1c242102925b776341536ea3f8f68f144e3895"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eWsQlsDAUee91n31SQTP1nqBuvKtZDl1PLdbSjXXPrUQ0mKDw/O6d4oToWUqkCvWxONWhrPYQv044UfxOp7rCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:55:43.747650Z","bundle_sha256":"5d5bc15d8ebc4325c493b3e3acf6e732355d337b96a2a783d67289aa0452fa89"}}