{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5CPGYHJFWRCA2ZKDDZAPOWE37Q","short_pith_number":"pith:5CPGYHJF","canonical_record":{"source":{"id":"1903.00994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-03T21:27:49Z","cross_cats_sorted":[],"title_canon_sha256":"7ca1153d53cb27f60d3433dbf9989acf93a40db6075fc8b50e0277df62fa3ab2","abstract_canon_sha256":"a11dbd67999d1812268b858b0780b1c1bd3476b469ac6b376eaf72004fad33af"},"schema_version":"1.0"},"canonical_sha256":"e89e6c1d25b4440d65431e40f7589bfc249a0452556fa74a57756af1cc65651d","source":{"kind":"arxiv","id":"1903.00994","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00994","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00994v1","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00994","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"pith_short_12","alias_value":"5CPGYHJFWRCA","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5CPGYHJFWRCA2ZKD","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5CPGYHJF","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5CPGYHJFWRCA2ZKDDZAPOWE37Q","target":"record","payload":{"canonical_record":{"source":{"id":"1903.00994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-03T21:27:49Z","cross_cats_sorted":[],"title_canon_sha256":"7ca1153d53cb27f60d3433dbf9989acf93a40db6075fc8b50e0277df62fa3ab2","abstract_canon_sha256":"a11dbd67999d1812268b858b0780b1c1bd3476b469ac6b376eaf72004fad33af"},"schema_version":"1.0"},"canonical_sha256":"e89e6c1d25b4440d65431e40f7589bfc249a0452556fa74a57756af1cc65651d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:12.599562Z","signature_b64":"WiFOHpXCpajwtFJd1/Ly6UO9epnVussF2YAfaq0Mdr3CPmsasMVCdWjhNEoquCugYKeEoWQwCuqjb2Gc8Yh9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e89e6c1d25b4440d65431e40f7589bfc249a0452556fa74a57756af1cc65651d","last_reissued_at":"2026-05-17T23:52:12.598855Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:12.598855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.00994","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-17T23:52:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nP8cPdk2jla5DVDr4ZvDFjZUf/rhH5WpAmE2+aQdtkShtIkaVHLjoRZO8vky3hmSNbGAvPL5Ih43mq5TC2LdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:32:17.599909Z"},"content_sha256":"ea3cb42a1a029970819b40dd21accf9d43c1b7c0551df78f1b8e4f8df1e92674","schema_version":"1.0","event_id":"sha256:ea3cb42a1a029970819b40dd21accf9d43c1b7c0551df78f1b8e4f8df1e92674"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5CPGYHJFWRCA2ZKDDZAPOWE37Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"dRRT*: Scalable and Informed Asymptotically-Optimal Multi-Robot Motion Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Andrew Dobson, Dan Halperin, Kiril Solovey, Kostas E. Bekris, Rahul Shome","submitted_at":"2019-03-03T21:27:49Z","abstract_excerpt":"Many exciting robotic applications require multiple robots with many degrees of freedom, such as manipulators, to coordinate their motion in a shared workspace. Discovering high-quality paths in such scenarios can be achieved, in principle, by exploring the composite space of all robots. Sampling-based planners do so by building a roadmap or a tree data structure in the corresponding configuration space and can achieve asymptotic optimality. The hardness of motion planning, however, renders the explicit construction of such structures in the composite space of multiple robots impractical. This"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00994","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-17T23:52:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dlS8QXspla96rKtwlsNuN57wUKAGn3eq+cifF3eWyR10CPmdHJOKjhuFf20Qq0r9KPNWdO3dBwTNMjEoMB/MAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:32:17.600527Z"},"content_sha256":"b0aef2e473184c5f9a16cffb80a3aa8cb8b3353b894b586a430b6ee97a8ab4c3","schema_version":"1.0","event_id":"sha256:b0aef2e473184c5f9a16cffb80a3aa8cb8b3353b894b586a430b6ee97a8ab4c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5CPGYHJFWRCA2ZKDDZAPOWE37Q/bundle.json","state_url":"https://pith.science/pith/5CPGYHJFWRCA2ZKDDZAPOWE37Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5CPGYHJFWRCA2ZKDDZAPOWE37Q/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:32:17Z","links":{"resolver":"https://pith.science/pith/5CPGYHJFWRCA2ZKDDZAPOWE37Q","bundle":"https://pith.science/pith/5CPGYHJFWRCA2ZKDDZAPOWE37Q/bundle.json","state":"https://pith.science/pith/5CPGYHJFWRCA2ZKDDZAPOWE37Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5CPGYHJFWRCA2ZKDDZAPOWE37Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5CPGYHJFWRCA2ZKDDZAPOWE37Q","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":"a11dbd67999d1812268b858b0780b1c1bd3476b469ac6b376eaf72004fad33af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-03T21:27:49Z","title_canon_sha256":"7ca1153d53cb27f60d3433dbf9989acf93a40db6075fc8b50e0277df62fa3ab2"},"schema_version":"1.0","source":{"id":"1903.00994","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00994","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00994v1","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00994","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"pith_short_12","alias_value":"5CPGYHJFWRCA","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5CPGYHJFWRCA2ZKD","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5CPGYHJF","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:b0aef2e473184c5f9a16cffb80a3aa8cb8b3353b894b586a430b6ee97a8ab4c3","target":"graph","created_at":"2026-05-17T23:52:12Z","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":"Many exciting robotic applications require multiple robots with many degrees of freedom, such as manipulators, to coordinate their motion in a shared workspace. Discovering high-quality paths in such scenarios can be achieved, in principle, by exploring the composite space of all robots. Sampling-based planners do so by building a roadmap or a tree data structure in the corresponding configuration space and can achieve asymptotic optimality. The hardness of motion planning, however, renders the explicit construction of such structures in the composite space of multiple robots impractical. This","authors_text":"Andrew Dobson, Dan Halperin, Kiril Solovey, Kostas E. Bekris, Rahul Shome","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-03T21:27:49Z","title":"dRRT*: Scalable and Informed Asymptotically-Optimal Multi-Robot Motion Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00994","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:ea3cb42a1a029970819b40dd21accf9d43c1b7c0551df78f1b8e4f8df1e92674","target":"record","created_at":"2026-05-17T23:52:12Z","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":"a11dbd67999d1812268b858b0780b1c1bd3476b469ac6b376eaf72004fad33af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-03T21:27:49Z","title_canon_sha256":"7ca1153d53cb27f60d3433dbf9989acf93a40db6075fc8b50e0277df62fa3ab2"},"schema_version":"1.0","source":{"id":"1903.00994","kind":"arxiv","version":1}},"canonical_sha256":"e89e6c1d25b4440d65431e40f7589bfc249a0452556fa74a57756af1cc65651d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e89e6c1d25b4440d65431e40f7589bfc249a0452556fa74a57756af1cc65651d","first_computed_at":"2026-05-17T23:52:12.598855Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:12.598855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WiFOHpXCpajwtFJd1/Ly6UO9epnVussF2YAfaq0Mdr3CPmsasMVCdWjhNEoquCugYKeEoWQwCuqjb2Gc8Yh9Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:12.599562Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.00994","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea3cb42a1a029970819b40dd21accf9d43c1b7c0551df78f1b8e4f8df1e92674","sha256:b0aef2e473184c5f9a16cffb80a3aa8cb8b3353b894b586a430b6ee97a8ab4c3"],"state_sha256":"3387aee28fdadfcd977932c67de3da2e6d3943d5fb23bf623d49e4927cc69deb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qNSPNoo1D0qxN6Xji6crtZ8as24ARDD8YHtoo8vvXXHYwSjpQs83damydo5BLg+3XQVwcv/7Q1BDyyDOiDqWDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T04:32:17.603620Z","bundle_sha256":"8dbe215c59852040c44c6a169046a7cca4b13f497d957afbd96a0852dd1901d8"}}