{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FEIMCTXCVOTNTG4D4FIAZGYK32","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":"b419186745d69b9572bc43f7d2a0af9f9d73e09288622449ee4e9bfa1b47a342","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-07-16T20:19:29Z","title_canon_sha256":"32bca7a835fdcf77f2bede0a8049fcf1837577e1f632d074922e5b56900500cc"},"schema_version":"1.0","source":{"id":"1607.04800","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04800","created_at":"2026-05-18T01:00:52Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04800v3","created_at":"2026-05-18T01:00:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04800","created_at":"2026-05-18T01:00:52Z"},{"alias_kind":"pith_short_12","alias_value":"FEIMCTXCVOTN","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FEIMCTXCVOTNTG4D","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FEIMCTXC","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:f1225cef4c42c58ece438a436503201ff29102c5805de07a80eab4d05b9d12a5","target":"graph","created_at":"2026-05-18T01:00: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":"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","authors_text":"Dan Halperin, Michal Kleinbort, Oren Salzman","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-07-16T20:19:29Z","title":"Collision detection or nearest-neighbor search? On the computational bottleneck in sampling-based motion planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04800","kind":"arxiv","version":3},"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:cf9f67e477fe046e6327840dfb55e34fee0f6119507d96d32ea2806071c2741e","target":"record","created_at":"2026-05-18T01:00: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":"b419186745d69b9572bc43f7d2a0af9f9d73e09288622449ee4e9bfa1b47a342","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-07-16T20:19:29Z","title_canon_sha256":"32bca7a835fdcf77f2bede0a8049fcf1837577e1f632d074922e5b56900500cc"},"schema_version":"1.0","source":{"id":"1607.04800","kind":"arxiv","version":3}},"canonical_sha256":"2910c14ee2aba6d99b83e1500c9b0adead707efbf7f72eb141822c7e2b415a87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2910c14ee2aba6d99b83e1500c9b0adead707efbf7f72eb141822c7e2b415a87","first_computed_at":"2026-05-18T01:00:52.714972Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:52.714972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wXl+Y/AAlLpl08AyBAWgzWrzD0euLelmxvIGAwuc61stcuy8XUG7RzdZvdfGQln5ILD91po0Bp/29j/GNSDODg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:52.715671Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.04800","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf9f67e477fe046e6327840dfb55e34fee0f6119507d96d32ea2806071c2741e","sha256:f1225cef4c42c58ece438a436503201ff29102c5805de07a80eab4d05b9d12a5"],"state_sha256":"1d53f2be5c102f3eb9fdb902f7dae414a96e4b8b755557c202287216c27f6c53"}