{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2O67MJPHPAKB6GIOQWYOSII4WJ","short_pith_number":"pith:2O67MJPH","schema_version":"1.0","canonical_sha256":"d3bdf625e778141f190e85b0e9211cb24c6e4c3afa71a9f8614c23968fe50c65","source":{"kind":"arxiv","id":"2607.28999","version":1},"attestation_state":"computed","paper":{"title":"MESS: Fast and Private Semantic Search on Multi-Graph HNSW","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Haoyu Cui, Mei Wang, Tien Tuan Anh Dinh, Zengpeng Li","submitted_at":"2026-07-31T03:53:24Z","abstract_excerpt":"Semantic search systems map data to a high-dimensional vector space and support retrieval of similar data via approximate nearest neighbor search. When the system is hosted by a trusted cloud provider, there is no privacy for the data or the query. Our goal is to design a system with three properties: privacy, accuracy, and efficiency. Existing works adopt either homomorphic encryption (HE), oblivious RAM (ORAM), or a differential privacy (DP) approach. They fall short of achieving all three properties.\n  In this paper, we present MESS, a system that realizes our goal. It maps the original vec"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.28999","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2026-07-31T03:53:24Z","cross_cats_sorted":[],"title_canon_sha256":"bf944cfff021508f569037bff676f5106e0f9f91bda83f384913e87b6b1d7b94","abstract_canon_sha256":"5f3e466e339626a5aa272d42713966b9d198a844310e375177bb2f1df3b2ed62"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-03T01:17:53.590723Z","signature_b64":"8szLrUcj/DXXHjTkemU37wprrcFfM23tUnZD1fkVN67kZSL7bxHlMjHdN3AkMKQI+5NMLb1Tfu9vwUqaJvHbAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3bdf625e778141f190e85b0e9211cb24c6e4c3afa71a9f8614c23968fe50c65","last_reissued_at":"2026-08-03T01:17:53.589212Z","signature_status":"signed_v1","first_computed_at":"2026-08-03T01:17:53.589212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MESS: Fast and Private Semantic Search on Multi-Graph HNSW","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Haoyu Cui, Mei Wang, Tien Tuan Anh Dinh, Zengpeng Li","submitted_at":"2026-07-31T03:53:24Z","abstract_excerpt":"Semantic search systems map data to a high-dimensional vector space and support retrieval of similar data via approximate nearest neighbor search. When the system is hosted by a trusted cloud provider, there is no privacy for the data or the query. Our goal is to design a system with three properties: privacy, accuracy, and efficiency. Existing works adopt either homomorphic encryption (HE), oblivious RAM (ORAM), or a differential privacy (DP) approach. They fall short of achieving all three properties.\n  In this paper, we present MESS, a system that realizes our goal. It maps the original vec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28999","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.28999/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.28999","created_at":"2026-08-03T01:17:53.590147+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.28999v1","created_at":"2026-08-03T01:17:53.590147+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28999","created_at":"2026-08-03T01:17:53.590147+00:00"},{"alias_kind":"pith_short_12","alias_value":"2O67MJPHPAKB","created_at":"2026-08-03T01:17:53.590147+00:00"},{"alias_kind":"pith_short_16","alias_value":"2O67MJPHPAKB6GIO","created_at":"2026-08-03T01:17:53.590147+00:00"},{"alias_kind":"pith_short_8","alias_value":"2O67MJPH","created_at":"2026-08-03T01:17:53.590147+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2O67MJPHPAKB6GIOQWYOSII4WJ","json":"https://pith.science/pith/2O67MJPHPAKB6GIOQWYOSII4WJ.json","graph_json":"https://pith.science/api/pith-number/2O67MJPHPAKB6GIOQWYOSII4WJ/graph.json","events_json":"https://pith.science/api/pith-number/2O67MJPHPAKB6GIOQWYOSII4WJ/events.json","paper":"https://pith.science/paper/2O67MJPH"},"agent_actions":{"view_html":"https://pith.science/pith/2O67MJPHPAKB6GIOQWYOSII4WJ","download_json":"https://pith.science/pith/2O67MJPHPAKB6GIOQWYOSII4WJ.json","view_paper":"https://pith.science/paper/2O67MJPH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.28999&json=true","fetch_graph":"https://pith.science/api/pith-number/2O67MJPHPAKB6GIOQWYOSII4WJ/graph.json","fetch_events":"https://pith.science/api/pith-number/2O67MJPHPAKB6GIOQWYOSII4WJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2O67MJPHPAKB6GIOQWYOSII4WJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2O67MJPHPAKB6GIOQWYOSII4WJ/action/storage_attestation","attest_author":"https://pith.science/pith/2O67MJPHPAKB6GIOQWYOSII4WJ/action/author_attestation","sign_citation":"https://pith.science/pith/2O67MJPHPAKB6GIOQWYOSII4WJ/action/citation_signature","submit_replication":"https://pith.science/pith/2O67MJPHPAKB6GIOQWYOSII4WJ/action/replication_record"}},"created_at":"2026-08-03T01:17:53.590147+00:00","updated_at":"2026-08-03T01:17:53.590147+00:00"}