{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ERNH3PXJ3FCP4GCFFOZJXG7X64","short_pith_number":"pith:ERNH3PXJ","canonical_record":{"source":{"id":"1806.01253","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-04T17:45:07Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"7b127e7db60fabdf6793229983dd8f431fdf11bffa599bad691e31ac79e19abd","abstract_canon_sha256":"04700dd75f5aa3bb7ebd9efadcb2c7e309366e9cd0f7777b52960917603bb678"},"schema_version":"1.0"},"canonical_sha256":"245a7dbee9d944fe18452bb29b9bf7f7362bea9456234a226769b8193277af15","source":{"kind":"arxiv","id":"1806.01253","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01253","created_at":"2026-05-18T00:14:16Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01253v1","created_at":"2026-05-18T00:14:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01253","created_at":"2026-05-18T00:14:16Z"},{"alias_kind":"pith_short_12","alias_value":"ERNH3PXJ3FCP","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"ERNH3PXJ3FCP4GCF","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"ERNH3PXJ","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ERNH3PXJ3FCP4GCFFOZJXG7X64","target":"record","payload":{"canonical_record":{"source":{"id":"1806.01253","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-04T17:45:07Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"7b127e7db60fabdf6793229983dd8f431fdf11bffa599bad691e31ac79e19abd","abstract_canon_sha256":"04700dd75f5aa3bb7ebd9efadcb2c7e309366e9cd0f7777b52960917603bb678"},"schema_version":"1.0"},"canonical_sha256":"245a7dbee9d944fe18452bb29b9bf7f7362bea9456234a226769b8193277af15","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:16.993787Z","signature_b64":"s2iiSOLMkkHBnASQD+57Xipbl4daTIus/Cp0pbJ5pX0sZg9HflEkfcHECiNXh11BgURVp0uL5Va8tkmEcx31AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"245a7dbee9d944fe18452bb29b9bf7f7362bea9456234a226769b8193277af15","last_reissued_at":"2026-05-18T00:14:16.993277Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:16.993277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.01253","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:14:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YskibtA5YokoP+luPkLzOKvhL3nLPLs9eiq/BVy33FmYA+2B0KggPSEapYvvdneqiz5hbDAAH9MFQKV7Nqr1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:08:43.915076Z"},"content_sha256":"86766408bbd54313078951a77567fb08d79a6d1919f5618b43480d9a1e33e03e","schema_version":"1.0","event_id":"sha256:86766408bbd54313078951a77567fb08d79a6d1919f5618b43480d9a1e33e03e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ERNH3PXJ3FCP4GCFFOZJXG7X64","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Capacity of Private Information Retrieval with Private Side Information Under Storage Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Sennur Ulukus, Yi-Peng Wei","submitted_at":"2018-06-04T17:45:07Z","abstract_excerpt":"We consider the problem of private information retrieval (PIR) of a single message out of $K$ messages from $N$ replicated and non-colluding databases where a cache-enabled user (retriever) of cache-size $S$ possesses side information in the form of uncoded portions of the messages that are unknown to the databases. The identities of these side information messages need to be kept private from the databases, i.e., we consider PIR with private side information (PSI). We characterize the optimal normalized download cost for this PIR-PSI problem under the storage constraint $S$ as $D^*=1+\\frac{1}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01253","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:14:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"52NMVdQTuzKoaFpeWVYcYJri7Aos2BaNcsYFGQESn5QX3Ovfoj1fG9wIozZoEFKqJ0dh6mnSYJrT5qfGaiECCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:08:43.915690Z"},"content_sha256":"b62d9cf87db85f2093167f4e71acf3d089c5c8dac029e466bd0471d7495d5f02","schema_version":"1.0","event_id":"sha256:b62d9cf87db85f2093167f4e71acf3d089c5c8dac029e466bd0471d7495d5f02"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ERNH3PXJ3FCP4GCFFOZJXG7X64/bundle.json","state_url":"https://pith.science/pith/ERNH3PXJ3FCP4GCFFOZJXG7X64/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ERNH3PXJ3FCP4GCFFOZJXG7X64/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-06T20:08:43Z","links":{"resolver":"https://pith.science/pith/ERNH3PXJ3FCP4GCFFOZJXG7X64","bundle":"https://pith.science/pith/ERNH3PXJ3FCP4GCFFOZJXG7X64/bundle.json","state":"https://pith.science/pith/ERNH3PXJ3FCP4GCFFOZJXG7X64/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ERNH3PXJ3FCP4GCFFOZJXG7X64/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ERNH3PXJ3FCP4GCFFOZJXG7X64","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":"04700dd75f5aa3bb7ebd9efadcb2c7e309366e9cd0f7777b52960917603bb678","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-04T17:45:07Z","title_canon_sha256":"7b127e7db60fabdf6793229983dd8f431fdf11bffa599bad691e31ac79e19abd"},"schema_version":"1.0","source":{"id":"1806.01253","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01253","created_at":"2026-05-18T00:14:16Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01253v1","created_at":"2026-05-18T00:14:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01253","created_at":"2026-05-18T00:14:16Z"},{"alias_kind":"pith_short_12","alias_value":"ERNH3PXJ3FCP","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"ERNH3PXJ3FCP4GCF","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"ERNH3PXJ","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:b62d9cf87db85f2093167f4e71acf3d089c5c8dac029e466bd0471d7495d5f02","target":"graph","created_at":"2026-05-18T00:14:16Z","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 private information retrieval (PIR) of a single message out of $K$ messages from $N$ replicated and non-colluding databases where a cache-enabled user (retriever) of cache-size $S$ possesses side information in the form of uncoded portions of the messages that are unknown to the databases. The identities of these side information messages need to be kept private from the databases, i.e., we consider PIR with private side information (PSI). We characterize the optimal normalized download cost for this PIR-PSI problem under the storage constraint $S$ as $D^*=1+\\frac{1}","authors_text":"Sennur Ulukus, Yi-Peng Wei","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-04T17:45:07Z","title":"The Capacity of Private Information Retrieval with Private Side Information Under Storage Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01253","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:86766408bbd54313078951a77567fb08d79a6d1919f5618b43480d9a1e33e03e","target":"record","created_at":"2026-05-18T00:14:16Z","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":"04700dd75f5aa3bb7ebd9efadcb2c7e309366e9cd0f7777b52960917603bb678","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-04T17:45:07Z","title_canon_sha256":"7b127e7db60fabdf6793229983dd8f431fdf11bffa599bad691e31ac79e19abd"},"schema_version":"1.0","source":{"id":"1806.01253","kind":"arxiv","version":1}},"canonical_sha256":"245a7dbee9d944fe18452bb29b9bf7f7362bea9456234a226769b8193277af15","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"245a7dbee9d944fe18452bb29b9bf7f7362bea9456234a226769b8193277af15","first_computed_at":"2026-05-18T00:14:16.993277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:16.993277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s2iiSOLMkkHBnASQD+57Xipbl4daTIus/Cp0pbJ5pX0sZg9HflEkfcHECiNXh11BgURVp0uL5Va8tkmEcx31AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:16.993787Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.01253","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86766408bbd54313078951a77567fb08d79a6d1919f5618b43480d9a1e33e03e","sha256:b62d9cf87db85f2093167f4e71acf3d089c5c8dac029e466bd0471d7495d5f02"],"state_sha256":"7735c88dde8b9236f2ea64914329b8d549352a82993cb0a1051651ee0076fe25"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"73HP0/iUb5auJ0LKEIGItKuufo5+Ra/JCpEwM+o+WKHaWsbK3mlq+ll0paRrUNyAcmfYmJORO37zEr4r6JE8DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:08:43.918776Z","bundle_sha256":"4af3b0b171b000914bccbda90645bfcf1dc3e9c3ca24eef20d181739672d2da4"}}