{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YMQ2S2KQ2PMJ4LPJRO2GPPA2CM","short_pith_number":"pith:YMQ2S2KQ","schema_version":"1.0","canonical_sha256":"c321a96950d3d89e2de98bb467bc1a1321da8b3113139a50297326231f26841c","source":{"kind":"arxiv","id":"1807.05997","version":1},"attestation_state":"computed","paper":{"title":"Noisy Private Information Retrieval: On Separability of Channel Coding and Information Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Karim Banawan, Sennur Ulukus","submitted_at":"2018-07-16T17:54:46Z","abstract_excerpt":"We consider the problem of noisy private information retrieval (NPIR) from $N$ non-communicating databases, each storing the same set of $M$ messages. In this model, the answer strings are not returned through noiseless bit pipes, but rather through \\emph{noisy} memoryless channels. We aim at characterizing the PIR capacity for this model as a function of the statistical information measures of the noisy channels such as entropy and mutual information. We derive a general upper bound for the retrieval rate in the form of a max-min optimization. We use the achievable schemes for the PIR problem"},"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":"1807.05997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-16T17:54:46Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"8ea2b2ce5d0ed054def98d1d9ad32446080c1ac7c5b7554e2e0a87eb38d1f0cb","abstract_canon_sha256":"b23425faca3d550a34f8f7d1b22a9686fdb6163b2eebed63df8b7bad735171c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:41.981302Z","signature_b64":"IacQqM1ZU43iKZ/qhvEp2V5losRL9eyYyQoOS829dfjlpJd7aJPouS8x7QFIG6Ir1/2DJAZVl2VjYiW6IbT0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c321a96950d3d89e2de98bb467bc1a1321da8b3113139a50297326231f26841c","last_reissued_at":"2026-05-18T00:10:41.980588Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:41.980588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Noisy Private Information Retrieval: On Separability of Channel Coding and Information Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Karim Banawan, Sennur Ulukus","submitted_at":"2018-07-16T17:54:46Z","abstract_excerpt":"We consider the problem of noisy private information retrieval (NPIR) from $N$ non-communicating databases, each storing the same set of $M$ messages. In this model, the answer strings are not returned through noiseless bit pipes, but rather through \\emph{noisy} memoryless channels. We aim at characterizing the PIR capacity for this model as a function of the statistical information measures of the noisy channels such as entropy and mutual information. We derive a general upper bound for the retrieval rate in the form of a max-min optimization. We use the achievable schemes for the PIR problem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05997","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":"1807.05997","created_at":"2026-05-18T00:10:41.980705+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.05997v1","created_at":"2026-05-18T00:10:41.980705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05997","created_at":"2026-05-18T00:10:41.980705+00:00"},{"alias_kind":"pith_short_12","alias_value":"YMQ2S2KQ2PMJ","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YMQ2S2KQ2PMJ4LPJ","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YMQ2S2KQ","created_at":"2026-05-18T12:33:04.347982+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/YMQ2S2KQ2PMJ4LPJRO2GPPA2CM","json":"https://pith.science/pith/YMQ2S2KQ2PMJ4LPJRO2GPPA2CM.json","graph_json":"https://pith.science/api/pith-number/YMQ2S2KQ2PMJ4LPJRO2GPPA2CM/graph.json","events_json":"https://pith.science/api/pith-number/YMQ2S2KQ2PMJ4LPJRO2GPPA2CM/events.json","paper":"https://pith.science/paper/YMQ2S2KQ"},"agent_actions":{"view_html":"https://pith.science/pith/YMQ2S2KQ2PMJ4LPJRO2GPPA2CM","download_json":"https://pith.science/pith/YMQ2S2KQ2PMJ4LPJRO2GPPA2CM.json","view_paper":"https://pith.science/paper/YMQ2S2KQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.05997&json=true","fetch_graph":"https://pith.science/api/pith-number/YMQ2S2KQ2PMJ4LPJRO2GPPA2CM/graph.json","fetch_events":"https://pith.science/api/pith-number/YMQ2S2KQ2PMJ4LPJRO2GPPA2CM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YMQ2S2KQ2PMJ4LPJRO2GPPA2CM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YMQ2S2KQ2PMJ4LPJRO2GPPA2CM/action/storage_attestation","attest_author":"https://pith.science/pith/YMQ2S2KQ2PMJ4LPJRO2GPPA2CM/action/author_attestation","sign_citation":"https://pith.science/pith/YMQ2S2KQ2PMJ4LPJRO2GPPA2CM/action/citation_signature","submit_replication":"https://pith.science/pith/YMQ2S2KQ2PMJ4LPJRO2GPPA2CM/action/replication_record"}},"created_at":"2026-05-18T00:10:41.980705+00:00","updated_at":"2026-05-18T00:10:41.980705+00:00"}