{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Y2375N4YTIHKXLDDJ344AWFTM3","short_pith_number":"pith:Y2375N4Y","canonical_record":{"source":{"id":"1801.04923","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-13T11:31:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a93a5c55d3b9c04ddc7e303a90167f58066ede308a1c5c7b9509506a067d3327","abstract_canon_sha256":"7036067a9015e8826b7f8c7a4ec02c8d81fe5f1eb41f491df1d996c44b35f8fe"},"schema_version":"1.0"},"canonical_sha256":"c6b7feb7989a0eabac634ef9c058b366ea6027353c34b6b99ac89d9beda40c43","source":{"kind":"arxiv","id":"1801.04923","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04923","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04923v2","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04923","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"pith_short_12","alias_value":"Y2375N4YTIHK","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y2375N4YTIHKXLDD","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y2375N4Y","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Y2375N4YTIHKXLDDJ344AWFTM3","target":"record","payload":{"canonical_record":{"source":{"id":"1801.04923","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-13T11:31:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a93a5c55d3b9c04ddc7e303a90167f58066ede308a1c5c7b9509506a067d3327","abstract_canon_sha256":"7036067a9015e8826b7f8c7a4ec02c8d81fe5f1eb41f491df1d996c44b35f8fe"},"schema_version":"1.0"},"canonical_sha256":"c6b7feb7989a0eabac634ef9c058b366ea6027353c34b6b99ac89d9beda40c43","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:34.108537Z","signature_b64":"rVniY5L7rPhWvyPSGg7fFEPfMndSmsCsjUHLF1QfR1J6Er/SXrrw6q+Vx9V4MP2Z9BEhmz0BOSxImc1iK9Y7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6b7feb7989a0eabac634ef9c058b366ea6027353c34b6b99ac89d9beda40c43","last_reissued_at":"2026-05-18T00:14:34.107875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:34.107875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.04923","source_version":2,"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:14:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J0NR/a9j6vesJ49NXvPjCiNPIPRcmOe0ohQWnm4GuP79h2NZb/aNM0nP8t2FnfVGitCSgvlOMqBpPvsZlCYpAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:55:50.699828Z"},"content_sha256":"10c8a32dbf8beb8a72046027ff9e41cae4269677b4d5bed90eb8d315399e9552","schema_version":"1.0","event_id":"sha256:10c8a32dbf8beb8a72046027ff9e41cae4269677b4d5bed90eb8d315399e9552"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Y2375N4YTIHKXLDDJ344AWFTM3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An MDS-PIR Capacity-Achieving Protocol for Distributed Storage Using Non-MDS 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":"2018-01-13T11:31:12Z","abstract_excerpt":"We propose a private information retrieval (PIR) protocol for distributed storage systems with noncolluding nodes where data is stored using an arbitrary linear code. An expression for the PIR rate, i.e., the ratio of the amount of retrieved data per unit of downloaded data, is derived, and a necessary and a sufficient condition for codes to achieve the maximum distance separable (MDS) PIR capacity are given. The necessary condition is based on the generalized Hamming weights of the storage code, while the sufficient condition is based on code automorphisms. We show that cyclic codes and Reed-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04923","kind":"arxiv","version":2},"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:14:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U5d6ivhe98aP1D/oKqXzopp2xULgAW5RFA8QTYybdGFuunkLmiWjztiG4DcpfnD0xdJ0hxNKpPiEgMAisIxbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:55:50.700165Z"},"content_sha256":"fc97c70fb62cb9d313facc052f977f1064bc383ec0e1e62e2d5f725e05ba68b0","schema_version":"1.0","event_id":"sha256:fc97c70fb62cb9d313facc052f977f1064bc383ec0e1e62e2d5f725e05ba68b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y2375N4YTIHKXLDDJ344AWFTM3/bundle.json","state_url":"https://pith.science/pith/Y2375N4YTIHKXLDDJ344AWFTM3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y2375N4YTIHKXLDDJ344AWFTM3/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-28T05:55:50Z","links":{"resolver":"https://pith.science/pith/Y2375N4YTIHKXLDDJ344AWFTM3","bundle":"https://pith.science/pith/Y2375N4YTIHKXLDDJ344AWFTM3/bundle.json","state":"https://pith.science/pith/Y2375N4YTIHKXLDDJ344AWFTM3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y2375N4YTIHKXLDDJ344AWFTM3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Y2375N4YTIHKXLDDJ344AWFTM3","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":"7036067a9015e8826b7f8c7a4ec02c8d81fe5f1eb41f491df1d996c44b35f8fe","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-13T11:31:12Z","title_canon_sha256":"a93a5c55d3b9c04ddc7e303a90167f58066ede308a1c5c7b9509506a067d3327"},"schema_version":"1.0","source":{"id":"1801.04923","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04923","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04923v2","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04923","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"pith_short_12","alias_value":"Y2375N4YTIHK","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y2375N4YTIHKXLDD","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y2375N4Y","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:fc97c70fb62cb9d313facc052f977f1064bc383ec0e1e62e2d5f725e05ba68b0","target":"graph","created_at":"2026-05-18T00:14:34Z","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 a private information retrieval (PIR) protocol for distributed storage systems with noncolluding nodes where data is stored using an arbitrary linear code. An expression for the PIR rate, i.e., the ratio of the amount of retrieved data per unit of downloaded data, is derived, and a necessary and a sufficient condition for codes to achieve the maximum distance separable (MDS) PIR capacity are given. The necessary condition is based on the generalized Hamming weights of the storage code, while the sufficient condition is based on code automorphisms. We show that cyclic codes and Reed-","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":"2018-01-13T11:31:12Z","title":"An MDS-PIR Capacity-Achieving Protocol for Distributed Storage Using Non-MDS Linear Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04923","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:10c8a32dbf8beb8a72046027ff9e41cae4269677b4d5bed90eb8d315399e9552","target":"record","created_at":"2026-05-18T00:14:34Z","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":"7036067a9015e8826b7f8c7a4ec02c8d81fe5f1eb41f491df1d996c44b35f8fe","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-13T11:31:12Z","title_canon_sha256":"a93a5c55d3b9c04ddc7e303a90167f58066ede308a1c5c7b9509506a067d3327"},"schema_version":"1.0","source":{"id":"1801.04923","kind":"arxiv","version":2}},"canonical_sha256":"c6b7feb7989a0eabac634ef9c058b366ea6027353c34b6b99ac89d9beda40c43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6b7feb7989a0eabac634ef9c058b366ea6027353c34b6b99ac89d9beda40c43","first_computed_at":"2026-05-18T00:14:34.107875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:34.107875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rVniY5L7rPhWvyPSGg7fFEPfMndSmsCsjUHLF1QfR1J6Er/SXrrw6q+Vx9V4MP2Z9BEhmz0BOSxImc1iK9Y7BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:34.108537Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.04923","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10c8a32dbf8beb8a72046027ff9e41cae4269677b4d5bed90eb8d315399e9552","sha256:fc97c70fb62cb9d313facc052f977f1064bc383ec0e1e62e2d5f725e05ba68b0"],"state_sha256":"33729819a3daef5d8c911c06244b4a9104308f363c3c66459494619c25368188"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RSRoDLik5gRpA9IS0dluUISAU9Rd4jjMWw630ROCYWjU/M/XhWLb+ZCcTTEv/XmXNJlyu+TE9K20TSpSf+ZoBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:55:50.702214Z","bundle_sha256":"85e50d30e4d686be6fbe72a5638901011681a0977b0ba6217bc8fd66af387214"}}