{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:TSM24CIIDFLNIFJEK3SKHZJ6FI","short_pith_number":"pith:TSM24CII","schema_version":"1.0","canonical_sha256":"9c99ae09081956d4152456e4a3e53e2a16b39420b0973d3ee9bbb60496c121fd","source":{"kind":"arxiv","id":"2102.10808","version":1},"attestation_state":"computed","paper":{"title":"ikd-Tree: An Incremental K-D Tree for Robotic Applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Fu Zhang, Wei Xu, Yixi Cai","submitted_at":"2021-02-22T07:14:12Z","abstract_excerpt":"This paper proposes an efficient data structure, ikd-Tree, for dynamic space partition. The ikd-Tree incrementally updates a k-d tree with new coming points only, leading to much lower computation time than existing static k-d trees. Besides point-wise operations, the ikd-Tree supports several features such as box-wise operations and down-sampling that are practically useful in robotic applications. In parallel to the incremental operations (i.e., insert, re-insert, and delete), ikd-Tree actively monitors the tree structure and partially re-balances the tree, which enables efficient nearest po"},"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":"2102.10808","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2021-02-22T07:14:12Z","cross_cats_sorted":[],"title_canon_sha256":"de3c82027e4164ebafc5cea31bae1c4cf8717cb4ba73bedd1491ada7c70834d7","abstract_canon_sha256":"169d92be8c6b9f29904bbcc9ecd1d66821fe997917a3219533dfa8aad3508b6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:17:01.653615Z","signature_b64":"QOZ910NkCIOpqc2YVKgmSZunA1cVrl/ytyMxBtdXDCDcA4SRalJMToOIUQMMtF8zOK0quWcA0AsFTFDF0EEyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c99ae09081956d4152456e4a3e53e2a16b39420b0973d3ee9bbb60496c121fd","last_reissued_at":"2026-07-05T02:17:01.653207Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:17:01.653207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ikd-Tree: An Incremental K-D Tree for Robotic Applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Fu Zhang, Wei Xu, Yixi Cai","submitted_at":"2021-02-22T07:14:12Z","abstract_excerpt":"This paper proposes an efficient data structure, ikd-Tree, for dynamic space partition. The ikd-Tree incrementally updates a k-d tree with new coming points only, leading to much lower computation time than existing static k-d trees. Besides point-wise operations, the ikd-Tree supports several features such as box-wise operations and down-sampling that are practically useful in robotic applications. In parallel to the incremental operations (i.e., insert, re-insert, and delete), ikd-Tree actively monitors the tree structure and partially re-balances the tree, which enables efficient nearest po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.10808","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.10808/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2102.10808","created_at":"2026-07-05T02:17:01.653273+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.10808v1","created_at":"2026-07-05T02:17:01.653273+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.10808","created_at":"2026-07-05T02:17:01.653273+00:00"},{"alias_kind":"pith_short_12","alias_value":"TSM24CIIDFLN","created_at":"2026-07-05T02:17:01.653273+00:00"},{"alias_kind":"pith_short_16","alias_value":"TSM24CIIDFLNIFJE","created_at":"2026-07-05T02:17:01.653273+00:00"},{"alias_kind":"pith_short_8","alias_value":"TSM24CII","created_at":"2026-07-05T02:17:01.653273+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26010","citing_title":"FAR-LIO: Enabling High-Speed Autonomy through Fast, Accurate, and Robust LiDAR-Inertial Odometry","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2606.10019","citing_title":"Generalized-CVO: Fast and Correspondence-Free Local Point Cloud Registration with Second Order Riemannian Optimization","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2605.24495","citing_title":"Elevator-LIO: Robust LiDAR-Inertial Odometry for Multi-Floor Navigation under Elevator-Induced Non-Inertial Motion","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18047","citing_title":"FUSE: A Framework for Unified State Estimation in Vehicular and Robotic SLAM Systems","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18047","citing_title":"FUSE: A Framework for Unified State Estimation in Vehicular and Robotic SLAM Systems","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18047","citing_title":"FUSE: A Framework for Unified State Estimation in Vehicular and Robotic SLAM Systems","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2512.07775","citing_title":"OptMap: Geometric Map Distillation via Submodular Maximization","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03640","citing_title":"In-memory Multidimensional Indexing Using the skd-tree","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TSM24CIIDFLNIFJEK3SKHZJ6FI","json":"https://pith.science/pith/TSM24CIIDFLNIFJEK3SKHZJ6FI.json","graph_json":"https://pith.science/api/pith-number/TSM24CIIDFLNIFJEK3SKHZJ6FI/graph.json","events_json":"https://pith.science/api/pith-number/TSM24CIIDFLNIFJEK3SKHZJ6FI/events.json","paper":"https://pith.science/paper/TSM24CII"},"agent_actions":{"view_html":"https://pith.science/pith/TSM24CIIDFLNIFJEK3SKHZJ6FI","download_json":"https://pith.science/pith/TSM24CIIDFLNIFJEK3SKHZJ6FI.json","view_paper":"https://pith.science/paper/TSM24CII","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.10808&json=true","fetch_graph":"https://pith.science/api/pith-number/TSM24CIIDFLNIFJEK3SKHZJ6FI/graph.json","fetch_events":"https://pith.science/api/pith-number/TSM24CIIDFLNIFJEK3SKHZJ6FI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TSM24CIIDFLNIFJEK3SKHZJ6FI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TSM24CIIDFLNIFJEK3SKHZJ6FI/action/storage_attestation","attest_author":"https://pith.science/pith/TSM24CIIDFLNIFJEK3SKHZJ6FI/action/author_attestation","sign_citation":"https://pith.science/pith/TSM24CIIDFLNIFJEK3SKHZJ6FI/action/citation_signature","submit_replication":"https://pith.science/pith/TSM24CIIDFLNIFJEK3SKHZJ6FI/action/replication_record"}},"created_at":"2026-07-05T02:17:01.653273+00:00","updated_at":"2026-07-05T02:17:01.653273+00:00"}