{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7GOXDPDTHECKSAXEFUVTPBEW74","short_pith_number":"pith:7GOXDPDT","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"},"canonical_sha256":"f99d71bc733904a902e42d2b378496ff249b23ae2d3b054d09874f9fb9f7ec3a","source":{"kind":"arxiv","id":"1211.5405","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5405","created_at":"2026-05-18T03:07:34Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5405v3","created_at":"2026-05-18T03:07:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5405","created_at":"2026-05-18T03:07:34Z"},{"alias_kind":"pith_short_12","alias_value":"7GOXDPDTHECK","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7GOXDPDTHECKSAXE","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7GOXDPDT","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7GOXDPDTHECKSAXEFUVTPBEW74","target":"record","payload":{"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"},"canonical_sha256":"f99d71bc733904a902e42d2b378496ff249b23ae2d3b054d09874f9fb9f7ec3a","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"},"source_kind":"arxiv","source_id":"1211.5405","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:07:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WI/c/40mKudTAP87JBL5xZ1re7oJeg3tXBZU6gZsLZ4prSzAGGNKcjBvLhLyS0NKL7DD3ihX/JC2BWEp4C7ECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:58:07.568806Z"},"content_sha256":"9d728354de57ca569ee4c10644b789c4db0e6a424e88d9bf7abc13c6cd249b68","schema_version":"1.0","event_id":"sha256:9d728354de57ca569ee4c10644b789c4db0e6a424e88d9bf7abc13c6cd249b68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7GOXDPDTHECKSAXEFUVTPBEW74","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:07:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J+w0XrNC6Jd0fmxRMs4ctmW9cy0YykleyRaMcl11rgDR4/wRfE20rzIKteTxl60vXKwsx2SqRZgjiwAp5O5rBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:58:07.569533Z"},"content_sha256":"64525ad262d2f847060694a7bf5bd6190d38c57f00e296a4e40ead5837820ebb","schema_version":"1.0","event_id":"sha256:64525ad262d2f847060694a7bf5bd6190d38c57f00e296a4e40ead5837820ebb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7GOXDPDTHECKSAXEFUVTPBEW74/bundle.json","state_url":"https://pith.science/pith/7GOXDPDTHECKSAXEFUVTPBEW74/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7GOXDPDTHECKSAXEFUVTPBEW74/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T10:58:07Z","links":{"resolver":"https://pith.science/pith/7GOXDPDTHECKSAXEFUVTPBEW74","bundle":"https://pith.science/pith/7GOXDPDTHECKSAXEFUVTPBEW74/bundle.json","state":"https://pith.science/pith/7GOXDPDTHECKSAXEFUVTPBEW74/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7GOXDPDTHECKSAXEFUVTPBEW74/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7GOXDPDTHECKSAXEFUVTPBEW74","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fc578114a5a7aef8850b9329635c20bcba585597cb6afcbc7f8b3dedd38a8744","cross_cats_sorted":["cs.NI","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-23T02:16:02Z","title_canon_sha256":"66d0c44a8efaec4b65b5d3cd6682daaa47461b98e51dd410ff82ff190a084d0d"},"schema_version":"1.0","source":{"id":"1211.5405","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5405","created_at":"2026-05-18T03:07:34Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5405v3","created_at":"2026-05-18T03:07:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5405","created_at":"2026-05-18T03:07:34Z"},{"alias_kind":"pith_short_12","alias_value":"7GOXDPDTHECK","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7GOXDPDTHECKSAXE","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7GOXDPDT","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:64525ad262d2f847060694a7bf5bd6190d38c57f00e296a4e40ead5837820ebb","target":"graph","created_at":"2026-05-18T03:07:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Kangwook Lee, Kannan Ramchandran, Nihar B. Shah","cross_cats":["cs.NI","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-23T02:16:02Z","title":"The MDS Queue: Analysing the Latency Performance of Erasure Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5405","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9d728354de57ca569ee4c10644b789c4db0e6a424e88d9bf7abc13c6cd249b68","target":"record","created_at":"2026-05-18T03:07:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fc578114a5a7aef8850b9329635c20bcba585597cb6afcbc7f8b3dedd38a8744","cross_cats_sorted":["cs.NI","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-23T02:16:02Z","title_canon_sha256":"66d0c44a8efaec4b65b5d3cd6682daaa47461b98e51dd410ff82ff190a084d0d"},"schema_version":"1.0","source":{"id":"1211.5405","kind":"arxiv","version":3}},"canonical_sha256":"f99d71bc733904a902e42d2b378496ff249b23ae2d3b054d09874f9fb9f7ec3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f99d71bc733904a902e42d2b378496ff249b23ae2d3b054d09874f9fb9f7ec3a","first_computed_at":"2026-05-18T03:07:34.592018Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:34.592018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O1pVlGbfYMly/tp0HlNK1X8GTXzG1hKKA3L/Na2KJMwAXgI3pNAPlsV3wvzZ+7Lu4PD9UGFoiBslGu0SJXXjBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:34.592452Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.5405","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d728354de57ca569ee4c10644b789c4db0e6a424e88d9bf7abc13c6cd249b68","sha256:64525ad262d2f847060694a7bf5bd6190d38c57f00e296a4e40ead5837820ebb"],"state_sha256":"8d0b921b88e9fa31ab466953af169f85a4d0e27924b256107522fd68865e75b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hbCSVUcyFiOdWTGRMIykX0VmMHN+eGmu/phJJW4ljsbN3nh4wG5kVr76P6/7QxSKZ0OO2W1nwK0jDsu4ag/JDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:58:07.572919Z","bundle_sha256":"6aa579908c1530a7cf5ce2476cf69bde03aa35f793ede39cf72d08a09201896a"}}