{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CIG6UWHH6IF7IKRHPWP6CARJFI","short_pith_number":"pith:CIG6UWHH","schema_version":"1.0","canonical_sha256":"120dea58e7f20bf42a277d9fe102292a303db06ae1f58e3a0480d0923c52f5a6","source":{"kind":"arxiv","id":"1207.0854","version":1},"attestation_state":"computed","paper":{"title":"CROSS-MBCR: Exact Minimum Bandwith Coordinated Regenerating Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nicolas Le Scouarnec, Steve Jiekak","submitted_at":"2012-07-03T22:51:36Z","abstract_excerpt":"We study the exact and optimal repair of multiple failures in codes for distributed storage. More particularly, we provide an explicit construction of exact minimum bandwidth coordinated regenerating codes (MBCR) for n=d+t,k,d >= k,t >= 1. Our construction differs from existing constructions by allowing both t>1 (i.e., repair of multiple failures) and d>k (i.e., contacting more than k devices during repair)."},"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.0854","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-03T22:51:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"957badf97fe127c335893918bc47a07dbaa9a22fe5333719f899e7500f04cb9a","abstract_canon_sha256":"33c78550efb35bfc21663276c7ef70f4f3eaaae9841223fddb8790bf85db7cce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:48.200987Z","signature_b64":"ZpTuViu76JddGdZYYFQDcyvVyPZ+t1n+5vjb/gfaLIPXYVFMjK6U3En+enyZ/0XfVzrrjqc/ERMY6VAVevGuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"120dea58e7f20bf42a277d9fe102292a303db06ae1f58e3a0480d0923c52f5a6","last_reissued_at":"2026-05-18T03:51:48.200236Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:48.200236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CROSS-MBCR: Exact Minimum Bandwith Coordinated Regenerating Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nicolas Le Scouarnec, Steve Jiekak","submitted_at":"2012-07-03T22:51:36Z","abstract_excerpt":"We study the exact and optimal repair of multiple failures in codes for distributed storage. More particularly, we provide an explicit construction of exact minimum bandwidth coordinated regenerating codes (MBCR) for n=d+t,k,d >= k,t >= 1. Our construction differs from existing constructions by allowing both t>1 (i.e., repair of multiple failures) and d>k (i.e., contacting more than k devices during repair)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0854","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.0854","created_at":"2026-05-18T03:51:48.200332+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.0854v1","created_at":"2026-05-18T03:51:48.200332+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0854","created_at":"2026-05-18T03:51:48.200332+00:00"},{"alias_kind":"pith_short_12","alias_value":"CIG6UWHH6IF7","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CIG6UWHH6IF7IKRH","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CIG6UWHH","created_at":"2026-05-18T12:27:01.376967+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/CIG6UWHH6IF7IKRHPWP6CARJFI","json":"https://pith.science/pith/CIG6UWHH6IF7IKRHPWP6CARJFI.json","graph_json":"https://pith.science/api/pith-number/CIG6UWHH6IF7IKRHPWP6CARJFI/graph.json","events_json":"https://pith.science/api/pith-number/CIG6UWHH6IF7IKRHPWP6CARJFI/events.json","paper":"https://pith.science/paper/CIG6UWHH"},"agent_actions":{"view_html":"https://pith.science/pith/CIG6UWHH6IF7IKRHPWP6CARJFI","download_json":"https://pith.science/pith/CIG6UWHH6IF7IKRHPWP6CARJFI.json","view_paper":"https://pith.science/paper/CIG6UWHH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.0854&json=true","fetch_graph":"https://pith.science/api/pith-number/CIG6UWHH6IF7IKRHPWP6CARJFI/graph.json","fetch_events":"https://pith.science/api/pith-number/CIG6UWHH6IF7IKRHPWP6CARJFI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CIG6UWHH6IF7IKRHPWP6CARJFI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CIG6UWHH6IF7IKRHPWP6CARJFI/action/storage_attestation","attest_author":"https://pith.science/pith/CIG6UWHH6IF7IKRHPWP6CARJFI/action/author_attestation","sign_citation":"https://pith.science/pith/CIG6UWHH6IF7IKRHPWP6CARJFI/action/citation_signature","submit_replication":"https://pith.science/pith/CIG6UWHH6IF7IKRHPWP6CARJFI/action/replication_record"}},"created_at":"2026-05-18T03:51:48.200332+00:00","updated_at":"2026-05-18T03:51:48.200332+00:00"}