{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TSHXEZUPBD33ZD3ZRLMHAUSGUK","short_pith_number":"pith:TSHXEZUP","schema_version":"1.0","canonical_sha256":"9c8f72668f08f7bc8f798ad8705246a2b051e8eaf46e4a9b02f3055015f5cb88","source":{"kind":"arxiv","id":"1805.04104","version":2},"attestation_state":"computed","paper":{"title":"The Capacity of Private Information Retrieval from Uncoded Storage Constrained Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DB","cs.IR","math.IT"],"primary_cat":"cs.IT","authors_text":"Deepak Kumar, Mohamed Adel Attia, Ravi Tandon","submitted_at":"2018-05-10T17:59:39Z","abstract_excerpt":"Private information retrieval (PIR) allows a user to retrieve a desired message from a set of databases without revealing the identity of the desired message. The replicated databases scenario was considered by Sun and Jafar, 2016, where $N$ databases can store the same $K$ messages completely. A PIR scheme was developed to achieve the optimal download cost given by $\\left(1+ \\frac{1}{N}+ \\frac{1}{N^{2}}+ \\cdots + \\frac{1}{N^{K-1}}\\right)$. In this work, we consider the problem of PIR from storage constrained databases. Each database has a storage capacity of $\\mu KL$ bits, where $L$ is the si"},"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":"1805.04104","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-10T17:59:39Z","cross_cats_sorted":["cs.CR","cs.DB","cs.IR","math.IT"],"title_canon_sha256":"002eb91b57bd9b1b4664fbc00d61470a83ddf08ac54ceeb2445295dc31fa1eaf","abstract_canon_sha256":"5651942cd84ad3f357e2789c2300be43fe1f0fa950600a9b73af7177f140cb87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:25.142904Z","signature_b64":"Xn1KOsZQI9TtisHu0SABObRIBuC2MFU6k5N0YNAAPsgjOz5p/EAkXmFs4wAhUROfeIIWU+E1Ev1g5hFmSmnMCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c8f72668f08f7bc8f798ad8705246a2b051e8eaf46e4a9b02f3055015f5cb88","last_reissued_at":"2026-05-18T00:02:25.142232Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:25.142232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Capacity of Private Information Retrieval from Uncoded Storage Constrained Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DB","cs.IR","math.IT"],"primary_cat":"cs.IT","authors_text":"Deepak Kumar, Mohamed Adel Attia, Ravi Tandon","submitted_at":"2018-05-10T17:59:39Z","abstract_excerpt":"Private information retrieval (PIR) allows a user to retrieve a desired message from a set of databases without revealing the identity of the desired message. The replicated databases scenario was considered by Sun and Jafar, 2016, where $N$ databases can store the same $K$ messages completely. A PIR scheme was developed to achieve the optimal download cost given by $\\left(1+ \\frac{1}{N}+ \\frac{1}{N^{2}}+ \\cdots + \\frac{1}{N^{K-1}}\\right)$. In this work, we consider the problem of PIR from storage constrained databases. Each database has a storage capacity of $\\mu KL$ bits, where $L$ is the si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04104","kind":"arxiv","version":2},"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":"1805.04104","created_at":"2026-05-18T00:02:25.142332+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.04104v2","created_at":"2026-05-18T00:02:25.142332+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04104","created_at":"2026-05-18T00:02:25.142332+00:00"},{"alias_kind":"pith_short_12","alias_value":"TSHXEZUPBD33","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"TSHXEZUPBD33ZD3Z","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"TSHXEZUP","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.11366","citing_title":"Improved Storage for Efficient Private Information Retrieval","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TSHXEZUPBD33ZD3ZRLMHAUSGUK","json":"https://pith.science/pith/TSHXEZUPBD33ZD3ZRLMHAUSGUK.json","graph_json":"https://pith.science/api/pith-number/TSHXEZUPBD33ZD3ZRLMHAUSGUK/graph.json","events_json":"https://pith.science/api/pith-number/TSHXEZUPBD33ZD3ZRLMHAUSGUK/events.json","paper":"https://pith.science/paper/TSHXEZUP"},"agent_actions":{"view_html":"https://pith.science/pith/TSHXEZUPBD33ZD3ZRLMHAUSGUK","download_json":"https://pith.science/pith/TSHXEZUPBD33ZD3ZRLMHAUSGUK.json","view_paper":"https://pith.science/paper/TSHXEZUP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.04104&json=true","fetch_graph":"https://pith.science/api/pith-number/TSHXEZUPBD33ZD3ZRLMHAUSGUK/graph.json","fetch_events":"https://pith.science/api/pith-number/TSHXEZUPBD33ZD3ZRLMHAUSGUK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TSHXEZUPBD33ZD3ZRLMHAUSGUK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TSHXEZUPBD33ZD3ZRLMHAUSGUK/action/storage_attestation","attest_author":"https://pith.science/pith/TSHXEZUPBD33ZD3ZRLMHAUSGUK/action/author_attestation","sign_citation":"https://pith.science/pith/TSHXEZUPBD33ZD3ZRLMHAUSGUK/action/citation_signature","submit_replication":"https://pith.science/pith/TSHXEZUPBD33ZD3ZRLMHAUSGUK/action/replication_record"}},"created_at":"2026-05-18T00:02:25.142332+00:00","updated_at":"2026-05-18T00:02:25.142332+00:00"}