{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:5F7LQTTBQBBX2VK6FXXIS7J66I","short_pith_number":"pith:5F7LQTTB","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"},"canonical_sha256":"e97eb84e6180437d555e2dee897d3ef2089cc7130a6e7c481ac05f8884a21436","source":{"kind":"arxiv","id":"physics/0408067","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"physics/0408067","created_at":"2026-07-04T14:44:22Z"},{"alias_kind":"arxiv_version","alias_value":"physics/0408067v2","created_at":"2026-07-04T14:44:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.physics/0408067","created_at":"2026-07-04T14:44:22Z"},{"alias_kind":"pith_short_12","alias_value":"5F7LQTTBQBBX","created_at":"2026-07-04T14:44:22Z"},{"alias_kind":"pith_short_16","alias_value":"5F7LQTTBQBBX2VK6","created_at":"2026-07-04T14:44:22Z"},{"alias_kind":"pith_short_8","alias_value":"5F7LQTTB","created_at":"2026-07-04T14:44:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:5F7LQTTBQBBX2VK6FXXIS7J66I","target":"record","payload":{"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"},"canonical_sha256":"e97eb84e6180437d555e2dee897d3ef2089cc7130a6e7c481ac05f8884a21436","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"},"source_kind":"arxiv","source_id":"physics/0408067","source_version":2,"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-04T14:44:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9q+LoW0Ups0Rf/0g5SEuFsvz4zEin4+wWzZpbwx7RgE8DHRyPxMMif61n04BxREU5UjSjlPy9wlrhK8VqoOyCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T00:34:09.905659Z"},"content_sha256":"cab62a1ed5ea5046da304ce3a0900f72e1c58576831888a786d0d498435eebf7","schema_version":"1.0","event_id":"sha256:cab62a1ed5ea5046da304ce3a0900f72e1c58576831888a786d0d498435eebf7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:5F7LQTTBQBBX2VK6FXXIS7J66I","target":"graph","payload":{"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"},"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-04T14:44:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wXGw/hT0fSXH5douwLs1dZzZyPx+Cuy844xy4ZQfOxGymlzv36+hE8BK8tokqqgrBiUvnde1Pjs9UbQZF2OlBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T00:34:09.906349Z"},"content_sha256":"d6002601acbbde9664b6c86cba94a4a764ec3588b0005cc07f96f3e0b4dd778b","schema_version":"1.0","event_id":"sha256:d6002601acbbde9664b6c86cba94a4a764ec3588b0005cc07f96f3e0b4dd778b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5F7LQTTBQBBX2VK6FXXIS7J66I/bundle.json","state_url":"https://pith.science/pith/5F7LQTTBQBBX2VK6FXXIS7J66I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5F7LQTTBQBBX2VK6FXXIS7J66I/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-16T00:34:09Z","links":{"resolver":"https://pith.science/pith/5F7LQTTBQBBX2VK6FXXIS7J66I","bundle":"https://pith.science/pith/5F7LQTTBQBBX2VK6FXXIS7J66I/bundle.json","state":"https://pith.science/pith/5F7LQTTBQBBX2VK6FXXIS7J66I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5F7LQTTBQBBX2VK6FXXIS7J66I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:5F7LQTTBQBBX2VK6FXXIS7J66I","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":"6d14e2424f9ef0c197663e96cd8ebd018e6109a074b3b297fc918a7fe1438234","cross_cats_sorted":["physics.comp-ph"],"license":"","primary_cat":"physics.data-an","submitted_at":"2004-08-14T01:35:34Z","title_canon_sha256":"a92562cfd7d3ccc6cb78bd29e142abb89acc8143e114dc35c18d3193f1c4dc42"},"schema_version":"1.0","source":{"id":"physics/0408067","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"physics/0408067","created_at":"2026-07-04T14:44:22Z"},{"alias_kind":"arxiv_version","alias_value":"physics/0408067v2","created_at":"2026-07-04T14:44:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.physics/0408067","created_at":"2026-07-04T14:44:22Z"},{"alias_kind":"pith_short_12","alias_value":"5F7LQTTBQBBX","created_at":"2026-07-04T14:44:22Z"},{"alias_kind":"pith_short_16","alias_value":"5F7LQTTBQBBX2VK6","created_at":"2026-07-04T14:44:22Z"},{"alias_kind":"pith_short_8","alias_value":"5F7LQTTB","created_at":"2026-07-04T14:44:22Z"}],"graph_snapshots":[{"event_id":"sha256:d6002601acbbde9664b6c86cba94a4a764ec3588b0005cc07f96f3e0b4dd778b","target":"graph","created_at":"2026-07-04T14:44:22Z","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/physics/0408067/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Matthew B. Kennel","cross_cats":["physics.comp-ph"],"headline":"","license":"","primary_cat":"physics.data-an","submitted_at":"2004-08-14T01:35:34Z","title":"KDTREE 2: Fortran 95 and C++ software to efficiently search for near neighbors in a multi-dimensional Euclidean space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"physics/0408067","kind":"arxiv","version":2},"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:cab62a1ed5ea5046da304ce3a0900f72e1c58576831888a786d0d498435eebf7","target":"record","created_at":"2026-07-04T14:44:22Z","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":"6d14e2424f9ef0c197663e96cd8ebd018e6109a074b3b297fc918a7fe1438234","cross_cats_sorted":["physics.comp-ph"],"license":"","primary_cat":"physics.data-an","submitted_at":"2004-08-14T01:35:34Z","title_canon_sha256":"a92562cfd7d3ccc6cb78bd29e142abb89acc8143e114dc35c18d3193f1c4dc42"},"schema_version":"1.0","source":{"id":"physics/0408067","kind":"arxiv","version":2}},"canonical_sha256":"e97eb84e6180437d555e2dee897d3ef2089cc7130a6e7c481ac05f8884a21436","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e97eb84e6180437d555e2dee897d3ef2089cc7130a6e7c481ac05f8884a21436","first_computed_at":"2026-07-04T14:44:22.319845Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:44:22.319845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BniKE6/C4nOg/rDJlZByZVWtNkLgcJrSbrTXQqt/vvIbjLlfzIdko3JjPewkJqKcS/B3VdLC8cPtSKaXtRx8BQ==","signature_status":"signed_v1","signed_at":"2026-07-04T14:44:22.320222Z","signed_message":"canonical_sha256_bytes"},"source_id":"physics/0408067","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cab62a1ed5ea5046da304ce3a0900f72e1c58576831888a786d0d498435eebf7","sha256:d6002601acbbde9664b6c86cba94a4a764ec3588b0005cc07f96f3e0b4dd778b"],"state_sha256":"7ec970edc99dd6259c8534aa9ea4ee465524b87c711f4131db1f2c5284607b5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S3M9TaehT8xjjUUQSEswq335nbuG7zUoYgRJtWv/n56KaFCEF5PF2PxmAVSddAyjJawgKaLgEm/WW4thHglzAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T00:34:09.912391Z","bundle_sha256":"6e2b292a845f66d1a7b17ce08ad444a65509973fd57c77674ad121ec9879d917"}}