{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LGLOJG4IUTNMU22YTIEFFPHDOC","short_pith_number":"pith:LGLOJG4I","canonical_record":{"source":{"id":"1806.05767","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-06-14T23:48:08Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"9f7738c41b3c66bd3931069cfd5e837b7071d49c5b9161ba13815611820d7932","abstract_canon_sha256":"34c0542d2cda07310a100b0005ffc93256f832ac99deeb2bb1186cd4b1de9e64"},"schema_version":"1.0"},"canonical_sha256":"5996e49b88a4daca6b589a0852bce370bda5e7c405e1ba96b421555fd9dedb9e","source":{"kind":"arxiv","id":"1806.05767","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.05767","created_at":"2026-05-17T23:52:52Z"},{"alias_kind":"arxiv_version","alias_value":"1806.05767v2","created_at":"2026-05-17T23:52:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.05767","created_at":"2026-05-17T23:52:52Z"},{"alias_kind":"pith_short_12","alias_value":"LGLOJG4IUTNM","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LGLOJG4IUTNMU22Y","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LGLOJG4I","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LGLOJG4IUTNMU22YTIEFFPHDOC","target":"record","payload":{"canonical_record":{"source":{"id":"1806.05767","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-06-14T23:48:08Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"9f7738c41b3c66bd3931069cfd5e837b7071d49c5b9161ba13815611820d7932","abstract_canon_sha256":"34c0542d2cda07310a100b0005ffc93256f832ac99deeb2bb1186cd4b1de9e64"},"schema_version":"1.0"},"canonical_sha256":"5996e49b88a4daca6b589a0852bce370bda5e7c405e1ba96b421555fd9dedb9e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:52.877497Z","signature_b64":"Qt/eR2DzRtU25He2i87W5Eck7uhhL6n2BpGmMffu7/Of7aSyB/U/4llWGdQNJ6v0g9iP9FMWNDXSfcDFAQQaCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5996e49b88a4daca6b589a0852bce370bda5e7c405e1ba96b421555fd9dedb9e","last_reissued_at":"2026-05-17T23:52:52.876820Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:52.876820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.05767","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-17T23:52:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tH3jq+enw+EwlWpEdKlcTiROpUceh2TWOwYfpsMdvH239nMZS0NDsIhldPzfjCJ1rROEt9roDYIzibBw4saPAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:05:55.066242Z"},"content_sha256":"593c375587b4904243261990974d9b8459a4507df132173d82e88fd988e066ab","schema_version":"1.0","event_id":"sha256:593c375587b4904243261990974d9b8459a4507df132173d82e88fd988e066ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LGLOJG4IUTNMU22YTIEFFPHDOC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Motion Planning Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.RO","authors_text":"Ahmed H. Qureshi, Anthony Simeonov, Mayur J. Bency, Michael C. Yip","submitted_at":"2018-06-14T23:48:08Z","abstract_excerpt":"Fast and efficient motion planning algorithms are crucial for many state-of-the-art robotics applications such as self-driving cars. Existing motion planning methods become ineffective as their computational complexity increases exponentially with the dimensionality of the motion planning problem. To address this issue, we present Motion Planning Networks (MPNet), a neural network-based novel planning algorithm. The proposed method encodes the given workspaces directly from a point cloud measurement and generates the end-to-end collision-free paths for the given start and goal configurations. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.05767","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-17T23:52:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XrPg7OEhOjPnYUfmHCH1X1bcemXUTHffyFD/bWBV/mfGI4J0tBttttz8ljZePZktxuBEyQ/QmPsHttv4wLhvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:05:55.066947Z"},"content_sha256":"360bdf5c4ef9dd6e7aa1b59b13800131a195144b972af55e11f9cf2e6231584b","schema_version":"1.0","event_id":"sha256:360bdf5c4ef9dd6e7aa1b59b13800131a195144b972af55e11f9cf2e6231584b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LGLOJG4IUTNMU22YTIEFFPHDOC/bundle.json","state_url":"https://pith.science/pith/LGLOJG4IUTNMU22YTIEFFPHDOC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LGLOJG4IUTNMU22YTIEFFPHDOC/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-26T18:05:55Z","links":{"resolver":"https://pith.science/pith/LGLOJG4IUTNMU22YTIEFFPHDOC","bundle":"https://pith.science/pith/LGLOJG4IUTNMU22YTIEFFPHDOC/bundle.json","state":"https://pith.science/pith/LGLOJG4IUTNMU22YTIEFFPHDOC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LGLOJG4IUTNMU22YTIEFFPHDOC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LGLOJG4IUTNMU22YTIEFFPHDOC","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":"34c0542d2cda07310a100b0005ffc93256f832ac99deeb2bb1186cd4b1de9e64","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-06-14T23:48:08Z","title_canon_sha256":"9f7738c41b3c66bd3931069cfd5e837b7071d49c5b9161ba13815611820d7932"},"schema_version":"1.0","source":{"id":"1806.05767","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.05767","created_at":"2026-05-17T23:52:52Z"},{"alias_kind":"arxiv_version","alias_value":"1806.05767v2","created_at":"2026-05-17T23:52:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.05767","created_at":"2026-05-17T23:52:52Z"},{"alias_kind":"pith_short_12","alias_value":"LGLOJG4IUTNM","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LGLOJG4IUTNMU22Y","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LGLOJG4I","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:360bdf5c4ef9dd6e7aa1b59b13800131a195144b972af55e11f9cf2e6231584b","target":"graph","created_at":"2026-05-17T23:52:52Z","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":"Fast and efficient motion planning algorithms are crucial for many state-of-the-art robotics applications such as self-driving cars. Existing motion planning methods become ineffective as their computational complexity increases exponentially with the dimensionality of the motion planning problem. To address this issue, we present Motion Planning Networks (MPNet), a neural network-based novel planning algorithm. The proposed method encodes the given workspaces directly from a point cloud measurement and generates the end-to-end collision-free paths for the given start and goal configurations. ","authors_text":"Ahmed H. Qureshi, Anthony Simeonov, Mayur J. Bency, Michael C. Yip","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-06-14T23:48:08Z","title":"Motion Planning Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.05767","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:593c375587b4904243261990974d9b8459a4507df132173d82e88fd988e066ab","target":"record","created_at":"2026-05-17T23:52:52Z","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":"34c0542d2cda07310a100b0005ffc93256f832ac99deeb2bb1186cd4b1de9e64","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-06-14T23:48:08Z","title_canon_sha256":"9f7738c41b3c66bd3931069cfd5e837b7071d49c5b9161ba13815611820d7932"},"schema_version":"1.0","source":{"id":"1806.05767","kind":"arxiv","version":2}},"canonical_sha256":"5996e49b88a4daca6b589a0852bce370bda5e7c405e1ba96b421555fd9dedb9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5996e49b88a4daca6b589a0852bce370bda5e7c405e1ba96b421555fd9dedb9e","first_computed_at":"2026-05-17T23:52:52.876820Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:52.876820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qt/eR2DzRtU25He2i87W5Eck7uhhL6n2BpGmMffu7/Of7aSyB/U/4llWGdQNJ6v0g9iP9FMWNDXSfcDFAQQaCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:52.877497Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.05767","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:593c375587b4904243261990974d9b8459a4507df132173d82e88fd988e066ab","sha256:360bdf5c4ef9dd6e7aa1b59b13800131a195144b972af55e11f9cf2e6231584b"],"state_sha256":"885a0a5545c288c103243c287979f8914b22329e5a03b2c0e538cedd67c9fe78"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vsxmRmPehfWLJd4/iCXROsaTicUaO1ycl52l3cxnX18qJh8DbUenXxjjbUfSHz4fFko5F0dI8HhWS9Oex28CAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:05:55.070119Z","bundle_sha256":"03c02c674761fadef47bcdd806d678bb6316529d8b7c05c67c7e66cba75c0bde"}}