{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:TSM24CIIDFLNIFJEK3SKHZJ6FI","short_pith_number":"pith:TSM24CII","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"},"canonical_sha256":"9c99ae09081956d4152456e4a3e53e2a16b39420b0973d3ee9bbb60496c121fd","source":{"kind":"arxiv","id":"2102.10808","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.10808","created_at":"2026-07-05T02:17:01Z"},{"alias_kind":"arxiv_version","alias_value":"2102.10808v1","created_at":"2026-07-05T02:17:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.10808","created_at":"2026-07-05T02:17:01Z"},{"alias_kind":"pith_short_12","alias_value":"TSM24CIIDFLN","created_at":"2026-07-05T02:17:01Z"},{"alias_kind":"pith_short_16","alias_value":"TSM24CIIDFLNIFJE","created_at":"2026-07-05T02:17:01Z"},{"alias_kind":"pith_short_8","alias_value":"TSM24CII","created_at":"2026-07-05T02:17:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:TSM24CIIDFLNIFJEK3SKHZJ6FI","target":"record","payload":{"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"},"canonical_sha256":"9c99ae09081956d4152456e4a3e53e2a16b39420b0973d3ee9bbb60496c121fd","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"},"source_kind":"arxiv","source_id":"2102.10808","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-07-05T02:17:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TONuI6imcShQ+wj90RclMAeYtBMHMn1XzwxVxBiVNDBeJsuinbZEUfEmM11iWh8bHMYk5xInMozVsKUEs2UaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T15:45:58.021682Z"},"content_sha256":"6d64d7a159f2e9542b64dbebf76718a555f4c29d0bbfe985a204f240fb37b29e","schema_version":"1.0","event_id":"sha256:6d64d7a159f2e9542b64dbebf76718a555f4c29d0bbfe985a204f240fb37b29e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:TSM24CIIDFLNIFJEK3SKHZJ6FI","target":"graph","payload":{"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"},"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-07-05T02:17:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zv6FWZImmger8hl3BdnQaZBv5Thw6yFvtxf0ZCLZhLIwliBMoFK6o94cV1f1g2ZrGp9nRuvotY+31Svom8v8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T15:45:58.022543Z"},"content_sha256":"7ccdb1a5bd133a6ac311a984deb4daca68e58bd8fb2b72e5ef99fe7d19f5e9ec","schema_version":"1.0","event_id":"sha256:7ccdb1a5bd133a6ac311a984deb4daca68e58bd8fb2b72e5ef99fe7d19f5e9ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TSM24CIIDFLNIFJEK3SKHZJ6FI/bundle.json","state_url":"https://pith.science/pith/TSM24CIIDFLNIFJEK3SKHZJ6FI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TSM24CIIDFLNIFJEK3SKHZJ6FI/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-08-09T15:45:58Z","links":{"resolver":"https://pith.science/pith/TSM24CIIDFLNIFJEK3SKHZJ6FI","bundle":"https://pith.science/pith/TSM24CIIDFLNIFJEK3SKHZJ6FI/bundle.json","state":"https://pith.science/pith/TSM24CIIDFLNIFJEK3SKHZJ6FI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TSM24CIIDFLNIFJEK3SKHZJ6FI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:TSM24CIIDFLNIFJEK3SKHZJ6FI","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":"169d92be8c6b9f29904bbcc9ecd1d66821fe997917a3219533dfa8aad3508b6a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2021-02-22T07:14:12Z","title_canon_sha256":"de3c82027e4164ebafc5cea31bae1c4cf8717cb4ba73bedd1491ada7c70834d7"},"schema_version":"1.0","source":{"id":"2102.10808","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.10808","created_at":"2026-07-05T02:17:01Z"},{"alias_kind":"arxiv_version","alias_value":"2102.10808v1","created_at":"2026-07-05T02:17:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.10808","created_at":"2026-07-05T02:17:01Z"},{"alias_kind":"pith_short_12","alias_value":"TSM24CIIDFLN","created_at":"2026-07-05T02:17:01Z"},{"alias_kind":"pith_short_16","alias_value":"TSM24CIIDFLNIFJE","created_at":"2026-07-05T02:17:01Z"},{"alias_kind":"pith_short_8","alias_value":"TSM24CII","created_at":"2026-07-05T02:17:01Z"}],"graph_snapshots":[{"event_id":"sha256:7ccdb1a5bd133a6ac311a984deb4daca68e58bd8fb2b72e5ef99fe7d19f5e9ec","target":"graph","created_at":"2026-07-05T02:17:01Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2102.10808/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Fu Zhang, Wei Xu, Yixi Cai","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2021-02-22T07:14:12Z","title":"ikd-Tree: An Incremental K-D Tree for Robotic Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.10808","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:6d64d7a159f2e9542b64dbebf76718a555f4c29d0bbfe985a204f240fb37b29e","target":"record","created_at":"2026-07-05T02:17:01Z","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":"169d92be8c6b9f29904bbcc9ecd1d66821fe997917a3219533dfa8aad3508b6a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2021-02-22T07:14:12Z","title_canon_sha256":"de3c82027e4164ebafc5cea31bae1c4cf8717cb4ba73bedd1491ada7c70834d7"},"schema_version":"1.0","source":{"id":"2102.10808","kind":"arxiv","version":1}},"canonical_sha256":"9c99ae09081956d4152456e4a3e53e2a16b39420b0973d3ee9bbb60496c121fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c99ae09081956d4152456e4a3e53e2a16b39420b0973d3ee9bbb60496c121fd","first_computed_at":"2026-07-05T02:17:01.653207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:17:01.653207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QOZ910NkCIOpqc2YVKgmSZunA1cVrl/ytyMxBtdXDCDcA4SRalJMToOIUQMMtF8zOK0quWcA0AsFTFDF0EEyBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:17:01.653615Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.10808","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d64d7a159f2e9542b64dbebf76718a555f4c29d0bbfe985a204f240fb37b29e","sha256:7ccdb1a5bd133a6ac311a984deb4daca68e58bd8fb2b72e5ef99fe7d19f5e9ec"],"state_sha256":"5d5fe10b84250c43ffef913b98bcb4c92e2e7f16f1aa88a3598091549c4f5262"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b3UJbNJ46x5Ht/H1yhD+tWbh6w7NU2tnD2myj45+MDl8ZAF3O/I0vqRQ+ok2An3fKK6XAB+w4TzC421ttRz8Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T15:45:58.028013Z","bundle_sha256":"c560459edcd391f4e7a17544c46762c948610d41f964ba9a2247f234e8d48a5b"}}