{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:W37FBVHHM2JZRYDSAVJDZNS2XE","short_pith_number":"pith:W37FBVHH","schema_version":"1.0","canonical_sha256":"b6fe50d4e7669398e07205523cb65ab91f207d173d4cc5aaa2709fea0df81653","source":{"kind":"arxiv","id":"2606.02752","version":1},"attestation_state":"computed","paper":{"title":"Online K-d tree for approximate neighborhood search in data streams","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eduardo V. L. Barboza, Rafael M. O. Cruz, Robert Sabourin","submitted_at":"2026-06-01T18:18:29Z","abstract_excerpt":"The k-Nearest Neighbors (kNN) algorithm has long been widely used in Machine Learning (ML) applications. However, the main concern when using it is the computational cost required for neighborhood search, which can make it unfeasible for large-scale applications. Optimization algorithms, such as the K-d tree, become an option in such scenarios. Under data streams, it can be challenging to maintain the properties of the K-d tree, as it requires inserting and deleting nodes on the fly. These operations can make maintaining the tree's balance and invariants difficult. Additionally, traditional K-"},"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":"2606.02752","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-01T18:18:29Z","cross_cats_sorted":[],"title_canon_sha256":"5ea62146080e6c52614b3d72a13e1761836923a80e5a7c7403499d7a65e18dc8","abstract_canon_sha256":"99ab94fcf1433439875f7c36c182cdd86ad3590db356953f13a7a3ea8a7d7ea1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T00:05:08.943267Z","signature_b64":"UA0ZT1bqqlFdTYR02lV3kPGUUdon/ubfF1ln8QHSjmwvZhHJC1F5jQh7yODSo0RCDoFZ2y6mxYSzrZaKGjRcAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6fe50d4e7669398e07205523cb65ab91f207d173d4cc5aaa2709fea0df81653","last_reissued_at":"2026-06-03T00:05:08.942871Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T00:05:08.942871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online K-d tree for approximate neighborhood search in data streams","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eduardo V. L. Barboza, Rafael M. O. Cruz, Robert Sabourin","submitted_at":"2026-06-01T18:18:29Z","abstract_excerpt":"The k-Nearest Neighbors (kNN) algorithm has long been widely used in Machine Learning (ML) applications. However, the main concern when using it is the computational cost required for neighborhood search, which can make it unfeasible for large-scale applications. Optimization algorithms, such as the K-d tree, become an option in such scenarios. Under data streams, it can be challenging to maintain the properties of the K-d tree, as it requires inserting and deleting nodes on the fly. These operations can make maintaining the tree's balance and invariants difficult. Additionally, traditional K-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02752","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/2606.02752/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":"2606.02752","created_at":"2026-06-03T00:05:08.942930+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.02752v1","created_at":"2026-06-03T00:05:08.942930+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02752","created_at":"2026-06-03T00:05:08.942930+00:00"},{"alias_kind":"pith_short_12","alias_value":"W37FBVHHM2JZ","created_at":"2026-06-03T00:05:08.942930+00:00"},{"alias_kind":"pith_short_16","alias_value":"W37FBVHHM2JZRYDS","created_at":"2026-06-03T00:05:08.942930+00:00"},{"alias_kind":"pith_short_8","alias_value":"W37FBVHH","created_at":"2026-06-03T00:05:08.942930+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W37FBVHHM2JZRYDSAVJDZNS2XE","json":"https://pith.science/pith/W37FBVHHM2JZRYDSAVJDZNS2XE.json","graph_json":"https://pith.science/api/pith-number/W37FBVHHM2JZRYDSAVJDZNS2XE/graph.json","events_json":"https://pith.science/api/pith-number/W37FBVHHM2JZRYDSAVJDZNS2XE/events.json","paper":"https://pith.science/paper/W37FBVHH"},"agent_actions":{"view_html":"https://pith.science/pith/W37FBVHHM2JZRYDSAVJDZNS2XE","download_json":"https://pith.science/pith/W37FBVHHM2JZRYDSAVJDZNS2XE.json","view_paper":"https://pith.science/paper/W37FBVHH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.02752&json=true","fetch_graph":"https://pith.science/api/pith-number/W37FBVHHM2JZRYDSAVJDZNS2XE/graph.json","fetch_events":"https://pith.science/api/pith-number/W37FBVHHM2JZRYDSAVJDZNS2XE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W37FBVHHM2JZRYDSAVJDZNS2XE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W37FBVHHM2JZRYDSAVJDZNS2XE/action/storage_attestation","attest_author":"https://pith.science/pith/W37FBVHHM2JZRYDSAVJDZNS2XE/action/author_attestation","sign_citation":"https://pith.science/pith/W37FBVHHM2JZRYDSAVJDZNS2XE/action/citation_signature","submit_replication":"https://pith.science/pith/W37FBVHHM2JZRYDSAVJDZNS2XE/action/replication_record"}},"created_at":"2026-06-03T00:05:08.942930+00:00","updated_at":"2026-06-03T00:05:08.942930+00:00"}