{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NCGSMC7X4JP4AXDLIYFNLHJLVO","short_pith_number":"pith:NCGSMC7X","canonical_record":{"source":{"id":"1806.04437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-12T11:14:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c5a2e13a50688aedc4c96acd11b32d32bbf9f16149e94ea4d90f3b979e398ae5","abstract_canon_sha256":"55b64f21aead8b45331ff3aa4f63d353e6fe296f4d63a1e15c9aa27dd25e880a"},"schema_version":"1.0"},"canonical_sha256":"688d260bf7e25fc05c6b460ad59d2bab8cb7702378c05a3bd3acf31978fea45b","source":{"kind":"arxiv","id":"1806.04437","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04437","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04437v1","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04437","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"pith_short_12","alias_value":"NCGSMC7X4JP4","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NCGSMC7X4JP4AXDL","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NCGSMC7X","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NCGSMC7X4JP4AXDLIYFNLHJLVO","target":"record","payload":{"canonical_record":{"source":{"id":"1806.04437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-12T11:14:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c5a2e13a50688aedc4c96acd11b32d32bbf9f16149e94ea4d90f3b979e398ae5","abstract_canon_sha256":"55b64f21aead8b45331ff3aa4f63d353e6fe296f4d63a1e15c9aa27dd25e880a"},"schema_version":"1.0"},"canonical_sha256":"688d260bf7e25fc05c6b460ad59d2bab8cb7702378c05a3bd3acf31978fea45b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:35.530288Z","signature_b64":"BpGY0XaqgnIUYujLquchssOS9gHfQfTHnU0jOZAgWaGPKi4D5KqX7X8VaOjodnlhdJ4A2W31gTgNPICjHe4TDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"688d260bf7e25fc05c6b460ad59d2bab8cb7702378c05a3bd3acf31978fea45b","last_reissued_at":"2026-05-18T00:13:35.529783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:35.529783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.04437","source_version":1,"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-18T00:13:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q8ha+qnxiYbqrHZVusVyh+oy0zaC6khdXr9ZsekBCneZXiK9gACMPqo9w64vQ9Ovb9lLhUKspKiNj8bq9ke4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:27:40.772054Z"},"content_sha256":"d03a2d1b4d427dad1be5203846e379ddb919c3d8bb39118374440b73a7d14199","schema_version":"1.0","event_id":"sha256:d03a2d1b4d427dad1be5203846e379ddb919c3d8bb39118374440b73a7d14199"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NCGSMC7X4JP4AXDLIYFNLHJLVO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Erasure Coding for Distributed Storage: An Overview","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Birenjith Sasidharan, M. Nikhil Krishnan, Myna Vajha, P. Vijay Kumar, S. B. Balaji, Vinayak Ramkumar","submitted_at":"2018-06-12T11:14:00Z","abstract_excerpt":"In a distributed storage system, code symbols are dispersed across space in nodes or storage units as opposed to time. In settings such as that of a large data center, an important consideration is the efficient repair of a failed node. Efficient repair calls for erasure codes that in the face of node failure, are efficient in terms of minimizing the amount of repair data transferred over the network, the amount of data accessed at a helper node as well as the number of helper nodes contacted. Coding theory has evolved to handle these challenges by introducing two new classes of erasure codes,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04437","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"},"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-18T00:13:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WM7+0mp9/Zg7y5e4+2zggqAx3/dnbzvmQQmXdpXIEuBh2FySuk7L9C2fzXYIJzEwKL7XNd36UQ8VEaeccSC0DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:27:40.772417Z"},"content_sha256":"a679e9902eb856a8bc5f7400d99c80f72ea8f662e56d8cd74d289b05b04d7b95","schema_version":"1.0","event_id":"sha256:a679e9902eb856a8bc5f7400d99c80f72ea8f662e56d8cd74d289b05b04d7b95"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NCGSMC7X4JP4AXDLIYFNLHJLVO/bundle.json","state_url":"https://pith.science/pith/NCGSMC7X4JP4AXDLIYFNLHJLVO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NCGSMC7X4JP4AXDLIYFNLHJLVO/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-31T02:27:40Z","links":{"resolver":"https://pith.science/pith/NCGSMC7X4JP4AXDLIYFNLHJLVO","bundle":"https://pith.science/pith/NCGSMC7X4JP4AXDLIYFNLHJLVO/bundle.json","state":"https://pith.science/pith/NCGSMC7X4JP4AXDLIYFNLHJLVO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NCGSMC7X4JP4AXDLIYFNLHJLVO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NCGSMC7X4JP4AXDLIYFNLHJLVO","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":"55b64f21aead8b45331ff3aa4f63d353e6fe296f4d63a1e15c9aa27dd25e880a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-12T11:14:00Z","title_canon_sha256":"c5a2e13a50688aedc4c96acd11b32d32bbf9f16149e94ea4d90f3b979e398ae5"},"schema_version":"1.0","source":{"id":"1806.04437","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04437","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04437v1","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04437","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"pith_short_12","alias_value":"NCGSMC7X4JP4","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NCGSMC7X4JP4AXDL","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NCGSMC7X","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:a679e9902eb856a8bc5f7400d99c80f72ea8f662e56d8cd74d289b05b04d7b95","target":"graph","created_at":"2026-05-18T00:13:35Z","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 a distributed storage system, code symbols are dispersed across space in nodes or storage units as opposed to time. In settings such as that of a large data center, an important consideration is the efficient repair of a failed node. Efficient repair calls for erasure codes that in the face of node failure, are efficient in terms of minimizing the amount of repair data transferred over the network, the amount of data accessed at a helper node as well as the number of helper nodes contacted. Coding theory has evolved to handle these challenges by introducing two new classes of erasure codes,","authors_text":"Birenjith Sasidharan, M. Nikhil Krishnan, Myna Vajha, P. Vijay Kumar, S. B. Balaji, Vinayak Ramkumar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-12T11:14:00Z","title":"Erasure Coding for Distributed Storage: An Overview"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04437","kind":"arxiv","version":1},"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:d03a2d1b4d427dad1be5203846e379ddb919c3d8bb39118374440b73a7d14199","target":"record","created_at":"2026-05-18T00:13:35Z","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":"55b64f21aead8b45331ff3aa4f63d353e6fe296f4d63a1e15c9aa27dd25e880a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-12T11:14:00Z","title_canon_sha256":"c5a2e13a50688aedc4c96acd11b32d32bbf9f16149e94ea4d90f3b979e398ae5"},"schema_version":"1.0","source":{"id":"1806.04437","kind":"arxiv","version":1}},"canonical_sha256":"688d260bf7e25fc05c6b460ad59d2bab8cb7702378c05a3bd3acf31978fea45b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"688d260bf7e25fc05c6b460ad59d2bab8cb7702378c05a3bd3acf31978fea45b","first_computed_at":"2026-05-18T00:13:35.529783Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:35.529783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BpGY0XaqgnIUYujLquchssOS9gHfQfTHnU0jOZAgWaGPKi4D5KqX7X8VaOjodnlhdJ4A2W31gTgNPICjHe4TDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:35.530288Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.04437","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d03a2d1b4d427dad1be5203846e379ddb919c3d8bb39118374440b73a7d14199","sha256:a679e9902eb856a8bc5f7400d99c80f72ea8f662e56d8cd74d289b05b04d7b95"],"state_sha256":"acb46a682018225d1e24438f84b9cc98e10a6a7cac405fc871283f58957c4f73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qcAEyT9BYdhEewRpHIiXJzH++/7mZAJo2w3vE14ysunR9f9ZFI/oBffOFWrI1oGMfSJKATaB7E7biZc/dwKRBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:27:40.774411Z","bundle_sha256":"8756a89bf25f70b6fa1d5d2b6b8fb9bb461d67e3d8a45ad01a7d46fbefb3a4ba"}}