{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:KLA6AWSJTT2HLHRHXRCD2YR3U6","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":"6657038b96d4252aa6385a04a41f2c853a8c94aaf0f5d30e9eb46431547cb5bb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-02-18T09:32:57Z","title_canon_sha256":"5309be65ad7e33b6eae9aff03da05be2193b382f9668d98696a165690f70cb80"},"schema_version":"1.0","source":{"id":"2202.09095","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.09095","created_at":"2026-07-05T03:58:09Z"},{"alias_kind":"arxiv_version","alias_value":"2202.09095v1","created_at":"2026-07-05T03:58:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.09095","created_at":"2026-07-05T03:58:09Z"},{"alias_kind":"pith_short_12","alias_value":"KLA6AWSJTT2H","created_at":"2026-07-05T03:58:09Z"},{"alias_kind":"pith_short_16","alias_value":"KLA6AWSJTT2HLHRH","created_at":"2026-07-05T03:58:09Z"},{"alias_kind":"pith_short_8","alias_value":"KLA6AWSJ","created_at":"2026-07-05T03:58:09Z"}],"graph_snapshots":[{"event_id":"sha256:4272f33c87f4fc3e7b8b0f3ecefac859b010881c0a9cf503057a646c6af631ac","target":"graph","created_at":"2026-07-05T03:58:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2202.09095/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, a flexible and robust private information retrieval (PIR) scheme based on binary non-maximum distance separable (non-MDS) codes is considered. This combines previous works on PIR schemes based on transitive non-MDS codes on one hand, and PIR from MDS-coded Byzantine and non-responsive servers on the other hand. More specifically, a PIR scheme employing binary Reed-Muller (RM) codes tolerant to colluding, Byzantine, and non-responsive servers is constructed, and bounds for the achievable rates are derived under certain conditions. The construction of such schemes turns out to be m","authors_text":"Camilla Hollanti, Matteo Allaix, Perttu Saarela, Ragnar Freij-Hollanti","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-02-18T09:32:57Z","title":"Private Information Retrieval from Colluding and Byzantine Servers with Binary Reed-Muller Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.09095","kind":"arxiv","version":1},"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:db4ad417d7396df67b6ed8752603b9af1a5900c454774d6e443c8df120a03792","target":"record","created_at":"2026-07-05T03:58:09Z","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":"6657038b96d4252aa6385a04a41f2c853a8c94aaf0f5d30e9eb46431547cb5bb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-02-18T09:32:57Z","title_canon_sha256":"5309be65ad7e33b6eae9aff03da05be2193b382f9668d98696a165690f70cb80"},"schema_version":"1.0","source":{"id":"2202.09095","kind":"arxiv","version":1}},"canonical_sha256":"52c1e05a499cf4759e27bc443d623ba7969f8dc78ccccecf2ef3cb05551660fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52c1e05a499cf4759e27bc443d623ba7969f8dc78ccccecf2ef3cb05551660fc","first_computed_at":"2026-07-05T03:58:09.642392Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:58:09.642392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7N0cBWX7ec9iUEA7glEDcFbr40GMnzlpPGmVTnw0VNgtBrd68O+l3/fc4EY+vyQQigS7TYmlji3nRcpuYjA3AA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:58:09.642812Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.09095","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db4ad417d7396df67b6ed8752603b9af1a5900c454774d6e443c8df120a03792","sha256:4272f33c87f4fc3e7b8b0f3ecefac859b010881c0a9cf503057a646c6af631ac"],"state_sha256":"8ac6601bf1f1f2572572168f573453ab77c34fb5f9313b578db9806dcbec81e1"}