{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QSYKATK2CQKE5LOTGAKNVUZSCC","short_pith_number":"pith:QSYKATK2","schema_version":"1.0","canonical_sha256":"84b0a04d5a14144eadd33014dad332109fd8ac9fb29e78b69be9278998efa21b","source":{"kind":"arxiv","id":"1706.07035","version":1},"attestation_state":"computed","paper":{"title":"The Capacity of Cache Aided Private Information Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"Ravi Tandon","submitted_at":"2017-06-21T17:56:11Z","abstract_excerpt":"The problem of cache enabled private information retrieval (PIR) is considered in which a user wishes to privately retrieve one out of $K$ messages, each of size $L$ bits from $N$ distributed databases. The user has a local cache of storage $SL$ bits which can be used to store any function of the $K$ messages. The main contribution of this work is the exact characterization of the capacity of cache aided PIR as a function of the storage parameter $S$. In particular, for a given cache storage parameter $S$, the information-theoretically optimal download cost $D^{*}(S)/L$ (or the inverse of capa"},"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":"1706.07035","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-21T17:56:11Z","cross_cats_sorted":["cs.CR","cs.DC","math.IT"],"title_canon_sha256":"3dc6a06720496a26e4c0bd58e9badb2473d270ff72841c08dba98c290c3cab9a","abstract_canon_sha256":"de609d5ba3dc64ae278c5a64e0af23b478d8d3aa592b60f557296da858badadf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:56.270160Z","signature_b64":"RYYUrZatSxiaBV5iJSAUjng9fuZv96BSoS6U4+Enq+LCWA6MZWJBnoZwKomhU3PuhQaUogONFuHTO+rKYbZYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84b0a04d5a14144eadd33014dad332109fd8ac9fb29e78b69be9278998efa21b","last_reissued_at":"2026-05-18T00:41:56.269509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:56.269509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Capacity of Cache Aided Private Information Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"Ravi Tandon","submitted_at":"2017-06-21T17:56:11Z","abstract_excerpt":"The problem of cache enabled private information retrieval (PIR) is considered in which a user wishes to privately retrieve one out of $K$ messages, each of size $L$ bits from $N$ distributed databases. The user has a local cache of storage $SL$ bits which can be used to store any function of the $K$ messages. The main contribution of this work is the exact characterization of the capacity of cache aided PIR as a function of the storage parameter $S$. In particular, for a given cache storage parameter $S$, the information-theoretically optimal download cost $D^{*}(S)/L$ (or the inverse of capa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07035","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":"1706.07035","created_at":"2026-05-18T00:41:56.269603+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.07035v1","created_at":"2026-05-18T00:41:56.269603+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07035","created_at":"2026-05-18T00:41:56.269603+00:00"},{"alias_kind":"pith_short_12","alias_value":"QSYKATK2CQKE","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QSYKATK2CQKE5LOT","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QSYKATK2","created_at":"2026-05-18T12:31:39.905425+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.06957","citing_title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QSYKATK2CQKE5LOTGAKNVUZSCC","json":"https://pith.science/pith/QSYKATK2CQKE5LOTGAKNVUZSCC.json","graph_json":"https://pith.science/api/pith-number/QSYKATK2CQKE5LOTGAKNVUZSCC/graph.json","events_json":"https://pith.science/api/pith-number/QSYKATK2CQKE5LOTGAKNVUZSCC/events.json","paper":"https://pith.science/paper/QSYKATK2"},"agent_actions":{"view_html":"https://pith.science/pith/QSYKATK2CQKE5LOTGAKNVUZSCC","download_json":"https://pith.science/pith/QSYKATK2CQKE5LOTGAKNVUZSCC.json","view_paper":"https://pith.science/paper/QSYKATK2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.07035&json=true","fetch_graph":"https://pith.science/api/pith-number/QSYKATK2CQKE5LOTGAKNVUZSCC/graph.json","fetch_events":"https://pith.science/api/pith-number/QSYKATK2CQKE5LOTGAKNVUZSCC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QSYKATK2CQKE5LOTGAKNVUZSCC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QSYKATK2CQKE5LOTGAKNVUZSCC/action/storage_attestation","attest_author":"https://pith.science/pith/QSYKATK2CQKE5LOTGAKNVUZSCC/action/author_attestation","sign_citation":"https://pith.science/pith/QSYKATK2CQKE5LOTGAKNVUZSCC/action/citation_signature","submit_replication":"https://pith.science/pith/QSYKATK2CQKE5LOTGAKNVUZSCC/action/replication_record"}},"created_at":"2026-05-18T00:41:56.269603+00:00","updated_at":"2026-05-18T00:41:56.269603+00:00"}