{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1999:QBT7Q3M4AYBPI6VLBZDNVOOP6A","short_pith_number":"pith:QBT7Q3M4","schema_version":"1.0","canonical_sha256":"8067f86d9c0602f47aab0e46dab9cff01bd2ba8b77753f685c9c15fcecf2d5e9","source":{"kind":"arxiv","id":"cs/9901013","version":1},"attestation_state":"computed","paper":{"title":"Analysis of approximate nearest neighbor searching with clustered point sets","license":"","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"David M. Mount, Songrit Maneewongvatana","submitted_at":"1999-01-26T21:23:37Z","abstract_excerpt":"We present an empirical analysis of data structures for approximate nearest neighbor searching. We compare the well-known optimized kd-tree splitting method against two alternative splitting methods. The first, called the sliding-midpoint method, which attempts to balance the goals of producing subdivision cells of bounded aspect ratio, while not producing any empty cells. The second, called the minimum-ambiguity method is a query-based approach. In addition to the data points, it is also given a training set of query points for preprocessing. It employs a simple greedy algorithm to select the"},"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":"cs/9901013","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CG","submitted_at":"1999-01-26T21:23:37Z","cross_cats_sorted":[],"title_canon_sha256":"0af3fb28051d69bcf61d108002f01a46199520139d9cec7e0d0963ffa915215e","abstract_canon_sha256":"fbbed17fcd0f286e839eb5270c8c3515290d489d92bed98d37f9c1433b778232"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:25:09.283552Z","signature_b64":"sdmU7Wm2w5nNxrbG4sBUP9JYhoshV8BbjYlWgRmX9oy86hNtpB9FnH/8mXnpyqfN/BYTxxWVjrjvbJkl+h6OBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8067f86d9c0602f47aab0e46dab9cff01bd2ba8b77753f685c9c15fcecf2d5e9","last_reissued_at":"2026-07-04T14:25:09.283135Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:25:09.283135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of approximate nearest neighbor searching with clustered point sets","license":"","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"David M. Mount, Songrit Maneewongvatana","submitted_at":"1999-01-26T21:23:37Z","abstract_excerpt":"We present an empirical analysis of data structures for approximate nearest neighbor searching. We compare the well-known optimized kd-tree splitting method against two alternative splitting methods. The first, called the sliding-midpoint method, which attempts to balance the goals of producing subdivision cells of bounded aspect ratio, while not producing any empty cells. The second, called the minimum-ambiguity method is a query-based approach. In addition to the data points, it is also given a training set of query points for preprocessing. It employs a simple greedy algorithm to select the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/9901013","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/cs/9901013/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":"cs/9901013","created_at":"2026-07-04T14:25:09.283196+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/9901013v1","created_at":"2026-07-04T14:25:09.283196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/9901013","created_at":"2026-07-04T14:25:09.283196+00:00"},{"alias_kind":"pith_short_12","alias_value":"QBT7Q3M4AYBP","created_at":"2026-07-04T14:25:09.283196+00:00"},{"alias_kind":"pith_short_16","alias_value":"QBT7Q3M4AYBPI6VL","created_at":"2026-07-04T14:25:09.283196+00:00"},{"alias_kind":"pith_short_8","alias_value":"QBT7Q3M4","created_at":"2026-07-04T14:25:09.283196+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2606.01006","citing_title":"Automated Erythrocyte Detection and Tracking for Retinal Blood Flow Quantification in Erythrocyte-Mediated Angiography","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2606.30585","citing_title":"Excitons in Large Disordered Boron-Nitride Layer using Linear-Scaling Bethe-Salpeter Simulations","ref_index":37,"is_internal_anchor":true},{"citing_arxiv_id":"1907.10121","citing_title":"SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python","ref_index":99,"is_internal_anchor":true},{"citing_arxiv_id":"2605.05772","citing_title":"UD-DML: Uniform Design Subsampling for Double Machine Learning over Massive Data","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QBT7Q3M4AYBPI6VLBZDNVOOP6A","json":"https://pith.science/pith/QBT7Q3M4AYBPI6VLBZDNVOOP6A.json","graph_json":"https://pith.science/api/pith-number/QBT7Q3M4AYBPI6VLBZDNVOOP6A/graph.json","events_json":"https://pith.science/api/pith-number/QBT7Q3M4AYBPI6VLBZDNVOOP6A/events.json","paper":"https://pith.science/paper/QBT7Q3M4"},"agent_actions":{"view_html":"https://pith.science/pith/QBT7Q3M4AYBPI6VLBZDNVOOP6A","download_json":"https://pith.science/pith/QBT7Q3M4AYBPI6VLBZDNVOOP6A.json","view_paper":"https://pith.science/paper/QBT7Q3M4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/9901013&json=true","fetch_graph":"https://pith.science/api/pith-number/QBT7Q3M4AYBPI6VLBZDNVOOP6A/graph.json","fetch_events":"https://pith.science/api/pith-number/QBT7Q3M4AYBPI6VLBZDNVOOP6A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QBT7Q3M4AYBPI6VLBZDNVOOP6A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QBT7Q3M4AYBPI6VLBZDNVOOP6A/action/storage_attestation","attest_author":"https://pith.science/pith/QBT7Q3M4AYBPI6VLBZDNVOOP6A/action/author_attestation","sign_citation":"https://pith.science/pith/QBT7Q3M4AYBPI6VLBZDNVOOP6A/action/citation_signature","submit_replication":"https://pith.science/pith/QBT7Q3M4AYBPI6VLBZDNVOOP6A/action/replication_record"}},"created_at":"2026-07-04T14:25:09.283196+00:00","updated_at":"2026-07-04T14:25:09.283196+00:00"}