{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:OW3FHKXGUU5ZVKAU6OLFKTWQQW","short_pith_number":"pith:OW3FHKXG","canonical_record":{"source":{"id":"2509.08148","kind":"arxiv","version":18},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-09-09T21:10:15Z","cross_cats_sorted":[],"title_canon_sha256":"6b873678e0be5324c3c509e00dafd1c8041d6ee7f5843579781abf8f2f90e20c","abstract_canon_sha256":"0c90a977119d9508b192b0746da916f91a1459c9f31593935cf6e7475cf6ae8e"},"schema_version":"1.0"},"canonical_sha256":"75b653aae6a53b9aa814f396554ed085ab91f7f75660df3fd97bd9a4b9b173bc","source":{"kind":"arxiv","id":"2509.08148","version":18},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.08148","created_at":"2026-05-27T01:04:50Z"},{"alias_kind":"arxiv_version","alias_value":"2509.08148v18","created_at":"2026-05-27T01:04:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08148","created_at":"2026-05-27T01:04:50Z"},{"alias_kind":"pith_short_12","alias_value":"OW3FHKXGUU5Z","created_at":"2026-05-27T01:04:50Z"},{"alias_kind":"pith_short_16","alias_value":"OW3FHKXGUU5ZVKAU","created_at":"2026-05-27T01:04:50Z"},{"alias_kind":"pith_short_8","alias_value":"OW3FHKXG","created_at":"2026-05-27T01:04:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:OW3FHKXGUU5ZVKAU6OLFKTWQQW","target":"record","payload":{"canonical_record":{"source":{"id":"2509.08148","kind":"arxiv","version":18},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-09-09T21:10:15Z","cross_cats_sorted":[],"title_canon_sha256":"6b873678e0be5324c3c509e00dafd1c8041d6ee7f5843579781abf8f2f90e20c","abstract_canon_sha256":"0c90a977119d9508b192b0746da916f91a1459c9f31593935cf6e7475cf6ae8e"},"schema_version":"1.0"},"canonical_sha256":"75b653aae6a53b9aa814f396554ed085ab91f7f75660df3fd97bd9a4b9b173bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:04:50.384467Z","signature_b64":"WfGIbFeURa9qSfjiwIhcVbiA9fciamRNSwqKyaOHyWazxyXBcEfL93hiIS7kr1hXXJUSXFM+nt/HHHW/O0rVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75b653aae6a53b9aa814f396554ed085ab91f7f75660df3fd97bd9a4b9b173bc","last_reissued_at":"2026-05-27T01:04:50.383831Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:04:50.383831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.08148","source_version":18,"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-05-27T01:04:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4f8Qx9uOnzAtpP8S+vjZ9NuTuX/gMqEg7Uh/Aen2aY+tSqvBMeBM1yfAK+IfgfcCGVHrensGkzT+9Ks4toAUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T01:43:35.627560Z"},"content_sha256":"9657b0ea16fe1ce5786a6615e5c1c326f2372a3e0a6a521c38efa88971da43be","schema_version":"1.0","event_id":"sha256:9657b0ea16fe1ce5786a6615e5c1c326f2372a3e0a6a521c38efa88971da43be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:OW3FHKXGUU5ZVKAU6OLFKTWQQW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Dynamic, Self-balancing k-d Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A k-d tree can be made dynamic and self-balancing with specialized insertion, deletion, and rebalancing algorithms that preserve its alternating-dimension invariant.","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Russell A. Brown","submitted_at":"2025-09-09T21:10:15Z","abstract_excerpt":"The original description of the k-d tree recognized that rebalancing techniques, used for building an AVL or red-black tree, are not applicable to a k-d tree, because these techniques involve cyclic exchange of tree nodes that violates the invariant of the k-d tree. For this reason, a static, balanced k-d tree is often built from all of the k-dimensional data en masse. However, it is possible to build a dynamic k-d tree that self-balances when necessary after insertion or deletion of each k-dimensional datum. This article describes insertion, deletion, and rebalancing algorithms for a dynamic,"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"It is possible to build a dynamic k-d tree that self-balances when necessary after insertion or deletion of each k-dimensional datum.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"Rebalancing steps can be designed that restore balance after each update while strictly preserving the k-d tree's alternating-dimension partitioning invariant at every node.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The paper introduces insertion, deletion, and rebalancing algorithms for a dynamic self-balancing k-d tree and measures their performance.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A k-d tree can be made dynamic and self-balancing with specialized insertion, deletion, and rebalancing algorithms that preserve its alternating-dimension invariant.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"b5f8a474c13ed3ac1eca12aa76da064dce8d116df71db439137214b0f5b9d0fc"},"source":{"id":"2509.08148","kind":"arxiv","version":18},"verdict":{"id":"b552f260-991f-4077-a2af-28fde04d753b","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-18T17:44:52.223312Z","strongest_claim":"It is possible to build a dynamic k-d tree that self-balances when necessary after insertion or deletion of each k-dimensional datum.","one_line_summary":"The paper introduces insertion, deletion, and rebalancing algorithms for a dynamic self-balancing k-d tree and measures their performance.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"Rebalancing steps can be designed that restore balance after each update while strictly preserving the k-d tree's alternating-dimension partitioning invariant at every node.","pith_extraction_headline":"A k-d tree can be made dynamic and self-balancing with specialized insertion, deletion, and rebalancing algorithms that preserve its alternating-dimension invariant."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.08148/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":2,"snapshot_sha256":"7786e3fb70db14f7b9a9303f73404163cf68ecb8ab809d8a5e8634b0cb8ca884"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"b552f260-991f-4077-a2af-28fde04d753b"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-27T01:04:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vEd8scVWaD549MRYDemCWPgmCpzm6VM+hOTAN7wqMqkDqVMDAtv2KQCG1h+K59/jsrXCwkW89w8cQcBeh+wiDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T01:43:35.628030Z"},"content_sha256":"579cf6073a5c783d10c37930fe78706fdf61b99ecd0473a3c6ba6845a0f512c9","schema_version":"1.0","event_id":"sha256:579cf6073a5c783d10c37930fe78706fdf61b99ecd0473a3c6ba6845a0f512c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OW3FHKXGUU5ZVKAU6OLFKTWQQW/bundle.json","state_url":"https://pith.science/pith/OW3FHKXGUU5ZVKAU6OLFKTWQQW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OW3FHKXGUU5ZVKAU6OLFKTWQQW/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-06-12T01:43:35Z","links":{"resolver":"https://pith.science/pith/OW3FHKXGUU5ZVKAU6OLFKTWQQW","bundle":"https://pith.science/pith/OW3FHKXGUU5ZVKAU6OLFKTWQQW/bundle.json","state":"https://pith.science/pith/OW3FHKXGUU5ZVKAU6OLFKTWQQW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OW3FHKXGUU5ZVKAU6OLFKTWQQW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:OW3FHKXGUU5ZVKAU6OLFKTWQQW","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":"0c90a977119d9508b192b0746da916f91a1459c9f31593935cf6e7475cf6ae8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-09-09T21:10:15Z","title_canon_sha256":"6b873678e0be5324c3c509e00dafd1c8041d6ee7f5843579781abf8f2f90e20c"},"schema_version":"1.0","source":{"id":"2509.08148","kind":"arxiv","version":18}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.08148","created_at":"2026-05-27T01:04:50Z"},{"alias_kind":"arxiv_version","alias_value":"2509.08148v18","created_at":"2026-05-27T01:04:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08148","created_at":"2026-05-27T01:04:50Z"},{"alias_kind":"pith_short_12","alias_value":"OW3FHKXGUU5Z","created_at":"2026-05-27T01:04:50Z"},{"alias_kind":"pith_short_16","alias_value":"OW3FHKXGUU5ZVKAU","created_at":"2026-05-27T01:04:50Z"},{"alias_kind":"pith_short_8","alias_value":"OW3FHKXG","created_at":"2026-05-27T01:04:50Z"}],"graph_snapshots":[{"event_id":"sha256:579cf6073a5c783d10c37930fe78706fdf61b99ecd0473a3c6ba6845a0f512c9","target":"graph","created_at":"2026-05-27T01:04:50Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"It is possible to build a dynamic k-d tree that self-balances when necessary after insertion or deletion of each k-dimensional datum."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"Rebalancing steps can be designed that restore balance after each update while strictly preserving the k-d tree's alternating-dimension partitioning invariant at every node."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The paper introduces insertion, deletion, and rebalancing algorithms for a dynamic self-balancing k-d tree and measures their performance."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A k-d tree can be made dynamic and self-balancing with specialized insertion, deletion, and rebalancing algorithms that preserve its alternating-dimension invariant."}],"snapshot_sha256":"b5f8a474c13ed3ac1eca12aa76da064dce8d116df71db439137214b0f5b9d0fc"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"7786e3fb70db14f7b9a9303f73404163cf68ecb8ab809d8a5e8634b0cb8ca884"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.08148/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The original description of the k-d tree recognized that rebalancing techniques, used for building an AVL or red-black tree, are not applicable to a k-d tree, because these techniques involve cyclic exchange of tree nodes that violates the invariant of the k-d tree. For this reason, a static, balanced k-d tree is often built from all of the k-dimensional data en masse. However, it is possible to build a dynamic k-d tree that self-balances when necessary after insertion or deletion of each k-dimensional datum. This article describes insertion, deletion, and rebalancing algorithms for a dynamic,","authors_text":"Russell A. Brown","cross_cats":[],"headline":"A k-d tree can be made dynamic and self-balancing with specialized insertion, deletion, and rebalancing algorithms that preserve its alternating-dimension invariant.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-09-09T21:10:15Z","title":"A Dynamic, Self-balancing k-d Tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.08148","kind":"arxiv","version":18},"verdict":{"created_at":"2026-05-18T17:44:52.223312Z","id":"b552f260-991f-4077-a2af-28fde04d753b","model_set":{"reader":"grok-4.3"},"one_line_summary":"The paper introduces insertion, deletion, and rebalancing algorithms for a dynamic self-balancing k-d tree and measures their performance.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A k-d tree can be made dynamic and self-balancing with specialized insertion, deletion, and rebalancing algorithms that preserve its alternating-dimension invariant.","strongest_claim":"It is possible to build a dynamic k-d tree that self-balances when necessary after insertion or deletion of each k-dimensional datum.","weakest_assumption":"Rebalancing steps can be designed that restore balance after each update while strictly preserving the k-d tree's alternating-dimension partitioning invariant at every node."}},"verdict_id":"b552f260-991f-4077-a2af-28fde04d753b"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9657b0ea16fe1ce5786a6615e5c1c326f2372a3e0a6a521c38efa88971da43be","target":"record","created_at":"2026-05-27T01:04:50Z","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":"0c90a977119d9508b192b0746da916f91a1459c9f31593935cf6e7475cf6ae8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-09-09T21:10:15Z","title_canon_sha256":"6b873678e0be5324c3c509e00dafd1c8041d6ee7f5843579781abf8f2f90e20c"},"schema_version":"1.0","source":{"id":"2509.08148","kind":"arxiv","version":18}},"canonical_sha256":"75b653aae6a53b9aa814f396554ed085ab91f7f75660df3fd97bd9a4b9b173bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75b653aae6a53b9aa814f396554ed085ab91f7f75660df3fd97bd9a4b9b173bc","first_computed_at":"2026-05-27T01:04:50.383831Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-27T01:04:50.383831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WfGIbFeURa9qSfjiwIhcVbiA9fciamRNSwqKyaOHyWazxyXBcEfL93hiIS7kr1hXXJUSXFM+nt/HHHW/O0rVCA==","signature_status":"signed_v1","signed_at":"2026-05-27T01:04:50.384467Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.08148","source_kind":"arxiv","source_version":18}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9657b0ea16fe1ce5786a6615e5c1c326f2372a3e0a6a521c38efa88971da43be","sha256:579cf6073a5c783d10c37930fe78706fdf61b99ecd0473a3c6ba6845a0f512c9"],"state_sha256":"7e6bbba747aa1e3360812e6d7c891fb2968e3a279bbca93a328432a907e2d290"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ez6GH5KHXqpXQUDEkIu46yrA/Fe2ZTVpOPEUhdipzP8tbpOGz0BheUCmfDrvX7HlZq2rJhF5J2lCoSEFfMwcAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T01:43:35.630515Z","bundle_sha256":"ce4479c97b55bab4d67debc297e16b1196fe236df1b8c3b36556e0e97ec4eb39"}}