{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WLBV33J7VRSMVDIN6VCXURHBQW","short_pith_number":"pith:WLBV33J7","canonical_record":{"source":{"id":"1207.0879","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-04T02:26:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a0c7390cfbe50dd7423caefee1c377c8e897839a91306be7bbde225975339e88","abstract_canon_sha256":"1d3f21f5dba776962ad6a1e38ad5842c1464021e50e58c2336e3051f7f3510be"},"schema_version":"1.0"},"canonical_sha256":"b2c35ded3fac64ca8d0df5457a44e185b4a45b54c949793b6e9a1004dd147c1a","source":{"kind":"arxiv","id":"1207.0879","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0879","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0879v1","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0879","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"pith_short_12","alias_value":"WLBV33J7VRSM","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WLBV33J7VRSMVDIN","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WLBV33J7","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WLBV33J7VRSMVDIN6VCXURHBQW","target":"record","payload":{"canonical_record":{"source":{"id":"1207.0879","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-04T02:26:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a0c7390cfbe50dd7423caefee1c377c8e897839a91306be7bbde225975339e88","abstract_canon_sha256":"1d3f21f5dba776962ad6a1e38ad5842c1464021e50e58c2336e3051f7f3510be"},"schema_version":"1.0"},"canonical_sha256":"b2c35ded3fac64ca8d0df5457a44e185b4a45b54c949793b6e9a1004dd147c1a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:48.123618Z","signature_b64":"ytZ+TnLJ2x0lwY4yvqY9tPp6rR1eNosedbkcvnKVtTWN50Rj+c/WTLuO7k28ihC+TsFxk2PriB29N5ItmBKkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2c35ded3fac64ca8d0df5457a44e185b4a45b54c949793b6e9a1004dd147c1a","last_reissued_at":"2026-05-18T03:51:48.123107Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:48.123107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.0879","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-18T03:51:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VbPksC8zKQ8+8f6m9vSz7qFYM2TuPFrGpQITPCEMSN4f/ERO4A+QoWqcjDKElmJkh4wlKRrtZUjjqcIFDW4yAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:53:27.328056Z"},"content_sha256":"02e6c0885518f92e72396ab1fe9e4ae0b44bc355d5647dfb1397bcb9ecc0fe68","schema_version":"1.0","event_id":"sha256:02e6c0885518f92e72396ab1fe9e4ae0b44bc355d5647dfb1397bcb9ecc0fe68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WLBV33J7VRSMVDIN6VCXURHBQW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact Cooperative Regenerating Codes with Minimum-Repair-Bandwidth for Distributed Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anyu Wang, Zhifang Zhang","submitted_at":"2012-07-04T02:26:05Z","abstract_excerpt":"We give an explicit construction of exact cooperative regenerating codes at the MBCR (minimum bandwidth cooperative regeneration) point. Before the paper, the only known explicit MBCR code is given with parameters $n=d+r$ and $d=k$, while our construction applies to all possible values of $n,k,d,r$. The code has a brief expression in the polynomial form and the data reconstruction is accomplished by bivariate polynomial interpolation. It is a scalar code and operates over a finite field of size $q\\geq n$. Besides, we establish several subspace properties for linear exact MBCR codes. Based on t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0879","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-18T03:51:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/dP705WBWblBivnpx7KeDNHNlp5fSVF//MGLyYSKc6Gs4OXtK181ojWt3D2BurowX/hxHDzYy/0f4cpIVJ4WAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:53:27.328746Z"},"content_sha256":"a026a4c7cec3432c1b89ef62154c010c3429eac3beb69a023b4d9a2982c0426f","schema_version":"1.0","event_id":"sha256:a026a4c7cec3432c1b89ef62154c010c3429eac3beb69a023b4d9a2982c0426f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WLBV33J7VRSMVDIN6VCXURHBQW/bundle.json","state_url":"https://pith.science/pith/WLBV33J7VRSMVDIN6VCXURHBQW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WLBV33J7VRSMVDIN6VCXURHBQW/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-11T00:53:27Z","links":{"resolver":"https://pith.science/pith/WLBV33J7VRSMVDIN6VCXURHBQW","bundle":"https://pith.science/pith/WLBV33J7VRSMVDIN6VCXURHBQW/bundle.json","state":"https://pith.science/pith/WLBV33J7VRSMVDIN6VCXURHBQW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WLBV33J7VRSMVDIN6VCXURHBQW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WLBV33J7VRSMVDIN6VCXURHBQW","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":"1d3f21f5dba776962ad6a1e38ad5842c1464021e50e58c2336e3051f7f3510be","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-04T02:26:05Z","title_canon_sha256":"a0c7390cfbe50dd7423caefee1c377c8e897839a91306be7bbde225975339e88"},"schema_version":"1.0","source":{"id":"1207.0879","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0879","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0879v1","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0879","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"pith_short_12","alias_value":"WLBV33J7VRSM","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WLBV33J7VRSMVDIN","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WLBV33J7","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:a026a4c7cec3432c1b89ef62154c010c3429eac3beb69a023b4d9a2982c0426f","target":"graph","created_at":"2026-05-18T03:51:48Z","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":"We give an explicit construction of exact cooperative regenerating codes at the MBCR (minimum bandwidth cooperative regeneration) point. Before the paper, the only known explicit MBCR code is given with parameters $n=d+r$ and $d=k$, while our construction applies to all possible values of $n,k,d,r$. The code has a brief expression in the polynomial form and the data reconstruction is accomplished by bivariate polynomial interpolation. It is a scalar code and operates over a finite field of size $q\\geq n$. Besides, we establish several subspace properties for linear exact MBCR codes. Based on t","authors_text":"Anyu Wang, Zhifang Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-04T02:26:05Z","title":"Exact Cooperative Regenerating Codes with Minimum-Repair-Bandwidth for Distributed Storage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0879","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:02e6c0885518f92e72396ab1fe9e4ae0b44bc355d5647dfb1397bcb9ecc0fe68","target":"record","created_at":"2026-05-18T03:51:48Z","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":"1d3f21f5dba776962ad6a1e38ad5842c1464021e50e58c2336e3051f7f3510be","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-04T02:26:05Z","title_canon_sha256":"a0c7390cfbe50dd7423caefee1c377c8e897839a91306be7bbde225975339e88"},"schema_version":"1.0","source":{"id":"1207.0879","kind":"arxiv","version":1}},"canonical_sha256":"b2c35ded3fac64ca8d0df5457a44e185b4a45b54c949793b6e9a1004dd147c1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2c35ded3fac64ca8d0df5457a44e185b4a45b54c949793b6e9a1004dd147c1a","first_computed_at":"2026-05-18T03:51:48.123107Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:48.123107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ytZ+TnLJ2x0lwY4yvqY9tPp6rR1eNosedbkcvnKVtTWN50Rj+c/WTLuO7k28ihC+TsFxk2PriB29N5ItmBKkBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:48.123618Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.0879","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02e6c0885518f92e72396ab1fe9e4ae0b44bc355d5647dfb1397bcb9ecc0fe68","sha256:a026a4c7cec3432c1b89ef62154c010c3429eac3beb69a023b4d9a2982c0426f"],"state_sha256":"dfdbbf3cd98c22f5eddde0379411f5757898124bd5faeb0dbb90fb134d4a8fa9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZYlI7XGfzA7o6ah5VyGaoJCUKsfQvnBYY+UEx1KAjY8nBctDHJ4WgGEQWZSkirSKGmSMmaa8A4ltO6xnaN7jCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T00:53:27.332459Z","bundle_sha256":"325e026edd07fddbab01f96e1e1f00f248988a35e4d70aafe3f61c5f94553315"}}