{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GJDI657FDTQXLGBUAYPQAQEMTZ","short_pith_number":"pith:GJDI657F","schema_version":"1.0","canonical_sha256":"32468f77e51ce1759834061f00408c9e45b742159a9d8538e284f5964739a42d","source":{"kind":"arxiv","id":"1712.03898","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.03898","created_at":"2026-05-17T23:54:26.548308+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.03898v4","created_at":"2026-05-17T23:54:26.548308+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03898","created_at":"2026-05-17T23:54:26.548308+00:00"},{"alias_kind":"pith_short_12","alias_value":"GJDI657FDTQX","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GJDI657FDTQXLGBU","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GJDI657F","created_at":"2026-05-18T12:31:18.294218+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/GJDI657FDTQXLGBUAYPQAQEMTZ","json":"https://pith.science/pith/GJDI657FDTQXLGBUAYPQAQEMTZ.json","graph_json":"https://pith.science/api/pith-number/GJDI657FDTQXLGBUAYPQAQEMTZ/graph.json","events_json":"https://pith.science/api/pith-number/GJDI657FDTQXLGBUAYPQAQEMTZ/events.json","paper":"https://pith.science/paper/GJDI657F"},"agent_actions":{"view_html":"https://pith.science/pith/GJDI657FDTQXLGBUAYPQAQEMTZ","download_json":"https://pith.science/pith/GJDI657FDTQXLGBUAYPQAQEMTZ.json","view_paper":"https://pith.science/paper/GJDI657F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.03898&json=true","fetch_graph":"https://pith.science/api/pith-number/GJDI657FDTQXLGBUAYPQAQEMTZ/graph.json","fetch_events":"https://pith.science/api/pith-number/GJDI657FDTQXLGBUAYPQAQEMTZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GJDI657FDTQXLGBUAYPQAQEMTZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GJDI657FDTQXLGBUAYPQAQEMTZ/action/storage_attestation","attest_author":"https://pith.science/pith/GJDI657FDTQXLGBUAYPQAQEMTZ/action/author_attestation","sign_citation":"https://pith.science/pith/GJDI657FDTQXLGBUAYPQAQEMTZ/action/citation_signature","submit_replication":"https://pith.science/pith/GJDI657FDTQXLGBUAYPQAQEMTZ/action/replication_record"}},"created_at":"2026-05-17T23:54:26.548308+00:00","updated_at":"2026-05-17T23:54:26.548308+00:00"}