{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BVDI6EMKFT5QF6INXRWVZ3KLHT","short_pith_number":"pith:BVDI6EMK","canonical_record":{"source":{"id":"1806.01342","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-04T19:31:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0c9b84c241a236d5c6531240056e1ab0f6d7c1a7f8fe4d6a6a294742d9dbfe80","abstract_canon_sha256":"215b96b6d471b8e874bac9988d9b285fa66d5ec0321bc5a63e0291c0c9140a8d"},"schema_version":"1.0"},"canonical_sha256":"0d468f118a2cfb02f90dbc6d5ced4b3cc8b22f3be634ec8d056938b37369a4c7","source":{"kind":"arxiv","id":"1806.01342","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01342","created_at":"2026-05-18T00:05:30Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01342v3","created_at":"2026-05-18T00:05:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01342","created_at":"2026-05-18T00:05:30Z"},{"alias_kind":"pith_short_12","alias_value":"BVDI6EMKFT5Q","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BVDI6EMKFT5QF6IN","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BVDI6EMK","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BVDI6EMKFT5QF6INXRWVZ3KLHT","target":"record","payload":{"canonical_record":{"source":{"id":"1806.01342","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-04T19:31:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0c9b84c241a236d5c6531240056e1ab0f6d7c1a7f8fe4d6a6a294742d9dbfe80","abstract_canon_sha256":"215b96b6d471b8e874bac9988d9b285fa66d5ec0321bc5a63e0291c0c9140a8d"},"schema_version":"1.0"},"canonical_sha256":"0d468f118a2cfb02f90dbc6d5ced4b3cc8b22f3be634ec8d056938b37369a4c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:30.880104Z","signature_b64":"3sHYDC4jJpfp60PzZ52mM2Iqih/WN0sr7XRmp7PIwf9j+lpxxgmG4spEsihWxy8OHhWqVdBt1Ei8KY5N2qFRDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d468f118a2cfb02f90dbc6d5ced4b3cc8b22f3be634ec8d056938b37369a4c7","last_reissued_at":"2026-05-18T00:05:30.879600Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:30.879600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.01342","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:05:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EB5SCMb5Th+E6C57nes2tZ7xKmDy8sQx/ySIXQHFc2jJQlwfMx3fvlpFvEvNlrnRBDMIIDoy64Otx92ve6OKAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:19:00.822215Z"},"content_sha256":"665ac53bc543cf6e608a942fde841f13c2b3dadf0799ed3795b61a9517b3f040","schema_version":"1.0","event_id":"sha256:665ac53bc543cf6e608a942fde841f13c2b3dadf0799ed3795b61a9517b3f040"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BVDI6EMKFT5QF6INXRWVZ3KLHT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymmetry Helps: Improved Private Information Retrieval Protocols for Distributed Storage","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-06-04T19:31:39Z","abstract_excerpt":"We consider private information retrieval (PIR) for distributed storage systems (DSSs) with noncolluding nodes where data is stored using a non maximum distance separable (MDS) linear code. It was recently shown that if data is stored using a particular class of non-MDS linear codes, the MDS-PIR capacity, i.e., the maximum possible PIR rate for MDS-coded DSSs, can be achieved. For this class of codes, we prove that the PIR capacity is indeed equal to the MDS-PIR capacity, giving the first family of non-MDS codes for which the PIR capacity is known. For other codes, we provide asymmetric PIR pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01342","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:05:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YnL6aMbX3C9+5QqRbD5YV/GMvhawBsh1yNKd/yyrXoZZXEK8f+J7bedCvxvpC435l6wHrwzPp9Gah1T1KG8qCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:19:00.822820Z"},"content_sha256":"b58e4c239f8d7c98fea33c7ebf336f3912e1faf7b2a8d63213227947bfec6a29","schema_version":"1.0","event_id":"sha256:b58e4c239f8d7c98fea33c7ebf336f3912e1faf7b2a8d63213227947bfec6a29"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BVDI6EMKFT5QF6INXRWVZ3KLHT/bundle.json","state_url":"https://pith.science/pith/BVDI6EMKFT5QF6INXRWVZ3KLHT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BVDI6EMKFT5QF6INXRWVZ3KLHT/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:19:00Z","links":{"resolver":"https://pith.science/pith/BVDI6EMKFT5QF6INXRWVZ3KLHT","bundle":"https://pith.science/pith/BVDI6EMKFT5QF6INXRWVZ3KLHT/bundle.json","state":"https://pith.science/pith/BVDI6EMKFT5QF6INXRWVZ3KLHT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BVDI6EMKFT5QF6INXRWVZ3KLHT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BVDI6EMKFT5QF6INXRWVZ3KLHT","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":"215b96b6d471b8e874bac9988d9b285fa66d5ec0321bc5a63e0291c0c9140a8d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-04T19:31:39Z","title_canon_sha256":"0c9b84c241a236d5c6531240056e1ab0f6d7c1a7f8fe4d6a6a294742d9dbfe80"},"schema_version":"1.0","source":{"id":"1806.01342","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01342","created_at":"2026-05-18T00:05:30Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01342v3","created_at":"2026-05-18T00:05:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01342","created_at":"2026-05-18T00:05:30Z"},{"alias_kind":"pith_short_12","alias_value":"BVDI6EMKFT5Q","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BVDI6EMKFT5QF6IN","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BVDI6EMK","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:b58e4c239f8d7c98fea33c7ebf336f3912e1faf7b2a8d63213227947bfec6a29","target":"graph","created_at":"2026-05-18T00:05:30Z","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 consider private information retrieval (PIR) for distributed storage systems (DSSs) with noncolluding nodes where data is stored using a non maximum distance separable (MDS) linear code. It was recently shown that if data is stored using a particular class of non-MDS linear codes, the MDS-PIR capacity, i.e., the maximum possible PIR rate for MDS-coded DSSs, can be achieved. For this class of codes, we prove that the PIR capacity is indeed equal to the MDS-PIR capacity, giving the first family of non-MDS codes for which the PIR capacity is known. For other codes, we provide asymmetric PIR pr","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-06-04T19:31:39Z","title":"Asymmetry Helps: Improved Private Information Retrieval Protocols for Distributed Storage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01342","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:665ac53bc543cf6e608a942fde841f13c2b3dadf0799ed3795b61a9517b3f040","target":"record","created_at":"2026-05-18T00:05:30Z","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":"215b96b6d471b8e874bac9988d9b285fa66d5ec0321bc5a63e0291c0c9140a8d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-04T19:31:39Z","title_canon_sha256":"0c9b84c241a236d5c6531240056e1ab0f6d7c1a7f8fe4d6a6a294742d9dbfe80"},"schema_version":"1.0","source":{"id":"1806.01342","kind":"arxiv","version":3}},"canonical_sha256":"0d468f118a2cfb02f90dbc6d5ced4b3cc8b22f3be634ec8d056938b37369a4c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d468f118a2cfb02f90dbc6d5ced4b3cc8b22f3be634ec8d056938b37369a4c7","first_computed_at":"2026-05-18T00:05:30.879600Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:30.879600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3sHYDC4jJpfp60PzZ52mM2Iqih/WN0sr7XRmp7PIwf9j+lpxxgmG4spEsihWxy8OHhWqVdBt1Ei8KY5N2qFRDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:30.880104Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.01342","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:665ac53bc543cf6e608a942fde841f13c2b3dadf0799ed3795b61a9517b3f040","sha256:b58e4c239f8d7c98fea33c7ebf336f3912e1faf7b2a8d63213227947bfec6a29"],"state_sha256":"953ae0d84879ec4f4891e451dabaee0d3c752ddcb7135fa4c28018b5e3510e20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a60Yerh6jI7u/nILRcQpxgTKzr1HifbYh1sR+fz0Zc1r8p0faUlBZd9h+ra00lQ4IIdl4WfUIvRvIAB9EsCvBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:19:00.825820Z","bundle_sha256":"f09433087a35e66700d71d400b5df533af9eaf8974962729d6bd3454215893f5"}}