{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZEE6EC3IA6QMKJEQ6BA45R5XLM","short_pith_number":"pith:ZEE6EC3I","schema_version":"1.0","canonical_sha256":"c909e20b6807a0c52490f041cec7b75b2b0f6f601c2bffa25ecbfed9d8ad401f","source":{"kind":"arxiv","id":"1107.1627","version":1},"attestation_state":"computed","paper":{"title":"On Codes for Optimal Rebuilding Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"Itzhak Tamo, Jehoshua Bruck, Zhiying Wang","submitted_at":"2011-07-08T13:21:28Z","abstract_excerpt":"MDS (maximum distance separable) array codes are widely used in storage systems due to their computationally efficient encoding and decoding procedures. An MDS code with r redundancy nodes can correct any r erasures by accessing (reading) all the remaining information in both the systematic nodes and the parity (redundancy) nodes. However, in practice, a single erasure is the most likely failure event; hence, a natural question is how much information do we need to access in order to rebuild a single storage node? We define the rebuilding ratio as the fraction of remaining information accessed"},"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":"1107.1627","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-08T13:21:28Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"00ee115be1ae2ddeb2d26c03e5590a10b770a8a5bca93db845639680267e1212","abstract_canon_sha256":"ddec3586d04c1445d4056ca71b8fe94b3a8970259922ca75603c971a715b96fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:35.323356Z","signature_b64":"4u7twdl0pQP1TWo93ijQRF06txMlbkOhYBJ4w/HUIBdJwugpCBupQZpP0/o+LVsB3mqODqHBz16FedU/nWSfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c909e20b6807a0c52490f041cec7b75b2b0f6f601c2bffa25ecbfed9d8ad401f","last_reissued_at":"2026-05-18T04:18:35.322922Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:35.322922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Codes for Optimal Rebuilding Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"Itzhak Tamo, Jehoshua Bruck, Zhiying Wang","submitted_at":"2011-07-08T13:21:28Z","abstract_excerpt":"MDS (maximum distance separable) array codes are widely used in storage systems due to their computationally efficient encoding and decoding procedures. An MDS code with r redundancy nodes can correct any r erasures by accessing (reading) all the remaining information in both the systematic nodes and the parity (redundancy) nodes. However, in practice, a single erasure is the most likely failure event; hence, a natural question is how much information do we need to access in order to rebuild a single storage node? We define the rebuilding ratio as the fraction of remaining information accessed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1627","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":"1107.1627","created_at":"2026-05-18T04:18:35.322977+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.1627v1","created_at":"2026-05-18T04:18:35.322977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1627","created_at":"2026-05-18T04:18:35.322977+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZEE6EC3IA6QM","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZEE6EC3IA6QMKJEQ","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZEE6EC3I","created_at":"2026-05-18T12:26:47.523578+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/ZEE6EC3IA6QMKJEQ6BA45R5XLM","json":"https://pith.science/pith/ZEE6EC3IA6QMKJEQ6BA45R5XLM.json","graph_json":"https://pith.science/api/pith-number/ZEE6EC3IA6QMKJEQ6BA45R5XLM/graph.json","events_json":"https://pith.science/api/pith-number/ZEE6EC3IA6QMKJEQ6BA45R5XLM/events.json","paper":"https://pith.science/paper/ZEE6EC3I"},"agent_actions":{"view_html":"https://pith.science/pith/ZEE6EC3IA6QMKJEQ6BA45R5XLM","download_json":"https://pith.science/pith/ZEE6EC3IA6QMKJEQ6BA45R5XLM.json","view_paper":"https://pith.science/paper/ZEE6EC3I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.1627&json=true","fetch_graph":"https://pith.science/api/pith-number/ZEE6EC3IA6QMKJEQ6BA45R5XLM/graph.json","fetch_events":"https://pith.science/api/pith-number/ZEE6EC3IA6QMKJEQ6BA45R5XLM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZEE6EC3IA6QMKJEQ6BA45R5XLM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZEE6EC3IA6QMKJEQ6BA45R5XLM/action/storage_attestation","attest_author":"https://pith.science/pith/ZEE6EC3IA6QMKJEQ6BA45R5XLM/action/author_attestation","sign_citation":"https://pith.science/pith/ZEE6EC3IA6QMKJEQ6BA45R5XLM/action/citation_signature","submit_replication":"https://pith.science/pith/ZEE6EC3IA6QMKJEQ6BA45R5XLM/action/replication_record"}},"created_at":"2026-05-18T04:18:35.322977+00:00","updated_at":"2026-05-18T04:18:35.322977+00:00"}