{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:AZT5MCJRXDZQNZ6XDPGOJMYEW3","short_pith_number":"pith:AZT5MCJR","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"},"canonical_sha256":"0667d60931b8f306e7d71bcce4b304b6c0e180c0b88a183fbd067f36b168e5a4","source":{"kind":"arxiv","id":"2411.09275","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.09275","created_at":"2026-07-05T09:57:48Z"},{"alias_kind":"arxiv_version","alias_value":"2411.09275v2","created_at":"2026-07-05T09:57:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.09275","created_at":"2026-07-05T09:57:48Z"},{"alias_kind":"pith_short_12","alias_value":"AZT5MCJRXDZQ","created_at":"2026-07-05T09:57:48Z"},{"alias_kind":"pith_short_16","alias_value":"AZT5MCJRXDZQNZ6X","created_at":"2026-07-05T09:57:48Z"},{"alias_kind":"pith_short_8","alias_value":"AZT5MCJR","created_at":"2026-07-05T09:57:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:AZT5MCJRXDZQNZ6XDPGOJMYEW3","target":"record","payload":{"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"},"canonical_sha256":"0667d60931b8f306e7d71bcce4b304b6c0e180c0b88a183fbd067f36b168e5a4","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"},"source_kind":"arxiv","source_id":"2411.09275","source_version":2,"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-05T09:57:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aMqg+9uvep0ZRQToHQJUMPYnksyV+dzRB5Xc67K6l+ZEtamnvEFxzlLrIj6ocsECMplqiffFHEkrbuyY/x+aDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T11:44:13.721481Z"},"content_sha256":"2c7969f0f0728c491d2c5194324150b1ab286569eda6acdf032068b68669ea68","schema_version":"1.0","event_id":"sha256:2c7969f0f0728c491d2c5194324150b1ab286569eda6acdf032068b68669ea68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:AZT5MCJRXDZQNZ6XDPGOJMYEW3","target":"graph","payload":{"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"},"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-05T09:57:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f2YkyXwGpZTsaXX8KL/bz7iJt9UwBDJDm9OdkOLO0lRyNfBaCr/qO38qYjRU9Sqi28DIUWGgvxaLIwwUX7muCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T11:44:13.721990Z"},"content_sha256":"987503fbe4103dbc2b88355ba2086520c297b5c11e6fa4c87d770fdd078617a0","schema_version":"1.0","event_id":"sha256:987503fbe4103dbc2b88355ba2086520c297b5c11e6fa4c87d770fdd078617a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AZT5MCJRXDZQNZ6XDPGOJMYEW3/bundle.json","state_url":"https://pith.science/pith/AZT5MCJRXDZQNZ6XDPGOJMYEW3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AZT5MCJRXDZQNZ6XDPGOJMYEW3/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-09T11:44:13Z","links":{"resolver":"https://pith.science/pith/AZT5MCJRXDZQNZ6XDPGOJMYEW3","bundle":"https://pith.science/pith/AZT5MCJRXDZQNZ6XDPGOJMYEW3/bundle.json","state":"https://pith.science/pith/AZT5MCJRXDZQNZ6XDPGOJMYEW3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AZT5MCJRXDZQNZ6XDPGOJMYEW3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:AZT5MCJRXDZQNZ6XDPGOJMYEW3","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":"2f714171b770ffc91dbd896d68f08ae94d48a9083c529e43955b56863ec5904d","cross_cats_sorted":["cs.DB","cs.DC","cs.PF"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-14T08:25:31Z","title_canon_sha256":"560ac85100d9cd4699856e0d70a67fe6488e35ca7b03fd70375dfcf89715a2cc"},"schema_version":"1.0","source":{"id":"2411.09275","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.09275","created_at":"2026-07-05T09:57:48Z"},{"alias_kind":"arxiv_version","alias_value":"2411.09275v2","created_at":"2026-07-05T09:57:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.09275","created_at":"2026-07-05T09:57:48Z"},{"alias_kind":"pith_short_12","alias_value":"AZT5MCJRXDZQ","created_at":"2026-07-05T09:57:48Z"},{"alias_kind":"pith_short_16","alias_value":"AZT5MCJRXDZQNZ6X","created_at":"2026-07-05T09:57:48Z"},{"alias_kind":"pith_short_8","alias_value":"AZT5MCJR","created_at":"2026-07-05T09:57:48Z"}],"graph_snapshots":[{"event_id":"sha256:987503fbe4103dbc2b88355ba2086520c297b5c11e6fa4c87d770fdd078617a0","target":"graph","created_at":"2026-07-05T09:57:48Z","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/2411.09275/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Yan Gu, Yihan Sun, Zheqi Shen, Ziyang Men","cross_cats":["cs.DB","cs.DC","cs.PF"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-14T08:25:31Z","title":"Parallel $k$d-tree with Batch Updates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.09275","kind":"arxiv","version":2},"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:2c7969f0f0728c491d2c5194324150b1ab286569eda6acdf032068b68669ea68","target":"record","created_at":"2026-07-05T09:57:48Z","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":"2f714171b770ffc91dbd896d68f08ae94d48a9083c529e43955b56863ec5904d","cross_cats_sorted":["cs.DB","cs.DC","cs.PF"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-14T08:25:31Z","title_canon_sha256":"560ac85100d9cd4699856e0d70a67fe6488e35ca7b03fd70375dfcf89715a2cc"},"schema_version":"1.0","source":{"id":"2411.09275","kind":"arxiv","version":2}},"canonical_sha256":"0667d60931b8f306e7d71bcce4b304b6c0e180c0b88a183fbd067f36b168e5a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0667d60931b8f306e7d71bcce4b304b6c0e180c0b88a183fbd067f36b168e5a4","first_computed_at":"2026-07-05T09:57:48.758785Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:57:48.758785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9Q0vH7E7WF+6cXZ9kGeVVaHhmfb5KRc9txmDPxt6ow67CAuAA7ewbES6NUoQVEU2i3vIlHFS/qg0Z9v3TBEbBw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:57:48.759287Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.09275","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c7969f0f0728c491d2c5194324150b1ab286569eda6acdf032068b68669ea68","sha256:987503fbe4103dbc2b88355ba2086520c297b5c11e6fa4c87d770fdd078617a0"],"state_sha256":"1d49d2fa2e80a9d8d26d6aee5a79fa9a2a0988ff4827c513d835433f447211e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ufJCucIgyUC3gZO2vUxwyjmJazjlWKFnfPNyWQz6KcIkSkSJT0vr7JSwek21wSK3z/TmlTzdVYHNqWcQfHTRDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T11:44:13.726987Z","bundle_sha256":"4fefcf810d64cdaf60afba29289a39989fabc39f8ab25263c787b81c95941c08"}}