{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:QANAGCGKHUNHQ57XRVOCDU2DDV","short_pith_number":"pith:QANAGCGK","canonical_record":{"source":{"id":"2605.01342","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-05-02T09:26:04Z","cross_cats_sorted":[],"title_canon_sha256":"43056e7b6a173985a8f7d81f7b8ab881da53db6bdb244ca35d4aaa972300dfcc","abstract_canon_sha256":"c9803b0e0a26a455da1000d0116bf41c338189305ca7a84421880940f87eafca"},"schema_version":"1.0"},"canonical_sha256":"801a0308ca3d1a7877f78d5c21d3431d40fe985da88ae6de4dc6258c85053bf8","source":{"kind":"arxiv","id":"2605.01342","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.01342","created_at":"2026-06-04T01:08:50Z"},{"alias_kind":"arxiv_version","alias_value":"2605.01342v3","created_at":"2026-06-04T01:08:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.01342","created_at":"2026-06-04T01:08:50Z"},{"alias_kind":"pith_short_12","alias_value":"QANAGCGKHUNH","created_at":"2026-06-04T01:08:50Z"},{"alias_kind":"pith_short_16","alias_value":"QANAGCGKHUNHQ57X","created_at":"2026-06-04T01:08:50Z"},{"alias_kind":"pith_short_8","alias_value":"QANAGCGK","created_at":"2026-06-04T01:08:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:QANAGCGKHUNHQ57XRVOCDU2DDV","target":"record","payload":{"canonical_record":{"source":{"id":"2605.01342","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-05-02T09:26:04Z","cross_cats_sorted":[],"title_canon_sha256":"43056e7b6a173985a8f7d81f7b8ab881da53db6bdb244ca35d4aaa972300dfcc","abstract_canon_sha256":"c9803b0e0a26a455da1000d0116bf41c338189305ca7a84421880940f87eafca"},"schema_version":"1.0"},"canonical_sha256":"801a0308ca3d1a7877f78d5c21d3431d40fe985da88ae6de4dc6258c85053bf8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:08:50.775868Z","signature_b64":"de2GbCgmrKI+sdTB9H3qSdvCJYFXbgOeyuIpZ0OF1klyW/4Y8It1V/ttNFI4dAgzqr16vDTtVUFODORiUPutAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"801a0308ca3d1a7877f78d5c21d3431d40fe985da88ae6de4dc6258c85053bf8","last_reissued_at":"2026-06-04T01:08:50.775052Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:08:50.775052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.01342","source_version":3,"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-04T01:08:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LwKaOzJnuh35pdpUXFq0YQbNyII7f3moqrwNSCcM9bEE2ik1CejghyVbkLvoj3AHp6FRRIKaGEpccXulbpeECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:00:27.358260Z"},"content_sha256":"7d74691d56de573fa35efd4a72eaf23158fab981b14330eb864eb00cdc2a5d59","schema_version":"1.0","event_id":"sha256:7d74691d56de573fa35efd4a72eaf23158fab981b14330eb864eb00cdc2a5d59"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:QANAGCGKHUNHQ57XRVOCDU2DDV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Don't Stir the Pot! Authorized Vector Data Retrieval via Access-Aware Indexing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"An access-aware lattice groups co-accessed vector blocks to enforce role-based access control while tracking a storage budget and raising query throughput.","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Shanshan Han, Sharad Mehrotra, Vishal Chakraborty","submitted_at":"2026-05-02T09:26:04Z","abstract_excerpt":"Vector databases increasingly enforce role-based access control, where each top-k approximate nearest neighbor query must return only vectors the querying role is authorized to access. Two extremes bracket the design space. A single global index built over all vectors avoids duplication but wastes search effort on unauthorized vectors and degrades recall, while an oracle index, built with all authorized vectors to the query roles, searches only authorized vectors but duplicates every shared vector between roles or queries. We present Veda and its efficient variant EffVeda, two indexing strateg"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Evaluations show that our methods deliver higher throughput at high recall while closely tracking the storage budget.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that the access-aware lattice structure permits effective grouping of co-accessed blocks under a user-specified storage budget without causing unacceptable degradation in recall or query latency when impure nodes are pruned via distance bounds.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Veda and EffVeda partition vectors into disjoint role-combination blocks, apply lattice-based copy and merge operations within a storage budget, index large nodes with HNSW, and use coordinated search with distance bounds to deliver higher throughput at high recall.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"An access-aware lattice groups co-accessed vector blocks to enforce role-based access control while tracking a storage budget and raising query throughput.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"ed29811ab5d4a10d8eb520c6a1600c6f3c3fe2684c2cddc3ad76163a52abe7f3"},"source":{"id":"2605.01342","kind":"arxiv","version":3},"verdict":{"id":"234145fd-1e6b-4bac-b620-c85136cd535a","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T21:29:28.113952Z","strongest_claim":"Evaluations show that our methods deliver higher throughput at high recall while closely tracking the storage budget.","one_line_summary":"Veda and EffVeda partition vectors into disjoint role-combination blocks, apply lattice-based copy and merge operations within a storage budget, index large nodes with HNSW, and use coordinated search with distance bounds to deliver higher throughput at high recall.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that the access-aware lattice structure permits effective grouping of co-accessed blocks under a user-specified storage budget without causing unacceptable degradation in recall or query latency when impure nodes are pruned via distance bounds.","pith_extraction_headline":"An access-aware lattice groups co-accessed vector blocks to enforce role-based access control while tracking a storage budget and raising query throughput."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.01342/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T18:34:58.088556Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T17:20:14.998340Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"b0f73b6da7a34de78828511cb1a4a3ea1e32d953644a640b462fe97b1e95b397"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"8b6f87fb17b8a67a55ca2c24371247b402684120b81d857ce3d31ea26fed44b3"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"234145fd-1e6b-4bac-b620-c85136cd535a"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-04T01:08:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ROabznj4JnANjeUIN5CDZ4EvPPLtvOs49zXr5UuLlDKNoUvuz/X++/0Cv8P8qQBm5kW+sP6+oal72mTxZdMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:00:27.358791Z"},"content_sha256":"0e7be3bd2e18ba2fff67750dfb09f9ef8f125a522cc9a9d988d7f58cab379dcc","schema_version":"1.0","event_id":"sha256:0e7be3bd2e18ba2fff67750dfb09f9ef8f125a522cc9a9d988d7f58cab379dcc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QANAGCGKHUNHQ57XRVOCDU2DDV/bundle.json","state_url":"https://pith.science/pith/QANAGCGKHUNHQ57XRVOCDU2DDV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QANAGCGKHUNHQ57XRVOCDU2DDV/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-04T03:00:27Z","links":{"resolver":"https://pith.science/pith/QANAGCGKHUNHQ57XRVOCDU2DDV","bundle":"https://pith.science/pith/QANAGCGKHUNHQ57XRVOCDU2DDV/bundle.json","state":"https://pith.science/pith/QANAGCGKHUNHQ57XRVOCDU2DDV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QANAGCGKHUNHQ57XRVOCDU2DDV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QANAGCGKHUNHQ57XRVOCDU2DDV","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":"c9803b0e0a26a455da1000d0116bf41c338189305ca7a84421880940f87eafca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-05-02T09:26:04Z","title_canon_sha256":"43056e7b6a173985a8f7d81f7b8ab881da53db6bdb244ca35d4aaa972300dfcc"},"schema_version":"1.0","source":{"id":"2605.01342","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.01342","created_at":"2026-06-04T01:08:50Z"},{"alias_kind":"arxiv_version","alias_value":"2605.01342v3","created_at":"2026-06-04T01:08:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.01342","created_at":"2026-06-04T01:08:50Z"},{"alias_kind":"pith_short_12","alias_value":"QANAGCGKHUNH","created_at":"2026-06-04T01:08:50Z"},{"alias_kind":"pith_short_16","alias_value":"QANAGCGKHUNHQ57X","created_at":"2026-06-04T01:08:50Z"},{"alias_kind":"pith_short_8","alias_value":"QANAGCGK","created_at":"2026-06-04T01:08:50Z"}],"graph_snapshots":[{"event_id":"sha256:0e7be3bd2e18ba2fff67750dfb09f9ef8f125a522cc9a9d988d7f58cab379dcc","target":"graph","created_at":"2026-06-04T01:08:50Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Evaluations show that our methods deliver higher throughput at high recall while closely tracking the storage budget."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that the access-aware lattice structure permits effective grouping of co-accessed blocks under a user-specified storage budget without causing unacceptable degradation in recall or query latency when impure nodes are pruned via distance bounds."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Veda and EffVeda partition vectors into disjoint role-combination blocks, apply lattice-based copy and merge operations within a storage budget, index large nodes with HNSW, and use coordinated search with distance bounds to deliver higher throughput at high recall."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"An access-aware lattice groups co-accessed vector blocks to enforce role-based access control while tracking a storage budget and raising query throughput."}],"snapshot_sha256":"ed29811ab5d4a10d8eb520c6a1600c6f3c3fe2684c2cddc3ad76163a52abe7f3"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"8b6f87fb17b8a67a55ca2c24371247b402684120b81d857ce3d31ea26fed44b3"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T18:34:58.088556Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T17:20:14.998340Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.01342/integrity.json","findings":[],"snapshot_sha256":"b0f73b6da7a34de78828511cb1a4a3ea1e32d953644a640b462fe97b1e95b397","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Vector databases increasingly enforce role-based access control, where each top-k approximate nearest neighbor query must return only vectors the querying role is authorized to access. Two extremes bracket the design space. A single global index built over all vectors avoids duplication but wastes search effort on unauthorized vectors and degrades recall, while an oracle index, built with all authorized vectors to the query roles, searches only authorized vectors but duplicates every shared vector between roles or queries. We present Veda and its efficient variant EffVeda, two indexing strateg","authors_text":"Shanshan Han, Sharad Mehrotra, Vishal Chakraborty","cross_cats":[],"headline":"An access-aware lattice groups co-accessed vector blocks to enforce role-based access control while tracking a storage budget and raising query throughput.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-05-02T09:26:04Z","title":"Don't Stir the Pot! Authorized Vector Data Retrieval via Access-Aware Indexing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.01342","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-14T21:29:28.113952Z","id":"234145fd-1e6b-4bac-b620-c85136cd535a","model_set":{"reader":"grok-4.3"},"one_line_summary":"Veda and EffVeda partition vectors into disjoint role-combination blocks, apply lattice-based copy and merge operations within a storage budget, index large nodes with HNSW, and use coordinated search with distance bounds to deliver higher throughput at high recall.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"An access-aware lattice groups co-accessed vector blocks to enforce role-based access control while tracking a storage budget and raising query throughput.","strongest_claim":"Evaluations show that our methods deliver higher throughput at high recall while closely tracking the storage budget.","weakest_assumption":"The assumption that the access-aware lattice structure permits effective grouping of co-accessed blocks under a user-specified storage budget without causing unacceptable degradation in recall or query latency when impure nodes are pruned via distance bounds."}},"verdict_id":"234145fd-1e6b-4bac-b620-c85136cd535a"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7d74691d56de573fa35efd4a72eaf23158fab981b14330eb864eb00cdc2a5d59","target":"record","created_at":"2026-06-04T01:08:50Z","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":"c9803b0e0a26a455da1000d0116bf41c338189305ca7a84421880940f87eafca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-05-02T09:26:04Z","title_canon_sha256":"43056e7b6a173985a8f7d81f7b8ab881da53db6bdb244ca35d4aaa972300dfcc"},"schema_version":"1.0","source":{"id":"2605.01342","kind":"arxiv","version":3}},"canonical_sha256":"801a0308ca3d1a7877f78d5c21d3431d40fe985da88ae6de4dc6258c85053bf8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"801a0308ca3d1a7877f78d5c21d3431d40fe985da88ae6de4dc6258c85053bf8","first_computed_at":"2026-06-04T01:08:50.775052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T01:08:50.775052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"de2GbCgmrKI+sdTB9H3qSdvCJYFXbgOeyuIpZ0OF1klyW/4Y8It1V/ttNFI4dAgzqr16vDTtVUFODORiUPutAA==","signature_status":"signed_v1","signed_at":"2026-06-04T01:08:50.775868Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.01342","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d74691d56de573fa35efd4a72eaf23158fab981b14330eb864eb00cdc2a5d59","sha256:0e7be3bd2e18ba2fff67750dfb09f9ef8f125a522cc9a9d988d7f58cab379dcc"],"state_sha256":"99e6ae4ae1c264ac7c8f3f595de4a04872f1d3c9e6a31b55c82fadde3ce059f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/C2BBeNXuc7L5vbyfH1iK6BQNY/Uuqi/tM2Xevvnzr3ck0zRUFwzKAEe3e3ilEtwZZDDxj8xEeqjggwni7huBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T03:00:27.361184Z","bundle_sha256":"9a93bf162a71fd3c688413568423a6337bbaf30d13fab2051affd76d00f867f3"}}