{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TCYR37NMP2B4ZP54DNRF7MAG3X","short_pith_number":"pith:TCYR37NM","canonical_record":{"source":{"id":"1702.01739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-06T18:50:02Z","cross_cats_sorted":["cs.CR","cs.IR","math.IT"],"title_canon_sha256":"2e998b23b6dc788dede8e0cce7786c97a6cac98d6ed9e12417dc9d898d991b9f","abstract_canon_sha256":"c12da5d0de2f867ee6b396061edf5e7da75cd4d1325e1c5397cd3c59057b8003"},"schema_version":"1.0"},"canonical_sha256":"98b11dfdac7e83ccbfbc1b625fb006ddde7ed0f4cd1f23731734617cd7d0434b","source":{"kind":"arxiv","id":"1702.01739","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01739","created_at":"2026-05-18T00:51:19Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01739v1","created_at":"2026-05-18T00:51:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01739","created_at":"2026-05-18T00:51:19Z"},{"alias_kind":"pith_short_12","alias_value":"TCYR37NMP2B4","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TCYR37NMP2B4ZP54","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TCYR37NM","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TCYR37NMP2B4ZP54DNRF7MAG3X","target":"record","payload":{"canonical_record":{"source":{"id":"1702.01739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-06T18:50:02Z","cross_cats_sorted":["cs.CR","cs.IR","math.IT"],"title_canon_sha256":"2e998b23b6dc788dede8e0cce7786c97a6cac98d6ed9e12417dc9d898d991b9f","abstract_canon_sha256":"c12da5d0de2f867ee6b396061edf5e7da75cd4d1325e1c5397cd3c59057b8003"},"schema_version":"1.0"},"canonical_sha256":"98b11dfdac7e83ccbfbc1b625fb006ddde7ed0f4cd1f23731734617cd7d0434b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:19.707637Z","signature_b64":"OS+g6h4GuOb+lzUgntq2Dv3VRLcQVnrR0Owsybp+fXi4naf2VvduFRqriBDGrK7GNHmuRJXvLSMVjj21cpGDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98b11dfdac7e83ccbfbc1b625fb006ddde7ed0f4cd1f23731734617cd7d0434b","last_reissued_at":"2026-05-18T00:51:19.706902Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:19.706902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.01739","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-18T00:51:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AF0nh9MMePTCN8DwiFLp0lfqjUGAEREggpLAXMyEPwKAd61RAc8QxK/rVmlmyNnHv/y9DfktrSCHgVf3T0oLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:15:31.817962Z"},"content_sha256":"0f9eeee6f50230b0bb1ad2f60b44727e774f88aee45c2fa301c5f96e2bfebb58","schema_version":"1.0","event_id":"sha256:0f9eeee6f50230b0bb1ad2f60b44727e774f88aee45c2fa301c5f96e2bfebb58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TCYR37NMP2B4ZP54DNRF7MAG3X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Message Private Information Retrieval: Capacity Results and Near-Optimal Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IR","math.IT"],"primary_cat":"cs.IT","authors_text":"Karim Banawan, Sennur Ulukus","submitted_at":"2017-02-06T18:50:02Z","abstract_excerpt":"We consider the problem of multi-message private information retrieval (MPIR) from $N$ non-communicating replicated databases. In MPIR, the user is interested in retrieving $P$ messages out of $M$ stored messages without leaking the identity of the retrieved messages. The information-theoretic sum capacity of MPIR $C_s^P$ is the maximum number of desired message symbols that can be retrieved privately per downloaded symbol. For the case $P \\geq \\frac{M}{2}$, we determine the exact sum capacity of MPIR as $C_s^P=\\frac{1}{1+\\frac{M-P}{PN}}$. The achievable scheme in this case is based on downloa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01739","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-18T00:51:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xpc80ogGhy1hbjJy7dmlv/3wl1v3DPTMZWpMQMtQhTOjo/TO32hy+CZfx/HRr4OfCkciNwzSPNup3f8bngSyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:15:31.818322Z"},"content_sha256":"f1b370ba5bd054db8eef44f7dd0f111b3dc02bcfb6837c9c00c8a1eefecb3184","schema_version":"1.0","event_id":"sha256:f1b370ba5bd054db8eef44f7dd0f111b3dc02bcfb6837c9c00c8a1eefecb3184"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TCYR37NMP2B4ZP54DNRF7MAG3X/bundle.json","state_url":"https://pith.science/pith/TCYR37NMP2B4ZP54DNRF7MAG3X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TCYR37NMP2B4ZP54DNRF7MAG3X/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-02T14:15:31Z","links":{"resolver":"https://pith.science/pith/TCYR37NMP2B4ZP54DNRF7MAG3X","bundle":"https://pith.science/pith/TCYR37NMP2B4ZP54DNRF7MAG3X/bundle.json","state":"https://pith.science/pith/TCYR37NMP2B4ZP54DNRF7MAG3X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TCYR37NMP2B4ZP54DNRF7MAG3X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TCYR37NMP2B4ZP54DNRF7MAG3X","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":"c12da5d0de2f867ee6b396061edf5e7da75cd4d1325e1c5397cd3c59057b8003","cross_cats_sorted":["cs.CR","cs.IR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-06T18:50:02Z","title_canon_sha256":"2e998b23b6dc788dede8e0cce7786c97a6cac98d6ed9e12417dc9d898d991b9f"},"schema_version":"1.0","source":{"id":"1702.01739","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01739","created_at":"2026-05-18T00:51:19Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01739v1","created_at":"2026-05-18T00:51:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01739","created_at":"2026-05-18T00:51:19Z"},{"alias_kind":"pith_short_12","alias_value":"TCYR37NMP2B4","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TCYR37NMP2B4ZP54","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TCYR37NM","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:f1b370ba5bd054db8eef44f7dd0f111b3dc02bcfb6837c9c00c8a1eefecb3184","target":"graph","created_at":"2026-05-18T00:51:19Z","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":"We consider the problem of multi-message private information retrieval (MPIR) from $N$ non-communicating replicated databases. In MPIR, the user is interested in retrieving $P$ messages out of $M$ stored messages without leaking the identity of the retrieved messages. The information-theoretic sum capacity of MPIR $C_s^P$ is the maximum number of desired message symbols that can be retrieved privately per downloaded symbol. For the case $P \\geq \\frac{M}{2}$, we determine the exact sum capacity of MPIR as $C_s^P=\\frac{1}{1+\\frac{M-P}{PN}}$. The achievable scheme in this case is based on downloa","authors_text":"Karim Banawan, Sennur Ulukus","cross_cats":["cs.CR","cs.IR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-06T18:50:02Z","title":"Multi-Message Private Information Retrieval: Capacity Results and Near-Optimal Schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01739","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:0f9eeee6f50230b0bb1ad2f60b44727e774f88aee45c2fa301c5f96e2bfebb58","target":"record","created_at":"2026-05-18T00:51:19Z","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":"c12da5d0de2f867ee6b396061edf5e7da75cd4d1325e1c5397cd3c59057b8003","cross_cats_sorted":["cs.CR","cs.IR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-06T18:50:02Z","title_canon_sha256":"2e998b23b6dc788dede8e0cce7786c97a6cac98d6ed9e12417dc9d898d991b9f"},"schema_version":"1.0","source":{"id":"1702.01739","kind":"arxiv","version":1}},"canonical_sha256":"98b11dfdac7e83ccbfbc1b625fb006ddde7ed0f4cd1f23731734617cd7d0434b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98b11dfdac7e83ccbfbc1b625fb006ddde7ed0f4cd1f23731734617cd7d0434b","first_computed_at":"2026-05-18T00:51:19.706902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:19.706902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OS+g6h4GuOb+lzUgntq2Dv3VRLcQVnrR0Owsybp+fXi4naf2VvduFRqriBDGrK7GNHmuRJXvLSMVjj21cpGDAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:19.707637Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.01739","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f9eeee6f50230b0bb1ad2f60b44727e774f88aee45c2fa301c5f96e2bfebb58","sha256:f1b370ba5bd054db8eef44f7dd0f111b3dc02bcfb6837c9c00c8a1eefecb3184"],"state_sha256":"4608e8ca6afabcba963a4563e114990c47a25fc8d190c9a5b3720c95feba3966"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2PsW6GsnD2SROg2UYLZD7ovexyA7dcjJcNaH59zNXzhqRPmvZq96PwCcEsEVzbw/gBuoHHyzakBATHxfDwO8DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:15:31.820464Z","bundle_sha256":"31eafb5a0029b0628d5a02ed9d8caef788f49b2e6f495989b819ca43670e1cbd"}}