{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JF4YEXHFEH5SQX7N3WIFWR653W","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"63841ff17aa06c883b7d13e3cdcbb3cf2164926b6921528098f011776daa1577","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-11T12:17:20Z","title_canon_sha256":"84fecd4ece2a873ab86f3fa3222a9957596d5ed68647449b7872b990bb9eb11e"},"schema_version":"1.0","source":{"id":"1802.03731","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03731","created_at":"2026-05-18T00:06:30Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03731v2","created_at":"2026-05-18T00:06:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03731","created_at":"2026-05-18T00:06:30Z"},{"alias_kind":"pith_short_12","alias_value":"JF4YEXHFEH5S","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JF4YEXHFEH5SQX7N","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JF4YEXHF","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:b23f422ba66de67bd0f8c76b4ebaa241285584b79aac8ba291633a7744b76751","target":"graph","created_at":"2026-05-18T00:06:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Camilla Hollanti, David Karpuk, Oliver W. Gnilke, Ragnar Freij-Hollanti, Razane Tajeddine","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-11T12:17:20Z","title":"Robust Private Information Retrieval from Coded Systems with Byzantine and Colluding Servers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03731","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1bf5a6940ca46825f1503db5f5f752125b3933bf318388649a6a5d3c79e1b9d5","target":"record","created_at":"2026-05-18T00:06:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"63841ff17aa06c883b7d13e3cdcbb3cf2164926b6921528098f011776daa1577","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-11T12:17:20Z","title_canon_sha256":"84fecd4ece2a873ab86f3fa3222a9957596d5ed68647449b7872b990bb9eb11e"},"schema_version":"1.0","source":{"id":"1802.03731","kind":"arxiv","version":2}},"canonical_sha256":"4979825ce521fb285feddd905b47dddd9690d8f66f56d435025828da6ec96a49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4979825ce521fb285feddd905b47dddd9690d8f66f56d435025828da6ec96a49","first_computed_at":"2026-05-18T00:06:30.739821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:30.739821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BGkgDeCIR7Qlka8dlAbbKS04Ln8ZHdBPH9oouywbfiirKbtKrYKvtuUcP3wNS0VhrNHV96XcK0cF2gysNpUnBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:30.740240Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.03731","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bf5a6940ca46825f1503db5f5f752125b3933bf318388649a6a5d3c79e1b9d5","sha256:b23f422ba66de67bd0f8c76b4ebaa241285584b79aac8ba291633a7744b76751"],"state_sha256":"16b902c0000e3a5daa1e4288cb95c12703339e33c52dce6aa9b89d56c6a54897"}