{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YZC2HA4PQYALCTGIYX2CFALIXI","short_pith_number":"pith:YZC2HA4P","canonical_record":{"source":{"id":"1902.09865","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-26T11:22:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c1339ca0432ad6c2c0d6fdb3b51f23dfc9b27c42da82882a56f52fcf8398ae9e","abstract_canon_sha256":"e6c66208ee0b5d857f61ef0d18d32444a7f23f400b1d65f686b6bc88591e39f2"},"schema_version":"1.0"},"canonical_sha256":"c645a3838f8600b14cc8c5f4228168ba1ded360770d52cf530fcb3742ea39669","source":{"kind":"arxiv","id":"1902.09865","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.09865","created_at":"2026-05-17T23:52:35Z"},{"alias_kind":"arxiv_version","alias_value":"1902.09865v1","created_at":"2026-05-17T23:52:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.09865","created_at":"2026-05-17T23:52:35Z"},{"alias_kind":"pith_short_12","alias_value":"YZC2HA4PQYAL","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YZC2HA4PQYALCTGI","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YZC2HA4P","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YZC2HA4PQYALCTGIYX2CFALIXI","target":"record","payload":{"canonical_record":{"source":{"id":"1902.09865","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-26T11:22:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c1339ca0432ad6c2c0d6fdb3b51f23dfc9b27c42da82882a56f52fcf8398ae9e","abstract_canon_sha256":"e6c66208ee0b5d857f61ef0d18d32444a7f23f400b1d65f686b6bc88591e39f2"},"schema_version":"1.0"},"canonical_sha256":"c645a3838f8600b14cc8c5f4228168ba1ded360770d52cf530fcb3742ea39669","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:35.132622Z","signature_b64":"DWGuI/2gLb6aF13yGyzIU6cf5GIA6CKKC02ZH2Qo4AzhCtdjZcKVjH0BsxfBOTsNSmkCjDwsoRjUdf2jgHXyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c645a3838f8600b14cc8c5f4228168ba1ded360770d52cf530fcb3742ea39669","last_reissued_at":"2026-05-17T23:52:35.132061Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:35.132061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.09865","source_version":1,"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:52:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qy8/cK4He94FxA/bI/WWg6c5w93Ob9fPjqyQS9w0HBLOa5M/SLfbNjk3kPkGYTet6JfJbNaVD7zuTJTWCJd7Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:27:10.158853Z"},"content_sha256":"a403d4c120a93a3a86d8b1b5f0d83583361941f3e0cad63fa820b0d4b217bfae","schema_version":"1.0","event_id":"sha256:a403d4c120a93a3a86d8b1b5f0d83583361941f3e0cad63fa820b0d4b217bfae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YZC2HA4PQYALCTGIYX2CFALIXI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Achieving Secrecy Capacity of Minimum Storage Regenerating Codes for all Feasible $(n, k, d)$ Parameter Values","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Navin Kashyap, V. Arvind Rameshwar","submitted_at":"2019-02-26T11:22:48Z","abstract_excerpt":"This paper addresses the problem of constructing secure exact-repair regenerating codes at the MSR point for all feasible values of the parameters. The setting involves a passive eavesdropper who is allowed to observe the stored contents of, and the downloads into, an $l$-subset of the $n$ nodes of a distributed storage system (DSS). The objective is to achieve perfect secrecy between the eavesdropped symbols and the file stored on the DSS. Previous secure code constructions (most notably that by Rawat et al.) tackle the problem only for the restricted case wherein the number, $d$, of helper n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.09865","kind":"arxiv","version":1},"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:52:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VPmbXX0qOQrUE6lCpCmnbvPSIHXLWsZZo4VbsT5BRfPrJW/SQLZsTDkKQiDUm508grXdLCRZfb+J2OKokqYxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:27:10.159644Z"},"content_sha256":"fdbca7bb85b886431302e2940f0e6e97cc6616112a296c9ba1af656846fab0ba","schema_version":"1.0","event_id":"sha256:fdbca7bb85b886431302e2940f0e6e97cc6616112a296c9ba1af656846fab0ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YZC2HA4PQYALCTGIYX2CFALIXI/bundle.json","state_url":"https://pith.science/pith/YZC2HA4PQYALCTGIYX2CFALIXI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YZC2HA4PQYALCTGIYX2CFALIXI/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-06-10T11:27:10Z","links":{"resolver":"https://pith.science/pith/YZC2HA4PQYALCTGIYX2CFALIXI","bundle":"https://pith.science/pith/YZC2HA4PQYALCTGIYX2CFALIXI/bundle.json","state":"https://pith.science/pith/YZC2HA4PQYALCTGIYX2CFALIXI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YZC2HA4PQYALCTGIYX2CFALIXI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YZC2HA4PQYALCTGIYX2CFALIXI","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":"e6c66208ee0b5d857f61ef0d18d32444a7f23f400b1d65f686b6bc88591e39f2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-26T11:22:48Z","title_canon_sha256":"c1339ca0432ad6c2c0d6fdb3b51f23dfc9b27c42da82882a56f52fcf8398ae9e"},"schema_version":"1.0","source":{"id":"1902.09865","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.09865","created_at":"2026-05-17T23:52:35Z"},{"alias_kind":"arxiv_version","alias_value":"1902.09865v1","created_at":"2026-05-17T23:52:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.09865","created_at":"2026-05-17T23:52:35Z"},{"alias_kind":"pith_short_12","alias_value":"YZC2HA4PQYAL","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YZC2HA4PQYALCTGI","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YZC2HA4P","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:fdbca7bb85b886431302e2940f0e6e97cc6616112a296c9ba1af656846fab0ba","target":"graph","created_at":"2026-05-17T23:52:35Z","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":"This paper addresses the problem of constructing secure exact-repair regenerating codes at the MSR point for all feasible values of the parameters. The setting involves a passive eavesdropper who is allowed to observe the stored contents of, and the downloads into, an $l$-subset of the $n$ nodes of a distributed storage system (DSS). The objective is to achieve perfect secrecy between the eavesdropped symbols and the file stored on the DSS. Previous secure code constructions (most notably that by Rawat et al.) tackle the problem only for the restricted case wherein the number, $d$, of helper n","authors_text":"Navin Kashyap, V. Arvind Rameshwar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-26T11:22:48Z","title":"Achieving Secrecy Capacity of Minimum Storage Regenerating Codes for all Feasible $(n, k, d)$ Parameter Values"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.09865","kind":"arxiv","version":1},"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:a403d4c120a93a3a86d8b1b5f0d83583361941f3e0cad63fa820b0d4b217bfae","target":"record","created_at":"2026-05-17T23:52:35Z","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":"e6c66208ee0b5d857f61ef0d18d32444a7f23f400b1d65f686b6bc88591e39f2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-26T11:22:48Z","title_canon_sha256":"c1339ca0432ad6c2c0d6fdb3b51f23dfc9b27c42da82882a56f52fcf8398ae9e"},"schema_version":"1.0","source":{"id":"1902.09865","kind":"arxiv","version":1}},"canonical_sha256":"c645a3838f8600b14cc8c5f4228168ba1ded360770d52cf530fcb3742ea39669","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c645a3838f8600b14cc8c5f4228168ba1ded360770d52cf530fcb3742ea39669","first_computed_at":"2026-05-17T23:52:35.132061Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:35.132061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DWGuI/2gLb6aF13yGyzIU6cf5GIA6CKKC02ZH2Qo4AzhCtdjZcKVjH0BsxfBOTsNSmkCjDwsoRjUdf2jgHXyAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:35.132622Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.09865","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a403d4c120a93a3a86d8b1b5f0d83583361941f3e0cad63fa820b0d4b217bfae","sha256:fdbca7bb85b886431302e2940f0e6e97cc6616112a296c9ba1af656846fab0ba"],"state_sha256":"f01f304507701f8d9fa8d6576e5a05e80090f44dc3ef2c7f289925bf3a767581"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EX/N7g7BpQTJCNhIuDWOHyTv3ZP75jB5u1mC2/e9+2mmpEpB7mSo7raqz9Wx2udyRlDTLecBzkd61uckvg1NAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T11:27:10.164123Z","bundle_sha256":"eee40b0778ead59cbeb0d3bd8a53deba99ddfab7f496f3f0c3d391f8ddd50070"}}