{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:B5B3FZXSHUYDIEDHBERJ2HV5VI","short_pith_number":"pith:B5B3FZXS","schema_version":"1.0","canonical_sha256":"0f43b2e6f23d3034106709229d1ebdaa2a72d246f02d440c23e06162b4cd1157","source":{"kind":"arxiv","id":"2502.13245","version":3},"attestation_state":"computed","paper":{"title":"Range Retrieval with Graph-Based Indices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Guy E. Blelloch, Magdalen Dobson Manohar, Taekseung Kim","submitted_at":"2025-02-18T19:18:01Z","abstract_excerpt":"Retrieving points based on proximity in a high-dimensional vector space is a crucial step in information retrieval applications. The approximate nearest neighbor search (ANNS) problem, which identifies the $k$ nearest neighbors for a query, has been extensively studied in recent years. However, comparatively little attention has been paid to the related problem of finding all points within a given distance of a query, the range retrieval problem, despite its applications in areas such as duplicate detection, plagiarism checking, and facial recognition. In this paper, we present new techniques "},"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":"2502.13245","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-02-18T19:18:01Z","cross_cats_sorted":[],"title_canon_sha256":"a66d861a5938a977bce5bc253d63c4ddd23b6558277b940527d58390617f32db","abstract_canon_sha256":"665f63d4ae06fed47d7f6ad96f628ea4eae79453b221a1d29b0e1d38dcf43a96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:07:59.028883Z","signature_b64":"C+meKZt8jbsuf8Ev6NB5K01XPAimjpszpu7nnf2TLgMvZFlUlSol9cYeZ7NIXaK3kztWPZIbTy1bmi7/Sgs7AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f43b2e6f23d3034106709229d1ebdaa2a72d246f02d440c23e06162b4cd1157","last_reissued_at":"2026-07-05T12:07:59.028337Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:07:59.028337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Range Retrieval with Graph-Based Indices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Guy E. Blelloch, Magdalen Dobson Manohar, Taekseung Kim","submitted_at":"2025-02-18T19:18:01Z","abstract_excerpt":"Retrieving points based on proximity in a high-dimensional vector space is a crucial step in information retrieval applications. The approximate nearest neighbor search (ANNS) problem, which identifies the $k$ nearest neighbors for a query, has been extensively studied in recent years. However, comparatively little attention has been paid to the related problem of finding all points within a given distance of a query, the range retrieval problem, despite its applications in areas such as duplicate detection, plagiarism checking, and facial recognition. In this paper, we present new techniques "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.13245","kind":"arxiv","version":3},"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/2502.13245/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":"2502.13245","created_at":"2026-07-05T12:07:59.028408+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.13245v3","created_at":"2026-07-05T12:07:59.028408+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.13245","created_at":"2026-07-05T12:07:59.028408+00:00"},{"alias_kind":"pith_short_12","alias_value":"B5B3FZXSHUYD","created_at":"2026-07-05T12:07:59.028408+00:00"},{"alias_kind":"pith_short_16","alias_value":"B5B3FZXSHUYDIEDH","created_at":"2026-07-05T12:07:59.028408+00:00"},{"alias_kind":"pith_short_8","alias_value":"B5B3FZXS","created_at":"2026-07-05T12:07:59.028408+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/B5B3FZXSHUYDIEDHBERJ2HV5VI","json":"https://pith.science/pith/B5B3FZXSHUYDIEDHBERJ2HV5VI.json","graph_json":"https://pith.science/api/pith-number/B5B3FZXSHUYDIEDHBERJ2HV5VI/graph.json","events_json":"https://pith.science/api/pith-number/B5B3FZXSHUYDIEDHBERJ2HV5VI/events.json","paper":"https://pith.science/paper/B5B3FZXS"},"agent_actions":{"view_html":"https://pith.science/pith/B5B3FZXSHUYDIEDHBERJ2HV5VI","download_json":"https://pith.science/pith/B5B3FZXSHUYDIEDHBERJ2HV5VI.json","view_paper":"https://pith.science/paper/B5B3FZXS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.13245&json=true","fetch_graph":"https://pith.science/api/pith-number/B5B3FZXSHUYDIEDHBERJ2HV5VI/graph.json","fetch_events":"https://pith.science/api/pith-number/B5B3FZXSHUYDIEDHBERJ2HV5VI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B5B3FZXSHUYDIEDHBERJ2HV5VI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B5B3FZXSHUYDIEDHBERJ2HV5VI/action/storage_attestation","attest_author":"https://pith.science/pith/B5B3FZXSHUYDIEDHBERJ2HV5VI/action/author_attestation","sign_citation":"https://pith.science/pith/B5B3FZXSHUYDIEDHBERJ2HV5VI/action/citation_signature","submit_replication":"https://pith.science/pith/B5B3FZXSHUYDIEDHBERJ2HV5VI/action/replication_record"}},"created_at":"2026-07-05T12:07:59.028408+00:00","updated_at":"2026-07-05T12:07:59.028408+00:00"}