{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:23WVPDOD5BLVFRU76LX4V7A2XE","short_pith_number":"pith:23WVPDOD","canonical_record":{"source":{"id":"1207.6762","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-29T09:57:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8f8722eb20901556af4f6fb22d365d022980f199cb49fc86c84c6d7828040e09","abstract_canon_sha256":"934401cd8f58665073f588e2e6424c9d4c10708bd9d8434e4dd9c9d003f609c3"},"schema_version":"1.0"},"canonical_sha256":"d6ed578dc3e85752c69ff2efcafc1ab920003f08ccdfbc051b1a9cbe51ee6f1d","source":{"kind":"arxiv","id":"1207.6762","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6762","created_at":"2026-05-18T02:21:07Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6762v5","created_at":"2026-05-18T02:21:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6762","created_at":"2026-05-18T02:21:07Z"},{"alias_kind":"pith_short_12","alias_value":"23WVPDOD5BLV","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"23WVPDOD5BLVFRU7","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"23WVPDOD","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:23WVPDOD5BLVFRU76LX4V7A2XE","target":"record","payload":{"canonical_record":{"source":{"id":"1207.6762","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-29T09:57:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8f8722eb20901556af4f6fb22d365d022980f199cb49fc86c84c6d7828040e09","abstract_canon_sha256":"934401cd8f58665073f588e2e6424c9d4c10708bd9d8434e4dd9c9d003f609c3"},"schema_version":"1.0"},"canonical_sha256":"d6ed578dc3e85752c69ff2efcafc1ab920003f08ccdfbc051b1a9cbe51ee6f1d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:07.902013Z","signature_b64":"fGH1pL08PlzXLPL7Wu9ZKm2QXQbt3d0UqAgBnWH/b5pqBkdVgNsFOoJ8c09mkA09e6ja4jM/qp2y6HuwxhznDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6ed578dc3e85752c69ff2efcafc1ab920003f08ccdfbc051b1a9cbe51ee6f1d","last_reissued_at":"2026-05-18T02:21:07.901424Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:07.901424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.6762","source_version":5,"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:21:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+9NiWfMBnQTpgOfKv/aLPfHKoG9rkeU2sH5xJY8EYvpMJtHS+E9+YRn57p6ign2iO1ucbN8fXFGfboRKwIEXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T22:21:04.774641Z"},"content_sha256":"8b78d50675a86e564abbf6f40675f03c8670ddcab0ef37dacb6fc62701e2eee8","schema_version":"1.0","event_id":"sha256:8b78d50675a86e564abbf6f40675f03c8670ddcab0ef37dacb6fc62701e2eee8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:23WVPDOD5BLVFRU76LX4V7A2XE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cooperative Regenerating Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kenneth W. Shum, Yuchong Hu","submitted_at":"2012-07-29T09:57:44Z","abstract_excerpt":"One of the design objectives in distributed storage system is the minimization of the data traffic during the repair of failed storage nodes. By repairing multiple failures simultaneously and cooperatively, further reduction of repair traffic is made possible. A closed-form expression of the optimal tradeoff between the repair traffic and the amount of storage in each node for cooperative repair is given. We show that the points on the tradeoff curve can be achieved by linear cooperative regenerating codes, with an explicit bound on the required finite field size. The proof relies on a max-flo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6762","kind":"arxiv","version":5},"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:21:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FhiB7qHTFIIdVm/vFNEimaQ1yBZBSFLsxBccKdxsgOVzv1BKuZvNdgcmi3cuiUucdMZTwmD9WeNQuE0ZM999CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T22:21:04.774974Z"},"content_sha256":"5e36135584c45db5c1046dd90fb873aa89d940588835974d975d46e4e3718ba0","schema_version":"1.0","event_id":"sha256:5e36135584c45db5c1046dd90fb873aa89d940588835974d975d46e4e3718ba0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/23WVPDOD5BLVFRU76LX4V7A2XE/bundle.json","state_url":"https://pith.science/pith/23WVPDOD5BLVFRU76LX4V7A2XE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/23WVPDOD5BLVFRU76LX4V7A2XE/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-29T22:21:04Z","links":{"resolver":"https://pith.science/pith/23WVPDOD5BLVFRU76LX4V7A2XE","bundle":"https://pith.science/pith/23WVPDOD5BLVFRU76LX4V7A2XE/bundle.json","state":"https://pith.science/pith/23WVPDOD5BLVFRU76LX4V7A2XE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/23WVPDOD5BLVFRU76LX4V7A2XE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:23WVPDOD5BLVFRU76LX4V7A2XE","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":"934401cd8f58665073f588e2e6424c9d4c10708bd9d8434e4dd9c9d003f609c3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-29T09:57:44Z","title_canon_sha256":"8f8722eb20901556af4f6fb22d365d022980f199cb49fc86c84c6d7828040e09"},"schema_version":"1.0","source":{"id":"1207.6762","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6762","created_at":"2026-05-18T02:21:07Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6762v5","created_at":"2026-05-18T02:21:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6762","created_at":"2026-05-18T02:21:07Z"},{"alias_kind":"pith_short_12","alias_value":"23WVPDOD5BLV","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"23WVPDOD5BLVFRU7","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"23WVPDOD","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:5e36135584c45db5c1046dd90fb873aa89d940588835974d975d46e4e3718ba0","target":"graph","created_at":"2026-05-18T02:21:07Z","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":"One of the design objectives in distributed storage system is the minimization of the data traffic during the repair of failed storage nodes. By repairing multiple failures simultaneously and cooperatively, further reduction of repair traffic is made possible. A closed-form expression of the optimal tradeoff between the repair traffic and the amount of storage in each node for cooperative repair is given. We show that the points on the tradeoff curve can be achieved by linear cooperative regenerating codes, with an explicit bound on the required finite field size. The proof relies on a max-flo","authors_text":"Kenneth W. Shum, Yuchong Hu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-29T09:57:44Z","title":"Cooperative Regenerating Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6762","kind":"arxiv","version":5},"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:8b78d50675a86e564abbf6f40675f03c8670ddcab0ef37dacb6fc62701e2eee8","target":"record","created_at":"2026-05-18T02:21:07Z","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":"934401cd8f58665073f588e2e6424c9d4c10708bd9d8434e4dd9c9d003f609c3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-29T09:57:44Z","title_canon_sha256":"8f8722eb20901556af4f6fb22d365d022980f199cb49fc86c84c6d7828040e09"},"schema_version":"1.0","source":{"id":"1207.6762","kind":"arxiv","version":5}},"canonical_sha256":"d6ed578dc3e85752c69ff2efcafc1ab920003f08ccdfbc051b1a9cbe51ee6f1d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6ed578dc3e85752c69ff2efcafc1ab920003f08ccdfbc051b1a9cbe51ee6f1d","first_computed_at":"2026-05-18T02:21:07.901424Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:07.901424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fGH1pL08PlzXLPL7Wu9ZKm2QXQbt3d0UqAgBnWH/b5pqBkdVgNsFOoJ8c09mkA09e6ja4jM/qp2y6HuwxhznDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:07.902013Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.6762","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b78d50675a86e564abbf6f40675f03c8670ddcab0ef37dacb6fc62701e2eee8","sha256:5e36135584c45db5c1046dd90fb873aa89d940588835974d975d46e4e3718ba0"],"state_sha256":"0985da4a10138719a6dca909fb0127bca0c8dee29cd4fdf15c006c79c25ae9e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0bXjAlVqd7BlolRJNTU8idHKD+sgWXNkMD/zBqL9TuY+xG00EyA+cDzADUUjsVu8GLYrr7RlrYJZJLtuJ657Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T22:21:04.776844Z","bundle_sha256":"5af9230174f5eb269d517cb07de90cb00f504b23c3889b34751a6810cafd793a"}}