{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:VV3SF2MGZNMMVFDM6TBEFFHPUR","short_pith_number":"pith:VV3SF2MG","canonical_record":{"source":{"id":"2507.11907","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-07-16T04:46:28Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"3964fe27cc50ce443174ff11d959f29c01f30920a29814a17c86acdcd570dda7","abstract_canon_sha256":"81843122c03ec4b83b2dc65f26ff12b65e7d43d77f5ede894b9d5759f14ba84e"},"schema_version":"1.0"},"canonical_sha256":"ad7722e986cb58ca946cf4c24294efa464e941871d21e43d0761a2b650174809","source":{"kind":"arxiv","id":"2507.11907","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.11907","created_at":"2026-07-05T11:40:01Z"},{"alias_kind":"arxiv_version","alias_value":"2507.11907v2","created_at":"2026-07-05T11:40:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11907","created_at":"2026-07-05T11:40:01Z"},{"alias_kind":"pith_short_12","alias_value":"VV3SF2MGZNMM","created_at":"2026-07-05T11:40:01Z"},{"alias_kind":"pith_short_16","alias_value":"VV3SF2MGZNMMVFDM","created_at":"2026-07-05T11:40:01Z"},{"alias_kind":"pith_short_8","alias_value":"VV3SF2MG","created_at":"2026-07-05T11:40:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:VV3SF2MGZNMMVFDM6TBEFFHPUR","target":"record","payload":{"canonical_record":{"source":{"id":"2507.11907","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-07-16T04:46:28Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"3964fe27cc50ce443174ff11d959f29c01f30920a29814a17c86acdcd570dda7","abstract_canon_sha256":"81843122c03ec4b83b2dc65f26ff12b65e7d43d77f5ede894b9d5759f14ba84e"},"schema_version":"1.0"},"canonical_sha256":"ad7722e986cb58ca946cf4c24294efa464e941871d21e43d0761a2b650174809","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:40:01.452047Z","signature_b64":"U7RHfyMkL9NuRCkYv/CaQzIaMG/sjmw8lIN8mBVbt39kmSDaoVxTG0fwB1xUE4X5h96urZThJs7kDD7afT6BCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad7722e986cb58ca946cf4c24294efa464e941871d21e43d0761a2b650174809","last_reissued_at":"2026-07-05T11:40:01.451577Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:40:01.451577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.11907","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:40:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QiEEq20bkaXUMV5pcQ0o19CaJLmEauzO7KPzH4fPy7rwPF68Na/gtG8NHGHjz5oiBy+PfgF1lyRLruh5zACFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T15:47:18.262640Z"},"content_sha256":"f942a06f33c868f6e67e0e27c4171c084b743415248337cbc58c2e807954b836","schema_version":"1.0","event_id":"sha256:f942a06f33c868f6e67e0e27c4171c084b743415248337cbc58c2e807954b836"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:VV3SF2MGZNMMVFDM6TBEFFHPUR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SIEVE: Effective Filtered Vector Search with Collection of Indexes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DB","authors_text":"Jianjun Chen, Silu Huang, Wei Ding, Yongjoo Park, Zhaoheng Li","submitted_at":"2025-07-16T04:46:28Z","abstract_excerpt":"Many real-world tasks such as recommending videos with the kids tag can be reduced to finding most similar vectors associated with hard predicates. This task, filtered vector search, is challenging as prior state-of-the-art graph-based (unfiltered) similarity search techniques quickly degenerate when hard constraints are considered. That is, effective graph-based filtered similarity search relies on sufficient connectivity for reaching the most similar items within just a few hops. To consider predicates, recent works propose modifying graph traversal to visit only the items that may satisfy p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11907","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/2507.11907/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:40:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vG2NATN5I5Pw51zfCH726gkgxmd2PcGmvHQFyWG/TnQS3xAiWTlbDmoda/bBfnjnRUYbCLbummbz4D4hhWpHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T15:47:18.263144Z"},"content_sha256":"7c7addc1ca2729f49b1d327ae91b44e9f042313540fe1da677b8f1377ead2b42","schema_version":"1.0","event_id":"sha256:7c7addc1ca2729f49b1d327ae91b44e9f042313540fe1da677b8f1377ead2b42"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VV3SF2MGZNMMVFDM6TBEFFHPUR/bundle.json","state_url":"https://pith.science/pith/VV3SF2MGZNMMVFDM6TBEFFHPUR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VV3SF2MGZNMMVFDM6TBEFFHPUR/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-08T15:47:18Z","links":{"resolver":"https://pith.science/pith/VV3SF2MGZNMMVFDM6TBEFFHPUR","bundle":"https://pith.science/pith/VV3SF2MGZNMMVFDM6TBEFFHPUR/bundle.json","state":"https://pith.science/pith/VV3SF2MGZNMMVFDM6TBEFFHPUR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VV3SF2MGZNMMVFDM6TBEFFHPUR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:VV3SF2MGZNMMVFDM6TBEFFHPUR","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":"81843122c03ec4b83b2dc65f26ff12b65e7d43d77f5ede894b9d5759f14ba84e","cross_cats_sorted":["cs.IR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-07-16T04:46:28Z","title_canon_sha256":"3964fe27cc50ce443174ff11d959f29c01f30920a29814a17c86acdcd570dda7"},"schema_version":"1.0","source":{"id":"2507.11907","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.11907","created_at":"2026-07-05T11:40:01Z"},{"alias_kind":"arxiv_version","alias_value":"2507.11907v2","created_at":"2026-07-05T11:40:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11907","created_at":"2026-07-05T11:40:01Z"},{"alias_kind":"pith_short_12","alias_value":"VV3SF2MGZNMM","created_at":"2026-07-05T11:40:01Z"},{"alias_kind":"pith_short_16","alias_value":"VV3SF2MGZNMMVFDM","created_at":"2026-07-05T11:40:01Z"},{"alias_kind":"pith_short_8","alias_value":"VV3SF2MG","created_at":"2026-07-05T11:40:01Z"}],"graph_snapshots":[{"event_id":"sha256:7c7addc1ca2729f49b1d327ae91b44e9f042313540fe1da677b8f1377ead2b42","target":"graph","created_at":"2026-07-05T11:40:01Z","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/2507.11907/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many real-world tasks such as recommending videos with the kids tag can be reduced to finding most similar vectors associated with hard predicates. This task, filtered vector search, is challenging as prior state-of-the-art graph-based (unfiltered) similarity search techniques quickly degenerate when hard constraints are considered. That is, effective graph-based filtered similarity search relies on sufficient connectivity for reaching the most similar items within just a few hops. To consider predicates, recent works propose modifying graph traversal to visit only the items that may satisfy p","authors_text":"Jianjun Chen, Silu Huang, Wei Ding, Yongjoo Park, Zhaoheng Li","cross_cats":["cs.IR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-07-16T04:46:28Z","title":"SIEVE: Effective Filtered Vector Search with Collection of Indexes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11907","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:f942a06f33c868f6e67e0e27c4171c084b743415248337cbc58c2e807954b836","target":"record","created_at":"2026-07-05T11:40:01Z","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":"81843122c03ec4b83b2dc65f26ff12b65e7d43d77f5ede894b9d5759f14ba84e","cross_cats_sorted":["cs.IR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-07-16T04:46:28Z","title_canon_sha256":"3964fe27cc50ce443174ff11d959f29c01f30920a29814a17c86acdcd570dda7"},"schema_version":"1.0","source":{"id":"2507.11907","kind":"arxiv","version":2}},"canonical_sha256":"ad7722e986cb58ca946cf4c24294efa464e941871d21e43d0761a2b650174809","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad7722e986cb58ca946cf4c24294efa464e941871d21e43d0761a2b650174809","first_computed_at":"2026-07-05T11:40:01.451577Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:40:01.451577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U7RHfyMkL9NuRCkYv/CaQzIaMG/sjmw8lIN8mBVbt39kmSDaoVxTG0fwB1xUE4X5h96urZThJs7kDD7afT6BCw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:40:01.452047Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.11907","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f942a06f33c868f6e67e0e27c4171c084b743415248337cbc58c2e807954b836","sha256:7c7addc1ca2729f49b1d327ae91b44e9f042313540fe1da677b8f1377ead2b42"],"state_sha256":"b9b75222bc17501022bd9d3d7f49fc37df3838b49104c48cea5ca4a64f2cb439"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zAIy8MICFnUrwYQhlupjyH2fY99mrD5x1SDHtcllWNhvFVxPBkvSg2+YsGLUXE/45YxI/LzpoSOA+hW1wLdLCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T15:47:18.268047Z","bundle_sha256":"e8a672dfc6d96905c3b5741ff60f5199780989e29cc0b1728d71a6cfbc92cc2f"}}