{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SJAUZKO4I3Y6YVD57YWNMETFMA","short_pith_number":"pith:SJAUZKO4","canonical_record":{"source":{"id":"2607.00727","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-07-01T10:12:45Z","cross_cats_sorted":[],"title_canon_sha256":"45ee3daea8d09eb0fc6bc03605d9420f8cb192130e7ad2d04c017db1733776a9","abstract_canon_sha256":"9977aa278fab3bd3a88e543f3289b99a96c55e018adab05632f97a08c7536fda"},"schema_version":"1.0"},"canonical_sha256":"92414ca9dc46f1ec547dfe2cd6126560129b187e270c16473de779c0d3dcd2c8","source":{"kind":"arxiv","id":"2607.00727","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00727","created_at":"2026-07-02T01:17:52Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00727v1","created_at":"2026-07-02T01:17:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00727","created_at":"2026-07-02T01:17:52Z"},{"alias_kind":"pith_short_12","alias_value":"SJAUZKO4I3Y6","created_at":"2026-07-02T01:17:52Z"},{"alias_kind":"pith_short_16","alias_value":"SJAUZKO4I3Y6YVD5","created_at":"2026-07-02T01:17:52Z"},{"alias_kind":"pith_short_8","alias_value":"SJAUZKO4","created_at":"2026-07-02T01:17:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SJAUZKO4I3Y6YVD57YWNMETFMA","target":"record","payload":{"canonical_record":{"source":{"id":"2607.00727","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-07-01T10:12:45Z","cross_cats_sorted":[],"title_canon_sha256":"45ee3daea8d09eb0fc6bc03605d9420f8cb192130e7ad2d04c017db1733776a9","abstract_canon_sha256":"9977aa278fab3bd3a88e543f3289b99a96c55e018adab05632f97a08c7536fda"},"schema_version":"1.0"},"canonical_sha256":"92414ca9dc46f1ec547dfe2cd6126560129b187e270c16473de779c0d3dcd2c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T01:17:52.789468Z","signature_b64":"PjKiQj4yrRpbrLt28hKYdormLP6dCIA8o2DLfW6/w0xDM3witKtqfrySP6Dpt8ZF+Zb/Vd6rslPey8WOm+jpDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92414ca9dc46f1ec547dfe2cd6126560129b187e270c16473de779c0d3dcd2c8","last_reissued_at":"2026-07-02T01:17:52.788925Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T01:17:52.788925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.00727","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-02T01:17:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hgd5Ay+Jp2NjblCCZr5P3MabysHnmH7EFDpFP6gMdGPYD3Wg4s3DOI66tJa1EZw5kLG4CdMU2CV7qakjH9uXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T23:49:39.673640Z"},"content_sha256":"51732984a6a3875c61b8319e47fdd2d61e342acca7cafd0270605596e3bf3a77","schema_version":"1.0","event_id":"sha256:51732984a6a3875c61b8319e47fdd2d61e342acca7cafd0270605596e3bf3a77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SJAUZKO4I3Y6YVD57YWNMETFMA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Nearest Neighbor Search with Graph Range Filters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Qian Tao, Yongxin Tong, Yuntao Jiang, Yu Sun","submitted_at":"2026-07-01T10:12:45Z","abstract_excerpt":"Vector databases have become a fundamental component for high-dimensional vector retrieval in artificial intelligence applications. Recent research has focused on filtered approximate nearest neighbor search (filtered ANN), which involves retrieving the nearest vectors that satisfy a given attribute-based filter. However, existing filters are generally limited to numerical range constraints or categorical existence checks, which restricts their applicability in more complex, real-world scenarios. In this paper, we investigate filtered ANN using graph range filters, where the retrieved vectors "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00727","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/2607.00727/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-02T01:17:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+I64lKzkIhf1qWoKCRGVtYAscNMn54qNAhtpt29YPt5zrqO8BxAd6JcNq3Uri2pRwdGafkxO6Ansf0S/TR1zCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T23:49:39.674609Z"},"content_sha256":"83f110fd0115db9f0eaca40875e48847e291d93b5847b4eb86832f9df42124c9","schema_version":"1.0","event_id":"sha256:83f110fd0115db9f0eaca40875e48847e291d93b5847b4eb86832f9df42124c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SJAUZKO4I3Y6YVD57YWNMETFMA/bundle.json","state_url":"https://pith.science/pith/SJAUZKO4I3Y6YVD57YWNMETFMA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SJAUZKO4I3Y6YVD57YWNMETFMA/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-17T23:49:39Z","links":{"resolver":"https://pith.science/pith/SJAUZKO4I3Y6YVD57YWNMETFMA","bundle":"https://pith.science/pith/SJAUZKO4I3Y6YVD57YWNMETFMA/bundle.json","state":"https://pith.science/pith/SJAUZKO4I3Y6YVD57YWNMETFMA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SJAUZKO4I3Y6YVD57YWNMETFMA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SJAUZKO4I3Y6YVD57YWNMETFMA","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":"9977aa278fab3bd3a88e543f3289b99a96c55e018adab05632f97a08c7536fda","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-07-01T10:12:45Z","title_canon_sha256":"45ee3daea8d09eb0fc6bc03605d9420f8cb192130e7ad2d04c017db1733776a9"},"schema_version":"1.0","source":{"id":"2607.00727","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00727","created_at":"2026-07-02T01:17:52Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00727v1","created_at":"2026-07-02T01:17:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00727","created_at":"2026-07-02T01:17:52Z"},{"alias_kind":"pith_short_12","alias_value":"SJAUZKO4I3Y6","created_at":"2026-07-02T01:17:52Z"},{"alias_kind":"pith_short_16","alias_value":"SJAUZKO4I3Y6YVD5","created_at":"2026-07-02T01:17:52Z"},{"alias_kind":"pith_short_8","alias_value":"SJAUZKO4","created_at":"2026-07-02T01:17:52Z"}],"graph_snapshots":[{"event_id":"sha256:83f110fd0115db9f0eaca40875e48847e291d93b5847b4eb86832f9df42124c9","target":"graph","created_at":"2026-07-02T01:17: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/2607.00727/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Vector databases have become a fundamental component for high-dimensional vector retrieval in artificial intelligence applications. Recent research has focused on filtered approximate nearest neighbor search (filtered ANN), which involves retrieving the nearest vectors that satisfy a given attribute-based filter. However, existing filters are generally limited to numerical range constraints or categorical existence checks, which restricts their applicability in more complex, real-world scenarios. In this paper, we investigate filtered ANN using graph range filters, where the retrieved vectors ","authors_text":"Qian Tao, Yongxin Tong, Yuntao Jiang, Yu Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-07-01T10:12:45Z","title":"Approximate Nearest Neighbor Search with Graph Range Filters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00727","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:51732984a6a3875c61b8319e47fdd2d61e342acca7cafd0270605596e3bf3a77","target":"record","created_at":"2026-07-02T01:17: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":"9977aa278fab3bd3a88e543f3289b99a96c55e018adab05632f97a08c7536fda","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-07-01T10:12:45Z","title_canon_sha256":"45ee3daea8d09eb0fc6bc03605d9420f8cb192130e7ad2d04c017db1733776a9"},"schema_version":"1.0","source":{"id":"2607.00727","kind":"arxiv","version":1}},"canonical_sha256":"92414ca9dc46f1ec547dfe2cd6126560129b187e270c16473de779c0d3dcd2c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92414ca9dc46f1ec547dfe2cd6126560129b187e270c16473de779c0d3dcd2c8","first_computed_at":"2026-07-02T01:17:52.788925Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-02T01:17:52.788925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PjKiQj4yrRpbrLt28hKYdormLP6dCIA8o2DLfW6/w0xDM3witKtqfrySP6Dpt8ZF+Zb/Vd6rslPey8WOm+jpDg==","signature_status":"signed_v1","signed_at":"2026-07-02T01:17:52.789468Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.00727","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51732984a6a3875c61b8319e47fdd2d61e342acca7cafd0270605596e3bf3a77","sha256:83f110fd0115db9f0eaca40875e48847e291d93b5847b4eb86832f9df42124c9"],"state_sha256":"bc88254d9a5dcfad4dc1aea8717848ff55492f30900973bbac088081c70543af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ffE5+M336xv5BZI2nPY/eZeaBKs7Tp3bOpN1Ki0ET58PxteK1aFXgoC+yOHQR5ooVoR3FddYScedVU4+GOyyAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T23:49:39.682034Z","bundle_sha256":"e8b0719d00b48b7de73a462160493a460ce185f2c5ae19a1e08a4bac547d48ff"}}