{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DM7BPZQ7F3Y654LECEY4K2QDQA","short_pith_number":"pith:DM7BPZQ7","schema_version":"1.0","canonical_sha256":"1b3e17e61f2ef1eef1641131c56a03800f4bc5d7e6db168dfa70fa9516d0c392","source":{"kind":"arxiv","id":"1806.08006","version":3},"attestation_state":"computed","paper":{"title":"Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Camilla Hollanti, David Karpuk, Oliver W. Gnilke, Ragnar Freij-Hollanti, Razane Tajeddine","submitted_at":"2018-06-20T22:00:44Z","abstract_excerpt":"The problem of Private Information Retrieval (PIR) from coded storage systems with colluding, byzantine, and unresponsive servers is considered. An explicit scheme using an $[n,k]$ Reed-Solomon storage code is designed, protecting against $t$-collusion and handling up to $b$ byzantine and $r$ unresponsive servers, when $n>k+t+2b+r-1$. This scheme achieves a PIR rate of $\\frac{n-r-(k+2b+t-1)}{n-r}$. In the case where the capacity is known, namely when $k=1$, it is asymptotically capacity-achieving as the number of files grows. Lastly, the scheme is adapted to symmetric PIR."},"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.08006","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-20T22:00:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5319b67ae874b6d0ea8991feb5ad0af0698d4e262ffa206a0c6a8a788ac49a48","abstract_canon_sha256":"f76704d358d4f8c3bc34014c404419c5ee95fab660c4491e4ad0c796cbc70180"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:28.526441Z","signature_b64":"hl3UNWLAcBtD3r6zegHuGHAY3/Pl6h0hbtr/pNdkJ/eHwsjdibWiq0i9SYhLvU1+9XGnq/+YBZCtgmZJdzJ8BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b3e17e61f2ef1eef1641131c56a03800f4bc5d7e6db168dfa70fa9516d0c392","last_reissued_at":"2026-05-18T00:06:28.525928Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:28.525928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Camilla Hollanti, David Karpuk, Oliver W. Gnilke, Ragnar Freij-Hollanti, Razane Tajeddine","submitted_at":"2018-06-20T22:00:44Z","abstract_excerpt":"The problem of Private Information Retrieval (PIR) from coded storage systems with colluding, byzantine, and unresponsive servers is considered. An explicit scheme using an $[n,k]$ Reed-Solomon storage code is designed, protecting against $t$-collusion and handling up to $b$ byzantine and $r$ unresponsive servers, when $n>k+t+2b+r-1$. This scheme achieves a PIR rate of $\\frac{n-r-(k+2b+t-1)}{n-r}$. In the case where the capacity is known, namely when $k=1$, it is asymptotically capacity-achieving as the number of files grows. Lastly, the scheme is adapted to symmetric PIR."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08006","kind":"arxiv","version":3},"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.08006","created_at":"2026-05-18T00:06:28.526020+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.08006v3","created_at":"2026-05-18T00:06:28.526020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08006","created_at":"2026-05-18T00:06:28.526020+00:00"},{"alias_kind":"pith_short_12","alias_value":"DM7BPZQ7F3Y6","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DM7BPZQ7F3Y654LE","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DM7BPZQ7","created_at":"2026-05-18T12:32:19.392346+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/DM7BPZQ7F3Y654LECEY4K2QDQA","json":"https://pith.science/pith/DM7BPZQ7F3Y654LECEY4K2QDQA.json","graph_json":"https://pith.science/api/pith-number/DM7BPZQ7F3Y654LECEY4K2QDQA/graph.json","events_json":"https://pith.science/api/pith-number/DM7BPZQ7F3Y654LECEY4K2QDQA/events.json","paper":"https://pith.science/paper/DM7BPZQ7"},"agent_actions":{"view_html":"https://pith.science/pith/DM7BPZQ7F3Y654LECEY4K2QDQA","download_json":"https://pith.science/pith/DM7BPZQ7F3Y654LECEY4K2QDQA.json","view_paper":"https://pith.science/paper/DM7BPZQ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.08006&json=true","fetch_graph":"https://pith.science/api/pith-number/DM7BPZQ7F3Y654LECEY4K2QDQA/graph.json","fetch_events":"https://pith.science/api/pith-number/DM7BPZQ7F3Y654LECEY4K2QDQA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DM7BPZQ7F3Y654LECEY4K2QDQA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DM7BPZQ7F3Y654LECEY4K2QDQA/action/storage_attestation","attest_author":"https://pith.science/pith/DM7BPZQ7F3Y654LECEY4K2QDQA/action/author_attestation","sign_citation":"https://pith.science/pith/DM7BPZQ7F3Y654LECEY4K2QDQA/action/citation_signature","submit_replication":"https://pith.science/pith/DM7BPZQ7F3Y654LECEY4K2QDQA/action/replication_record"}},"created_at":"2026-05-18T00:06:28.526020+00:00","updated_at":"2026-05-18T00:06:28.526020+00:00"}