{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YMQ2S2KQ2PMJ4LPJRO2GPPA2CM","short_pith_number":"pith:YMQ2S2KQ","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"},"canonical_sha256":"c321a96950d3d89e2de98bb467bc1a1321da8b3113139a50297326231f26841c","source":{"kind":"arxiv","id":"1807.05997","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05997","created_at":"2026-05-18T00:10:41Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05997v1","created_at":"2026-05-18T00:10:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05997","created_at":"2026-05-18T00:10:41Z"},{"alias_kind":"pith_short_12","alias_value":"YMQ2S2KQ2PMJ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YMQ2S2KQ2PMJ4LPJ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YMQ2S2KQ","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YMQ2S2KQ2PMJ4LPJRO2GPPA2CM","target":"record","payload":{"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"},"canonical_sha256":"c321a96950d3d89e2de98bb467bc1a1321da8b3113139a50297326231f26841c","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"},"source_kind":"arxiv","source_id":"1807.05997","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:10:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c3tg/chkfgKOm11UCwcw21PN3UZ7EOWONXwHcv7Na4XhuX1dWfs2nOWER6XxI4fp4wCpZrtAEoN8Vw4QJO2wAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:01:42.416008Z"},"content_sha256":"fb9764b02c4f964c7ff6f40825bbda2a842c25dfb6eb95245828680f588a3077","schema_version":"1.0","event_id":"sha256:fb9764b02c4f964c7ff6f40825bbda2a842c25dfb6eb95245828680f588a3077"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YMQ2S2KQ2PMJ4LPJRO2GPPA2CM","target":"graph","payload":{"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"},"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:10:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bys4Obh+pX9pXdoFY18dumi81h7SHtLpSpZdKKjLHwhPO9Qz41i1qfqiSkw0loV+TgZYQl8vXTcOpsMS2NYJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:01:42.416713Z"},"content_sha256":"fed35cfbd96e6c5845b5be008eeb3c76f5fe568a17ad66372cb6801a72079501","schema_version":"1.0","event_id":"sha256:fed35cfbd96e6c5845b5be008eeb3c76f5fe568a17ad66372cb6801a72079501"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YMQ2S2KQ2PMJ4LPJRO2GPPA2CM/bundle.json","state_url":"https://pith.science/pith/YMQ2S2KQ2PMJ4LPJRO2GPPA2CM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YMQ2S2KQ2PMJ4LPJRO2GPPA2CM/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-09T12:01:42Z","links":{"resolver":"https://pith.science/pith/YMQ2S2KQ2PMJ4LPJRO2GPPA2CM","bundle":"https://pith.science/pith/YMQ2S2KQ2PMJ4LPJRO2GPPA2CM/bundle.json","state":"https://pith.science/pith/YMQ2S2KQ2PMJ4LPJRO2GPPA2CM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YMQ2S2KQ2PMJ4LPJRO2GPPA2CM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YMQ2S2KQ2PMJ4LPJRO2GPPA2CM","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":"b23425faca3d550a34f8f7d1b22a9686fdb6163b2eebed63df8b7bad735171c8","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-16T17:54:46Z","title_canon_sha256":"8ea2b2ce5d0ed054def98d1d9ad32446080c1ac7c5b7554e2e0a87eb38d1f0cb"},"schema_version":"1.0","source":{"id":"1807.05997","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05997","created_at":"2026-05-18T00:10:41Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05997v1","created_at":"2026-05-18T00:10:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05997","created_at":"2026-05-18T00:10:41Z"},{"alias_kind":"pith_short_12","alias_value":"YMQ2S2KQ2PMJ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YMQ2S2KQ2PMJ4LPJ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YMQ2S2KQ","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:fed35cfbd96e6c5845b5be008eeb3c76f5fe568a17ad66372cb6801a72079501","target":"graph","created_at":"2026-05-18T00:10:41Z","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 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","authors_text":"Karim Banawan, Sennur Ulukus","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-16T17:54:46Z","title":"Noisy Private Information Retrieval: On Separability of Channel Coding and Information Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05997","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:fb9764b02c4f964c7ff6f40825bbda2a842c25dfb6eb95245828680f588a3077","target":"record","created_at":"2026-05-18T00:10:41Z","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":"b23425faca3d550a34f8f7d1b22a9686fdb6163b2eebed63df8b7bad735171c8","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-16T17:54:46Z","title_canon_sha256":"8ea2b2ce5d0ed054def98d1d9ad32446080c1ac7c5b7554e2e0a87eb38d1f0cb"},"schema_version":"1.0","source":{"id":"1807.05997","kind":"arxiv","version":1}},"canonical_sha256":"c321a96950d3d89e2de98bb467bc1a1321da8b3113139a50297326231f26841c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c321a96950d3d89e2de98bb467bc1a1321da8b3113139a50297326231f26841c","first_computed_at":"2026-05-18T00:10:41.980588Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:41.980588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IacQqM1ZU43iKZ/qhvEp2V5losRL9eyYyQoOS829dfjlpJd7aJPouS8x7QFIG6Ir1/2DJAZVl2VjYiW6IbT0BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:41.981302Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.05997","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb9764b02c4f964c7ff6f40825bbda2a842c25dfb6eb95245828680f588a3077","sha256:fed35cfbd96e6c5845b5be008eeb3c76f5fe568a17ad66372cb6801a72079501"],"state_sha256":"111fab5a4a08a467bb98b145511b5c167647f85aac248c8b6b0a15aa1faf2506"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xUnPobgCGfHOLaQvGxu7CJxXhfKO1y/msYTguw8tcbUFCC8W27WkiI0L1s/i5R+BaXiQNhCz+NIvMNgGfgEkDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T12:01:42.420798Z","bundle_sha256":"54b30cd032139c6e493f843e576ac0b1edca4beaff876efab2d49637018dbdc7"}}