{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DM7BPZQ7F3Y654LECEY4K2QDQA","short_pith_number":"pith:DM7BPZQ7","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"},"canonical_sha256":"1b3e17e61f2ef1eef1641131c56a03800f4bc5d7e6db168dfa70fa9516d0c392","source":{"kind":"arxiv","id":"1806.08006","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08006","created_at":"2026-05-18T00:06:28Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08006v3","created_at":"2026-05-18T00:06:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08006","created_at":"2026-05-18T00:06:28Z"},{"alias_kind":"pith_short_12","alias_value":"DM7BPZQ7F3Y6","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DM7BPZQ7F3Y654LE","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DM7BPZQ7","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DM7BPZQ7F3Y654LECEY4K2QDQA","target":"record","payload":{"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"},"canonical_sha256":"1b3e17e61f2ef1eef1641131c56a03800f4bc5d7e6db168dfa70fa9516d0c392","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"},"source_kind":"arxiv","source_id":"1806.08006","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:06:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"okROK5NuUhTNiRMfz9NL1SBgBirRkAATw5kHsv3cocS1Lfd6G48gyMsw0JWyLa2Tcx1BC38Otxtxteo4LPcwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T18:36:29.749022Z"},"content_sha256":"2f296434b27e9cdc6ad6ca5d119d8421f39419b73df1610115e40ca8330c3d02","schema_version":"1.0","event_id":"sha256:2f296434b27e9cdc6ad6ca5d119d8421f39419b73df1610115e40ca8330c3d02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DM7BPZQ7F3Y654LECEY4K2QDQA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:06:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fZTzbu0MYuPtZRqtMcqm1oyMM4A/fHMlwV3GT+Y1LaE+vBgZ2k0o42NMU/PhKYOKI0sJWhlUYK8ktKSLLlKWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T18:36:29.751804Z"},"content_sha256":"3192f2c2a2d368a2f1676a5cf360ed9d8dd71d3da615bbe7e82372942c3ac2e2","schema_version":"1.0","event_id":"sha256:3192f2c2a2d368a2f1676a5cf360ed9d8dd71d3da615bbe7e82372942c3ac2e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DM7BPZQ7F3Y654LECEY4K2QDQA/bundle.json","state_url":"https://pith.science/pith/DM7BPZQ7F3Y654LECEY4K2QDQA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DM7BPZQ7F3Y654LECEY4K2QDQA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-22T18:36:29Z","links":{"resolver":"https://pith.science/pith/DM7BPZQ7F3Y654LECEY4K2QDQA","bundle":"https://pith.science/pith/DM7BPZQ7F3Y654LECEY4K2QDQA/bundle.json","state":"https://pith.science/pith/DM7BPZQ7F3Y654LECEY4K2QDQA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DM7BPZQ7F3Y654LECEY4K2QDQA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DM7BPZQ7F3Y654LECEY4K2QDQA","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":"f76704d358d4f8c3bc34014c404419c5ee95fab660c4491e4ad0c796cbc70180","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-20T22:00:44Z","title_canon_sha256":"5319b67ae874b6d0ea8991feb5ad0af0698d4e262ffa206a0c6a8a788ac49a48"},"schema_version":"1.0","source":{"id":"1806.08006","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08006","created_at":"2026-05-18T00:06:28Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08006v3","created_at":"2026-05-18T00:06:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08006","created_at":"2026-05-18T00:06:28Z"},{"alias_kind":"pith_short_12","alias_value":"DM7BPZQ7F3Y6","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DM7BPZQ7F3Y654LE","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DM7BPZQ7","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:3192f2c2a2d368a2f1676a5cf360ed9d8dd71d3da615bbe7e82372942c3ac2e2","target":"graph","created_at":"2026-05-18T00:06:28Z","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":"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.","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-06-20T22:00:44Z","title":"Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08006","kind":"arxiv","version":3},"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:2f296434b27e9cdc6ad6ca5d119d8421f39419b73df1610115e40ca8330c3d02","target":"record","created_at":"2026-05-18T00:06:28Z","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":"f76704d358d4f8c3bc34014c404419c5ee95fab660c4491e4ad0c796cbc70180","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-20T22:00:44Z","title_canon_sha256":"5319b67ae874b6d0ea8991feb5ad0af0698d4e262ffa206a0c6a8a788ac49a48"},"schema_version":"1.0","source":{"id":"1806.08006","kind":"arxiv","version":3}},"canonical_sha256":"1b3e17e61f2ef1eef1641131c56a03800f4bc5d7e6db168dfa70fa9516d0c392","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b3e17e61f2ef1eef1641131c56a03800f4bc5d7e6db168dfa70fa9516d0c392","first_computed_at":"2026-05-18T00:06:28.525928Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:28.525928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hl3UNWLAcBtD3r6zegHuGHAY3/Pl6h0hbtr/pNdkJ/eHwsjdibWiq0i9SYhLvU1+9XGnq/+YBZCtgmZJdzJ8BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:28.526441Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.08006","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f296434b27e9cdc6ad6ca5d119d8421f39419b73df1610115e40ca8330c3d02","sha256:3192f2c2a2d368a2f1676a5cf360ed9d8dd71d3da615bbe7e82372942c3ac2e2"],"state_sha256":"4bc129487bcf7e8f62d4b88560cf4133a91db2947498c2167e9de580890c6c6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c11FT2PN7kJ6NwhdRnPx79dX1FsRJFXJO8THrtXfmBmWud5C2EfFC633IlMKXhf8AO+OQA7yKJePjRo3MzU5DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T18:36:29.756838Z","bundle_sha256":"e0e9822c6e62b53253df3ef6f818346cdb44c2d98f2f3debb7b292f2ede73c01"}}