{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:5F7LQTTBQBBX2VK6FXXIS7J66I","short_pith_number":"pith:5F7LQTTB","schema_version":"1.0","canonical_sha256":"e97eb84e6180437d555e2dee897d3ef2089cc7130a6e7c481ac05f8884a21436","source":{"kind":"arxiv","id":"physics/0408067","version":2},"attestation_state":"computed","paper":{"title":"KDTREE 2: Fortran 95 and C++ software to efficiently search for near neighbors in a multi-dimensional Euclidean space","license":"","headline":"","cross_cats":["physics.comp-ph"],"primary_cat":"physics.data-an","authors_text":"Matthew B. Kennel","submitted_at":"2004-08-14T01:35:34Z","abstract_excerpt":"Many data-based statistical algorithms require that one find \\textit{near or nearest neighbors} to a given vector among a set of points in that vector space, usually with Euclidean topology. The k-d data structure and search algorithms are the generalization of classical binary search trees to higher dimensional spaces, so that one may locate near neighbors to an example vector in $O(\\log N)$ time instead of the brute-force O(N) time, with $N$ being the size of the data base. KDTREE2 is a Fortran 95 module, and a parallel set of C++ classes which implement tree construction and search routines"},"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":"physics/0408067","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"physics.data-an","submitted_at":"2004-08-14T01:35:34Z","cross_cats_sorted":["physics.comp-ph"],"title_canon_sha256":"a92562cfd7d3ccc6cb78bd29e142abb89acc8143e114dc35c18d3193f1c4dc42","abstract_canon_sha256":"6d14e2424f9ef0c197663e96cd8ebd018e6109a074b3b297fc918a7fe1438234"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:44:22.320222Z","signature_b64":"BniKE6/C4nOg/rDJlZByZVWtNkLgcJrSbrTXQqt/vvIbjLlfzIdko3JjPewkJqKcS/B3VdLC8cPtSKaXtRx8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e97eb84e6180437d555e2dee897d3ef2089cc7130a6e7c481ac05f8884a21436","last_reissued_at":"2026-07-04T14:44:22.319845Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:44:22.319845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"KDTREE 2: Fortran 95 and C++ software to efficiently search for near neighbors in a multi-dimensional Euclidean space","license":"","headline":"","cross_cats":["physics.comp-ph"],"primary_cat":"physics.data-an","authors_text":"Matthew B. Kennel","submitted_at":"2004-08-14T01:35:34Z","abstract_excerpt":"Many data-based statistical algorithms require that one find \\textit{near or nearest neighbors} to a given vector among a set of points in that vector space, usually with Euclidean topology. The k-d data structure and search algorithms are the generalization of classical binary search trees to higher dimensional spaces, so that one may locate near neighbors to an example vector in $O(\\log N)$ time instead of the brute-force O(N) time, with $N$ being the size of the data base. KDTREE2 is a Fortran 95 module, and a parallel set of C++ classes which implement tree construction and search routines"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"physics/0408067","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/physics/0408067/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":"physics/0408067","created_at":"2026-07-04T14:44:22.319900+00:00"},{"alias_kind":"arxiv_version","alias_value":"physics/0408067v2","created_at":"2026-07-04T14:44:22.319900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.physics/0408067","created_at":"2026-07-04T14:44:22.319900+00:00"},{"alias_kind":"pith_short_12","alias_value":"5F7LQTTBQBBX","created_at":"2026-07-04T14:44:22.319900+00:00"},{"alias_kind":"pith_short_16","alias_value":"5F7LQTTBQBBX2VK6","created_at":"2026-07-04T14:44:22.319900+00:00"},{"alias_kind":"pith_short_8","alias_value":"5F7LQTTB","created_at":"2026-07-04T14:44:22.319900+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06604","citing_title":"Fast Graph-based Higher-Order Clustering Statistics on the GPU","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5F7LQTTBQBBX2VK6FXXIS7J66I","json":"https://pith.science/pith/5F7LQTTBQBBX2VK6FXXIS7J66I.json","graph_json":"https://pith.science/api/pith-number/5F7LQTTBQBBX2VK6FXXIS7J66I/graph.json","events_json":"https://pith.science/api/pith-number/5F7LQTTBQBBX2VK6FXXIS7J66I/events.json","paper":"https://pith.science/paper/5F7LQTTB"},"agent_actions":{"view_html":"https://pith.science/pith/5F7LQTTBQBBX2VK6FXXIS7J66I","download_json":"https://pith.science/pith/5F7LQTTBQBBX2VK6FXXIS7J66I.json","view_paper":"https://pith.science/paper/5F7LQTTB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=physics/0408067&json=true","fetch_graph":"https://pith.science/api/pith-number/5F7LQTTBQBBX2VK6FXXIS7J66I/graph.json","fetch_events":"https://pith.science/api/pith-number/5F7LQTTBQBBX2VK6FXXIS7J66I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5F7LQTTBQBBX2VK6FXXIS7J66I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5F7LQTTBQBBX2VK6FXXIS7J66I/action/storage_attestation","attest_author":"https://pith.science/pith/5F7LQTTBQBBX2VK6FXXIS7J66I/action/author_attestation","sign_citation":"https://pith.science/pith/5F7LQTTBQBBX2VK6FXXIS7J66I/action/citation_signature","submit_replication":"https://pith.science/pith/5F7LQTTBQBBX2VK6FXXIS7J66I/action/replication_record"}},"created_at":"2026-07-04T14:44:22.319900+00:00","updated_at":"2026-07-04T14:44:22.319900+00:00"}