{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:R2NN7KN2CFGCQDR6PEWPN2SRVF","short_pith_number":"pith:R2NN7KN2","schema_version":"1.0","canonical_sha256":"8e9adfa9ba114c280e3e792cf6ea51a96925d7a38470019f798834ed21d41bdf","source":{"kind":"arxiv","id":"2504.04018","version":1},"attestation_state":"computed","paper":{"title":"ESG: Elastic Graphs for Range-Filtering Approximate k-Nearest Neighbor Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Chuan Xiao, Mingyu Yang, Wei Wang, Wentao Li, Zhitao Shen","submitted_at":"2025-04-05T01:50:09Z","abstract_excerpt":"Range-filtering approximate $k$-nearest neighbor (RFAKNN) search takes as input a vector and a numeric value, returning $k$ points from a database of $N$ high-dimensional points. The returned points must satisfy two criteria: their numeric values must lie within the specified query range, and they must be approximately the $k$ nearest points to the query vector. To strike a better balance between query accuracy and efficiency, we propose novel methods that relax the strict requirement for subranges to \\textit{exactly} match the query range. This elastic relaxation is based on a theoretical ins"},"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":"2504.04018","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-04-05T01:50:09Z","cross_cats_sorted":[],"title_canon_sha256":"4ba314bea3fa80af9cd9111f80897e37e07b7f85b7b798ec56e84f686704fd7d","abstract_canon_sha256":"3822d1c87ec69ae0aeaf0c9dc520de86de003af19d5607d81d5694c6dd1f9b58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:44:52.701216Z","signature_b64":"2SzX4/RqRMICGYSp6SsypsExGDs+1n0tRz5INwleW/pss4/G/2FXr8bq+eXk9Bpxn/yuk25DsgIgtzAKfNxIDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e9adfa9ba114c280e3e792cf6ea51a96925d7a38470019f798834ed21d41bdf","last_reissued_at":"2026-07-05T10:44:52.700740Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:44:52.700740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ESG: Elastic Graphs for Range-Filtering Approximate k-Nearest Neighbor Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Chuan Xiao, Mingyu Yang, Wei Wang, Wentao Li, Zhitao Shen","submitted_at":"2025-04-05T01:50:09Z","abstract_excerpt":"Range-filtering approximate $k$-nearest neighbor (RFAKNN) search takes as input a vector and a numeric value, returning $k$ points from a database of $N$ high-dimensional points. The returned points must satisfy two criteria: their numeric values must lie within the specified query range, and they must be approximately the $k$ nearest points to the query vector. To strike a better balance between query accuracy and efficiency, we propose novel methods that relax the strict requirement for subranges to \\textit{exactly} match the query range. This elastic relaxation is based on a theoretical ins"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.04018","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/2504.04018/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":"2504.04018","created_at":"2026-07-05T10:44:52.700809+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.04018v1","created_at":"2026-07-05T10:44:52.700809+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.04018","created_at":"2026-07-05T10:44:52.700809+00:00"},{"alias_kind":"pith_short_12","alias_value":"R2NN7KN2CFGC","created_at":"2026-07-05T10:44:52.700809+00:00"},{"alias_kind":"pith_short_16","alias_value":"R2NN7KN2CFGCQDR6","created_at":"2026-07-05T10:44:52.700809+00:00"},{"alias_kind":"pith_short_8","alias_value":"R2NN7KN2","created_at":"2026-07-05T10:44:52.700809+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.00734","citing_title":"EMA: Approximate Nearest Neighbor Search with General Attribute Filtering and Dynamic Updates","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06616","citing_title":"CubeGraph: Efficient Retrieval-Augmented Generation for Spatial and Temporal Data","ref_index":51,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R2NN7KN2CFGCQDR6PEWPN2SRVF","json":"https://pith.science/pith/R2NN7KN2CFGCQDR6PEWPN2SRVF.json","graph_json":"https://pith.science/api/pith-number/R2NN7KN2CFGCQDR6PEWPN2SRVF/graph.json","events_json":"https://pith.science/api/pith-number/R2NN7KN2CFGCQDR6PEWPN2SRVF/events.json","paper":"https://pith.science/paper/R2NN7KN2"},"agent_actions":{"view_html":"https://pith.science/pith/R2NN7KN2CFGCQDR6PEWPN2SRVF","download_json":"https://pith.science/pith/R2NN7KN2CFGCQDR6PEWPN2SRVF.json","view_paper":"https://pith.science/paper/R2NN7KN2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.04018&json=true","fetch_graph":"https://pith.science/api/pith-number/R2NN7KN2CFGCQDR6PEWPN2SRVF/graph.json","fetch_events":"https://pith.science/api/pith-number/R2NN7KN2CFGCQDR6PEWPN2SRVF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R2NN7KN2CFGCQDR6PEWPN2SRVF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R2NN7KN2CFGCQDR6PEWPN2SRVF/action/storage_attestation","attest_author":"https://pith.science/pith/R2NN7KN2CFGCQDR6PEWPN2SRVF/action/author_attestation","sign_citation":"https://pith.science/pith/R2NN7KN2CFGCQDR6PEWPN2SRVF/action/citation_signature","submit_replication":"https://pith.science/pith/R2NN7KN2CFGCQDR6PEWPN2SRVF/action/replication_record"}},"created_at":"2026-07-05T10:44:52.700809+00:00","updated_at":"2026-07-05T10:44:52.700809+00:00"}