{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:3W4UGA7NPFWW4SHOXCB67T35UK","short_pith_number":"pith:3W4UGA7N","schema_version":"1.0","canonical_sha256":"ddb94303ed796d6e48eeb883efcf7da2933cc662f4eb2d742e44bc405c912753","source":{"kind":"arxiv","id":"1005.4178","version":2},"attestation_state":"computed","paper":{"title":"Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar","submitted_at":"2010-05-23T08:16:03Z","abstract_excerpt":"Regenerating codes are a class of distributed storage codes that optimally trade the bandwidth needed for repair of a failed node with the amount of data stored per node of the network. Minimum Storage Regenerating (MSR) codes minimize first, the amount of data stored per node, and then the repair bandwidth, while Minimum Bandwidth Regenerating (MBR) codes carry out the minimization in the reverse order. An [n, k, d] regenerating code permits the data to be recovered by connecting to any k of the n nodes in the network, while requiring that repair of a failed node be made possible by connectin"},"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":"1005.4178","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-23T08:16:03Z","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"title_canon_sha256":"30f79a944728751b1bc2a74a42c5accbbd89eccc9183756cac9b90fae019c355","abstract_canon_sha256":"718db5a467ed8153e5e29306bfba8d8bf91734c30586a6fcc569d13359806bf8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:53.663010Z","signature_b64":"t/z3ylhfIFneUKYClWq/q3ADz3pJQ7FsitUpsGB67kQUHHB3JX+qru92Ybmt8NRYMHtkICZ+kdtrTcav3XA2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddb94303ed796d6e48eeb883efcf7da2933cc662f4eb2d742e44bc405c912753","last_reissued_at":"2026-05-18T04:16:53.662571Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:53.662571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar","submitted_at":"2010-05-23T08:16:03Z","abstract_excerpt":"Regenerating codes are a class of distributed storage codes that optimally trade the bandwidth needed for repair of a failed node with the amount of data stored per node of the network. Minimum Storage Regenerating (MSR) codes minimize first, the amount of data stored per node, and then the repair bandwidth, while Minimum Bandwidth Regenerating (MBR) codes carry out the minimization in the reverse order. An [n, k, d] regenerating code permits the data to be recovered by connecting to any k of the n nodes in the network, while requiring that repair of a failed node be made possible by connectin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.4178","kind":"arxiv","version":2},"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":"1005.4178","created_at":"2026-05-18T04:16:53.662629+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.4178v2","created_at":"2026-05-18T04:16:53.662629+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.4178","created_at":"2026-05-18T04:16:53.662629+00:00"},{"alias_kind":"pith_short_12","alias_value":"3W4UGA7NPFWW","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"3W4UGA7NPFWW4SHO","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"3W4UGA7N","created_at":"2026-05-18T12:26:03.138858+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/3W4UGA7NPFWW4SHOXCB67T35UK","json":"https://pith.science/pith/3W4UGA7NPFWW4SHOXCB67T35UK.json","graph_json":"https://pith.science/api/pith-number/3W4UGA7NPFWW4SHOXCB67T35UK/graph.json","events_json":"https://pith.science/api/pith-number/3W4UGA7NPFWW4SHOXCB67T35UK/events.json","paper":"https://pith.science/paper/3W4UGA7N"},"agent_actions":{"view_html":"https://pith.science/pith/3W4UGA7NPFWW4SHOXCB67T35UK","download_json":"https://pith.science/pith/3W4UGA7NPFWW4SHOXCB67T35UK.json","view_paper":"https://pith.science/paper/3W4UGA7N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.4178&json=true","fetch_graph":"https://pith.science/api/pith-number/3W4UGA7NPFWW4SHOXCB67T35UK/graph.json","fetch_events":"https://pith.science/api/pith-number/3W4UGA7NPFWW4SHOXCB67T35UK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3W4UGA7NPFWW4SHOXCB67T35UK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3W4UGA7NPFWW4SHOXCB67T35UK/action/storage_attestation","attest_author":"https://pith.science/pith/3W4UGA7NPFWW4SHOXCB67T35UK/action/author_attestation","sign_citation":"https://pith.science/pith/3W4UGA7NPFWW4SHOXCB67T35UK/action/citation_signature","submit_replication":"https://pith.science/pith/3W4UGA7NPFWW4SHOXCB67T35UK/action/replication_record"}},"created_at":"2026-05-18T04:16:53.662629+00:00","updated_at":"2026-05-18T04:16:53.662629+00:00"}