{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:42YKZUCL7SOZ5NQBT46NWQIEQ3","short_pith_number":"pith:42YKZUCL","schema_version":"1.0","canonical_sha256":"e6b0acd04bfc9d9eb6019f3cdb410486e2485bbd233eaaa6327a9c15f6cb95f7","source":{"kind":"arxiv","id":"1709.07610","version":1},"attestation_state":"computed","paper":{"title":"Efficient Nearest-Neighbor Search for Dynamical Systems with Nonholonomic Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.RO","cs.SY"],"primary_cat":"cs.CG","authors_text":"Brian Paden, Dmitry Yershov, Emilio Frazzoli, Valerio Varricchio","submitted_at":"2017-09-22T07:06:12Z","abstract_excerpt":"Nearest-neighbor search dominates the asymptotic complexity of sampling-based motion planning algorithms and is often addressed with k-d tree data structures. While it is generally believed that the expected complexity of nearest-neighbor queries is $O(log(N))$ in the size of the tree, this paper reveals that when a classic k-d tree approach is used with sub-Riemannian metrics, the expected query complexity is in fact $\\Theta(N^p \\log(N))$ for a number $p \\in [0, 1)$ determined by the degree of nonholonomy of the system. These metrics arise naturally in nonholonomic mechanical systems, includi"},"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":"1709.07610","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-22T07:06:12Z","cross_cats_sorted":["cs.CC","cs.RO","cs.SY"],"title_canon_sha256":"3811598af2c925340ba9bea3287e47e4d1d3c12969a9fb80df856b06eeb99e31","abstract_canon_sha256":"a73f6aa928f9fec0a068f0271e7996592e4b130d09cfb87f6de1614606d42973"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:32.721827Z","signature_b64":"JYBRXwY4ucdSgxoqA9tfNAwGox6y8SGr2vJpFGdE5/Wy5VRkPrH3ipfIGRP4y4FhcSF4zA6rGZPuN3idMV9lDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6b0acd04bfc9d9eb6019f3cdb410486e2485bbd233eaaa6327a9c15f6cb95f7","last_reissued_at":"2026-05-18T00:34:32.721484Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:32.721484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Nearest-Neighbor Search for Dynamical Systems with Nonholonomic Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.RO","cs.SY"],"primary_cat":"cs.CG","authors_text":"Brian Paden, Dmitry Yershov, Emilio Frazzoli, Valerio Varricchio","submitted_at":"2017-09-22T07:06:12Z","abstract_excerpt":"Nearest-neighbor search dominates the asymptotic complexity of sampling-based motion planning algorithms and is often addressed with k-d tree data structures. While it is generally believed that the expected complexity of nearest-neighbor queries is $O(log(N))$ in the size of the tree, this paper reveals that when a classic k-d tree approach is used with sub-Riemannian metrics, the expected query complexity is in fact $\\Theta(N^p \\log(N))$ for a number $p \\in [0, 1)$ determined by the degree of nonholonomy of the system. These metrics arise naturally in nonholonomic mechanical systems, includi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07610","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":"1709.07610","created_at":"2026-05-18T00:34:32.721537+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.07610v1","created_at":"2026-05-18T00:34:32.721537+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07610","created_at":"2026-05-18T00:34:32.721537+00:00"},{"alias_kind":"pith_short_12","alias_value":"42YKZUCL7SOZ","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"42YKZUCL7SOZ5NQB","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"42YKZUCL","created_at":"2026-05-18T12:30:58.224056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/42YKZUCL7SOZ5NQBT46NWQIEQ3","json":"https://pith.science/pith/42YKZUCL7SOZ5NQBT46NWQIEQ3.json","graph_json":"https://pith.science/api/pith-number/42YKZUCL7SOZ5NQBT46NWQIEQ3/graph.json","events_json":"https://pith.science/api/pith-number/42YKZUCL7SOZ5NQBT46NWQIEQ3/events.json","paper":"https://pith.science/paper/42YKZUCL"},"agent_actions":{"view_html":"https://pith.science/pith/42YKZUCL7SOZ5NQBT46NWQIEQ3","download_json":"https://pith.science/pith/42YKZUCL7SOZ5NQBT46NWQIEQ3.json","view_paper":"https://pith.science/paper/42YKZUCL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.07610&json=true","fetch_graph":"https://pith.science/api/pith-number/42YKZUCL7SOZ5NQBT46NWQIEQ3/graph.json","fetch_events":"https://pith.science/api/pith-number/42YKZUCL7SOZ5NQBT46NWQIEQ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/42YKZUCL7SOZ5NQBT46NWQIEQ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/42YKZUCL7SOZ5NQBT46NWQIEQ3/action/storage_attestation","attest_author":"https://pith.science/pith/42YKZUCL7SOZ5NQBT46NWQIEQ3/action/author_attestation","sign_citation":"https://pith.science/pith/42YKZUCL7SOZ5NQBT46NWQIEQ3/action/citation_signature","submit_replication":"https://pith.science/pith/42YKZUCL7SOZ5NQBT46NWQIEQ3/action/replication_record"}},"created_at":"2026-05-18T00:34:32.721537+00:00","updated_at":"2026-05-18T00:34:32.721537+00:00"}