{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WLBV33J7VRSMVDIN6VCXURHBQW","short_pith_number":"pith:WLBV33J7","schema_version":"1.0","canonical_sha256":"b2c35ded3fac64ca8d0df5457a44e185b4a45b54c949793b6e9a1004dd147c1a","source":{"kind":"arxiv","id":"1207.0879","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.0879","created_at":"2026-05-18T03:51:48.123188+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.0879v1","created_at":"2026-05-18T03:51:48.123188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0879","created_at":"2026-05-18T03:51:48.123188+00:00"},{"alias_kind":"pith_short_12","alias_value":"WLBV33J7VRSM","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"WLBV33J7VRSMVDIN","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"WLBV33J7","created_at":"2026-05-18T12:27:25.539911+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WLBV33J7VRSMVDIN6VCXURHBQW","json":"https://pith.science/pith/WLBV33J7VRSMVDIN6VCXURHBQW.json","graph_json":"https://pith.science/api/pith-number/WLBV33J7VRSMVDIN6VCXURHBQW/graph.json","events_json":"https://pith.science/api/pith-number/WLBV33J7VRSMVDIN6VCXURHBQW/events.json","paper":"https://pith.science/paper/WLBV33J7"},"agent_actions":{"view_html":"https://pith.science/pith/WLBV33J7VRSMVDIN6VCXURHBQW","download_json":"https://pith.science/pith/WLBV33J7VRSMVDIN6VCXURHBQW.json","view_paper":"https://pith.science/paper/WLBV33J7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.0879&json=true","fetch_graph":"https://pith.science/api/pith-number/WLBV33J7VRSMVDIN6VCXURHBQW/graph.json","fetch_events":"https://pith.science/api/pith-number/WLBV33J7VRSMVDIN6VCXURHBQW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WLBV33J7VRSMVDIN6VCXURHBQW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WLBV33J7VRSMVDIN6VCXURHBQW/action/storage_attestation","attest_author":"https://pith.science/pith/WLBV33J7VRSMVDIN6VCXURHBQW/action/author_attestation","sign_citation":"https://pith.science/pith/WLBV33J7VRSMVDIN6VCXURHBQW/action/citation_signature","submit_replication":"https://pith.science/pith/WLBV33J7VRSMVDIN6VCXURHBQW/action/replication_record"}},"created_at":"2026-05-18T03:51:48.123188+00:00","updated_at":"2026-05-18T03:51:48.123188+00:00"}