{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UMAIZH4ZNZ34HGWTXLLHQS5FX2","short_pith_number":"pith:UMAIZH4Z","schema_version":"1.0","canonical_sha256":"a3008c9f996e77c39ad3bad6784ba5be8e53a811bdaca939be767c5c8a8d3332","source":{"kind":"arxiv","id":"1809.10252","version":1},"attestation_state":"computed","paper":{"title":"Deeply Informed Neural Sampling for Robot Motion Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.RO","authors_text":"Ahmed H. Qureshi, Michael C. Yip","submitted_at":"2018-09-26T22:14:55Z","abstract_excerpt":"Sampling-based Motion Planners (SMPs) have become increasingly popular as they provide collision-free path solutions regardless of obstacle geometry in a given environment. However, their computational complexity increases significantly with the dimensionality of the motion planning problem. Adaptive sampling is one of the ways to speed up SMPs by sampling a particular region of a configuration space that is more likely to contain an optimal path solution. Although there are a wide variety of algorithms for adaptive sampling, they rely on hand-crafted heuristics; furthermore, their performance"},"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":"1809.10252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-09-26T22:14:55Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e8a50d5e97dadec147a31c17c4df0630d0a9d29b3a1c06f98386230e7289a712","abstract_canon_sha256":"fe716bbb8196c0f32e7b21580ad3fec8688663b71c41a969d793cb9d63f7aea7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:38.741915Z","signature_b64":"CIt4vaj0J+2CdgIq6tOiUTyAPsavtWZ7zQOcqjk9VGMRL6FtyvDXoHuOhWjAfC7/9dbiTB+mxpcLEyHU8v8QAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3008c9f996e77c39ad3bad6784ba5be8e53a811bdaca939be767c5c8a8d3332","last_reissued_at":"2026-05-18T00:04:38.741567Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:38.741567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deeply Informed Neural Sampling for Robot Motion Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.RO","authors_text":"Ahmed H. Qureshi, Michael C. Yip","submitted_at":"2018-09-26T22:14:55Z","abstract_excerpt":"Sampling-based Motion Planners (SMPs) have become increasingly popular as they provide collision-free path solutions regardless of obstacle geometry in a given environment. However, their computational complexity increases significantly with the dimensionality of the motion planning problem. Adaptive sampling is one of the ways to speed up SMPs by sampling a particular region of a configuration space that is more likely to contain an optimal path solution. Although there are a wide variety of algorithms for adaptive sampling, they rely on hand-crafted heuristics; furthermore, their performance"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10252","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.10252","created_at":"2026-05-18T00:04:38.741623+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.10252v1","created_at":"2026-05-18T00:04:38.741623+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10252","created_at":"2026-05-18T00:04:38.741623+00:00"},{"alias_kind":"pith_short_12","alias_value":"UMAIZH4ZNZ34","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UMAIZH4ZNZ34HGWT","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UMAIZH4Z","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.05451","citing_title":"Mapping State Space using Landmarks for Universal Goal Reaching","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UMAIZH4ZNZ34HGWTXLLHQS5FX2","json":"https://pith.science/pith/UMAIZH4ZNZ34HGWTXLLHQS5FX2.json","graph_json":"https://pith.science/api/pith-number/UMAIZH4ZNZ34HGWTXLLHQS5FX2/graph.json","events_json":"https://pith.science/api/pith-number/UMAIZH4ZNZ34HGWTXLLHQS5FX2/events.json","paper":"https://pith.science/paper/UMAIZH4Z"},"agent_actions":{"view_html":"https://pith.science/pith/UMAIZH4ZNZ34HGWTXLLHQS5FX2","download_json":"https://pith.science/pith/UMAIZH4ZNZ34HGWTXLLHQS5FX2.json","view_paper":"https://pith.science/paper/UMAIZH4Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.10252&json=true","fetch_graph":"https://pith.science/api/pith-number/UMAIZH4ZNZ34HGWTXLLHQS5FX2/graph.json","fetch_events":"https://pith.science/api/pith-number/UMAIZH4ZNZ34HGWTXLLHQS5FX2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UMAIZH4ZNZ34HGWTXLLHQS5FX2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UMAIZH4ZNZ34HGWTXLLHQS5FX2/action/storage_attestation","attest_author":"https://pith.science/pith/UMAIZH4ZNZ34HGWTXLLHQS5FX2/action/author_attestation","sign_citation":"https://pith.science/pith/UMAIZH4ZNZ34HGWTXLLHQS5FX2/action/citation_signature","submit_replication":"https://pith.science/pith/UMAIZH4ZNZ34HGWTXLLHQS5FX2/action/replication_record"}},"created_at":"2026-05-18T00:04:38.741623+00:00","updated_at":"2026-05-18T00:04:38.741623+00:00"}