{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FEIMCTXCVOTNTG4D4FIAZGYK32","short_pith_number":"pith:FEIMCTXC","schema_version":"1.0","canonical_sha256":"2910c14ee2aba6d99b83e1500c9b0adead707efbf7f72eb141822c7e2b415a87","source":{"kind":"arxiv","id":"1607.04800","version":3},"attestation_state":"computed","paper":{"title":"Collision detection or nearest-neighbor search? On the computational bottleneck in sampling-based motion planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.RO","authors_text":"Dan Halperin, Michal Kleinbort, Oren Salzman","submitted_at":"2016-07-16T20:19:29Z","abstract_excerpt":"The complexity of nearest-neighbor search dominates the asymptotic running time of many sampling-based motion-planning algorithms. However, collision detection is often considered to be the computational bottleneck in practice. Examining various asymptotically optimal planning algorithms, we characterize settings, which we call NN-sensitive, in which the practical computational role of nearest-neighbor search is far from being negligible, i.e., the portion of running time taken up by nearest-neighbor search is comparable, or sometimes even greater than the portion of time taken up by collision"},"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":"1607.04800","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-07-16T20:19:29Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"32bca7a835fdcf77f2bede0a8049fcf1837577e1f632d074922e5b56900500cc","abstract_canon_sha256":"b419186745d69b9572bc43f7d2a0af9f9d73e09288622449ee4e9bfa1b47a342"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:52.715671Z","signature_b64":"wXl+Y/AAlLpl08AyBAWgzWrzD0euLelmxvIGAwuc61stcuy8XUG7RzdZvdfGQln5ILD91po0Bp/29j/GNSDODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2910c14ee2aba6d99b83e1500c9b0adead707efbf7f72eb141822c7e2b415a87","last_reissued_at":"2026-05-18T01:00:52.714972Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:52.714972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Collision detection or nearest-neighbor search? On the computational bottleneck in sampling-based motion planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.RO","authors_text":"Dan Halperin, Michal Kleinbort, Oren Salzman","submitted_at":"2016-07-16T20:19:29Z","abstract_excerpt":"The complexity of nearest-neighbor search dominates the asymptotic running time of many sampling-based motion-planning algorithms. However, collision detection is often considered to be the computational bottleneck in practice. Examining various asymptotically optimal planning algorithms, we characterize settings, which we call NN-sensitive, in which the practical computational role of nearest-neighbor search is far from being negligible, i.e., the portion of running time taken up by nearest-neighbor search is comparable, or sometimes even greater than the portion of time taken up by collision"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04800","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":""},"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":"1607.04800","created_at":"2026-05-18T01:00:52.715063+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.04800v3","created_at":"2026-05-18T01:00:52.715063+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04800","created_at":"2026-05-18T01:00:52.715063+00:00"},{"alias_kind":"pith_short_12","alias_value":"FEIMCTXCVOTN","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FEIMCTXCVOTNTG4D","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FEIMCTXC","created_at":"2026-05-18T12:30:15.759754+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.09785","citing_title":"An Efficient B-spline-Based Kinodynamic Replanning Framework for Quadrotors","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FEIMCTXCVOTNTG4D4FIAZGYK32","json":"https://pith.science/pith/FEIMCTXCVOTNTG4D4FIAZGYK32.json","graph_json":"https://pith.science/api/pith-number/FEIMCTXCVOTNTG4D4FIAZGYK32/graph.json","events_json":"https://pith.science/api/pith-number/FEIMCTXCVOTNTG4D4FIAZGYK32/events.json","paper":"https://pith.science/paper/FEIMCTXC"},"agent_actions":{"view_html":"https://pith.science/pith/FEIMCTXCVOTNTG4D4FIAZGYK32","download_json":"https://pith.science/pith/FEIMCTXCVOTNTG4D4FIAZGYK32.json","view_paper":"https://pith.science/paper/FEIMCTXC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.04800&json=true","fetch_graph":"https://pith.science/api/pith-number/FEIMCTXCVOTNTG4D4FIAZGYK32/graph.json","fetch_events":"https://pith.science/api/pith-number/FEIMCTXCVOTNTG4D4FIAZGYK32/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FEIMCTXCVOTNTG4D4FIAZGYK32/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FEIMCTXCVOTNTG4D4FIAZGYK32/action/storage_attestation","attest_author":"https://pith.science/pith/FEIMCTXCVOTNTG4D4FIAZGYK32/action/author_attestation","sign_citation":"https://pith.science/pith/FEIMCTXCVOTNTG4D4FIAZGYK32/action/citation_signature","submit_replication":"https://pith.science/pith/FEIMCTXCVOTNTG4D4FIAZGYK32/action/replication_record"}},"created_at":"2026-05-18T01:00:52.715063+00:00","updated_at":"2026-05-18T01:00:52.715063+00:00"}