{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ERNH3PXJ3FCP4GCFFOZJXG7X64","short_pith_number":"pith:ERNH3PXJ","schema_version":"1.0","canonical_sha256":"245a7dbee9d944fe18452bb29b9bf7f7362bea9456234a226769b8193277af15","source":{"kind":"arxiv","id":"1806.01253","version":1},"attestation_state":"computed","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}"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.01253","created_at":"2026-05-18T00:14:16.993366+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.01253v1","created_at":"2026-05-18T00:14:16.993366+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01253","created_at":"2026-05-18T00:14:16.993366+00:00"},{"alias_kind":"pith_short_12","alias_value":"ERNH3PXJ3FCP","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"ERNH3PXJ3FCP4GCF","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"ERNH3PXJ","created_at":"2026-05-18T12:32:22.470017+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/ERNH3PXJ3FCP4GCFFOZJXG7X64","json":"https://pith.science/pith/ERNH3PXJ3FCP4GCFFOZJXG7X64.json","graph_json":"https://pith.science/api/pith-number/ERNH3PXJ3FCP4GCFFOZJXG7X64/graph.json","events_json":"https://pith.science/api/pith-number/ERNH3PXJ3FCP4GCFFOZJXG7X64/events.json","paper":"https://pith.science/paper/ERNH3PXJ"},"agent_actions":{"view_html":"https://pith.science/pith/ERNH3PXJ3FCP4GCFFOZJXG7X64","download_json":"https://pith.science/pith/ERNH3PXJ3FCP4GCFFOZJXG7X64.json","view_paper":"https://pith.science/paper/ERNH3PXJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.01253&json=true","fetch_graph":"https://pith.science/api/pith-number/ERNH3PXJ3FCP4GCFFOZJXG7X64/graph.json","fetch_events":"https://pith.science/api/pith-number/ERNH3PXJ3FCP4GCFFOZJXG7X64/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ERNH3PXJ3FCP4GCFFOZJXG7X64/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ERNH3PXJ3FCP4GCFFOZJXG7X64/action/storage_attestation","attest_author":"https://pith.science/pith/ERNH3PXJ3FCP4GCFFOZJXG7X64/action/author_attestation","sign_citation":"https://pith.science/pith/ERNH3PXJ3FCP4GCFFOZJXG7X64/action/citation_signature","submit_replication":"https://pith.science/pith/ERNH3PXJ3FCP4GCFFOZJXG7X64/action/replication_record"}},"created_at":"2026-05-18T00:14:16.993366+00:00","updated_at":"2026-05-18T00:14:16.993366+00:00"}