{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:OJYE5MUKTJXGP346S6XVQ5UUP2","short_pith_number":"pith:OJYE5MUK","canonical_record":{"source":{"id":"2412.02448","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-03T13:32:11Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"fd38de637f6eb2b57b064447c5689851944a436b9c3c1e5edc8603bdc1e827bc","abstract_canon_sha256":"7c263f118e7e30cf456485ff8003ddd04838b673c81eb2358f67e6245ed10de7"},"schema_version":"1.0"},"canonical_sha256":"72704eb28a9a6e67ef9e97af5876947ea375ef4c2ec4130aa6c4dea74aff9a62","source":{"kind":"arxiv","id":"2412.02448","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.02448","created_at":"2026-07-05T11:22:34Z"},{"alias_kind":"arxiv_version","alias_value":"2412.02448v2","created_at":"2026-07-05T11:22:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.02448","created_at":"2026-07-05T11:22:34Z"},{"alias_kind":"pith_short_12","alias_value":"OJYE5MUKTJXG","created_at":"2026-07-05T11:22:34Z"},{"alias_kind":"pith_short_16","alias_value":"OJYE5MUKTJXGP346","created_at":"2026-07-05T11:22:34Z"},{"alias_kind":"pith_short_8","alias_value":"OJYE5MUK","created_at":"2026-07-05T11:22:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:OJYE5MUKTJXGP346S6XVQ5UUP2","target":"record","payload":{"canonical_record":{"source":{"id":"2412.02448","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-03T13:32:11Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"fd38de637f6eb2b57b064447c5689851944a436b9c3c1e5edc8603bdc1e827bc","abstract_canon_sha256":"7c263f118e7e30cf456485ff8003ddd04838b673c81eb2358f67e6245ed10de7"},"schema_version":"1.0"},"canonical_sha256":"72704eb28a9a6e67ef9e97af5876947ea375ef4c2ec4130aa6c4dea74aff9a62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:22:34.375877Z","signature_b64":"oPcWKyhvIGbUnTct7bypjzmA9BbCpQ2Sfg8JIYP+HeCoUi8xIDM+Me5Tmcu1NsKNk6GoJ/S6x12kzmd2OhS3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72704eb28a9a6e67ef9e97af5876947ea375ef4c2ec4130aa6c4dea74aff9a62","last_reissued_at":"2026-07-05T11:22:34.375365Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:22:34.375365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.02448","source_version":2,"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-05T11:22:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kly7dBVSaVz8iacDMA3ajnW29r7FTeruwwt9x3iLft+/0ksansqx4pJZv59Jn2CQjzG+UulkjDKS1Lw2z4EBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T09:47:06.119478Z"},"content_sha256":"5ead115619b7d78147b8195d2d358696dd9d35c6d7834d6b26f5994f0566ac02","schema_version":"1.0","event_id":"sha256:5ead115619b7d78147b8195d2d358696dd9d35c6d7834d6b26f5994f0566ac02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:OJYE5MUKTJXGP346S6XVQ5UUP2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Anqi Liang, Bin Yao, Guangxu Cheng, Pengcheng Zhang, Yitong Song, Zhongpu Chen","submitted_at":"2024-12-03T13:32:11Z","abstract_excerpt":"This paper presents an efficient and scalable framework for Range Filtered Approximate Nearest Neighbors Search (RF-ANNS) over high-dimensional vectors associated with attribute values. Given a query vector $q$ and a range $[l, h]$, RF-ANNS aims to find the approximate $k$ nearest neighbors of $q$ among data whose attribute values fall within $[l, h]$. Existing methods including pre-, post-, and hybrid filtering strategies that perform attribute range filtering before, after, or during the ANNS process, all suffer from significant performance degradation when query ranges shift. Though buildin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.02448","kind":"arxiv","version":2},"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/2412.02448/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-05T11:22:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lPKh+u5OXhadx0PU7zHghhAf7cD502bS+sxmm9wLTUZ3EVbVKJZ7OAIz4VpN6RAAEBxxhoIU/7ngo4+aqf8RCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T09:47:06.120495Z"},"content_sha256":"3803ed171d73f66ac586eb976c7b97da37441995566ede99b7b376bb4869d2fa","schema_version":"1.0","event_id":"sha256:3803ed171d73f66ac586eb976c7b97da37441995566ede99b7b376bb4869d2fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OJYE5MUKTJXGP346S6XVQ5UUP2/bundle.json","state_url":"https://pith.science/pith/OJYE5MUKTJXGP346S6XVQ5UUP2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OJYE5MUKTJXGP346S6XVQ5UUP2/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-17T09:47:06Z","links":{"resolver":"https://pith.science/pith/OJYE5MUKTJXGP346S6XVQ5UUP2","bundle":"https://pith.science/pith/OJYE5MUKTJXGP346S6XVQ5UUP2/bundle.json","state":"https://pith.science/pith/OJYE5MUKTJXGP346S6XVQ5UUP2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OJYE5MUKTJXGP346S6XVQ5UUP2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:OJYE5MUKTJXGP346S6XVQ5UUP2","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":"7c263f118e7e30cf456485ff8003ddd04838b673c81eb2358f67e6245ed10de7","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-03T13:32:11Z","title_canon_sha256":"fd38de637f6eb2b57b064447c5689851944a436b9c3c1e5edc8603bdc1e827bc"},"schema_version":"1.0","source":{"id":"2412.02448","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.02448","created_at":"2026-07-05T11:22:34Z"},{"alias_kind":"arxiv_version","alias_value":"2412.02448v2","created_at":"2026-07-05T11:22:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.02448","created_at":"2026-07-05T11:22:34Z"},{"alias_kind":"pith_short_12","alias_value":"OJYE5MUKTJXG","created_at":"2026-07-05T11:22:34Z"},{"alias_kind":"pith_short_16","alias_value":"OJYE5MUKTJXGP346","created_at":"2026-07-05T11:22:34Z"},{"alias_kind":"pith_short_8","alias_value":"OJYE5MUK","created_at":"2026-07-05T11:22:34Z"}],"graph_snapshots":[{"event_id":"sha256:3803ed171d73f66ac586eb976c7b97da37441995566ede99b7b376bb4869d2fa","target":"graph","created_at":"2026-07-05T11:22:34Z","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/2412.02448/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents an efficient and scalable framework for Range Filtered Approximate Nearest Neighbors Search (RF-ANNS) over high-dimensional vectors associated with attribute values. Given a query vector $q$ and a range $[l, h]$, RF-ANNS aims to find the approximate $k$ nearest neighbors of $q$ among data whose attribute values fall within $[l, h]$. Existing methods including pre-, post-, and hybrid filtering strategies that perform attribute range filtering before, after, or during the ANNS process, all suffer from significant performance degradation when query ranges shift. Though buildin","authors_text":"Anqi Liang, Bin Yao, Guangxu Cheng, Pengcheng Zhang, Yitong Song, Zhongpu Chen","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-03T13:32:11Z","title":"UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.02448","kind":"arxiv","version":2},"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:5ead115619b7d78147b8195d2d358696dd9d35c6d7834d6b26f5994f0566ac02","target":"record","created_at":"2026-07-05T11:22:34Z","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":"7c263f118e7e30cf456485ff8003ddd04838b673c81eb2358f67e6245ed10de7","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-03T13:32:11Z","title_canon_sha256":"fd38de637f6eb2b57b064447c5689851944a436b9c3c1e5edc8603bdc1e827bc"},"schema_version":"1.0","source":{"id":"2412.02448","kind":"arxiv","version":2}},"canonical_sha256":"72704eb28a9a6e67ef9e97af5876947ea375ef4c2ec4130aa6c4dea74aff9a62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72704eb28a9a6e67ef9e97af5876947ea375ef4c2ec4130aa6c4dea74aff9a62","first_computed_at":"2026-07-05T11:22:34.375365Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:22:34.375365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oPcWKyhvIGbUnTct7bypjzmA9BbCpQ2Sfg8JIYP+HeCoUi8xIDM+Me5Tmcu1NsKNk6GoJ/S6x12kzmd2OhS3Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:22:34.375877Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.02448","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ead115619b7d78147b8195d2d358696dd9d35c6d7834d6b26f5994f0566ac02","sha256:3803ed171d73f66ac586eb976c7b97da37441995566ede99b7b376bb4869d2fa"],"state_sha256":"89508f15557ee1ce0c0fb783ef5c216fbc1cb763e2efdb23afd8431a77b95677"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xddfxPSMikqFGWSSyUOKlrk0UTjc6A7JPnrOXdGkaHBgv7/15v67n7ilPtS2AeSDUaJ4+76wWxV0AIfL3RqwCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T09:47:06.126656Z","bundle_sha256":"445c587cdc166a25f335cab2b243d2637ecc61793ba509527594ccd0da667772"}}