{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JF4YEXHFEH5SQX7N3WIFWR653W","short_pith_number":"pith:JF4YEXHF","schema_version":"1.0","canonical_sha256":"4979825ce521fb285feddd905b47dddd9690d8f66f56d435025828da6ec96a49","source":{"kind":"arxiv","id":"1802.03731","version":2},"attestation_state":"computed","paper":{"title":"Robust Private Information Retrieval from Coded Systems with Byzantine and Colluding 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-02-11T12:17:20Z","abstract_excerpt":"A private information retrieval (PIR) scheme on coded storage systems with colluding, byzantine, and non-responsive servers is presented. Furthermore, the scheme can also be used for symmetric PIR in the same setting.\n  An explicit scheme using an $[n,k]$ generalized Reed-Solomon storage code is designed, protecting against $t$-collusion and handling up to $b$ byzantine and $r$ non-responsive servers, when $n\\geq n'= (\\nu +1) k+t+2b+r-1$, for some integer $\\nu \\geq 1$. This scheme achieves a PIR rate of $1-\\frac{k+2b+t+r-1}{n'}$. In the case where the capacity is known, namely when $k=1$, it i"},"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":"1802.03731","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-11T12:17:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"84fecd4ece2a873ab86f3fa3222a9957596d5ed68647449b7872b990bb9eb11e","abstract_canon_sha256":"63841ff17aa06c883b7d13e3cdcbb3cf2164926b6921528098f011776daa1577"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:30.740240Z","signature_b64":"BGkgDeCIR7Qlka8dlAbbKS04Ln8ZHdBPH9oouywbfiirKbtKrYKvtuUcP3wNS0VhrNHV96XcK0cF2gysNpUnBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4979825ce521fb285feddd905b47dddd9690d8f66f56d435025828da6ec96a49","last_reissued_at":"2026-05-18T00:06:30.739821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:30.739821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Private Information Retrieval from Coded Systems with Byzantine and Colluding 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-02-11T12:17:20Z","abstract_excerpt":"A private information retrieval (PIR) scheme on coded storage systems with colluding, byzantine, and non-responsive servers is presented. Furthermore, the scheme can also be used for symmetric PIR in the same setting.\n  An explicit scheme using an $[n,k]$ generalized Reed-Solomon storage code is designed, protecting against $t$-collusion and handling up to $b$ byzantine and $r$ non-responsive servers, when $n\\geq n'= (\\nu +1) k+t+2b+r-1$, for some integer $\\nu \\geq 1$. This scheme achieves a PIR rate of $1-\\frac{k+2b+t+r-1}{n'}$. In the case where the capacity is known, namely when $k=1$, it i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03731","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":"1802.03731","created_at":"2026-05-18T00:06:30.739882+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.03731v2","created_at":"2026-05-18T00:06:30.739882+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03731","created_at":"2026-05-18T00:06:30.739882+00:00"},{"alias_kind":"pith_short_12","alias_value":"JF4YEXHFEH5S","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JF4YEXHFEH5SQX7N","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JF4YEXHF","created_at":"2026-05-18T12:32:31.084164+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/JF4YEXHFEH5SQX7N3WIFWR653W","json":"https://pith.science/pith/JF4YEXHFEH5SQX7N3WIFWR653W.json","graph_json":"https://pith.science/api/pith-number/JF4YEXHFEH5SQX7N3WIFWR653W/graph.json","events_json":"https://pith.science/api/pith-number/JF4YEXHFEH5SQX7N3WIFWR653W/events.json","paper":"https://pith.science/paper/JF4YEXHF"},"agent_actions":{"view_html":"https://pith.science/pith/JF4YEXHFEH5SQX7N3WIFWR653W","download_json":"https://pith.science/pith/JF4YEXHFEH5SQX7N3WIFWR653W.json","view_paper":"https://pith.science/paper/JF4YEXHF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.03731&json=true","fetch_graph":"https://pith.science/api/pith-number/JF4YEXHFEH5SQX7N3WIFWR653W/graph.json","fetch_events":"https://pith.science/api/pith-number/JF4YEXHFEH5SQX7N3WIFWR653W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JF4YEXHFEH5SQX7N3WIFWR653W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JF4YEXHFEH5SQX7N3WIFWR653W/action/storage_attestation","attest_author":"https://pith.science/pith/JF4YEXHFEH5SQX7N3WIFWR653W/action/author_attestation","sign_citation":"https://pith.science/pith/JF4YEXHFEH5SQX7N3WIFWR653W/action/citation_signature","submit_replication":"https://pith.science/pith/JF4YEXHFEH5SQX7N3WIFWR653W/action/replication_record"}},"created_at":"2026-05-18T00:06:30.739882+00:00","updated_at":"2026-05-18T00:06:30.739882+00:00"}