{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:PWQMNY7PN6IT5SZU6SQULK7KVL","short_pith_number":"pith:PWQMNY7P","canonical_record":{"source":{"id":"1109.0264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-01T19:10:38Z","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"title_canon_sha256":"c06e466a9c36a77bafe64752358193892c60d81cb847341cd3a61d30396bbd76","abstract_canon_sha256":"ed02c79ff780fb66344c14d6fc5dd95fcecd8569e3f07c08a3e6dbafc3cd9b57"},"schema_version":"1.0"},"canonical_sha256":"7da0c6e3ef6f913ecb34f4a145abeaaac588c99281c3af82248589035cfae1d4","source":{"kind":"arxiv","id":"1109.0264","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.0264","created_at":"2026-05-18T04:14:16Z"},{"alias_kind":"arxiv_version","alias_value":"1109.0264v1","created_at":"2026-05-18T04:14:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.0264","created_at":"2026-05-18T04:14:16Z"},{"alias_kind":"pith_short_12","alias_value":"PWQMNY7PN6IT","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PWQMNY7PN6IT5SZU","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PWQMNY7P","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:PWQMNY7PN6IT5SZU6SQULK7KVL","target":"record","payload":{"canonical_record":{"source":{"id":"1109.0264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-01T19:10:38Z","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"title_canon_sha256":"c06e466a9c36a77bafe64752358193892c60d81cb847341cd3a61d30396bbd76","abstract_canon_sha256":"ed02c79ff780fb66344c14d6fc5dd95fcecd8569e3f07c08a3e6dbafc3cd9b57"},"schema_version":"1.0"},"canonical_sha256":"7da0c6e3ef6f913ecb34f4a145abeaaac588c99281c3af82248589035cfae1d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:16.941254Z","signature_b64":"s2wXJE6CWsYyhS7N2rLwgHj+PBH1yiyFwP7PwfbOUmhGmxz0vires7j/L9S+bOp1ZBxD82s9i40TCUPo4QjfDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7da0c6e3ef6f913ecb34f4a145abeaaac588c99281c3af82248589035cfae1d4","last_reissued_at":"2026-05-18T04:14:16.940703Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:16.940703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.0264","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-18T04:14:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kmf/7m3VhEe3NUJo61qcwVlNrjz4C2/Fu6jO5D6+pCzYkxdxSSxXEzngAymMqntAWb1PhqKplMPtuw7yOCj1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:24:57.221294Z"},"content_sha256":"b54fcd67cbe3f98e4a8448cb79f212ee596b0f830e83c33833800f091495dbf7","schema_version":"1.0","event_id":"sha256:b54fcd67cbe3f98e4a8448cb79f212ee596b0f830e83c33833800f091495dbf7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:PWQMNY7PN6IT5SZU6SQULK7KVL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple Regenerating Codes: Network Coding for Cloud Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Cheng Huang, Dimitris S. Papailiopoulos, Jianqiang Luo, Jin Li","submitted_at":"2011-09-01T19:10:38Z","abstract_excerpt":"Network codes designed specifically for distributed storage systems have the potential to provide dramatically higher storage efficiency for the same availability. One main challenge in the design of such codes is the exact repair problem: if a node storing encoded information fails, in order to maintain the same level of reliability we need to create encoded information at a new node. One of the main open problems in this emerging area has been the design of simple coding schemes that allow exact and low cost repair of failed nodes and have high data rates. In particular, all prior known expl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.0264","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-18T04:14:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"as1PF3ja897ZkZj2qzqeb3SMRNLiDqVv3ucZOkWuarEzjJxgNn+442belz5s9Nl9xPOOiQCTdlzjWxUj36k2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:24:57.221908Z"},"content_sha256":"74878b9ac044f35294fcad876abed8483383e553206eb9a26b1b3d639ca942bb","schema_version":"1.0","event_id":"sha256:74878b9ac044f35294fcad876abed8483383e553206eb9a26b1b3d639ca942bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PWQMNY7PN6IT5SZU6SQULK7KVL/bundle.json","state_url":"https://pith.science/pith/PWQMNY7PN6IT5SZU6SQULK7KVL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PWQMNY7PN6IT5SZU6SQULK7KVL/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-28T06:24:57Z","links":{"resolver":"https://pith.science/pith/PWQMNY7PN6IT5SZU6SQULK7KVL","bundle":"https://pith.science/pith/PWQMNY7PN6IT5SZU6SQULK7KVL/bundle.json","state":"https://pith.science/pith/PWQMNY7PN6IT5SZU6SQULK7KVL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PWQMNY7PN6IT5SZU6SQULK7KVL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PWQMNY7PN6IT5SZU6SQULK7KVL","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":"ed02c79ff780fb66344c14d6fc5dd95fcecd8569e3f07c08a3e6dbafc3cd9b57","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-01T19:10:38Z","title_canon_sha256":"c06e466a9c36a77bafe64752358193892c60d81cb847341cd3a61d30396bbd76"},"schema_version":"1.0","source":{"id":"1109.0264","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.0264","created_at":"2026-05-18T04:14:16Z"},{"alias_kind":"arxiv_version","alias_value":"1109.0264v1","created_at":"2026-05-18T04:14:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.0264","created_at":"2026-05-18T04:14:16Z"},{"alias_kind":"pith_short_12","alias_value":"PWQMNY7PN6IT","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PWQMNY7PN6IT5SZU","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PWQMNY7P","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:74878b9ac044f35294fcad876abed8483383e553206eb9a26b1b3d639ca942bb","target":"graph","created_at":"2026-05-18T04:14:16Z","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":"Network codes designed specifically for distributed storage systems have the potential to provide dramatically higher storage efficiency for the same availability. One main challenge in the design of such codes is the exact repair problem: if a node storing encoded information fails, in order to maintain the same level of reliability we need to create encoded information at a new node. One of the main open problems in this emerging area has been the design of simple coding schemes that allow exact and low cost repair of failed nodes and have high data rates. In particular, all prior known expl","authors_text":"Alexandros G. Dimakis, Cheng Huang, Dimitris S. Papailiopoulos, Jianqiang Luo, Jin Li","cross_cats":["cs.DC","cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-01T19:10:38Z","title":"Simple Regenerating Codes: Network Coding for Cloud Storage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.0264","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:b54fcd67cbe3f98e4a8448cb79f212ee596b0f830e83c33833800f091495dbf7","target":"record","created_at":"2026-05-18T04:14:16Z","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":"ed02c79ff780fb66344c14d6fc5dd95fcecd8569e3f07c08a3e6dbafc3cd9b57","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-01T19:10:38Z","title_canon_sha256":"c06e466a9c36a77bafe64752358193892c60d81cb847341cd3a61d30396bbd76"},"schema_version":"1.0","source":{"id":"1109.0264","kind":"arxiv","version":1}},"canonical_sha256":"7da0c6e3ef6f913ecb34f4a145abeaaac588c99281c3af82248589035cfae1d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7da0c6e3ef6f913ecb34f4a145abeaaac588c99281c3af82248589035cfae1d4","first_computed_at":"2026-05-18T04:14:16.940703Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:16.940703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s2wXJE6CWsYyhS7N2rLwgHj+PBH1yiyFwP7PwfbOUmhGmxz0vires7j/L9S+bOp1ZBxD82s9i40TCUPo4QjfDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:16.941254Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.0264","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b54fcd67cbe3f98e4a8448cb79f212ee596b0f830e83c33833800f091495dbf7","sha256:74878b9ac044f35294fcad876abed8483383e553206eb9a26b1b3d639ca942bb"],"state_sha256":"a2df01a6b0e3db451f7b3b38a3cada903d551e7975609adaa2f2f20d966427f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Uhk92iG75rUdgW6MkDfEjLAc/lucBjfCWNqK0JZ+ycb+O2PmTELZ7Xb/CTYz1q+gvqN/vO5xlbdspOFsSGdDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:24:57.225015Z","bundle_sha256":"b14fcb009c487178727038cf3ca4d6cf9749849f2dadde5377225470a70ec953"}}