{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7GOXDPDTHECKSAXEFUVTPBEW74","short_pith_number":"pith:7GOXDPDT","schema_version":"1.0","canonical_sha256":"f99d71bc733904a902e42d2b378496ff249b23ae2d3b054d09874f9fb9f7ec3a","source":{"kind":"arxiv","id":"1211.5405","version":3},"attestation_state":"computed","paper":{"title":"The MDS Queue: Analysing the Latency Performance of Erasure Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Kangwook Lee, Kannan Ramchandran, Nihar B. Shah","submitted_at":"2012-11-23T02:16:02Z","abstract_excerpt":"In order to scale economically, data centers are increasingly evolving their data storage methods from the use of simple data replication to the use of more powerful erasure codes, which provide the same level of reliability as replication but at a significantly lower storage cost. In particular, it is well known that Maximum-Distance-Separable (MDS) codes, such as Reed-Solomon codes, provide the maximum storage efficiency. While the use of codes for providing improved reliability in archival storage systems, where the data is less frequently accessed (or so-called \"cold data\"), is well unders"},"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":"1211.5405","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-23T02:16:02Z","cross_cats_sorted":["cs.NI","math.IT","math.OC"],"title_canon_sha256":"66d0c44a8efaec4b65b5d3cd6682daaa47461b98e51dd410ff82ff190a084d0d","abstract_canon_sha256":"fc578114a5a7aef8850b9329635c20bcba585597cb6afcbc7f8b3dedd38a8744"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:34.592452Z","signature_b64":"O1pVlGbfYMly/tp0HlNK1X8GTXzG1hKKA3L/Na2KJMwAXgI3pNAPlsV3wvzZ+7Lu4PD9UGFoiBslGu0SJXXjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f99d71bc733904a902e42d2b378496ff249b23ae2d3b054d09874f9fb9f7ec3a","last_reissued_at":"2026-05-18T03:07:34.592018Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:34.592018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The MDS Queue: Analysing the Latency Performance of Erasure Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Kangwook Lee, Kannan Ramchandran, Nihar B. Shah","submitted_at":"2012-11-23T02:16:02Z","abstract_excerpt":"In order to scale economically, data centers are increasingly evolving their data storage methods from the use of simple data replication to the use of more powerful erasure codes, which provide the same level of reliability as replication but at a significantly lower storage cost. In particular, it is well known that Maximum-Distance-Separable (MDS) codes, such as Reed-Solomon codes, provide the maximum storage efficiency. While the use of codes for providing improved reliability in archival storage systems, where the data is less frequently accessed (or so-called \"cold data\"), is well unders"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5405","kind":"arxiv","version":3},"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":"1211.5405","created_at":"2026-05-18T03:07:34.592080+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.5405v3","created_at":"2026-05-18T03:07:34.592080+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5405","created_at":"2026-05-18T03:07:34.592080+00:00"},{"alias_kind":"pith_short_12","alias_value":"7GOXDPDTHECK","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"7GOXDPDTHECKSAXE","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"7GOXDPDT","created_at":"2026-05-18T12:26:56.085431+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/7GOXDPDTHECKSAXEFUVTPBEW74","json":"https://pith.science/pith/7GOXDPDTHECKSAXEFUVTPBEW74.json","graph_json":"https://pith.science/api/pith-number/7GOXDPDTHECKSAXEFUVTPBEW74/graph.json","events_json":"https://pith.science/api/pith-number/7GOXDPDTHECKSAXEFUVTPBEW74/events.json","paper":"https://pith.science/paper/7GOXDPDT"},"agent_actions":{"view_html":"https://pith.science/pith/7GOXDPDTHECKSAXEFUVTPBEW74","download_json":"https://pith.science/pith/7GOXDPDTHECKSAXEFUVTPBEW74.json","view_paper":"https://pith.science/paper/7GOXDPDT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.5405&json=true","fetch_graph":"https://pith.science/api/pith-number/7GOXDPDTHECKSAXEFUVTPBEW74/graph.json","fetch_events":"https://pith.science/api/pith-number/7GOXDPDTHECKSAXEFUVTPBEW74/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7GOXDPDTHECKSAXEFUVTPBEW74/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7GOXDPDTHECKSAXEFUVTPBEW74/action/storage_attestation","attest_author":"https://pith.science/pith/7GOXDPDTHECKSAXEFUVTPBEW74/action/author_attestation","sign_citation":"https://pith.science/pith/7GOXDPDTHECKSAXEFUVTPBEW74/action/citation_signature","submit_replication":"https://pith.science/pith/7GOXDPDTHECKSAXEFUVTPBEW74/action/replication_record"}},"created_at":"2026-05-18T03:07:34.592080+00:00","updated_at":"2026-05-18T03:07:34.592080+00:00"}