{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LHVMPHRXHIM3D4OLPTMSY7S2V3","short_pith_number":"pith:LHVMPHRX","schema_version":"1.0","canonical_sha256":"59eac79e373a19b1f1cb7cd92c7e5aaef178a40dedb5c8b83ed980b14902faf3","source":{"kind":"arxiv","id":"1808.05797","version":1},"attestation_state":"computed","paper":{"title":"Single-Server Multi-Message Private Information Retrieval with Side Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Michael Gastpar, Su Li","submitted_at":"2018-08-17T08:45:35Z","abstract_excerpt":"We study the problem of single-server multi-message private information retrieval with side information. One user wants to recover $N$ out of $K$ independent messages which are stored at a single server. The user initially possesses a subset of $M$ messages as side information. The goal of the user is to download the $N$ demand messages while not leaking any information about the indices of these messages to the server. In this paper, we characterize the minimum number of required transmissions. We also present the optimal linear coding scheme which enables the user to download the demand mess"},"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":"1808.05797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-17T08:45:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dbc2acf901c95a13219aa4082c1ad9285166a547594be4f5e233f2010cec21a3","abstract_canon_sha256":"f400ca109f74bfc7986e62a28f5f69bcbdd7d1077f8435bc4b82790460a7cacd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:52.110104Z","signature_b64":"BcaIIryY2hhDBq0grj6kaE1/QjtntGaLif3XZVr5LxoUQQ5MrHMDEVH9SfFFNyl0VFVRTogLUsR9U6QPT6cwAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59eac79e373a19b1f1cb7cd92c7e5aaef178a40dedb5c8b83ed980b14902faf3","last_reissued_at":"2026-05-18T00:07:52.109289Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:52.109289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Single-Server Multi-Message Private Information Retrieval with Side Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Michael Gastpar, Su Li","submitted_at":"2018-08-17T08:45:35Z","abstract_excerpt":"We study the problem of single-server multi-message private information retrieval with side information. One user wants to recover $N$ out of $K$ independent messages which are stored at a single server. The user initially possesses a subset of $M$ messages as side information. The goal of the user is to download the $N$ demand messages while not leaking any information about the indices of these messages to the server. In this paper, we characterize the minimum number of required transmissions. We also present the optimal linear coding scheme which enables the user to download the demand mess"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05797","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":"1808.05797","created_at":"2026-05-18T00:07:52.109449+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.05797v1","created_at":"2026-05-18T00:07:52.109449+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05797","created_at":"2026-05-18T00:07:52.109449+00:00"},{"alias_kind":"pith_short_12","alias_value":"LHVMPHRXHIM3","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LHVMPHRXHIM3D4OL","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LHVMPHRX","created_at":"2026-05-18T12:32:37.024351+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":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LHVMPHRXHIM3D4OLPTMSY7S2V3","json":"https://pith.science/pith/LHVMPHRXHIM3D4OLPTMSY7S2V3.json","graph_json":"https://pith.science/api/pith-number/LHVMPHRXHIM3D4OLPTMSY7S2V3/graph.json","events_json":"https://pith.science/api/pith-number/LHVMPHRXHIM3D4OLPTMSY7S2V3/events.json","paper":"https://pith.science/paper/LHVMPHRX"},"agent_actions":{"view_html":"https://pith.science/pith/LHVMPHRXHIM3D4OLPTMSY7S2V3","download_json":"https://pith.science/pith/LHVMPHRXHIM3D4OLPTMSY7S2V3.json","view_paper":"https://pith.science/paper/LHVMPHRX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.05797&json=true","fetch_graph":"https://pith.science/api/pith-number/LHVMPHRXHIM3D4OLPTMSY7S2V3/graph.json","fetch_events":"https://pith.science/api/pith-number/LHVMPHRXHIM3D4OLPTMSY7S2V3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LHVMPHRXHIM3D4OLPTMSY7S2V3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LHVMPHRXHIM3D4OLPTMSY7S2V3/action/storage_attestation","attest_author":"https://pith.science/pith/LHVMPHRXHIM3D4OLPTMSY7S2V3/action/author_attestation","sign_citation":"https://pith.science/pith/LHVMPHRXHIM3D4OLPTMSY7S2V3/action/citation_signature","submit_replication":"https://pith.science/pith/LHVMPHRXHIM3D4OLPTMSY7S2V3/action/replication_record"}},"created_at":"2026-05-18T00:07:52.109449+00:00","updated_at":"2026-05-18T00:07:52.109449+00:00"}