{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:42YKZUCL7SOZ5NQBT46NWQIEQ3","short_pith_number":"pith:42YKZUCL","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"},"canonical_sha256":"e6b0acd04bfc9d9eb6019f3cdb410486e2485bbd233eaaa6327a9c15f6cb95f7","source":{"kind":"arxiv","id":"1709.07610","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07610","created_at":"2026-05-18T00:34:32Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07610v1","created_at":"2026-05-18T00:34:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07610","created_at":"2026-05-18T00:34:32Z"},{"alias_kind":"pith_short_12","alias_value":"42YKZUCL7SOZ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"42YKZUCL7SOZ5NQB","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"42YKZUCL","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:42YKZUCL7SOZ5NQBT46NWQIEQ3","target":"record","payload":{"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"},"canonical_sha256":"e6b0acd04bfc9d9eb6019f3cdb410486e2485bbd233eaaa6327a9c15f6cb95f7","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"},"source_kind":"arxiv","source_id":"1709.07610","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:34:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rUmBOhe+bcCIZysKSSvtjMOa/fgr44Opj/wIE2E9k8nOBXIXdD79UZdF8WAR6/euU5RFumhqgHuUgw4gNqetBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:39:28.447408Z"},"content_sha256":"d45b9c9a17da5021e0abb9ce3eac0c728e4b5b248daad1866763f353141231f8","schema_version":"1.0","event_id":"sha256:d45b9c9a17da5021e0abb9ce3eac0c728e4b5b248daad1866763f353141231f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:42YKZUCL7SOZ5NQBT46NWQIEQ3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:34:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cOfd95nCxs+4OaUmz0r115pfHhb4gNb0MjgzQoo9pfPT2B2oRx0kh5L2F3CC+f0skUoFjqMm0v1JxQV9Sb32AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:39:28.448078Z"},"content_sha256":"ba435319d2c3488f982a73b5b6783658c743263abfbaae3d6912c96ea4adff2f","schema_version":"1.0","event_id":"sha256:ba435319d2c3488f982a73b5b6783658c743263abfbaae3d6912c96ea4adff2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/42YKZUCL7SOZ5NQBT46NWQIEQ3/bundle.json","state_url":"https://pith.science/pith/42YKZUCL7SOZ5NQBT46NWQIEQ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/42YKZUCL7SOZ5NQBT46NWQIEQ3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T16:39:28Z","links":{"resolver":"https://pith.science/pith/42YKZUCL7SOZ5NQBT46NWQIEQ3","bundle":"https://pith.science/pith/42YKZUCL7SOZ5NQBT46NWQIEQ3/bundle.json","state":"https://pith.science/pith/42YKZUCL7SOZ5NQBT46NWQIEQ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/42YKZUCL7SOZ5NQBT46NWQIEQ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:42YKZUCL7SOZ5NQBT46NWQIEQ3","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":"a73f6aa928f9fec0a068f0271e7996592e4b130d09cfb87f6de1614606d42973","cross_cats_sorted":["cs.CC","cs.RO","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-22T07:06:12Z","title_canon_sha256":"3811598af2c925340ba9bea3287e47e4d1d3c12969a9fb80df856b06eeb99e31"},"schema_version":"1.0","source":{"id":"1709.07610","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07610","created_at":"2026-05-18T00:34:32Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07610v1","created_at":"2026-05-18T00:34:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07610","created_at":"2026-05-18T00:34:32Z"},{"alias_kind":"pith_short_12","alias_value":"42YKZUCL7SOZ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"42YKZUCL7SOZ5NQB","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"42YKZUCL","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:ba435319d2c3488f982a73b5b6783658c743263abfbaae3d6912c96ea4adff2f","target":"graph","created_at":"2026-05-18T00:34:32Z","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":"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","authors_text":"Brian Paden, Dmitry Yershov, Emilio Frazzoli, Valerio Varricchio","cross_cats":["cs.CC","cs.RO","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-22T07:06:12Z","title":"Efficient Nearest-Neighbor Search for Dynamical Systems with Nonholonomic Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07610","kind":"arxiv","version":1},"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:d45b9c9a17da5021e0abb9ce3eac0c728e4b5b248daad1866763f353141231f8","target":"record","created_at":"2026-05-18T00:34:32Z","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":"a73f6aa928f9fec0a068f0271e7996592e4b130d09cfb87f6de1614606d42973","cross_cats_sorted":["cs.CC","cs.RO","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-22T07:06:12Z","title_canon_sha256":"3811598af2c925340ba9bea3287e47e4d1d3c12969a9fb80df856b06eeb99e31"},"schema_version":"1.0","source":{"id":"1709.07610","kind":"arxiv","version":1}},"canonical_sha256":"e6b0acd04bfc9d9eb6019f3cdb410486e2485bbd233eaaa6327a9c15f6cb95f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6b0acd04bfc9d9eb6019f3cdb410486e2485bbd233eaaa6327a9c15f6cb95f7","first_computed_at":"2026-05-18T00:34:32.721484Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:32.721484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JYBRXwY4ucdSgxoqA9tfNAwGox6y8SGr2vJpFGdE5/Wy5VRkPrH3ipfIGRP4y4FhcSF4zA6rGZPuN3idMV9lDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:32.721827Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.07610","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d45b9c9a17da5021e0abb9ce3eac0c728e4b5b248daad1866763f353141231f8","sha256:ba435319d2c3488f982a73b5b6783658c743263abfbaae3d6912c96ea4adff2f"],"state_sha256":"a896fd0f53d1da885fc957a621b1fdaa32c9000ab55f592a6f6e1aaf955db395"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"34mMxpNdwfUNx5kCPbWVatcBnswjOqJ0g2ILYndpRPqIpjJ/ybK1v6eC/zurJ1VzucrsT5rEJo3vSuGIkpHDAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T16:39:28.451516Z","bundle_sha256":"2f03943e26f302cba23ab2bb9843030adf52072212f8ecbb8e9f53d5ee3a5a3c"}}