{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:HGCOASDD44OQ2HJNRDHSK7DFBH","short_pith_number":"pith:HGCOASDD","canonical_record":{"source":{"id":"2606.00734","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2026-05-30T13:56:00Z","cross_cats_sorted":[],"title_canon_sha256":"144791c2f8237f319359559786c764a083ae0e5cdb7fe7e12be72f160726d07f","abstract_canon_sha256":"01ed3bf4b573916044b758a06145d63ee2ca6cd69ca829d7d2b3a7c18d570ab3"},"schema_version":"1.0"},"canonical_sha256":"3984e04863e71d0d1d2d88cf257c6509c5eed4f721f5727ec8571fb754dac805","source":{"kind":"arxiv","id":"2606.00734","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.00734","created_at":"2026-06-02T01:04:04Z"},{"alias_kind":"arxiv_version","alias_value":"2606.00734v1","created_at":"2026-06-02T01:04:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00734","created_at":"2026-06-02T01:04:04Z"},{"alias_kind":"pith_short_12","alias_value":"HGCOASDD44OQ","created_at":"2026-06-02T01:04:04Z"},{"alias_kind":"pith_short_16","alias_value":"HGCOASDD44OQ2HJN","created_at":"2026-06-02T01:04:04Z"},{"alias_kind":"pith_short_8","alias_value":"HGCOASDD","created_at":"2026-06-02T01:04:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:HGCOASDD44OQ2HJNRDHSK7DFBH","target":"record","payload":{"canonical_record":{"source":{"id":"2606.00734","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2026-05-30T13:56:00Z","cross_cats_sorted":[],"title_canon_sha256":"144791c2f8237f319359559786c764a083ae0e5cdb7fe7e12be72f160726d07f","abstract_canon_sha256":"01ed3bf4b573916044b758a06145d63ee2ca6cd69ca829d7d2b3a7c18d570ab3"},"schema_version":"1.0"},"canonical_sha256":"3984e04863e71d0d1d2d88cf257c6509c5eed4f721f5727ec8571fb754dac805","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:04:04.150672Z","signature_b64":"a2zrXMsut/weFd4zaA6DqCWrm8fO9gsAxm7dtO5jjr3ae/yMM2EHNQSZ2fwQwI3yeLYapRo6ZLZiI4JwMOOgBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3984e04863e71d0d1d2d88cf257c6509c5eed4f721f5727ec8571fb754dac805","last_reissued_at":"2026-06-02T01:04:04.150287Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:04:04.150287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.00734","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-06-02T01:04:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I1vnm5BU7dJex+vbY7qmIpTL3F88IJkh8YDDHW53/CPWWm+IKfoRx8wjBPUimmNOMSPW0UfbyoanU6pED1SJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:50:35.250464Z"},"content_sha256":"518822158f691d5f5424518bb9566e141131cd41217efb129620ba5e562aadab","schema_version":"1.0","event_id":"sha256:518822158f691d5f5424518bb9566e141131cd41217efb129620ba5e562aadab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:HGCOASDD44OQ2HJNRDHSK7DFBH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"EMA: Approximate Nearest Neighbor Search with General Attribute Filtering and Dynamic Updates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Baotong Lu, Chenhao Ma, James Cheng, Mocheng Li","submitted_at":"2026-05-30T13:56:00Z","abstract_excerpt":"Filtering Approximate Nearest Neighbor (FANN) search is a critical and emerging task for strengthening the query capability of vector databases, supporting applications such as recommendation systems, retrieval-augmented generation (RAG), and agent memory. However, most existing methods are limited to range or label filtering, often incurring unacceptable index construction time and memory overhead. Predicate-agnostic approaches further struggle to handle a wide range of predicate selectivities effectively. In this paper, we propose EMA, a filtering ANN algorithm that supports multi-predicate "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00734","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/2606.00734/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-06-02T01:04:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QSP++bZrxOWwtR8m0wcQo0DC/SflCOJet6QIh+k7xwu7zx7jaWsH/jlhj1Oqn26brlgg0LZTzuhT4iumXCOnCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:50:35.251187Z"},"content_sha256":"5b41d6538606c93d2244a05cb362c32e7167592ea48fd407bdb30232b68d5882","schema_version":"1.0","event_id":"sha256:5b41d6538606c93d2244a05cb362c32e7167592ea48fd407bdb30232b68d5882"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HGCOASDD44OQ2HJNRDHSK7DFBH/bundle.json","state_url":"https://pith.science/pith/HGCOASDD44OQ2HJNRDHSK7DFBH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HGCOASDD44OQ2HJNRDHSK7DFBH/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-11T23:50:35Z","links":{"resolver":"https://pith.science/pith/HGCOASDD44OQ2HJNRDHSK7DFBH","bundle":"https://pith.science/pith/HGCOASDD44OQ2HJNRDHSK7DFBH/bundle.json","state":"https://pith.science/pith/HGCOASDD44OQ2HJNRDHSK7DFBH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HGCOASDD44OQ2HJNRDHSK7DFBH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HGCOASDD44OQ2HJNRDHSK7DFBH","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":"01ed3bf4b573916044b758a06145d63ee2ca6cd69ca829d7d2b3a7c18d570ab3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2026-05-30T13:56:00Z","title_canon_sha256":"144791c2f8237f319359559786c764a083ae0e5cdb7fe7e12be72f160726d07f"},"schema_version":"1.0","source":{"id":"2606.00734","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.00734","created_at":"2026-06-02T01:04:04Z"},{"alias_kind":"arxiv_version","alias_value":"2606.00734v1","created_at":"2026-06-02T01:04:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00734","created_at":"2026-06-02T01:04:04Z"},{"alias_kind":"pith_short_12","alias_value":"HGCOASDD44OQ","created_at":"2026-06-02T01:04:04Z"},{"alias_kind":"pith_short_16","alias_value":"HGCOASDD44OQ2HJN","created_at":"2026-06-02T01:04:04Z"},{"alias_kind":"pith_short_8","alias_value":"HGCOASDD","created_at":"2026-06-02T01:04:04Z"}],"graph_snapshots":[{"event_id":"sha256:5b41d6538606c93d2244a05cb362c32e7167592ea48fd407bdb30232b68d5882","target":"graph","created_at":"2026-06-02T01:04:04Z","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/2606.00734/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Filtering Approximate Nearest Neighbor (FANN) search is a critical and emerging task for strengthening the query capability of vector databases, supporting applications such as recommendation systems, retrieval-augmented generation (RAG), and agent memory. However, most existing methods are limited to range or label filtering, often incurring unacceptable index construction time and memory overhead. Predicate-agnostic approaches further struggle to handle a wide range of predicate selectivities effectively. In this paper, we propose EMA, a filtering ANN algorithm that supports multi-predicate ","authors_text":"Baotong Lu, Chenhao Ma, James Cheng, Mocheng Li","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2026-05-30T13:56:00Z","title":"EMA: Approximate Nearest Neighbor Search with General Attribute Filtering and Dynamic Updates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00734","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:518822158f691d5f5424518bb9566e141131cd41217efb129620ba5e562aadab","target":"record","created_at":"2026-06-02T01:04:04Z","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":"01ed3bf4b573916044b758a06145d63ee2ca6cd69ca829d7d2b3a7c18d570ab3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2026-05-30T13:56:00Z","title_canon_sha256":"144791c2f8237f319359559786c764a083ae0e5cdb7fe7e12be72f160726d07f"},"schema_version":"1.0","source":{"id":"2606.00734","kind":"arxiv","version":1}},"canonical_sha256":"3984e04863e71d0d1d2d88cf257c6509c5eed4f721f5727ec8571fb754dac805","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3984e04863e71d0d1d2d88cf257c6509c5eed4f721f5727ec8571fb754dac805","first_computed_at":"2026-06-02T01:04:04.150287Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T01:04:04.150287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a2zrXMsut/weFd4zaA6DqCWrm8fO9gsAxm7dtO5jjr3ae/yMM2EHNQSZ2fwQwI3yeLYapRo6ZLZiI4JwMOOgBA==","signature_status":"signed_v1","signed_at":"2026-06-02T01:04:04.150672Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.00734","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:518822158f691d5f5424518bb9566e141131cd41217efb129620ba5e562aadab","sha256:5b41d6538606c93d2244a05cb362c32e7167592ea48fd407bdb30232b68d5882"],"state_sha256":"ec3b35e32b6e56869ada654cb8ff877154599a7aa2720269cd6e2fb1e957b912"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K18T6GbICxVzFgXi1lXbjPBlZ23Azkp6/4XWeTWBJj3TgXvZ/kgMZxe182c1nsEp94Xu4tDqxzObp10dmZG4Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:50:35.255549Z","bundle_sha256":"38205ec91c2aa6e30c46b0f35f80ef06e67ef5eee81343c520f149b28d6035dc"}}