{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GQFYDKMLXSAVR3WZOO6SVLR2U5","short_pith_number":"pith:GQFYDKML","canonical_record":{"source":{"id":"2602.06721","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2026-02-06T14:14:00Z","cross_cats_sorted":[],"title_canon_sha256":"1afb2d1273ea52d14d1854ec79fde3bf3e5d4c84498ba598ea4df1888c9c679b","abstract_canon_sha256":"07399471233a4162e3b81875dc41bade0db4c7a12ea5384ae30fb7484a1ffd40"},"schema_version":"1.0"},"canonical_sha256":"340b81a98bbc8158eed973bd2aae3aa74baa7beb007a9cfa445c2e18b93bb3d3","source":{"kind":"arxiv","id":"2602.06721","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.06721","created_at":"2026-05-29T01:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"2602.06721v2","created_at":"2026-05-29T01:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.06721","created_at":"2026-05-29T01:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"GQFYDKMLXSAV","created_at":"2026-05-29T01:05:03Z"},{"alias_kind":"pith_short_16","alias_value":"GQFYDKMLXSAVR3WZ","created_at":"2026-05-29T01:05:03Z"},{"alias_kind":"pith_short_8","alias_value":"GQFYDKML","created_at":"2026-05-29T01:05:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GQFYDKMLXSAVR3WZOO6SVLR2U5","target":"record","payload":{"canonical_record":{"source":{"id":"2602.06721","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2026-02-06T14:14:00Z","cross_cats_sorted":[],"title_canon_sha256":"1afb2d1273ea52d14d1854ec79fde3bf3e5d4c84498ba598ea4df1888c9c679b","abstract_canon_sha256":"07399471233a4162e3b81875dc41bade0db4c7a12ea5384ae30fb7484a1ffd40"},"schema_version":"1.0"},"canonical_sha256":"340b81a98bbc8158eed973bd2aae3aa74baa7beb007a9cfa445c2e18b93bb3d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T01:05:03.867451Z","signature_b64":"yGZvzA8WENpv0FGigmKi59KEajQGTXS0zzOMWBw4hGKKVYqgeUN9j1JIRSB9M/YqHKD3pQrgNuAULORSMQ+eBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"340b81a98bbc8158eed973bd2aae3aa74baa7beb007a9cfa445c2e18b93bb3d3","last_reissued_at":"2026-05-29T01:05:03.866405Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T01:05:03.866405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2602.06721","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-05-29T01:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ERQa92M1F/TFsQcHI19PcYzYljVxHGFi11gZuLzSJDF+3PqzNBRrKRekoS3eMODTclkLoGVbI7xFUOKRpc3XBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T14:44:16.699017Z"},"content_sha256":"e93c9c17e7340070ea081e14577ad60a3d77bf76830b273523e60d7e82112c90","schema_version":"1.0","event_id":"sha256:e93c9c17e7340070ea081e14577ad60a3d77bf76830b273523e60d7e82112c90"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GQFYDKMLXSAVR3WZOO6SVLR2U5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"E2E: Efficient Filtered AKNN Search via Adaptive Termination","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Mingyu Yang, Wei Wang, Wentao Li, Wenxuan Xia","submitted_at":"2026-02-06T14:14:00Z","abstract_excerpt":"Approximate k-Nearest Neighbor (AKNN) search is widely used in vector databases. When vectors carry additional attributes (e.g., labels or numerical values), filtered AKNN search retrieves the nearest vectors to a query vector under attribute constraints. Most existing methods use a fixed termination condition, searching the entire index while respecting attribute filters. However, this leads to substantial redundant computations, since different queries require different amounts of search effort, and thus misses early termination opportunities for easy queries. This paper proposes a lightweig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.06721","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/2602.06721/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-05-29T01:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OswCFLHvjkQoCqan6R//Vm7lTi9fqeY8aL8X+3wIJ59Wshw5ltrm4jiTqLQLjt1NlHjeR7iHJCEgwl16DBtqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T14:44:16.699690Z"},"content_sha256":"7df3622f55b918edd48c86ca12959b1ebb3b297bccb6f97f62e33a59bebc02d5","schema_version":"1.0","event_id":"sha256:7df3622f55b918edd48c86ca12959b1ebb3b297bccb6f97f62e33a59bebc02d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GQFYDKMLXSAVR3WZOO6SVLR2U5/bundle.json","state_url":"https://pith.science/pith/GQFYDKMLXSAVR3WZOO6SVLR2U5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GQFYDKMLXSAVR3WZOO6SVLR2U5/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-06-06T14:44:16Z","links":{"resolver":"https://pith.science/pith/GQFYDKMLXSAVR3WZOO6SVLR2U5","bundle":"https://pith.science/pith/GQFYDKMLXSAVR3WZOO6SVLR2U5/bundle.json","state":"https://pith.science/pith/GQFYDKMLXSAVR3WZOO6SVLR2U5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GQFYDKMLXSAVR3WZOO6SVLR2U5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GQFYDKMLXSAVR3WZOO6SVLR2U5","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":"07399471233a4162e3b81875dc41bade0db4c7a12ea5384ae30fb7484a1ffd40","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2026-02-06T14:14:00Z","title_canon_sha256":"1afb2d1273ea52d14d1854ec79fde3bf3e5d4c84498ba598ea4df1888c9c679b"},"schema_version":"1.0","source":{"id":"2602.06721","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.06721","created_at":"2026-05-29T01:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"2602.06721v2","created_at":"2026-05-29T01:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.06721","created_at":"2026-05-29T01:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"GQFYDKMLXSAV","created_at":"2026-05-29T01:05:03Z"},{"alias_kind":"pith_short_16","alias_value":"GQFYDKMLXSAVR3WZ","created_at":"2026-05-29T01:05:03Z"},{"alias_kind":"pith_short_8","alias_value":"GQFYDKML","created_at":"2026-05-29T01:05:03Z"}],"graph_snapshots":[{"event_id":"sha256:7df3622f55b918edd48c86ca12959b1ebb3b297bccb6f97f62e33a59bebc02d5","target":"graph","created_at":"2026-05-29T01:05:03Z","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/2602.06721/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Approximate k-Nearest Neighbor (AKNN) search is widely used in vector databases. When vectors carry additional attributes (e.g., labels or numerical values), filtered AKNN search retrieves the nearest vectors to a query vector under attribute constraints. Most existing methods use a fixed termination condition, searching the entire index while respecting attribute filters. However, this leads to substantial redundant computations, since different queries require different amounts of search effort, and thus misses early termination opportunities for easy queries. This paper proposes a lightweig","authors_text":"Mingyu Yang, Wei Wang, Wentao Li, Wenxuan Xia","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2026-02-06T14:14:00Z","title":"E2E: Efficient Filtered AKNN Search via Adaptive Termination"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.06721","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:e93c9c17e7340070ea081e14577ad60a3d77bf76830b273523e60d7e82112c90","target":"record","created_at":"2026-05-29T01:05:03Z","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":"07399471233a4162e3b81875dc41bade0db4c7a12ea5384ae30fb7484a1ffd40","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2026-02-06T14:14:00Z","title_canon_sha256":"1afb2d1273ea52d14d1854ec79fde3bf3e5d4c84498ba598ea4df1888c9c679b"},"schema_version":"1.0","source":{"id":"2602.06721","kind":"arxiv","version":2}},"canonical_sha256":"340b81a98bbc8158eed973bd2aae3aa74baa7beb007a9cfa445c2e18b93bb3d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"340b81a98bbc8158eed973bd2aae3aa74baa7beb007a9cfa445c2e18b93bb3d3","first_computed_at":"2026-05-29T01:05:03.866405Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-29T01:05:03.866405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yGZvzA8WENpv0FGigmKi59KEajQGTXS0zzOMWBw4hGKKVYqgeUN9j1JIRSB9M/YqHKD3pQrgNuAULORSMQ+eBw==","signature_status":"signed_v1","signed_at":"2026-05-29T01:05:03.867451Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.06721","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e93c9c17e7340070ea081e14577ad60a3d77bf76830b273523e60d7e82112c90","sha256:7df3622f55b918edd48c86ca12959b1ebb3b297bccb6f97f62e33a59bebc02d5"],"state_sha256":"1928281f4fd213a1f1a353c2f6f0b1db1c088c639afdea17cb7e2e1e7e3ed5ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QbUPx/ikhLl9fbmvfBcwhV0FQ/4KRTJh/hzmxTGYZGb9DYTBoLKQy5oQw55v/mtbcbN6Ia8O7+LLOdXmcsyoBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T14:44:16.702778Z","bundle_sha256":"2102c36720a8c69c80eb1d935a6ca07890653bed19f4e4ef7dc525278713343e"}}