{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:Y72RDJ7YMUV4JSKGLGSBQS6VXO","short_pith_number":"pith:Y72RDJ7Y","canonical_record":{"source":{"id":"1902.03902","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-02-11T14:39:38Z","cross_cats_sorted":[],"title_canon_sha256":"f25ae095807297312258a6ab59447271a2536ac3c795862cf83e60fc2f6a554d","abstract_canon_sha256":"b03ca673d02e9faecaedeb1fdbd4724bc4c3d55377d914094aa8acfd0bad1beb"},"schema_version":"1.0"},"canonical_sha256":"c7f511a7f8652bc4c94659a4184bd5bb98c84dd04f4bf6b3b35ff766a69f778d","source":{"kind":"arxiv","id":"1902.03902","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03902","created_at":"2026-05-17T23:54:17Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03902v1","created_at":"2026-05-17T23:54:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03902","created_at":"2026-05-17T23:54:17Z"},{"alias_kind":"pith_short_12","alias_value":"Y72RDJ7YMUV4","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"Y72RDJ7YMUV4JSKG","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"Y72RDJ7Y","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:Y72RDJ7YMUV4JSKGLGSBQS6VXO","target":"record","payload":{"canonical_record":{"source":{"id":"1902.03902","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-02-11T14:39:38Z","cross_cats_sorted":[],"title_canon_sha256":"f25ae095807297312258a6ab59447271a2536ac3c795862cf83e60fc2f6a554d","abstract_canon_sha256":"b03ca673d02e9faecaedeb1fdbd4724bc4c3d55377d914094aa8acfd0bad1beb"},"schema_version":"1.0"},"canonical_sha256":"c7f511a7f8652bc4c94659a4184bd5bb98c84dd04f4bf6b3b35ff766a69f778d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:17.614049Z","signature_b64":"wEmMaRN5llgzkY1HDufdW9mGdrqSPp/5dCoGtmEsQu0HgW18vj+XG2beEKJs40J6IpP/afgHEhlz0hFhCJ47BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7f511a7f8652bc4c94659a4184bd5bb98c84dd04f4bf6b3b35ff766a69f778d","last_reissued_at":"2026-05-17T23:54:17.613464Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:17.613464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.03902","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-05-17T23:54:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7mIjeaWeA7stfEgnOPqgJeuLvUKjz+QcvzLqquLis09s/yKN+nRj+r53eFNsaKsH4c3JUIVkM9+xMF8aep/pDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:42:59.349567Z"},"content_sha256":"9eb3b456bf043a010c2567121d184612a705bd1ad23efa3953e40f25682102d4","schema_version":"1.0","event_id":"sha256:9eb3b456bf043a010c2567121d184612a705bd1ad23efa3953e40f25682102d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:Y72RDJ7YMUV4JSKGLGSBQS6VXO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Achieving Secure and Efficient Cloud Search Services: Cross-Lingual Multi-Keyword Rank Search over Encrypted Cloud Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Longfei Wu, Mohsen Guizani, Xueyan Liu, Zain Ul Abedin, Zhitao Guan","submitted_at":"2019-02-11T14:39:38Z","abstract_excerpt":"Multi-user multi-keyword ranked search scheme in arbitrary language is a novel multi-keyword rank searchable encryption (MRSE) framework based on Paillier Cryptosystem with Threshold Decryption (PCTD). Compared to previous MRSE schemes constructed based on the k-nearest neighbor searcha-ble encryption (KNN-SE) algorithm, it can mitigate some draw-backs and achieve better performance in terms of functionality and efficiency. Additionally, it does not require a predefined keyword set and support keywords in arbitrary languages. However, due to the pattern of exact matching of keywords in the new"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03902","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":""},"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-17T23:54:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NCEcAy5GXqJvMtxHc3y0DhpFV/ZNBry9Av4klejRmJZrh+zC4yF6gMu5L07hNldALLid27EyF5Te1HvPHFX/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:42:59.350262Z"},"content_sha256":"df6f875e1bbae43493e671ccf2ffd74ef3b665070259ee1779cd7a4f21d916a0","schema_version":"1.0","event_id":"sha256:df6f875e1bbae43493e671ccf2ffd74ef3b665070259ee1779cd7a4f21d916a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y72RDJ7YMUV4JSKGLGSBQS6VXO/bundle.json","state_url":"https://pith.science/pith/Y72RDJ7YMUV4JSKGLGSBQS6VXO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y72RDJ7YMUV4JSKGLGSBQS6VXO/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-06T15:42:59Z","links":{"resolver":"https://pith.science/pith/Y72RDJ7YMUV4JSKGLGSBQS6VXO","bundle":"https://pith.science/pith/Y72RDJ7YMUV4JSKGLGSBQS6VXO/bundle.json","state":"https://pith.science/pith/Y72RDJ7YMUV4JSKGLGSBQS6VXO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y72RDJ7YMUV4JSKGLGSBQS6VXO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:Y72RDJ7YMUV4JSKGLGSBQS6VXO","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":"b03ca673d02e9faecaedeb1fdbd4724bc4c3d55377d914094aa8acfd0bad1beb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-02-11T14:39:38Z","title_canon_sha256":"f25ae095807297312258a6ab59447271a2536ac3c795862cf83e60fc2f6a554d"},"schema_version":"1.0","source":{"id":"1902.03902","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03902","created_at":"2026-05-17T23:54:17Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03902v1","created_at":"2026-05-17T23:54:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03902","created_at":"2026-05-17T23:54:17Z"},{"alias_kind":"pith_short_12","alias_value":"Y72RDJ7YMUV4","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"Y72RDJ7YMUV4JSKG","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"Y72RDJ7Y","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:df6f875e1bbae43493e671ccf2ffd74ef3b665070259ee1779cd7a4f21d916a0","target":"graph","created_at":"2026-05-17T23:54:17Z","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"},"paper":{"abstract_excerpt":"Multi-user multi-keyword ranked search scheme in arbitrary language is a novel multi-keyword rank searchable encryption (MRSE) framework based on Paillier Cryptosystem with Threshold Decryption (PCTD). Compared to previous MRSE schemes constructed based on the k-nearest neighbor searcha-ble encryption (KNN-SE) algorithm, it can mitigate some draw-backs and achieve better performance in terms of functionality and efficiency. Additionally, it does not require a predefined keyword set and support keywords in arbitrary languages. However, due to the pattern of exact matching of keywords in the new","authors_text":"Longfei Wu, Mohsen Guizani, Xueyan Liu, Zain Ul Abedin, Zhitao Guan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-02-11T14:39:38Z","title":"Achieving Secure and Efficient Cloud Search Services: Cross-Lingual Multi-Keyword Rank Search over Encrypted Cloud Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03902","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:9eb3b456bf043a010c2567121d184612a705bd1ad23efa3953e40f25682102d4","target":"record","created_at":"2026-05-17T23:54:17Z","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":"b03ca673d02e9faecaedeb1fdbd4724bc4c3d55377d914094aa8acfd0bad1beb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-02-11T14:39:38Z","title_canon_sha256":"f25ae095807297312258a6ab59447271a2536ac3c795862cf83e60fc2f6a554d"},"schema_version":"1.0","source":{"id":"1902.03902","kind":"arxiv","version":1}},"canonical_sha256":"c7f511a7f8652bc4c94659a4184bd5bb98c84dd04f4bf6b3b35ff766a69f778d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7f511a7f8652bc4c94659a4184bd5bb98c84dd04f4bf6b3b35ff766a69f778d","first_computed_at":"2026-05-17T23:54:17.613464Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:17.613464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wEmMaRN5llgzkY1HDufdW9mGdrqSPp/5dCoGtmEsQu0HgW18vj+XG2beEKJs40J6IpP/afgHEhlz0hFhCJ47BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:17.614049Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.03902","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9eb3b456bf043a010c2567121d184612a705bd1ad23efa3953e40f25682102d4","sha256:df6f875e1bbae43493e671ccf2ffd74ef3b665070259ee1779cd7a4f21d916a0"],"state_sha256":"d47f2978fb3909412d345aed0662124309b5b11a172fee81906d182651d7c37f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wzrTETsleAM76GuKqUzz286OAgAigJGYD4q7/lD9WoA5/pINoN3cKpeT0WaMzMf9snUdaPLJ/5DqWHiclHzJAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T15:42:59.353855Z","bundle_sha256":"38688dbfbea444cd6fda68194a3a173fb279db691825f114f8308fcb6c5081bf"}}