{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:B5B3FZXSHUYDIEDHBERJ2HV5VI","short_pith_number":"pith:B5B3FZXS","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"},"canonical_sha256":"0f43b2e6f23d3034106709229d1ebdaa2a72d246f02d440c23e06162b4cd1157","source":{"kind":"arxiv","id":"2502.13245","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.13245","created_at":"2026-07-05T12:07:59Z"},{"alias_kind":"arxiv_version","alias_value":"2502.13245v3","created_at":"2026-07-05T12:07:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.13245","created_at":"2026-07-05T12:07:59Z"},{"alias_kind":"pith_short_12","alias_value":"B5B3FZXSHUYD","created_at":"2026-07-05T12:07:59Z"},{"alias_kind":"pith_short_16","alias_value":"B5B3FZXSHUYDIEDH","created_at":"2026-07-05T12:07:59Z"},{"alias_kind":"pith_short_8","alias_value":"B5B3FZXS","created_at":"2026-07-05T12:07:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:B5B3FZXSHUYDIEDHBERJ2HV5VI","target":"record","payload":{"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"},"canonical_sha256":"0f43b2e6f23d3034106709229d1ebdaa2a72d246f02d440c23e06162b4cd1157","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"},"source_kind":"arxiv","source_id":"2502.13245","source_version":3,"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-05T12:07:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QCKcMo72LqQ7ZloCBodO8ZltV0Mwyg9mcWSlT+K5kOzsBAEC32rwQQER9cYvcdg5xcQap9dGrf4dBrkDTC62Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T19:02:21.385398Z"},"content_sha256":"4925f47a65520b697f98f2f5ab4224de66aa33c9fef51194b00441618556537e","schema_version":"1.0","event_id":"sha256:4925f47a65520b697f98f2f5ab4224de66aa33c9fef51194b00441618556537e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:B5B3FZXSHUYDIEDHBERJ2HV5VI","target":"graph","payload":{"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"},"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-05T12:07:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DwhcNrEMnCH+0WBOqFNIijhWn0B6D7pT8Rw7GyJ8TI9NguGEcieFNTu9P65uUNn7f39rmyhxSQ07MSm/UkyfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T19:02:21.385773Z"},"content_sha256":"b5935b42bb5e709d9a461c7662caaf04b51ea2d8cc23b66b78dffe61ad44e466","schema_version":"1.0","event_id":"sha256:b5935b42bb5e709d9a461c7662caaf04b51ea2d8cc23b66b78dffe61ad44e466"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B5B3FZXSHUYDIEDHBERJ2HV5VI/bundle.json","state_url":"https://pith.science/pith/B5B3FZXSHUYDIEDHBERJ2HV5VI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B5B3FZXSHUYDIEDHBERJ2HV5VI/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-07-06T19:02:21Z","links":{"resolver":"https://pith.science/pith/B5B3FZXSHUYDIEDHBERJ2HV5VI","bundle":"https://pith.science/pith/B5B3FZXSHUYDIEDHBERJ2HV5VI/bundle.json","state":"https://pith.science/pith/B5B3FZXSHUYDIEDHBERJ2HV5VI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B5B3FZXSHUYDIEDHBERJ2HV5VI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:B5B3FZXSHUYDIEDHBERJ2HV5VI","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":"665f63d4ae06fed47d7f6ad96f628ea4eae79453b221a1d29b0e1d38dcf43a96","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-02-18T19:18:01Z","title_canon_sha256":"a66d861a5938a977bce5bc253d63c4ddd23b6558277b940527d58390617f32db"},"schema_version":"1.0","source":{"id":"2502.13245","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.13245","created_at":"2026-07-05T12:07:59Z"},{"alias_kind":"arxiv_version","alias_value":"2502.13245v3","created_at":"2026-07-05T12:07:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.13245","created_at":"2026-07-05T12:07:59Z"},{"alias_kind":"pith_short_12","alias_value":"B5B3FZXSHUYD","created_at":"2026-07-05T12:07:59Z"},{"alias_kind":"pith_short_16","alias_value":"B5B3FZXSHUYDIEDH","created_at":"2026-07-05T12:07:59Z"},{"alias_kind":"pith_short_8","alias_value":"B5B3FZXS","created_at":"2026-07-05T12:07:59Z"}],"graph_snapshots":[{"event_id":"sha256:b5935b42bb5e709d9a461c7662caaf04b51ea2d8cc23b66b78dffe61ad44e466","target":"graph","created_at":"2026-07-05T12:07:59Z","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/2502.13245/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Guy E. Blelloch, Magdalen Dobson Manohar, Taekseung Kim","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-02-18T19:18:01Z","title":"Range Retrieval with Graph-Based Indices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.13245","kind":"arxiv","version":3},"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:4925f47a65520b697f98f2f5ab4224de66aa33c9fef51194b00441618556537e","target":"record","created_at":"2026-07-05T12:07:59Z","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":"665f63d4ae06fed47d7f6ad96f628ea4eae79453b221a1d29b0e1d38dcf43a96","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-02-18T19:18:01Z","title_canon_sha256":"a66d861a5938a977bce5bc253d63c4ddd23b6558277b940527d58390617f32db"},"schema_version":"1.0","source":{"id":"2502.13245","kind":"arxiv","version":3}},"canonical_sha256":"0f43b2e6f23d3034106709229d1ebdaa2a72d246f02d440c23e06162b4cd1157","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f43b2e6f23d3034106709229d1ebdaa2a72d246f02d440c23e06162b4cd1157","first_computed_at":"2026-07-05T12:07:59.028337Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:07:59.028337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C+meKZt8jbsuf8Ev6NB5K01XPAimjpszpu7nnf2TLgMvZFlUlSol9cYeZ7NIXaK3kztWPZIbTy1bmi7/Sgs7AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T12:07:59.028883Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.13245","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4925f47a65520b697f98f2f5ab4224de66aa33c9fef51194b00441618556537e","sha256:b5935b42bb5e709d9a461c7662caaf04b51ea2d8cc23b66b78dffe61ad44e466"],"state_sha256":"edeb844ba160f60f3cbe096d8f45b41807c744a2f2f21a466d2ac52e8634aa17"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lQwkqc7+i6CmOHv5D/PonsAVaqjW8Qj/ibV/BcPzG/VkYp8pLDqB0sgSCQO+WpsSGePDis4OorED7qmPmXstAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T19:02:21.387705Z","bundle_sha256":"c757c6583cedb36438829325e0cc6e01314d16b7e39f83958b7cec0df85d221a"}}