{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GA4IDJFQ7YCQZMDMWP7JT44R6B","short_pith_number":"pith:GA4IDJFQ","schema_version":"1.0","canonical_sha256":"303881a4b0fe050cb06cb3fe99f391f057d2333198c94665ff0922c61306e7f2","source":{"kind":"arxiv","id":"1903.06921","version":1},"attestation_state":"computed","paper":{"title":"A new Capacity-Achieving Private Information Retrieval Scheme with (Almost) Optimal File Length for Coded Servers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chao Qi, Jinbao Zhu, Qifa Yan, Xiaohu Tang","submitted_at":"2019-03-16T13:48:31Z","abstract_excerpt":"In a distributed storage system, private information retrieval (PIR) guarantees that a user retrieves one file from the system without revealing any information about the identity of its interested file to any individual server. In this paper, we investigate $(N,K,M)$ coded sever model of PIR, where each of $M$ files is distributed to the $N$ servers in the form of $(N,K)$ maximum distance separable (MDS) code for some $N>K$ and $M>1$. As a result, we propose a new capacity-achieving $(N,K,M)$ coded linear PIR scheme such that it can be implemented with file length $\\frac{K(N-K)}{\\gcd(N,K)}$, "},"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":"1903.06921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-16T13:48:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"14a43e7753a2087b8fb736f5e9bce3fd4bedd8b41b99b28593898bbe1158c937","abstract_canon_sha256":"da0cf8b2e34ca9787f9c379ba073d0c8ae8a8e696abde8902324c8963f1ccc61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:08.599909Z","signature_b64":"dgbUlXNT37ThMOIULpD0LF9sFYVTfeomclNVTFzovTPY4/RQTHx+7AQOQ5E0VJQr0mwsiO2xXH1X9B7KOki5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"303881a4b0fe050cb06cb3fe99f391f057d2333198c94665ff0922c61306e7f2","last_reissued_at":"2026-05-17T23:51:08.599426Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:08.599426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new Capacity-Achieving Private Information Retrieval Scheme with (Almost) Optimal File Length for Coded Servers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chao Qi, Jinbao Zhu, Qifa Yan, Xiaohu Tang","submitted_at":"2019-03-16T13:48:31Z","abstract_excerpt":"In a distributed storage system, private information retrieval (PIR) guarantees that a user retrieves one file from the system without revealing any information about the identity of its interested file to any individual server. In this paper, we investigate $(N,K,M)$ coded sever model of PIR, where each of $M$ files is distributed to the $N$ servers in the form of $(N,K)$ maximum distance separable (MDS) code for some $N>K$ and $M>1$. As a result, we propose a new capacity-achieving $(N,K,M)$ coded linear PIR scheme such that it can be implemented with file length $\\frac{K(N-K)}{\\gcd(N,K)}$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06921","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":"1903.06921","created_at":"2026-05-17T23:51:08.599494+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.06921v1","created_at":"2026-05-17T23:51:08.599494+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06921","created_at":"2026-05-17T23:51:08.599494+00:00"},{"alias_kind":"pith_short_12","alias_value":"GA4IDJFQ7YCQ","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GA4IDJFQ7YCQZMDM","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GA4IDJFQ","created_at":"2026-05-18T12:33:18.533446+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/GA4IDJFQ7YCQZMDMWP7JT44R6B","json":"https://pith.science/pith/GA4IDJFQ7YCQZMDMWP7JT44R6B.json","graph_json":"https://pith.science/api/pith-number/GA4IDJFQ7YCQZMDMWP7JT44R6B/graph.json","events_json":"https://pith.science/api/pith-number/GA4IDJFQ7YCQZMDMWP7JT44R6B/events.json","paper":"https://pith.science/paper/GA4IDJFQ"},"agent_actions":{"view_html":"https://pith.science/pith/GA4IDJFQ7YCQZMDMWP7JT44R6B","download_json":"https://pith.science/pith/GA4IDJFQ7YCQZMDMWP7JT44R6B.json","view_paper":"https://pith.science/paper/GA4IDJFQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.06921&json=true","fetch_graph":"https://pith.science/api/pith-number/GA4IDJFQ7YCQZMDMWP7JT44R6B/graph.json","fetch_events":"https://pith.science/api/pith-number/GA4IDJFQ7YCQZMDMWP7JT44R6B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GA4IDJFQ7YCQZMDMWP7JT44R6B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GA4IDJFQ7YCQZMDMWP7JT44R6B/action/storage_attestation","attest_author":"https://pith.science/pith/GA4IDJFQ7YCQZMDMWP7JT44R6B/action/author_attestation","sign_citation":"https://pith.science/pith/GA4IDJFQ7YCQZMDMWP7JT44R6B/action/citation_signature","submit_replication":"https://pith.science/pith/GA4IDJFQ7YCQZMDMWP7JT44R6B/action/replication_record"}},"created_at":"2026-05-17T23:51:08.599494+00:00","updated_at":"2026-05-17T23:51:08.599494+00:00"}