{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QKT45I2KJU2ICUZ76CYPA4NIYS","short_pith_number":"pith:QKT45I2K","canonical_record":{"source":{"id":"1210.3664","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-13T01:58:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c1a4cd165556a72e583d0133d3216d4e60c1a2194fdc90637fe17c0b013abc5c","abstract_canon_sha256":"aa0633ad26fe63327488bb3b71bbc0a3e3af9f620b20b3e52231b9b1c0583e0a"},"schema_version":"1.0"},"canonical_sha256":"82a7cea34a4d3481533ff0b0f071a8c4b6a35e928fd856007e1fd67b28c6ac40","source":{"kind":"arxiv","id":"1210.3664","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.3664","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"arxiv_version","alias_value":"1210.3664v2","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3664","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"pith_short_12","alias_value":"QKT45I2KJU2I","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QKT45I2KJU2ICUZ7","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QKT45I2K","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QKT45I2KJU2ICUZ76CYPA4NIYS","target":"record","payload":{"canonical_record":{"source":{"id":"1210.3664","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-13T01:58:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c1a4cd165556a72e583d0133d3216d4e60c1a2194fdc90637fe17c0b013abc5c","abstract_canon_sha256":"aa0633ad26fe63327488bb3b71bbc0a3e3af9f620b20b3e52231b9b1c0583e0a"},"schema_version":"1.0"},"canonical_sha256":"82a7cea34a4d3481533ff0b0f071a8c4b6a35e928fd856007e1fd67b28c6ac40","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:02.887040Z","signature_b64":"XhoGQNH9QpJjoz8XuWppW6xLdYwqGMPSH5LReGWpZFMDtUupOq0gZgce2mZqGMCy04eRKq18d6i68c1JqVrRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82a7cea34a4d3481533ff0b0f071a8c4b6a35e928fd856007e1fd67b28c6ac40","last_reissued_at":"2026-05-18T02:48:02.886411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:02.886411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.3664","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-18T02:48:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZPBv4ME3j2UxgzEj5KEigEOXSP1JGJqrhYQ7JuhObpTQze0grybTQsMMWke1fyJc7StxnRZ++HH+EAevVy8aCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:38:06.948862Z"},"content_sha256":"907ec229b8b2961dcca5ce37de726197d0f3d33fc8e7a4e77cedbf8bb1c5ac68","schema_version":"1.0","event_id":"sha256:907ec229b8b2961dcca5ce37de726197d0f3d33fc8e7a4e77cedbf8bb1c5ac68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QKT45I2KJU2ICUZ76CYPA4NIYS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Secure Cooperative Regenerating Codes for Distributed Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ankit Singh Rawat, O. Ozan Koyluoglu, Sriram Vishwanath","submitted_at":"2012-10-13T01:58:55Z","abstract_excerpt":"Regenerating codes enable trading off repair bandwidth for storage in distributed storage systems (DSS). Due to their distributed nature, these systems are intrinsically susceptible to attacks, and they may also be subject to multiple simultaneous node failures. Cooperative regenerating codes allow bandwidth efficient repair of multiple simultaneous node failures. This paper analyzes storage systems that employ cooperative regenerating codes that are robust to (passive) eavesdroppers. The analysis is divided into two parts, studying both minimum bandwidth and minimum storage cooperative regene"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3664","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-18T02:48:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"shycfM/VFIC8SWOWZYujHrxUBEepCMnHPW8i1r+vkFxFfQ/QSCicJL27oZtPDdAxXlj04Vih3ca+d2Xv+WcJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:38:06.949568Z"},"content_sha256":"40dbc8803946e19c2e352fff43b5321fcc10d131c918c53676b2fbd6c0a8c7d1","schema_version":"1.0","event_id":"sha256:40dbc8803946e19c2e352fff43b5321fcc10d131c918c53676b2fbd6c0a8c7d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QKT45I2KJU2ICUZ76CYPA4NIYS/bundle.json","state_url":"https://pith.science/pith/QKT45I2KJU2ICUZ76CYPA4NIYS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QKT45I2KJU2ICUZ76CYPA4NIYS/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-31T03:38:06Z","links":{"resolver":"https://pith.science/pith/QKT45I2KJU2ICUZ76CYPA4NIYS","bundle":"https://pith.science/pith/QKT45I2KJU2ICUZ76CYPA4NIYS/bundle.json","state":"https://pith.science/pith/QKT45I2KJU2ICUZ76CYPA4NIYS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QKT45I2KJU2ICUZ76CYPA4NIYS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QKT45I2KJU2ICUZ76CYPA4NIYS","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":"aa0633ad26fe63327488bb3b71bbc0a3e3af9f620b20b3e52231b9b1c0583e0a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-13T01:58:55Z","title_canon_sha256":"c1a4cd165556a72e583d0133d3216d4e60c1a2194fdc90637fe17c0b013abc5c"},"schema_version":"1.0","source":{"id":"1210.3664","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.3664","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"arxiv_version","alias_value":"1210.3664v2","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3664","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"pith_short_12","alias_value":"QKT45I2KJU2I","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QKT45I2KJU2ICUZ7","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QKT45I2K","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:40dbc8803946e19c2e352fff43b5321fcc10d131c918c53676b2fbd6c0a8c7d1","target":"graph","created_at":"2026-05-18T02:48:02Z","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":"Regenerating codes enable trading off repair bandwidth for storage in distributed storage systems (DSS). Due to their distributed nature, these systems are intrinsically susceptible to attacks, and they may also be subject to multiple simultaneous node failures. Cooperative regenerating codes allow bandwidth efficient repair of multiple simultaneous node failures. This paper analyzes storage systems that employ cooperative regenerating codes that are robust to (passive) eavesdroppers. The analysis is divided into two parts, studying both minimum bandwidth and minimum storage cooperative regene","authors_text":"Ankit Singh Rawat, O. Ozan Koyluoglu, Sriram Vishwanath","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-13T01:58:55Z","title":"Secure Cooperative Regenerating Codes for Distributed Storage Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3664","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:907ec229b8b2961dcca5ce37de726197d0f3d33fc8e7a4e77cedbf8bb1c5ac68","target":"record","created_at":"2026-05-18T02:48:02Z","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":"aa0633ad26fe63327488bb3b71bbc0a3e3af9f620b20b3e52231b9b1c0583e0a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-13T01:58:55Z","title_canon_sha256":"c1a4cd165556a72e583d0133d3216d4e60c1a2194fdc90637fe17c0b013abc5c"},"schema_version":"1.0","source":{"id":"1210.3664","kind":"arxiv","version":2}},"canonical_sha256":"82a7cea34a4d3481533ff0b0f071a8c4b6a35e928fd856007e1fd67b28c6ac40","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82a7cea34a4d3481533ff0b0f071a8c4b6a35e928fd856007e1fd67b28c6ac40","first_computed_at":"2026-05-18T02:48:02.886411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:02.886411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XhoGQNH9QpJjoz8XuWppW6xLdYwqGMPSH5LReGWpZFMDtUupOq0gZgce2mZqGMCy04eRKq18d6i68c1JqVrRDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:02.887040Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.3664","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:907ec229b8b2961dcca5ce37de726197d0f3d33fc8e7a4e77cedbf8bb1c5ac68","sha256:40dbc8803946e19c2e352fff43b5321fcc10d131c918c53676b2fbd6c0a8c7d1"],"state_sha256":"47162455d3ade92425a4f378867b07905373c4c3af44163667372df6816717ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f5N+h0YnMqABRqUuMB+zIrLScr93z0xq6ifLjm/87mZkJVubc6MInVgptmSI/gP0CfDL0vWTtLPWCBtt2hmEBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:38:06.952967Z","bundle_sha256":"e61d45919c09f5be1da1ad86309f92429df861979319fb772f88f84c341833d5"}}