{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AZT5MCJRXDZQNZ6XDPGOJMYEW3","short_pith_number":"pith:AZT5MCJR","schema_version":"1.0","canonical_sha256":"0667d60931b8f306e7d71bcce4b304b6c0e180c0b88a183fbd067f36b168e5a4","source":{"kind":"arxiv","id":"2411.09275","version":2},"attestation_state":"computed","paper":{"title":"Parallel $k$d-tree with Batch Updates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DB","cs.DC","cs.PF"],"primary_cat":"cs.DS","authors_text":"Yan Gu, Yihan Sun, Zheqi Shen, Ziyang Men","submitted_at":"2024-11-14T08:25:31Z","abstract_excerpt":"The $k$d-tree is one of the most widely used data structures to manage multi-dimensional data. Due to the ever-growing data volume, it is imperative to consider parallelism in $k$d-trees. However, we observed challenges in existing parallel kd-tree implementations, for both constructions and updates.\n  The goal of this paper is to develop efficient in-memory $k$d-trees by supporting high parallelism and cache-efficiency. We propose the Pkd-tree (Parallel $k$d-tree), a parallel $k$d-tree that is efficient both in theory and in practice. The Pkd-tree supports parallel tree construction, batch up"},"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":"2411.09275","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-14T08:25:31Z","cross_cats_sorted":["cs.DB","cs.DC","cs.PF"],"title_canon_sha256":"560ac85100d9cd4699856e0d70a67fe6488e35ca7b03fd70375dfcf89715a2cc","abstract_canon_sha256":"2f714171b770ffc91dbd896d68f08ae94d48a9083c529e43955b56863ec5904d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:57:48.759287Z","signature_b64":"9Q0vH7E7WF+6cXZ9kGeVVaHhmfb5KRc9txmDPxt6ow67CAuAA7ewbES6NUoQVEU2i3vIlHFS/qg0Z9v3TBEbBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0667d60931b8f306e7d71bcce4b304b6c0e180c0b88a183fbd067f36b168e5a4","last_reissued_at":"2026-07-05T09:57:48.758785Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:57:48.758785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel $k$d-tree with Batch Updates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DB","cs.DC","cs.PF"],"primary_cat":"cs.DS","authors_text":"Yan Gu, Yihan Sun, Zheqi Shen, Ziyang Men","submitted_at":"2024-11-14T08:25:31Z","abstract_excerpt":"The $k$d-tree is one of the most widely used data structures to manage multi-dimensional data. Due to the ever-growing data volume, it is imperative to consider parallelism in $k$d-trees. However, we observed challenges in existing parallel kd-tree implementations, for both constructions and updates.\n  The goal of this paper is to develop efficient in-memory $k$d-trees by supporting high parallelism and cache-efficiency. We propose the Pkd-tree (Parallel $k$d-tree), a parallel $k$d-tree that is efficient both in theory and in practice. The Pkd-tree supports parallel tree construction, batch up"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.09275","kind":"arxiv","version":2},"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/2411.09275/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":"2411.09275","created_at":"2026-07-05T09:57:48.758843+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.09275v2","created_at":"2026-07-05T09:57:48.758843+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.09275","created_at":"2026-07-05T09:57:48.758843+00:00"},{"alias_kind":"pith_short_12","alias_value":"AZT5MCJRXDZQ","created_at":"2026-07-05T09:57:48.758843+00:00"},{"alias_kind":"pith_short_16","alias_value":"AZT5MCJRXDZQNZ6X","created_at":"2026-07-05T09:57:48.758843+00:00"},{"alias_kind":"pith_short_8","alias_value":"AZT5MCJR","created_at":"2026-07-05T09:57:48.758843+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.00496","citing_title":"Monitoring Robustness and Individual Fairness","ref_index":58,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AZT5MCJRXDZQNZ6XDPGOJMYEW3","json":"https://pith.science/pith/AZT5MCJRXDZQNZ6XDPGOJMYEW3.json","graph_json":"https://pith.science/api/pith-number/AZT5MCJRXDZQNZ6XDPGOJMYEW3/graph.json","events_json":"https://pith.science/api/pith-number/AZT5MCJRXDZQNZ6XDPGOJMYEW3/events.json","paper":"https://pith.science/paper/AZT5MCJR"},"agent_actions":{"view_html":"https://pith.science/pith/AZT5MCJRXDZQNZ6XDPGOJMYEW3","download_json":"https://pith.science/pith/AZT5MCJRXDZQNZ6XDPGOJMYEW3.json","view_paper":"https://pith.science/paper/AZT5MCJR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.09275&json=true","fetch_graph":"https://pith.science/api/pith-number/AZT5MCJRXDZQNZ6XDPGOJMYEW3/graph.json","fetch_events":"https://pith.science/api/pith-number/AZT5MCJRXDZQNZ6XDPGOJMYEW3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AZT5MCJRXDZQNZ6XDPGOJMYEW3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AZT5MCJRXDZQNZ6XDPGOJMYEW3/action/storage_attestation","attest_author":"https://pith.science/pith/AZT5MCJRXDZQNZ6XDPGOJMYEW3/action/author_attestation","sign_citation":"https://pith.science/pith/AZT5MCJRXDZQNZ6XDPGOJMYEW3/action/citation_signature","submit_replication":"https://pith.science/pith/AZT5MCJRXDZQNZ6XDPGOJMYEW3/action/replication_record"}},"created_at":"2026-07-05T09:57:48.758843+00:00","updated_at":"2026-07-05T09:57:48.758843+00:00"}