{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZY3UCJFO4J4JYN46Y2I5NLCPUK","short_pith_number":"pith:ZY3UCJFO","canonical_record":{"source":{"id":"1508.03787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-16T03:40:48Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"9a2c21feec94bbcc3f9474e862bfd80946b5da7239353b5d3734edd268406588","abstract_canon_sha256":"b1d83713fa4681b757d04bbff126b8dcef191913c35af3e039c745cebb014563"},"schema_version":"1.0"},"canonical_sha256":"ce374124aee2789c379ec691d6ac4fa289b9701ebadf6adf8fc6d74aceb4fc0f","source":{"kind":"arxiv","id":"1508.03787","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03787","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03787v1","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03787","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"ZY3UCJFO4J4J","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZY3UCJFO4J4JYN46","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZY3UCJFO","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZY3UCJFO4J4JYN46Y2I5NLCPUK","target":"record","payload":{"canonical_record":{"source":{"id":"1508.03787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-16T03:40:48Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"9a2c21feec94bbcc3f9474e862bfd80946b5da7239353b5d3734edd268406588","abstract_canon_sha256":"b1d83713fa4681b757d04bbff126b8dcef191913c35af3e039c745cebb014563"},"schema_version":"1.0"},"canonical_sha256":"ce374124aee2789c379ec691d6ac4fa289b9701ebadf6adf8fc6d74aceb4fc0f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:15.244638Z","signature_b64":"wIvu0PsixVrTBrtIU8z+0eqqRyL1jjTf6l7Sy5hnHzK+IDkQXSwvbPyxuveCoeK24GEjK050h/vMVEfoACEGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce374124aee2789c379ec691d6ac4fa289b9701ebadf6adf8fc6d74aceb4fc0f","last_reissued_at":"2026-05-18T01:35:15.244190Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:15.244190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.03787","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-18T01:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gOKXTms+nZ9Kb9W2wx8DLmaOLKa7SVn0h1O4dycg+ps1c3E+0zRsmrQlM7BLqtKC+c9S3RGorNMG/a5eNz1qDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:44:59.862604Z"},"content_sha256":"36e3c34b1a53a484563c1e75954c296d45980842517fb777ee6a104346a49a6a","schema_version":"1.0","event_id":"sha256:36e3c34b1a53a484563c1e75954c296d45980842517fb777ee6a104346a49a6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZY3UCJFO4J4JYN46Y2I5NLCPUK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information-theoretically Secure Erasure Codes for Distributed Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Kannan Ramchandran, K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar","submitted_at":"2015-08-16T03:40:48Z","abstract_excerpt":"Repair operations in distributed storage systems potentially expose the data to malicious acts of passive eavesdroppers or active adversaries, which can be detrimental to the security of the system. This paper presents erasure codes and repair algorithms that ensure security of the data in the presence of passive eavesdroppers and active adversaries, while maintaining high availability, reliability and efficiency in the system. Our codes are optimal in that they meet previously proposed lower bounds on the storage, network-bandwidth, and reliability requirements for a wide range of system para"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03787","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-18T01:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Osixa8vTitL62bjs9iORu2NqaBLeueZ0vXg01oWoVeB4DWeWMYWatGxTx8zoAC3xWlPFxR4RdSp7oC88NadjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:44:59.863266Z"},"content_sha256":"605acf647169641e68c933a287f4ba830ccdbb866f64d70e9004ffe4d9b0a9da","schema_version":"1.0","event_id":"sha256:605acf647169641e68c933a287f4ba830ccdbb866f64d70e9004ffe4d9b0a9da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZY3UCJFO4J4JYN46Y2I5NLCPUK/bundle.json","state_url":"https://pith.science/pith/ZY3UCJFO4J4JYN46Y2I5NLCPUK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZY3UCJFO4J4JYN46Y2I5NLCPUK/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-31T04:44:59Z","links":{"resolver":"https://pith.science/pith/ZY3UCJFO4J4JYN46Y2I5NLCPUK","bundle":"https://pith.science/pith/ZY3UCJFO4J4JYN46Y2I5NLCPUK/bundle.json","state":"https://pith.science/pith/ZY3UCJFO4J4JYN46Y2I5NLCPUK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZY3UCJFO4J4JYN46Y2I5NLCPUK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZY3UCJFO4J4JYN46Y2I5NLCPUK","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":"b1d83713fa4681b757d04bbff126b8dcef191913c35af3e039c745cebb014563","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-16T03:40:48Z","title_canon_sha256":"9a2c21feec94bbcc3f9474e862bfd80946b5da7239353b5d3734edd268406588"},"schema_version":"1.0","source":{"id":"1508.03787","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03787","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03787v1","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03787","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"ZY3UCJFO4J4J","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZY3UCJFO4J4JYN46","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZY3UCJFO","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:605acf647169641e68c933a287f4ba830ccdbb866f64d70e9004ffe4d9b0a9da","target":"graph","created_at":"2026-05-18T01:35:15Z","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":"Repair operations in distributed storage systems potentially expose the data to malicious acts of passive eavesdroppers or active adversaries, which can be detrimental to the security of the system. This paper presents erasure codes and repair algorithms that ensure security of the data in the presence of passive eavesdroppers and active adversaries, while maintaining high availability, reliability and efficiency in the system. Our codes are optimal in that they meet previously proposed lower bounds on the storage, network-bandwidth, and reliability requirements for a wide range of system para","authors_text":"Kannan Ramchandran, K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-16T03:40:48Z","title":"Information-theoretically Secure Erasure Codes for Distributed Storage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03787","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:36e3c34b1a53a484563c1e75954c296d45980842517fb777ee6a104346a49a6a","target":"record","created_at":"2026-05-18T01:35:15Z","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":"b1d83713fa4681b757d04bbff126b8dcef191913c35af3e039c745cebb014563","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-16T03:40:48Z","title_canon_sha256":"9a2c21feec94bbcc3f9474e862bfd80946b5da7239353b5d3734edd268406588"},"schema_version":"1.0","source":{"id":"1508.03787","kind":"arxiv","version":1}},"canonical_sha256":"ce374124aee2789c379ec691d6ac4fa289b9701ebadf6adf8fc6d74aceb4fc0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce374124aee2789c379ec691d6ac4fa289b9701ebadf6adf8fc6d74aceb4fc0f","first_computed_at":"2026-05-18T01:35:15.244190Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:15.244190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wIvu0PsixVrTBrtIU8z+0eqqRyL1jjTf6l7Sy5hnHzK+IDkQXSwvbPyxuveCoeK24GEjK050h/vMVEfoACEGCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:15.244638Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.03787","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36e3c34b1a53a484563c1e75954c296d45980842517fb777ee6a104346a49a6a","sha256:605acf647169641e68c933a287f4ba830ccdbb866f64d70e9004ffe4d9b0a9da"],"state_sha256":"30dad694789a75bf21e5240647b8688547ffed253f95106b1150ee77c6d7bb02"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qEuz1//D6ZDh4nIog5mqLx9EQmxQ2MlYGeRbM+GvveAqVSQl1+h0eDyJ95JaVrMO7W9t7YvRIyTxqU/v27T1DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:44:59.866758Z","bundle_sha256":"eee98fb091b1f32c76b003b42c15a721934858ffff96322b59f21465bd95f21c"}}