{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:G75EKUGGXUELILE67SBV3AK526","short_pith_number":"pith:G75EKUGG","schema_version":"1.0","canonical_sha256":"37fa4550c6bd08b42c9efc835d815dd79b8f23b1815ba1c3cbcd2290f61faf03","source":{"kind":"arxiv","id":"1411.6328","version":1},"attestation_state":"computed","paper":{"title":"Explicit MDS Codes for Optimal Repair Bandwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Itzhak Tamo, Jehoshua Bruck, Zhiying Wang","submitted_at":"2014-11-24T02:28:06Z","abstract_excerpt":"MDS codes are erasure-correcting codes that can correct the maximum number of erasures for a given number of redundancy or parity symbols. If an MDS code has $r$ parities and no more than $r$ erasures occur, then by transmitting all the remaining data in the code, the original information can be recovered. However, it was shown that in order to recover a single symbol erasure, only a fraction of $1/r$ of the information needs to be transmitted. This fraction is called the repair bandwidth (fraction). Explicit code constructions were given in previous works. If we view each symbol in the code a"},"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":"1411.6328","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-24T02:28:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2ea57cfffcde61df2face5147daa33145d5c0911cc04999df64a668e4137964c","abstract_canon_sha256":"e50d5f1eacb04c068ab1119c7b82b9441ba3746008f3b1f3fbfa0dd5a07892e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:33:00.266995Z","signature_b64":"AeKu1qHFb5Vn6m4XNGuznoywATX5JAK1TPjT4Pq5h5UB3vokSHCyB3vly4BsGOPkupcqgKtuX3RJqCrfx3OrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37fa4550c6bd08b42c9efc835d815dd79b8f23b1815ba1c3cbcd2290f61faf03","last_reissued_at":"2026-05-18T02:33:00.266663Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:33:00.266663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explicit MDS Codes for Optimal Repair Bandwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Itzhak Tamo, Jehoshua Bruck, Zhiying Wang","submitted_at":"2014-11-24T02:28:06Z","abstract_excerpt":"MDS codes are erasure-correcting codes that can correct the maximum number of erasures for a given number of redundancy or parity symbols. If an MDS code has $r$ parities and no more than $r$ erasures occur, then by transmitting all the remaining data in the code, the original information can be recovered. However, it was shown that in order to recover a single symbol erasure, only a fraction of $1/r$ of the information needs to be transmitted. This fraction is called the repair bandwidth (fraction). Explicit code constructions were given in previous works. If we view each symbol in the code a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6328","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":"1411.6328","created_at":"2026-05-18T02:33:00.266718+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.6328v1","created_at":"2026-05-18T02:33:00.266718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6328","created_at":"2026-05-18T02:33:00.266718+00:00"},{"alias_kind":"pith_short_12","alias_value":"G75EKUGGXUEL","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"G75EKUGGXUELILE6","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"G75EKUGG","created_at":"2026-05-18T12:28:28.263976+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/G75EKUGGXUELILE67SBV3AK526","json":"https://pith.science/pith/G75EKUGGXUELILE67SBV3AK526.json","graph_json":"https://pith.science/api/pith-number/G75EKUGGXUELILE67SBV3AK526/graph.json","events_json":"https://pith.science/api/pith-number/G75EKUGGXUELILE67SBV3AK526/events.json","paper":"https://pith.science/paper/G75EKUGG"},"agent_actions":{"view_html":"https://pith.science/pith/G75EKUGGXUELILE67SBV3AK526","download_json":"https://pith.science/pith/G75EKUGGXUELILE67SBV3AK526.json","view_paper":"https://pith.science/paper/G75EKUGG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.6328&json=true","fetch_graph":"https://pith.science/api/pith-number/G75EKUGGXUELILE67SBV3AK526/graph.json","fetch_events":"https://pith.science/api/pith-number/G75EKUGGXUELILE67SBV3AK526/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G75EKUGGXUELILE67SBV3AK526/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G75EKUGGXUELILE67SBV3AK526/action/storage_attestation","attest_author":"https://pith.science/pith/G75EKUGGXUELILE67SBV3AK526/action/author_attestation","sign_citation":"https://pith.science/pith/G75EKUGGXUELILE67SBV3AK526/action/citation_signature","submit_replication":"https://pith.science/pith/G75EKUGGXUELILE67SBV3AK526/action/replication_record"}},"created_at":"2026-05-18T02:33:00.266718+00:00","updated_at":"2026-05-18T02:33:00.266718+00:00"}