{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:IEHFGCU42H53EOGWFJQJFPODPH","short_pith_number":"pith:IEHFGCU4","schema_version":"1.0","canonical_sha256":"410e530a9cd1fbb238d62a6092bdc379e859e1e1c53adc9b16fe9ba3acda9fb6","source":{"kind":"arxiv","id":"1303.3668","version":1},"attestation_state":"computed","paper":{"title":"Access vs. Bandwidth in Codes for Storage","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":"2013-03-15T03:45:07Z","abstract_excerpt":"Maximum distance separable (MDS) codes are widely used in storage systems to protect against disk (node) failures. A node is said to have capacity $l$ over some field $\\mathbb{F}$, if it can store that amount of symbols of the field. An $(n,k,l)$ MDS code uses $n$ nodes of capacity $l$ to store $k$ information nodes. The MDS property guarantees the resiliency to any $n-k$ node failures. An \\emph{optimal bandwidth} (resp. \\emph{optimal access}) MDS code communicates (resp. accesses) the minimum amount of data during the repair process of a single failed node. It was shown that this amount equal"},"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":"1303.3668","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-15T03:45:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9c4b5bb6fc4f6f683c8e1cbf9583970721aeeb2d1cdb6039a8ad5734f82dc601","abstract_canon_sha256":"838449356f77ce7216572b655a7f71cf79c15cf530e1c94bc8e03a388d55e258"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:42.557653Z","signature_b64":"Qldhk91sTLbzit051+IRLWvRU3fMcLR7ahIzdSUcW1So22V9w/yAx6UlkBI/h/JvreNqXfRHb3hD5IZB8oYTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"410e530a9cd1fbb238d62a6092bdc379e859e1e1c53adc9b16fe9ba3acda9fb6","last_reissued_at":"2026-05-18T00:58:42.557112Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:42.557112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Access vs. Bandwidth in Codes for Storage","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":"2013-03-15T03:45:07Z","abstract_excerpt":"Maximum distance separable (MDS) codes are widely used in storage systems to protect against disk (node) failures. A node is said to have capacity $l$ over some field $\\mathbb{F}$, if it can store that amount of symbols of the field. An $(n,k,l)$ MDS code uses $n$ nodes of capacity $l$ to store $k$ information nodes. The MDS property guarantees the resiliency to any $n-k$ node failures. An \\emph{optimal bandwidth} (resp. \\emph{optimal access}) MDS code communicates (resp. accesses) the minimum amount of data during the repair process of a single failed node. It was shown that this amount equal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3668","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":"1303.3668","created_at":"2026-05-18T00:58:42.557188+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.3668v1","created_at":"2026-05-18T00:58:42.557188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3668","created_at":"2026-05-18T00:58:42.557188+00:00"},{"alias_kind":"pith_short_12","alias_value":"IEHFGCU42H53","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"IEHFGCU42H53EOGW","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"IEHFGCU4","created_at":"2026-05-18T12:27:46.883200+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/IEHFGCU42H53EOGWFJQJFPODPH","json":"https://pith.science/pith/IEHFGCU42H53EOGWFJQJFPODPH.json","graph_json":"https://pith.science/api/pith-number/IEHFGCU42H53EOGWFJQJFPODPH/graph.json","events_json":"https://pith.science/api/pith-number/IEHFGCU42H53EOGWFJQJFPODPH/events.json","paper":"https://pith.science/paper/IEHFGCU4"},"agent_actions":{"view_html":"https://pith.science/pith/IEHFGCU42H53EOGWFJQJFPODPH","download_json":"https://pith.science/pith/IEHFGCU42H53EOGWFJQJFPODPH.json","view_paper":"https://pith.science/paper/IEHFGCU4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.3668&json=true","fetch_graph":"https://pith.science/api/pith-number/IEHFGCU42H53EOGWFJQJFPODPH/graph.json","fetch_events":"https://pith.science/api/pith-number/IEHFGCU42H53EOGWFJQJFPODPH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IEHFGCU42H53EOGWFJQJFPODPH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IEHFGCU42H53EOGWFJQJFPODPH/action/storage_attestation","attest_author":"https://pith.science/pith/IEHFGCU42H53EOGWFJQJFPODPH/action/author_attestation","sign_citation":"https://pith.science/pith/IEHFGCU42H53EOGWFJQJFPODPH/action/citation_signature","submit_replication":"https://pith.science/pith/IEHFGCU42H53EOGWFJQJFPODPH/action/replication_record"}},"created_at":"2026-05-18T00:58:42.557188+00:00","updated_at":"2026-05-18T00:58:42.557188+00:00"}