{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GO7EC5ZACSWMHDG22CPSVQN4FI","short_pith_number":"pith:GO7EC5ZA","schema_version":"1.0","canonical_sha256":"33be41772014acc38cdad09f2ac1bc2a06de2f3b506d48e4c3da1d109d70c701","source":{"kind":"arxiv","id":"2605.26474","version":1},"attestation_state":"computed","paper":{"title":"Generalized Range Filtering Approximate Nearest Neighbor Search: Containment and Overlap [Technical Report]","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DB","authors_text":"Jeffrey Xu Yu, Jiadong Xie, Jiangtao Cui, Tong Wu, Yang Zhao, Yingfan Liu","submitted_at":"2026-05-26T02:31:27Z","abstract_excerpt":"Approximate nearest neighbor (ANN) search with range filters has recently garnered significant attention. This paper delves into a generalized form of this problem, i.e., ANN search with exact range-range (RR) predicates on a range-valued attribute, named RR filtering ANN (RRANN). Specifically, given $n$ vectors in $\\mathbb{R}^d$, each vector $v_i$ is associated with a numeric range $[l_i, r_i]$, symbolizing aspects like a price range or time interval. An RRANN query $(v_q, l_q, r_q)$ aims at finding $k$ vectors closest to $v_q$ within the vectors satisfying an arbitrary RR predicate defined b"},"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":"2605.26474","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2026-05-26T02:31:27Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"2d2b8128db364c7109b8c405e2aa8a4fdd1ba4d998bab3bead582e44d545774b","abstract_canon_sha256":"60b2fc6a34fa4d65fac08583fe0622f91106c29f2151dfac7d039fa28c1039e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:05:20.119725Z","signature_b64":"JTWOnURSQBOyvVUS3tiwusVrdx4gyxUUHRubLr/SPPV/qoXiahQWt2Ip/10CDe1m/6XZzQGshjLuyt+tpEphCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33be41772014acc38cdad09f2ac1bc2a06de2f3b506d48e4c3da1d109d70c701","last_reissued_at":"2026-05-27T01:05:20.118924Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:05:20.118924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Range Filtering Approximate Nearest Neighbor Search: Containment and Overlap [Technical Report]","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DB","authors_text":"Jeffrey Xu Yu, Jiadong Xie, Jiangtao Cui, Tong Wu, Yang Zhao, Yingfan Liu","submitted_at":"2026-05-26T02:31:27Z","abstract_excerpt":"Approximate nearest neighbor (ANN) search with range filters has recently garnered significant attention. This paper delves into a generalized form of this problem, i.e., ANN search with exact range-range (RR) predicates on a range-valued attribute, named RR filtering ANN (RRANN). Specifically, given $n$ vectors in $\\mathbb{R}^d$, each vector $v_i$ is associated with a numeric range $[l_i, r_i]$, symbolizing aspects like a price range or time interval. An RRANN query $(v_q, l_q, r_q)$ aims at finding $k$ vectors closest to $v_q$ within the vectors satisfying an arbitrary RR predicate defined b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.26474","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/2605.26474/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":"2605.26474","created_at":"2026-05-27T01:05:20.119048+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.26474v1","created_at":"2026-05-27T01:05:20.119048+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26474","created_at":"2026-05-27T01:05:20.119048+00:00"},{"alias_kind":"pith_short_12","alias_value":"GO7EC5ZACSWM","created_at":"2026-05-27T01:05:20.119048+00:00"},{"alias_kind":"pith_short_16","alias_value":"GO7EC5ZACSWMHDG2","created_at":"2026-05-27T01:05:20.119048+00:00"},{"alias_kind":"pith_short_8","alias_value":"GO7EC5ZA","created_at":"2026-05-27T01:05:20.119048+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/GO7EC5ZACSWMHDG22CPSVQN4FI","json":"https://pith.science/pith/GO7EC5ZACSWMHDG22CPSVQN4FI.json","graph_json":"https://pith.science/api/pith-number/GO7EC5ZACSWMHDG22CPSVQN4FI/graph.json","events_json":"https://pith.science/api/pith-number/GO7EC5ZACSWMHDG22CPSVQN4FI/events.json","paper":"https://pith.science/paper/GO7EC5ZA"},"agent_actions":{"view_html":"https://pith.science/pith/GO7EC5ZACSWMHDG22CPSVQN4FI","download_json":"https://pith.science/pith/GO7EC5ZACSWMHDG22CPSVQN4FI.json","view_paper":"https://pith.science/paper/GO7EC5ZA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.26474&json=true","fetch_graph":"https://pith.science/api/pith-number/GO7EC5ZACSWMHDG22CPSVQN4FI/graph.json","fetch_events":"https://pith.science/api/pith-number/GO7EC5ZACSWMHDG22CPSVQN4FI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GO7EC5ZACSWMHDG22CPSVQN4FI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GO7EC5ZACSWMHDG22CPSVQN4FI/action/storage_attestation","attest_author":"https://pith.science/pith/GO7EC5ZACSWMHDG22CPSVQN4FI/action/author_attestation","sign_citation":"https://pith.science/pith/GO7EC5ZACSWMHDG22CPSVQN4FI/action/citation_signature","submit_replication":"https://pith.science/pith/GO7EC5ZACSWMHDG22CPSVQN4FI/action/replication_record"}},"created_at":"2026-05-27T01:05:20.119048+00:00","updated_at":"2026-05-27T01:05:20.119048+00:00"}