{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:R2NN7KN2CFGCQDR6PEWPN2SRVF","short_pith_number":"pith:R2NN7KN2","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"},"canonical_sha256":"8e9adfa9ba114c280e3e792cf6ea51a96925d7a38470019f798834ed21d41bdf","source":{"kind":"arxiv","id":"2504.04018","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.04018","created_at":"2026-07-05T10:44:52Z"},{"alias_kind":"arxiv_version","alias_value":"2504.04018v1","created_at":"2026-07-05T10:44:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.04018","created_at":"2026-07-05T10:44:52Z"},{"alias_kind":"pith_short_12","alias_value":"R2NN7KN2CFGC","created_at":"2026-07-05T10:44:52Z"},{"alias_kind":"pith_short_16","alias_value":"R2NN7KN2CFGCQDR6","created_at":"2026-07-05T10:44:52Z"},{"alias_kind":"pith_short_8","alias_value":"R2NN7KN2","created_at":"2026-07-05T10:44:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:R2NN7KN2CFGCQDR6PEWPN2SRVF","target":"record","payload":{"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"},"canonical_sha256":"8e9adfa9ba114c280e3e792cf6ea51a96925d7a38470019f798834ed21d41bdf","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"},"source_kind":"arxiv","source_id":"2504.04018","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:44:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dXs2+mmb8e8HAtnNXWcC9OtX+wX/hlfVlFb8EqQy+wE84D+NVM1xoHrinkL9EuPOB/PTYxTnT70wd4L4LA3kDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T19:26:24.004536Z"},"content_sha256":"7d2ffd36f3cc2bb54225c9e06c920f8c521cf3d4290c6ecfde5dea4706b1f79b","schema_version":"1.0","event_id":"sha256:7d2ffd36f3cc2bb54225c9e06c920f8c521cf3d4290c6ecfde5dea4706b1f79b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:R2NN7KN2CFGCQDR6PEWPN2SRVF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:44:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qm5U0/quZz+IJBmj8X8R4V1HfjltyL/zgUU3JDQPuJQCNgNmbWPcT4OisnJET3oIMOS7RwZpZ5ZyInRAxL3uCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T19:26:24.005467Z"},"content_sha256":"2fb712033901ee5e6da947f745399fc9d015f07a939d67d45e86ebf9cf93bb08","schema_version":"1.0","event_id":"sha256:2fb712033901ee5e6da947f745399fc9d015f07a939d67d45e86ebf9cf93bb08"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R2NN7KN2CFGCQDR6PEWPN2SRVF/bundle.json","state_url":"https://pith.science/pith/R2NN7KN2CFGCQDR6PEWPN2SRVF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R2NN7KN2CFGCQDR6PEWPN2SRVF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-12T19:26:24Z","links":{"resolver":"https://pith.science/pith/R2NN7KN2CFGCQDR6PEWPN2SRVF","bundle":"https://pith.science/pith/R2NN7KN2CFGCQDR6PEWPN2SRVF/bundle.json","state":"https://pith.science/pith/R2NN7KN2CFGCQDR6PEWPN2SRVF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R2NN7KN2CFGCQDR6PEWPN2SRVF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:R2NN7KN2CFGCQDR6PEWPN2SRVF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3822d1c87ec69ae0aeaf0c9dc520de86de003af19d5607d81d5694c6dd1f9b58","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-04-05T01:50:09Z","title_canon_sha256":"4ba314bea3fa80af9cd9111f80897e37e07b7f85b7b798ec56e84f686704fd7d"},"schema_version":"1.0","source":{"id":"2504.04018","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.04018","created_at":"2026-07-05T10:44:52Z"},{"alias_kind":"arxiv_version","alias_value":"2504.04018v1","created_at":"2026-07-05T10:44:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.04018","created_at":"2026-07-05T10:44:52Z"},{"alias_kind":"pith_short_12","alias_value":"R2NN7KN2CFGC","created_at":"2026-07-05T10:44:52Z"},{"alias_kind":"pith_short_16","alias_value":"R2NN7KN2CFGCQDR6","created_at":"2026-07-05T10:44:52Z"},{"alias_kind":"pith_short_8","alias_value":"R2NN7KN2","created_at":"2026-07-05T10:44:52Z"}],"graph_snapshots":[{"event_id":"sha256:2fb712033901ee5e6da947f745399fc9d015f07a939d67d45e86ebf9cf93bb08","target":"graph","created_at":"2026-07-05T10:44:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2504.04018/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chuan Xiao, Mingyu Yang, Wei Wang, Wentao Li, Zhitao Shen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-04-05T01:50:09Z","title":"ESG: Elastic Graphs for Range-Filtering Approximate k-Nearest Neighbor Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.04018","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7d2ffd36f3cc2bb54225c9e06c920f8c521cf3d4290c6ecfde5dea4706b1f79b","target":"record","created_at":"2026-07-05T10:44:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3822d1c87ec69ae0aeaf0c9dc520de86de003af19d5607d81d5694c6dd1f9b58","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-04-05T01:50:09Z","title_canon_sha256":"4ba314bea3fa80af9cd9111f80897e37e07b7f85b7b798ec56e84f686704fd7d"},"schema_version":"1.0","source":{"id":"2504.04018","kind":"arxiv","version":1}},"canonical_sha256":"8e9adfa9ba114c280e3e792cf6ea51a96925d7a38470019f798834ed21d41bdf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e9adfa9ba114c280e3e792cf6ea51a96925d7a38470019f798834ed21d41bdf","first_computed_at":"2026-07-05T10:44:52.700740Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:44:52.700740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2SzX4/RqRMICGYSp6SsypsExGDs+1n0tRz5INwleW/pss4/G/2FXr8bq+eXk9Bpxn/yuk25DsgIgtzAKfNxIDA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:44:52.701216Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.04018","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d2ffd36f3cc2bb54225c9e06c920f8c521cf3d4290c6ecfde5dea4706b1f79b","sha256:2fb712033901ee5e6da947f745399fc9d015f07a939d67d45e86ebf9cf93bb08"],"state_sha256":"d4d78e9f512012b19a2c5c7ec1bbdfd116843905f7a5b986b937c2de4898ec07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ymnwEBsBX7nQXwhSqD6jEl782wMjWmdQAxdZlXJPGGXJtnwY66l+bjxCAQIpUG+qCBpOVnvM4CHGK5UuQgCpCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T19:26:24.018646Z","bundle_sha256":"d76b35bb18b4437b9af3c9f08251d9eb598ceb1f6adf65272a1ab20af8e5caec"}}