{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:2OSJUG5OUR4RWCDVQBEAX2OKD6","short_pith_number":"pith:2OSJUG5O","canonical_record":{"source":{"id":"2112.06188","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-12-12T09:08:41Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"55711a92478c574099bcada95888b3c97c1ff1d1f7a1039a25b292002473fb7b","abstract_canon_sha256":"4a357ecae3d0a65d30b87eebba2eaa53c2f0f65cc93e36b3b492b11fa92a75b4"},"schema_version":"1.0"},"canonical_sha256":"d3a49a1baea4791b087580480be9ca1fa75712d6e097987dab5ac2f196c14e8d","source":{"kind":"arxiv","id":"2112.06188","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.06188","created_at":"2026-07-05T03:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"2112.06188v1","created_at":"2026-07-05T03:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.06188","created_at":"2026-07-05T03:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"2OSJUG5OUR4R","created_at":"2026-07-05T03:40:11Z"},{"alias_kind":"pith_short_16","alias_value":"2OSJUG5OUR4RWCDV","created_at":"2026-07-05T03:40:11Z"},{"alias_kind":"pith_short_8","alias_value":"2OSJUG5O","created_at":"2026-07-05T03:40:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:2OSJUG5OUR4RWCDVQBEAX2OKD6","target":"record","payload":{"canonical_record":{"source":{"id":"2112.06188","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-12-12T09:08:41Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"55711a92478c574099bcada95888b3c97c1ff1d1f7a1039a25b292002473fb7b","abstract_canon_sha256":"4a357ecae3d0a65d30b87eebba2eaa53c2f0f65cc93e36b3b492b11fa92a75b4"},"schema_version":"1.0"},"canonical_sha256":"d3a49a1baea4791b087580480be9ca1fa75712d6e097987dab5ac2f196c14e8d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:40:11.217542Z","signature_b64":"KWWsd3kcm7vDRglr91WiNkBai4OFycxqUOUengwkM+Abi3qoajFCEtPasXFoPmx5bgReL6tLEIPiGfly9ebQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3a49a1baea4791b087580480be9ca1fa75712d6e097987dab5ac2f196c14e8d","last_reissued_at":"2026-07-05T03:40:11.217084Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:40:11.217084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.06188","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-05T03:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PEtELHrVmLIY3IJBHyJsUrkjmQGcvQygPBGbwPYiLCUgImWo5fokkfhpHaaRAAaXYiWQT+rjimFbTkxoPdUZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T01:47:17.163420Z"},"content_sha256":"9fb26f65326ede61ea42c95524c3e9f3c355861db34be4139d813a9c7f8f655e","schema_version":"1.0","event_id":"sha256:9fb26f65326ede61ea42c95524c3e9f3c355861db34be4139d813a9c7f8f655e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:2OSJUG5OUR4RWCDVQBEAX2OKD6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Batch-Dynamic $k$d-Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Julian Shun (1) ((1) MIT CSAIL), Laxman Dhulipala (1), Rahul Yesantharao (1), Yiqiu Wang (1)","submitted_at":"2021-12-12T09:08:41Z","abstract_excerpt":"$k$d-trees are widely used in parallel databases to support efficient neighborhood/similarity queries. Supporting parallel updates to $k$d-trees is therefore an important operation. In this paper, we present BDL-tree, a parallel, batch-dynamic implementation of a $k$d-tree that allows for efficient parallel $k$-NN queries over dynamically changing point sets. BDL-trees consist of a log-structured set of $k$d-trees which can be used to efficiently insert or delete batches of points in parallel with polylogarithmic depth. Specifically, given a BDL-tree with $n$ points, each batch of $B$ updates "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.06188","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/2112.06188/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-05T03:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yprYfK5yBtEAOdFmadaEtb2D144b3VQGxvmeXhYF34V0C2hCElCUJtomZQ/i7tuwdQabTtW4Mm4ljpGfx63FBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T01:47:17.164294Z"},"content_sha256":"6483d616ca44b710006c0066842ee4d06cc670d7da09f482865b5577202681f7","schema_version":"1.0","event_id":"sha256:6483d616ca44b710006c0066842ee4d06cc670d7da09f482865b5577202681f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2OSJUG5OUR4RWCDVQBEAX2OKD6/bundle.json","state_url":"https://pith.science/pith/2OSJUG5OUR4RWCDVQBEAX2OKD6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2OSJUG5OUR4RWCDVQBEAX2OKD6/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-08T01:47:17Z","links":{"resolver":"https://pith.science/pith/2OSJUG5OUR4RWCDVQBEAX2OKD6","bundle":"https://pith.science/pith/2OSJUG5OUR4RWCDVQBEAX2OKD6/bundle.json","state":"https://pith.science/pith/2OSJUG5OUR4RWCDVQBEAX2OKD6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2OSJUG5OUR4RWCDVQBEAX2OKD6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:2OSJUG5OUR4RWCDVQBEAX2OKD6","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":"4a357ecae3d0a65d30b87eebba2eaa53c2f0f65cc93e36b3b492b11fa92a75b4","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-12-12T09:08:41Z","title_canon_sha256":"55711a92478c574099bcada95888b3c97c1ff1d1f7a1039a25b292002473fb7b"},"schema_version":"1.0","source":{"id":"2112.06188","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.06188","created_at":"2026-07-05T03:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"2112.06188v1","created_at":"2026-07-05T03:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.06188","created_at":"2026-07-05T03:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"2OSJUG5OUR4R","created_at":"2026-07-05T03:40:11Z"},{"alias_kind":"pith_short_16","alias_value":"2OSJUG5OUR4RWCDV","created_at":"2026-07-05T03:40:11Z"},{"alias_kind":"pith_short_8","alias_value":"2OSJUG5O","created_at":"2026-07-05T03:40:11Z"}],"graph_snapshots":[{"event_id":"sha256:6483d616ca44b710006c0066842ee4d06cc670d7da09f482865b5577202681f7","target":"graph","created_at":"2026-07-05T03:40:11Z","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/2112.06188/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"$k$d-trees are widely used in parallel databases to support efficient neighborhood/similarity queries. Supporting parallel updates to $k$d-trees is therefore an important operation. In this paper, we present BDL-tree, a parallel, batch-dynamic implementation of a $k$d-tree that allows for efficient parallel $k$-NN queries over dynamically changing point sets. BDL-trees consist of a log-structured set of $k$d-trees which can be used to efficiently insert or delete batches of points in parallel with polylogarithmic depth. Specifically, given a BDL-tree with $n$ points, each batch of $B$ updates ","authors_text":"Julian Shun (1) ((1) MIT CSAIL), Laxman Dhulipala (1), Rahul Yesantharao (1), Yiqiu Wang (1)","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-12-12T09:08:41Z","title":"Parallel Batch-Dynamic $k$d-Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.06188","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:9fb26f65326ede61ea42c95524c3e9f3c355861db34be4139d813a9c7f8f655e","target":"record","created_at":"2026-07-05T03:40:11Z","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":"4a357ecae3d0a65d30b87eebba2eaa53c2f0f65cc93e36b3b492b11fa92a75b4","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-12-12T09:08:41Z","title_canon_sha256":"55711a92478c574099bcada95888b3c97c1ff1d1f7a1039a25b292002473fb7b"},"schema_version":"1.0","source":{"id":"2112.06188","kind":"arxiv","version":1}},"canonical_sha256":"d3a49a1baea4791b087580480be9ca1fa75712d6e097987dab5ac2f196c14e8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3a49a1baea4791b087580480be9ca1fa75712d6e097987dab5ac2f196c14e8d","first_computed_at":"2026-07-05T03:40:11.217084Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:40:11.217084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KWWsd3kcm7vDRglr91WiNkBai4OFycxqUOUengwkM+Abi3qoajFCEtPasXFoPmx5bgReL6tLEIPiGfly9ebQBw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:40:11.217542Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.06188","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9fb26f65326ede61ea42c95524c3e9f3c355861db34be4139d813a9c7f8f655e","sha256:6483d616ca44b710006c0066842ee4d06cc670d7da09f482865b5577202681f7"],"state_sha256":"9d40fd7fd3123aa8ec384b9161f9b942b5b20935d116bcdba33973143936fa62"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ua0oY+JokcUrwF+Du2eHuFzLMkIBbPEYZiCsfCkRRPJwZ7uq0gj3+B3rCZ1ZQ4ju6jqt/jRqh7H0/A5b47xSBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T01:47:17.169361Z","bundle_sha256":"f2b8c520b9a0a97c82f74c9bd97571716cc3570f41bf21c0d2237e33f0c38673"}}