{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YZGTFIGZ4N5IEZ7K3XWEM2K7M5","short_pith_number":"pith:YZGTFIGZ","schema_version":"1.0","canonical_sha256":"c64d32a0d9e37a8267eaddec46695f677e1bd1e3e802fdc301ed3c01ee287a33","source":{"kind":"arxiv","id":"2409.02571","version":1},"attestation_state":"computed","paper":{"title":"iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS","cs.IR"],"primary_cat":"cs.DB","authors_text":"Cheng Long, Christian S. Jensen, Jianyang Gao, Yuexuan Xu, Yutong Gou","submitted_at":"2024-09-04T09:41:52Z","abstract_excerpt":"Range-filtering approximate nearest neighbor (RFANN) search is attracting increasing attention in academia and industry. Given a set of data objects, each being a pair of a high-dimensional vector and a numeric value, an RFANN query with a vector and a numeric range as parameters returns the data object whose numeric value is in the query range and whose vector is nearest to the query vector. To process this query, a recent study proposes to build $O(n^2)$ dedicated graph-based indexes for all possible query ranges to enable efficient processing on a database of $n$ objects. As storing all 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":"2409.02571","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2024-09-04T09:41:52Z","cross_cats_sorted":["cs.DS","cs.IR"],"title_canon_sha256":"798784bf170cdfe11369baf63b6763b25c1b40a3814047cd13547364fbcce6ed","abstract_canon_sha256":"2e4df56ccf736919816d8015a184d11c4864d06e40786f964bf39057de50d44c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:03:07.082383Z","signature_b64":"CPVL4QY8w8iKU+4xFpBUXjo/PyGHV46F35RUikNN/OwZtNN3i2FRzWnTqb50rwE6ilK7dijjWDzlRTdW8OaRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c64d32a0d9e37a8267eaddec46695f677e1bd1e3e802fdc301ed3c01ee287a33","last_reissued_at":"2026-07-05T09:03:07.081828Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:03:07.081828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS","cs.IR"],"primary_cat":"cs.DB","authors_text":"Cheng Long, Christian S. Jensen, Jianyang Gao, Yuexuan Xu, Yutong Gou","submitted_at":"2024-09-04T09:41:52Z","abstract_excerpt":"Range-filtering approximate nearest neighbor (RFANN) search is attracting increasing attention in academia and industry. Given a set of data objects, each being a pair of a high-dimensional vector and a numeric value, an RFANN query with a vector and a numeric range as parameters returns the data object whose numeric value is in the query range and whose vector is nearest to the query vector. To process this query, a recent study proposes to build $O(n^2)$ dedicated graph-based indexes for all possible query ranges to enable efficient processing on a database of $n$ objects. As storing all the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.02571","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/2409.02571/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":"2409.02571","created_at":"2026-07-05T09:03:07.081890+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.02571v1","created_at":"2026-07-05T09:03:07.081890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.02571","created_at":"2026-07-05T09:03:07.081890+00:00"},{"alias_kind":"pith_short_12","alias_value":"YZGTFIGZ4N5I","created_at":"2026-07-05T09:03:07.081890+00:00"},{"alias_kind":"pith_short_16","alias_value":"YZGTFIGZ4N5IEZ7K","created_at":"2026-07-05T09:03:07.081890+00:00"},{"alias_kind":"pith_short_8","alias_value":"YZGTFIGZ","created_at":"2026-07-05T09:03:07.081890+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.06616","citing_title":"CubeGraph: Efficient Retrieval-Augmented Generation for Spatial and Temporal Data","ref_index":48,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YZGTFIGZ4N5IEZ7K3XWEM2K7M5","json":"https://pith.science/pith/YZGTFIGZ4N5IEZ7K3XWEM2K7M5.json","graph_json":"https://pith.science/api/pith-number/YZGTFIGZ4N5IEZ7K3XWEM2K7M5/graph.json","events_json":"https://pith.science/api/pith-number/YZGTFIGZ4N5IEZ7K3XWEM2K7M5/events.json","paper":"https://pith.science/paper/YZGTFIGZ"},"agent_actions":{"view_html":"https://pith.science/pith/YZGTFIGZ4N5IEZ7K3XWEM2K7M5","download_json":"https://pith.science/pith/YZGTFIGZ4N5IEZ7K3XWEM2K7M5.json","view_paper":"https://pith.science/paper/YZGTFIGZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.02571&json=true","fetch_graph":"https://pith.science/api/pith-number/YZGTFIGZ4N5IEZ7K3XWEM2K7M5/graph.json","fetch_events":"https://pith.science/api/pith-number/YZGTFIGZ4N5IEZ7K3XWEM2K7M5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YZGTFIGZ4N5IEZ7K3XWEM2K7M5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YZGTFIGZ4N5IEZ7K3XWEM2K7M5/action/storage_attestation","attest_author":"https://pith.science/pith/YZGTFIGZ4N5IEZ7K3XWEM2K7M5/action/author_attestation","sign_citation":"https://pith.science/pith/YZGTFIGZ4N5IEZ7K3XWEM2K7M5/action/citation_signature","submit_replication":"https://pith.science/pith/YZGTFIGZ4N5IEZ7K3XWEM2K7M5/action/replication_record"}},"created_at":"2026-07-05T09:03:07.081890+00:00","updated_at":"2026-07-05T09:03:07.081890+00:00"}