{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5ALN26H73EJM4WWBOHJZ56AJSP","short_pith_number":"pith:5ALN26H7","schema_version":"1.0","canonical_sha256":"e816dd78ffd912ce5ac171d39ef80993fb7a2a96ba94abf06b7f1cf5bf210418","source":{"kind":"arxiv","id":"1809.09776","version":1},"attestation_state":"computed","paper":{"title":"An Algorithm for Reducing Approximate Nearest Neighbor to Approximate Near Neighbor with O(logn) Query Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG"],"primary_cat":"cs.DS","authors_text":"Hengzhao Ma, Jianzhong Li","submitted_at":"2018-09-26T01:42:05Z","abstract_excerpt":"This paper proposes a new algorithm for reducing Approximate Nearest Neighbor problem to Approximate Near Neighbor problem. The advantage of this algorithm is that it achieves O(log n) query time. As a reduction problem, the uery time complexity is the times of invoking the algorithm for Approximate Near Neighbor problem. All former algorithms for the same reduction need polylog(n) query time. A box split method proposed by Vaidya is used in our paper to achieve the O(log n) query time complexity."},"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":"1809.09776","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-26T01:42:05Z","cross_cats_sorted":["cs.CC","cs.CG"],"title_canon_sha256":"874e0f82fc4d4f106eec70f77ac6575f47ad5d907193ac39954809862419811d","abstract_canon_sha256":"69aa6318f4cabe6a8e1e5113076c0604101a01aad9289079c0e87b109488b964"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:43.670340Z","signature_b64":"PF1G5FGYYwOmC09MO7VdLpO5B1QyM5PYihtnbzY7Xx356gGsGZfj5sg76lTHgMg6aTul0i8TPTeVuYqfS7zCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e816dd78ffd912ce5ac171d39ef80993fb7a2a96ba94abf06b7f1cf5bf210418","last_reissued_at":"2026-05-18T00:04:43.669604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:43.669604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Algorithm for Reducing Approximate Nearest Neighbor to Approximate Near Neighbor with O(logn) Query Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG"],"primary_cat":"cs.DS","authors_text":"Hengzhao Ma, Jianzhong Li","submitted_at":"2018-09-26T01:42:05Z","abstract_excerpt":"This paper proposes a new algorithm for reducing Approximate Nearest Neighbor problem to Approximate Near Neighbor problem. The advantage of this algorithm is that it achieves O(log n) query time. As a reduction problem, the uery time complexity is the times of invoking the algorithm for Approximate Near Neighbor problem. All former algorithms for the same reduction need polylog(n) query time. A box split method proposed by Vaidya is used in our paper to achieve the O(log n) query time complexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09776","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":""},"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":"1809.09776","created_at":"2026-05-18T00:04:43.669714+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.09776v1","created_at":"2026-05-18T00:04:43.669714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09776","created_at":"2026-05-18T00:04:43.669714+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ALN26H73EJM","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ALN26H73EJM4WWB","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ALN26H7","created_at":"2026-05-18T12:32:08.215937+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/5ALN26H73EJM4WWBOHJZ56AJSP","json":"https://pith.science/pith/5ALN26H73EJM4WWBOHJZ56AJSP.json","graph_json":"https://pith.science/api/pith-number/5ALN26H73EJM4WWBOHJZ56AJSP/graph.json","events_json":"https://pith.science/api/pith-number/5ALN26H73EJM4WWBOHJZ56AJSP/events.json","paper":"https://pith.science/paper/5ALN26H7"},"agent_actions":{"view_html":"https://pith.science/pith/5ALN26H73EJM4WWBOHJZ56AJSP","download_json":"https://pith.science/pith/5ALN26H73EJM4WWBOHJZ56AJSP.json","view_paper":"https://pith.science/paper/5ALN26H7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.09776&json=true","fetch_graph":"https://pith.science/api/pith-number/5ALN26H73EJM4WWBOHJZ56AJSP/graph.json","fetch_events":"https://pith.science/api/pith-number/5ALN26H73EJM4WWBOHJZ56AJSP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ALN26H73EJM4WWBOHJZ56AJSP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ALN26H73EJM4WWBOHJZ56AJSP/action/storage_attestation","attest_author":"https://pith.science/pith/5ALN26H73EJM4WWBOHJZ56AJSP/action/author_attestation","sign_citation":"https://pith.science/pith/5ALN26H73EJM4WWBOHJZ56AJSP/action/citation_signature","submit_replication":"https://pith.science/pith/5ALN26H73EJM4WWBOHJZ56AJSP/action/replication_record"}},"created_at":"2026-05-18T00:04:43.669714+00:00","updated_at":"2026-05-18T00:04:43.669714+00:00"}