{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:GYT3R3NBWZMOSOSX5ANZC5D267","short_pith_number":"pith:GYT3R3NB","canonical_record":{"source":{"id":"1102.0204","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-01T16:26:07Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"e97a92e60228ea08af0fec7408e7e91e52278e094e9dc5924e9163924f79e759","abstract_canon_sha256":"deea3e41081c85c168ffdd7c1efba4cec62ec3590d7a51df4dc6af01d2105aa3"},"schema_version":"1.0"},"canonical_sha256":"3627b8eda1b658e93a57e81b91747af7e880cd3fcf894670444e7bc991243782","source":{"kind":"arxiv","id":"1102.0204","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.0204","created_at":"2026-05-18T03:13:11Z"},{"alias_kind":"arxiv_version","alias_value":"1102.0204v3","created_at":"2026-05-18T03:13:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0204","created_at":"2026-05-18T03:13:11Z"},{"alias_kind":"pith_short_12","alias_value":"GYT3R3NBWZMO","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GYT3R3NBWZMOSOSX","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GYT3R3NB","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:GYT3R3NBWZMOSOSX5ANZC5D267","target":"record","payload":{"canonical_record":{"source":{"id":"1102.0204","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-01T16:26:07Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"e97a92e60228ea08af0fec7408e7e91e52278e094e9dc5924e9163924f79e759","abstract_canon_sha256":"deea3e41081c85c168ffdd7c1efba4cec62ec3590d7a51df4dc6af01d2105aa3"},"schema_version":"1.0"},"canonical_sha256":"3627b8eda1b658e93a57e81b91747af7e880cd3fcf894670444e7bc991243782","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:11.184620Z","signature_b64":"dL5Rv/wssfxBxYCDBBM/R0eG7t0FFc47HV2TZ2JXtqzBDPra6XVrJfvT+CGi+p53Il90kI68r9TV+i6eYa0rDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3627b8eda1b658e93a57e81b91747af7e880cd3fcf894670444e7bc991243782","last_reissued_at":"2026-05-18T03:13:11.183894Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:11.183894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.0204","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-18T03:13:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q2wxj6N5mvtuT34k4hVY8DFVK+XOhqyIfiB8T1Ql1lGg4gYCpwzRBULTEU8g75aPwhuexpxnutUzPFAAx7DvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:19:42.637724Z"},"content_sha256":"60b22a7a65fe350667df6907ab54b90e98f5798c0c4a3bbf3924b8e50094cc0e","schema_version":"1.0","event_id":"sha256:60b22a7a65fe350667df6907ab54b90e98f5798c0c4a3bbf3924b8e50094cc0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:GYT3R3NBWZMOSOSX5ANZC5D267","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Repairing Multiple Failures with Coordinated and Adaptive Regenerating Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"Anne-Marie Kermarrec, Gilles Straub, Nicolas Le Scouarnec","submitted_at":"2011-02-01T16:26:07Z","abstract_excerpt":"Erasure correcting codes are widely used to ensure data persistence in distributed storage systems. This paper addresses the simultaneous repair of multiple failures in such codes. We go beyond existing work (i.e., regenerating codes by Dimakis et al.) by describing (i) coordinated regenerating codes (also known as cooperative regenerating codes) which support the simultaneous repair of multiple devices, and (ii) adaptive regenerating codes which allow adapting the parameters at each repair. Similarly to regenerating codes by Dimakis et al., these codes achieve the optimal tradeoff between sto"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.0204","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-18T03:13:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JmeCeb0tAhinCkxGtsIcDlW5s8M0slQiZM11B7qp/1M4Z0IM1YHPGffc1OvARB/2h5Ti47NKzZ/lt9gVfpZpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:19:42.638387Z"},"content_sha256":"b5e19fde839a954b601bc645fe59531903e8430d8ef3ca5a15bef9a398e8d5a9","schema_version":"1.0","event_id":"sha256:b5e19fde839a954b601bc645fe59531903e8430d8ef3ca5a15bef9a398e8d5a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GYT3R3NBWZMOSOSX5ANZC5D267/bundle.json","state_url":"https://pith.science/pith/GYT3R3NBWZMOSOSX5ANZC5D267/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GYT3R3NBWZMOSOSX5ANZC5D267/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-30T05:19:42Z","links":{"resolver":"https://pith.science/pith/GYT3R3NBWZMOSOSX5ANZC5D267","bundle":"https://pith.science/pith/GYT3R3NBWZMOSOSX5ANZC5D267/bundle.json","state":"https://pith.science/pith/GYT3R3NBWZMOSOSX5ANZC5D267/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GYT3R3NBWZMOSOSX5ANZC5D267/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:GYT3R3NBWZMOSOSX5ANZC5D267","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":"deea3e41081c85c168ffdd7c1efba4cec62ec3590d7a51df4dc6af01d2105aa3","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-01T16:26:07Z","title_canon_sha256":"e97a92e60228ea08af0fec7408e7e91e52278e094e9dc5924e9163924f79e759"},"schema_version":"1.0","source":{"id":"1102.0204","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.0204","created_at":"2026-05-18T03:13:11Z"},{"alias_kind":"arxiv_version","alias_value":"1102.0204v3","created_at":"2026-05-18T03:13:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0204","created_at":"2026-05-18T03:13:11Z"},{"alias_kind":"pith_short_12","alias_value":"GYT3R3NBWZMO","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GYT3R3NBWZMOSOSX","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GYT3R3NB","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:b5e19fde839a954b601bc645fe59531903e8430d8ef3ca5a15bef9a398e8d5a9","target":"graph","created_at":"2026-05-18T03:13:11Z","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":"Erasure correcting codes are widely used to ensure data persistence in distributed storage systems. This paper addresses the simultaneous repair of multiple failures in such codes. We go beyond existing work (i.e., regenerating codes by Dimakis et al.) by describing (i) coordinated regenerating codes (also known as cooperative regenerating codes) which support the simultaneous repair of multiple devices, and (ii) adaptive regenerating codes which allow adapting the parameters at each repair. Similarly to regenerating codes by Dimakis et al., these codes achieve the optimal tradeoff between sto","authors_text":"Anne-Marie Kermarrec, Gilles Straub, Nicolas Le Scouarnec","cross_cats":["cs.DC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-01T16:26:07Z","title":"Repairing Multiple Failures with Coordinated and Adaptive Regenerating Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.0204","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:60b22a7a65fe350667df6907ab54b90e98f5798c0c4a3bbf3924b8e50094cc0e","target":"record","created_at":"2026-05-18T03:13:11Z","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":"deea3e41081c85c168ffdd7c1efba4cec62ec3590d7a51df4dc6af01d2105aa3","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-01T16:26:07Z","title_canon_sha256":"e97a92e60228ea08af0fec7408e7e91e52278e094e9dc5924e9163924f79e759"},"schema_version":"1.0","source":{"id":"1102.0204","kind":"arxiv","version":3}},"canonical_sha256":"3627b8eda1b658e93a57e81b91747af7e880cd3fcf894670444e7bc991243782","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3627b8eda1b658e93a57e81b91747af7e880cd3fcf894670444e7bc991243782","first_computed_at":"2026-05-18T03:13:11.183894Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:11.183894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dL5Rv/wssfxBxYCDBBM/R0eG7t0FFc47HV2TZ2JXtqzBDPra6XVrJfvT+CGi+p53Il90kI68r9TV+i6eYa0rDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:11.184620Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.0204","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:60b22a7a65fe350667df6907ab54b90e98f5798c0c4a3bbf3924b8e50094cc0e","sha256:b5e19fde839a954b601bc645fe59531903e8430d8ef3ca5a15bef9a398e8d5a9"],"state_sha256":"820d616d6d084bc4848569f76a5e6cbfda428af7a5cfa81178505d9081547f51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KO4X2/SOGrRMCSx3e90g47F7sjjenE6yFbXK5IS0hLl6NX99B84pV0AeW+msmR7XuipESF/6w/jL4+pGWFa6DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:19:42.641649Z","bundle_sha256":"4a386c9b46476a85e455a1604e3428bb5d6bd3d3b17cebd2bfcbc43d46db00cb"}}