{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AFDU5XAUDQL36WDBPHYCKGVUPM","short_pith_number":"pith:AFDU5XAU","schema_version":"1.0","canonical_sha256":"01474edc141c17bf586179f0251ab47b032fed040389680a37ada61c4631b9c9","source":{"kind":"arxiv","id":"1907.06013","version":3},"attestation_state":"computed","paper":{"title":"Motion Planning Networks: Bridging the Gap Between Learning-based and Classical Motion Planners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"Ahmed H. Qureshi, Anthony Simeonov, Michael C. Yip, Yinglong Miao","submitted_at":"2019-07-13T05:34:01Z","abstract_excerpt":"This paper describes Motion Planning Networks (MPNet), a computationally efficient, learning-based neural planner for solving motion planning problems. MPNet uses neural networks to learn general near-optimal heuristics for path planning in seen and unseen environments. It takes environment information such as raw point-cloud from depth sensors, as well as a robot's initial and desired goal configurations and recursively calls itself to bidirectionally generate connectable paths. In addition to finding directly connectable and near-optimal paths in a single pass, we show that worst-case theore"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1907.06013","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-07-13T05:34:01Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"cfc21859747f12c72f8be0c689f6cfafad24a5a2850ba0cbfcac70cf6cd6b0bd","abstract_canon_sha256":"246190b38992f1e1170e865750591ca2b18d511e2c0193e146cb85d9a2814b1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:13:53.554052Z","signature_b64":"vOd65wC7G4orqV0GPlfzRmg/eKDJNbmIBuGUISvo3WyLyKz+CLt+lnKwzalkmLT8KRtl/sY3D3FQrF0yR2pzBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01474edc141c17bf586179f0251ab47b032fed040389680a37ada61c4631b9c9","last_reissued_at":"2026-07-05T01:13:53.553690Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:13:53.553690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Motion Planning Networks: Bridging the Gap Between Learning-based and Classical Motion Planners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"Ahmed H. Qureshi, Anthony Simeonov, Michael C. Yip, Yinglong Miao","submitted_at":"2019-07-13T05:34:01Z","abstract_excerpt":"This paper describes Motion Planning Networks (MPNet), a computationally efficient, learning-based neural planner for solving motion planning problems. MPNet uses neural networks to learn general near-optimal heuristics for path planning in seen and unseen environments. It takes environment information such as raw point-cloud from depth sensors, as well as a robot's initial and desired goal configurations and recursively calls itself to bidirectionally generate connectable paths. In addition to finding directly connectable and near-optimal paths in a single pass, we show that worst-case theore"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06013","kind":"arxiv","version":3},"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/1907.06013/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.06013","created_at":"2026-07-05T01:13:53.553750+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.06013v3","created_at":"2026-07-05T01:13:53.553750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06013","created_at":"2026-07-05T01:13:53.553750+00:00"},{"alias_kind":"pith_short_12","alias_value":"AFDU5XAUDQL3","created_at":"2026-07-05T01:13:53.553750+00:00"},{"alias_kind":"pith_short_16","alias_value":"AFDU5XAUDQL36WDB","created_at":"2026-07-05T01:13:53.553750+00:00"},{"alias_kind":"pith_short_8","alias_value":"AFDU5XAU","created_at":"2026-07-05T01:13:53.553750+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.13507","citing_title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AFDU5XAUDQL36WDBPHYCKGVUPM","json":"https://pith.science/pith/AFDU5XAUDQL36WDBPHYCKGVUPM.json","graph_json":"https://pith.science/api/pith-number/AFDU5XAUDQL36WDBPHYCKGVUPM/graph.json","events_json":"https://pith.science/api/pith-number/AFDU5XAUDQL36WDBPHYCKGVUPM/events.json","paper":"https://pith.science/paper/AFDU5XAU"},"agent_actions":{"view_html":"https://pith.science/pith/AFDU5XAUDQL36WDBPHYCKGVUPM","download_json":"https://pith.science/pith/AFDU5XAUDQL36WDBPHYCKGVUPM.json","view_paper":"https://pith.science/paper/AFDU5XAU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.06013&json=true","fetch_graph":"https://pith.science/api/pith-number/AFDU5XAUDQL36WDBPHYCKGVUPM/graph.json","fetch_events":"https://pith.science/api/pith-number/AFDU5XAUDQL36WDBPHYCKGVUPM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AFDU5XAUDQL36WDBPHYCKGVUPM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AFDU5XAUDQL36WDBPHYCKGVUPM/action/storage_attestation","attest_author":"https://pith.science/pith/AFDU5XAUDQL36WDBPHYCKGVUPM/action/author_attestation","sign_citation":"https://pith.science/pith/AFDU5XAUDQL36WDBPHYCKGVUPM/action/citation_signature","submit_replication":"https://pith.science/pith/AFDU5XAUDQL36WDBPHYCKGVUPM/action/replication_record"}},"created_at":"2026-07-05T01:13:53.553750+00:00","updated_at":"2026-07-05T01:13:53.553750+00:00"}