{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OW3FHKXGUU5ZVKAU6OLFKTWQQW","short_pith_number":"pith:OW3FHKXG","schema_version":"1.0","canonical_sha256":"75b653aae6a53b9aa814f396554ed085ab91f7f75660df3fd97bd9a4b9b173bc","source":{"kind":"arxiv","id":"2509.08148","version":18},"attestation_state":"computed","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,"},"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":true},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2509.08148","created_at":"2026-05-27T01:04:50.383913+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.08148v18","created_at":"2026-05-27T01:04:50.383913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08148","created_at":"2026-05-27T01:04:50.383913+00:00"},{"alias_kind":"pith_short_12","alias_value":"OW3FHKXGUU5Z","created_at":"2026-05-27T01:04:50.383913+00:00"},{"alias_kind":"pith_short_16","alias_value":"OW3FHKXGUU5ZVKAU","created_at":"2026-05-27T01:04:50.383913+00:00"},{"alias_kind":"pith_short_8","alias_value":"OW3FHKXG","created_at":"2026-05-27T01:04:50.383913+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OW3FHKXGUU5ZVKAU6OLFKTWQQW","json":"https://pith.science/pith/OW3FHKXGUU5ZVKAU6OLFKTWQQW.json","graph_json":"https://pith.science/api/pith-number/OW3FHKXGUU5ZVKAU6OLFKTWQQW/graph.json","events_json":"https://pith.science/api/pith-number/OW3FHKXGUU5ZVKAU6OLFKTWQQW/events.json","paper":"https://pith.science/paper/OW3FHKXG"},"agent_actions":{"view_html":"https://pith.science/pith/OW3FHKXGUU5ZVKAU6OLFKTWQQW","download_json":"https://pith.science/pith/OW3FHKXGUU5ZVKAU6OLFKTWQQW.json","view_paper":"https://pith.science/paper/OW3FHKXG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.08148&json=true","fetch_graph":"https://pith.science/api/pith-number/OW3FHKXGUU5ZVKAU6OLFKTWQQW/graph.json","fetch_events":"https://pith.science/api/pith-number/OW3FHKXGUU5ZVKAU6OLFKTWQQW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OW3FHKXGUU5ZVKAU6OLFKTWQQW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OW3FHKXGUU5ZVKAU6OLFKTWQQW/action/storage_attestation","attest_author":"https://pith.science/pith/OW3FHKXGUU5ZVKAU6OLFKTWQQW/action/author_attestation","sign_citation":"https://pith.science/pith/OW3FHKXGUU5ZVKAU6OLFKTWQQW/action/citation_signature","submit_replication":"https://pith.science/pith/OW3FHKXGUU5ZVKAU6OLFKTWQQW/action/replication_record"}},"created_at":"2026-05-27T01:04:50.383913+00:00","updated_at":"2026-05-27T01:04:50.383913+00:00"}