{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GJDI657FDTQXLGBUAYPQAQEMTZ","short_pith_number":"pith:GJDI657F","canonical_record":{"source":{"id":"1712.03898","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-11T17:19:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dc20de3ee45bf2d7315b4a73b55e685fdbcc58d3a04adff7d02b3a70966f7b13","abstract_canon_sha256":"e6f39ee4f01790e7428414d8470b6c0c01e08706a823b9f3b6071e18e067293c"},"schema_version":"1.0"},"canonical_sha256":"32468f77e51ce1759834061f00408c9e45b742159a9d8538e284f5964739a42d","source":{"kind":"arxiv","id":"1712.03898","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03898","created_at":"2026-05-17T23:54:26Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03898v4","created_at":"2026-05-17T23:54:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03898","created_at":"2026-05-17T23:54:26Z"},{"alias_kind":"pith_short_12","alias_value":"GJDI657FDTQX","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GJDI657FDTQXLGBU","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GJDI657F","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GJDI657FDTQXLGBUAYPQAQEMTZ","target":"record","payload":{"canonical_record":{"source":{"id":"1712.03898","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-11T17:19:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dc20de3ee45bf2d7315b4a73b55e685fdbcc58d3a04adff7d02b3a70966f7b13","abstract_canon_sha256":"e6f39ee4f01790e7428414d8470b6c0c01e08706a823b9f3b6071e18e067293c"},"schema_version":"1.0"},"canonical_sha256":"32468f77e51ce1759834061f00408c9e45b742159a9d8538e284f5964739a42d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:26.548803Z","signature_b64":"gOQnSmA3Jd0dsWxiq/itL6tm7FNymcYSc5JnHKSPQozGl22j82k0Z5zWfpFuwUys+hKPhasnteC2KNC3dcHVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32468f77e51ce1759834061f00408c9e45b742159a9d8538e284f5964739a42d","last_reissued_at":"2026-05-17T23:54:26.548214Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:26.548214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.03898","source_version":4,"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-17T23:54:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ltBzI+gRcfOFgMolUVxRZkfbT0/V1Mtkl25TsmydW6zrvotwqmzDIkviTkc/PNTaTP9wf5mJKJf8n7/MQV3SCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:31:55.798652Z"},"content_sha256":"4455e2c433905456db5472b1c5c2d5c5c778c272f2a6681e0f389614951f9844","schema_version":"1.0","event_id":"sha256:4455e2c433905456db5472b1c5c2d5c5c778c272f2a6681e0f389614951f9844"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GJDI657FDTQXLGBUAYPQAQEMTZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Achieving Maximum Distance Separable Private Information Retrieval Capacity With Linear Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Eirik Rosnes, Hsuan-Yin Lin, Siddhartha Kumar","submitted_at":"2017-12-11T17:19:24Z","abstract_excerpt":"We propose three private information retrieval (PIR) protocols for distributed storage systems (DSSs) where data is stored using an arbitrary linear code. The first two protocols, named Protocol 1 and Protocol 2, achieve privacy for the scenario with noncolluding nodes. Protocol 1 requires a file size that is exponential in the number of files in the system, while Protocol 2 requires a file size that is independent of the number of files and is hence simpler. We prove that, for certain linear codes, Protocol 1 achieves the maximum distance separable (MDS) PIR capacity, i.e., the maximum PIR ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03898","kind":"arxiv","version":4},"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-17T23:54:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9lR9I3FdoU6kwJIKsbccpVq42DjQrqChNyJE1HwSuxKq3x+J+ZR9z7jOK26zkUmq2UNAU0v7X6nBTZy2fZuYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:31:55.799257Z"},"content_sha256":"d33f7927c4425e220be443b8e44301ea9482189a72521c5517da685d7f357fca","schema_version":"1.0","event_id":"sha256:d33f7927c4425e220be443b8e44301ea9482189a72521c5517da685d7f357fca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GJDI657FDTQXLGBUAYPQAQEMTZ/bundle.json","state_url":"https://pith.science/pith/GJDI657FDTQXLGBUAYPQAQEMTZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GJDI657FDTQXLGBUAYPQAQEMTZ/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-28T06:31:55Z","links":{"resolver":"https://pith.science/pith/GJDI657FDTQXLGBUAYPQAQEMTZ","bundle":"https://pith.science/pith/GJDI657FDTQXLGBUAYPQAQEMTZ/bundle.json","state":"https://pith.science/pith/GJDI657FDTQXLGBUAYPQAQEMTZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GJDI657FDTQXLGBUAYPQAQEMTZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GJDI657FDTQXLGBUAYPQAQEMTZ","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":"e6f39ee4f01790e7428414d8470b6c0c01e08706a823b9f3b6071e18e067293c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-11T17:19:24Z","title_canon_sha256":"dc20de3ee45bf2d7315b4a73b55e685fdbcc58d3a04adff7d02b3a70966f7b13"},"schema_version":"1.0","source":{"id":"1712.03898","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03898","created_at":"2026-05-17T23:54:26Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03898v4","created_at":"2026-05-17T23:54:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03898","created_at":"2026-05-17T23:54:26Z"},{"alias_kind":"pith_short_12","alias_value":"GJDI657FDTQX","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GJDI657FDTQXLGBU","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GJDI657F","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:d33f7927c4425e220be443b8e44301ea9482189a72521c5517da685d7f357fca","target":"graph","created_at":"2026-05-17T23:54:26Z","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":"We propose three private information retrieval (PIR) protocols for distributed storage systems (DSSs) where data is stored using an arbitrary linear code. The first two protocols, named Protocol 1 and Protocol 2, achieve privacy for the scenario with noncolluding nodes. Protocol 1 requires a file size that is exponential in the number of files in the system, while Protocol 2 requires a file size that is independent of the number of files and is hence simpler. We prove that, for certain linear codes, Protocol 1 achieves the maximum distance separable (MDS) PIR capacity, i.e., the maximum PIR ra","authors_text":"Alexandre Graell i Amat, Eirik Rosnes, Hsuan-Yin Lin, Siddhartha Kumar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-11T17:19:24Z","title":"Achieving Maximum Distance Separable Private Information Retrieval Capacity With Linear Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03898","kind":"arxiv","version":4},"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:4455e2c433905456db5472b1c5c2d5c5c778c272f2a6681e0f389614951f9844","target":"record","created_at":"2026-05-17T23:54:26Z","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":"e6f39ee4f01790e7428414d8470b6c0c01e08706a823b9f3b6071e18e067293c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-11T17:19:24Z","title_canon_sha256":"dc20de3ee45bf2d7315b4a73b55e685fdbcc58d3a04adff7d02b3a70966f7b13"},"schema_version":"1.0","source":{"id":"1712.03898","kind":"arxiv","version":4}},"canonical_sha256":"32468f77e51ce1759834061f00408c9e45b742159a9d8538e284f5964739a42d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32468f77e51ce1759834061f00408c9e45b742159a9d8538e284f5964739a42d","first_computed_at":"2026-05-17T23:54:26.548214Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:26.548214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gOQnSmA3Jd0dsWxiq/itL6tm7FNymcYSc5JnHKSPQozGl22j82k0Z5zWfpFuwUys+hKPhasnteC2KNC3dcHVBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:26.548803Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.03898","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4455e2c433905456db5472b1c5c2d5c5c778c272f2a6681e0f389614951f9844","sha256:d33f7927c4425e220be443b8e44301ea9482189a72521c5517da685d7f357fca"],"state_sha256":"8122c72b2ac1e04d1a8895629988fa733d17fe6b97eae3331b7a213b2b72260e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fKWkQXrB7Xgjm1yzRe1hwiAR4DZgAJOyay2vUmI4ohPK5hnbxa5fYprz4m2Tzwhv7UZODoIgiYWOfzczqaiXDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:31:55.802092Z","bundle_sha256":"feba5081c326701d0c4e913f5111f12008106fcd6b41c5465d3642d284ad9913"}}