{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GL446AUIJA7FF7KAEWNFBGBKXJ","short_pith_number":"pith:GL446AUI","schema_version":"1.0","canonical_sha256":"32f9cf0288483e52fd40259a50982aba4b4fee824409c39cf4626877cdb0ac4a","source":{"kind":"arxiv","id":"1808.07536","version":2},"attestation_state":"computed","paper":{"title":"Capacity-Achieving Private Information Retrieval Codes with Optimal Message Size and Upload Cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Chao Tian, Hua Sun, Jun Chen","submitted_at":"2018-08-22T19:34:22Z","abstract_excerpt":"We propose a new capacity-achieving code for the private information retrieval (PIR) problem, and show that it has the minimum message size (being one less than the number of servers) and the minimum upload cost (being roughly linear in the number of messages) among a general class of capacity-achieving codes, and in particular, among all capacity-achieving linear codes. Different from existing code constructions, the proposed code is asymmetric, and this asymmetry appears to be the key factor leading to the optimal message size and the optimal upload cost. The converse results on the message "},"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":"1808.07536","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-22T19:34:22Z","cross_cats_sorted":["cs.CR","cs.DS","math.IT"],"title_canon_sha256":"da771d5991a1244ef7d14d88c457e0361a6b120997a25d5be884c56e6aa5f964","abstract_canon_sha256":"cd06a870b67fb708404994f998f229423101378e4b0e01a790d7f3f5648a7171"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:05.452330Z","signature_b64":"KFpqvoHOWYmjvJQNGYagQjSWlFJ2VP7dyMs1eE8mi7LPMcCpgQXKXSRHLEwbngaIJhAt22tmQFek27CVawS/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32f9cf0288483e52fd40259a50982aba4b4fee824409c39cf4626877cdb0ac4a","last_reissued_at":"2026-05-17T23:52:05.451826Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:05.451826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity-Achieving Private Information Retrieval Codes with Optimal Message Size and Upload Cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Chao Tian, Hua Sun, Jun Chen","submitted_at":"2018-08-22T19:34:22Z","abstract_excerpt":"We propose a new capacity-achieving code for the private information retrieval (PIR) problem, and show that it has the minimum message size (being one less than the number of servers) and the minimum upload cost (being roughly linear in the number of messages) among a general class of capacity-achieving codes, and in particular, among all capacity-achieving linear codes. Different from existing code constructions, the proposed code is asymmetric, and this asymmetry appears to be the key factor leading to the optimal message size and the optimal upload cost. The converse results on the message "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.07536","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":"1808.07536","created_at":"2026-05-17T23:52:05.451905+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.07536v2","created_at":"2026-05-17T23:52:05.451905+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07536","created_at":"2026-05-17T23:52:05.451905+00:00"},{"alias_kind":"pith_short_12","alias_value":"GL446AUIJA7F","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GL446AUIJA7FF7KA","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GL446AUI","created_at":"2026-05-18T12:32:25.280505+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":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GL446AUIJA7FF7KAEWNFBGBKXJ","json":"https://pith.science/pith/GL446AUIJA7FF7KAEWNFBGBKXJ.json","graph_json":"https://pith.science/api/pith-number/GL446AUIJA7FF7KAEWNFBGBKXJ/graph.json","events_json":"https://pith.science/api/pith-number/GL446AUIJA7FF7KAEWNFBGBKXJ/events.json","paper":"https://pith.science/paper/GL446AUI"},"agent_actions":{"view_html":"https://pith.science/pith/GL446AUIJA7FF7KAEWNFBGBKXJ","download_json":"https://pith.science/pith/GL446AUIJA7FF7KAEWNFBGBKXJ.json","view_paper":"https://pith.science/paper/GL446AUI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.07536&json=true","fetch_graph":"https://pith.science/api/pith-number/GL446AUIJA7FF7KAEWNFBGBKXJ/graph.json","fetch_events":"https://pith.science/api/pith-number/GL446AUIJA7FF7KAEWNFBGBKXJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GL446AUIJA7FF7KAEWNFBGBKXJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GL446AUIJA7FF7KAEWNFBGBKXJ/action/storage_attestation","attest_author":"https://pith.science/pith/GL446AUIJA7FF7KAEWNFBGBKXJ/action/author_attestation","sign_citation":"https://pith.science/pith/GL446AUIJA7FF7KAEWNFBGBKXJ/action/citation_signature","submit_replication":"https://pith.science/pith/GL446AUIJA7FF7KAEWNFBGBKXJ/action/replication_record"}},"created_at":"2026-05-17T23:52:05.451905+00:00","updated_at":"2026-05-17T23:52:05.451905+00:00"}