{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TCYR37NMP2B4ZP54DNRF7MAG3X","short_pith_number":"pith:TCYR37NM","schema_version":"1.0","canonical_sha256":"98b11dfdac7e83ccbfbc1b625fb006ddde7ed0f4cd1f23731734617cd7d0434b","source":{"kind":"arxiv","id":"1702.01739","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.01739","created_at":"2026-05-18T00:51:19.707029+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.01739v1","created_at":"2026-05-18T00:51:19.707029+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01739","created_at":"2026-05-18T00:51:19.707029+00:00"},{"alias_kind":"pith_short_12","alias_value":"TCYR37NMP2B4","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TCYR37NMP2B4ZP54","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TCYR37NM","created_at":"2026-05-18T12:31:46.661854+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.00598","citing_title":"On an Equivalence Between Single-Server PIR with Side Information and Locally Recoverable Codes","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TCYR37NMP2B4ZP54DNRF7MAG3X","json":"https://pith.science/pith/TCYR37NMP2B4ZP54DNRF7MAG3X.json","graph_json":"https://pith.science/api/pith-number/TCYR37NMP2B4ZP54DNRF7MAG3X/graph.json","events_json":"https://pith.science/api/pith-number/TCYR37NMP2B4ZP54DNRF7MAG3X/events.json","paper":"https://pith.science/paper/TCYR37NM"},"agent_actions":{"view_html":"https://pith.science/pith/TCYR37NMP2B4ZP54DNRF7MAG3X","download_json":"https://pith.science/pith/TCYR37NMP2B4ZP54DNRF7MAG3X.json","view_paper":"https://pith.science/paper/TCYR37NM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.01739&json=true","fetch_graph":"https://pith.science/api/pith-number/TCYR37NMP2B4ZP54DNRF7MAG3X/graph.json","fetch_events":"https://pith.science/api/pith-number/TCYR37NMP2B4ZP54DNRF7MAG3X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TCYR37NMP2B4ZP54DNRF7MAG3X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TCYR37NMP2B4ZP54DNRF7MAG3X/action/storage_attestation","attest_author":"https://pith.science/pith/TCYR37NMP2B4ZP54DNRF7MAG3X/action/author_attestation","sign_citation":"https://pith.science/pith/TCYR37NMP2B4ZP54DNRF7MAG3X/action/citation_signature","submit_replication":"https://pith.science/pith/TCYR37NMP2B4ZP54DNRF7MAG3X/action/replication_record"}},"created_at":"2026-05-18T00:51:19.707029+00:00","updated_at":"2026-05-18T00:51:19.707029+00:00"}