{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZSOGJQAHFF7G2PPFBKGIXYIHW4","short_pith_number":"pith:ZSOGJQAH","canonical_record":{"source":{"id":"1706.00112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-31T22:19:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"550304afb510ec3ae96bc782941ec95e302a3870ce96bb968e8348116bf76502","abstract_canon_sha256":"35689a32796c8c5feec85aaecf0ddf855c42d3e6d925daef8a3e8ace4c3d2ee1"},"schema_version":"1.0"},"canonical_sha256":"cc9c64c007297e6d3de50a8c8be107b72b27954815956eae10ab9742cd3b972b","source":{"kind":"arxiv","id":"1706.00112","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.00112","created_at":"2026-05-18T00:43:15Z"},{"alias_kind":"arxiv_version","alias_value":"1706.00112v1","created_at":"2026-05-18T00:43:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00112","created_at":"2026-05-18T00:43:15Z"},{"alias_kind":"pith_short_12","alias_value":"ZSOGJQAHFF7G","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZSOGJQAHFF7G2PPF","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZSOGJQAH","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZSOGJQAHFF7G2PPFBKGIXYIHW4","target":"record","payload":{"canonical_record":{"source":{"id":"1706.00112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-31T22:19:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"550304afb510ec3ae96bc782941ec95e302a3870ce96bb968e8348116bf76502","abstract_canon_sha256":"35689a32796c8c5feec85aaecf0ddf855c42d3e6d925daef8a3e8ace4c3d2ee1"},"schema_version":"1.0"},"canonical_sha256":"cc9c64c007297e6d3de50a8c8be107b72b27954815956eae10ab9742cd3b972b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:15.011304Z","signature_b64":"Y/gSEvCLJaCnq6TFZ7MbHwI333/Dnztb3ieySasxykbdF9tukcHLY0SrFP57Sv1OARI9XIv0/BZwi+s6m1clDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc9c64c007297e6d3de50a8c8be107b72b27954815956eae10ab9742cd3b972b","last_reissued_at":"2026-05-18T00:43:15.010781Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:15.010781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.00112","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:43:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jR+JebQN4B90HzCO22mElGlTjPIp4oACe+xulKblAG2pO99OA2gdN4KUn0TRp8ALcuUCzGa5v1saSkBYHHUpAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:42:44.088098Z"},"content_sha256":"2ee61f734f2e2bfee063c5c81bca80e6e4e956a8a47a6d1f1c2909c230a4f840","schema_version":"1.0","event_id":"sha256:2ee61f734f2e2bfee063c5c81bca80e6e4e956a8a47a6d1f1c2909c230a4f840"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZSOGJQAHFF7G2PPFBKGIXYIHW4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal repair of Reed-Solomon codes: Achieving the cut-set bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Itzhak Tamo, Min Ye","submitted_at":"2017-05-31T22:19:20Z","abstract_excerpt":"Coding for distributed storage gives rise to a new set of problems in coding theory related to the need of reducing inter-node communication in the system. A large number of recent papers addressed the problem of optimizing the total amount of information downloaded for repair of a single failed node (the repair bandwidth) by accessing information on $d$ {\\em helper nodes}, where $k\\le d\\le n-1.$ By the so-called cut-set bound (Dimakis et al., 2010), the repair bandwidth of an $(n,k=n-r)$ MDS code using $d$ helper nodes is at least $dl/(d+1-k),$ where $l$ is the size of the node. Also, a numbe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00112","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:43:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tByCG+gEpGjLhoTWk6T05ivxvvnIJG/nlfibVF8RURrugTBETuUHt24f6R8QKbgYTt7SPKHbc5egB+u/qM3yCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:42:44.088452Z"},"content_sha256":"d011390bf9794b8f53782a920a0e6ce76bc4f92f257cbe9d9e3d42118aab1440","schema_version":"1.0","event_id":"sha256:d011390bf9794b8f53782a920a0e6ce76bc4f92f257cbe9d9e3d42118aab1440"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZSOGJQAHFF7G2PPFBKGIXYIHW4/bundle.json","state_url":"https://pith.science/pith/ZSOGJQAHFF7G2PPFBKGIXYIHW4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZSOGJQAHFF7G2PPFBKGIXYIHW4/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-06-07T12:42:44Z","links":{"resolver":"https://pith.science/pith/ZSOGJQAHFF7G2PPFBKGIXYIHW4","bundle":"https://pith.science/pith/ZSOGJQAHFF7G2PPFBKGIXYIHW4/bundle.json","state":"https://pith.science/pith/ZSOGJQAHFF7G2PPFBKGIXYIHW4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZSOGJQAHFF7G2PPFBKGIXYIHW4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZSOGJQAHFF7G2PPFBKGIXYIHW4","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":"35689a32796c8c5feec85aaecf0ddf855c42d3e6d925daef8a3e8ace4c3d2ee1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-31T22:19:20Z","title_canon_sha256":"550304afb510ec3ae96bc782941ec95e302a3870ce96bb968e8348116bf76502"},"schema_version":"1.0","source":{"id":"1706.00112","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.00112","created_at":"2026-05-18T00:43:15Z"},{"alias_kind":"arxiv_version","alias_value":"1706.00112v1","created_at":"2026-05-18T00:43:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00112","created_at":"2026-05-18T00:43:15Z"},{"alias_kind":"pith_short_12","alias_value":"ZSOGJQAHFF7G","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZSOGJQAHFF7G2PPF","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZSOGJQAH","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:d011390bf9794b8f53782a920a0e6ce76bc4f92f257cbe9d9e3d42118aab1440","target":"graph","created_at":"2026-05-18T00:43:15Z","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":"Coding for distributed storage gives rise to a new set of problems in coding theory related to the need of reducing inter-node communication in the system. A large number of recent papers addressed the problem of optimizing the total amount of information downloaded for repair of a single failed node (the repair bandwidth) by accessing information on $d$ {\\em helper nodes}, where $k\\le d\\le n-1.$ By the so-called cut-set bound (Dimakis et al., 2010), the repair bandwidth of an $(n,k=n-r)$ MDS code using $d$ helper nodes is at least $dl/(d+1-k),$ where $l$ is the size of the node. Also, a numbe","authors_text":"Alexander Barg, Itzhak Tamo, Min Ye","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-31T22:19:20Z","title":"Optimal repair of Reed-Solomon codes: Achieving the cut-set bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00112","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:2ee61f734f2e2bfee063c5c81bca80e6e4e956a8a47a6d1f1c2909c230a4f840","target":"record","created_at":"2026-05-18T00:43:15Z","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":"35689a32796c8c5feec85aaecf0ddf855c42d3e6d925daef8a3e8ace4c3d2ee1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-31T22:19:20Z","title_canon_sha256":"550304afb510ec3ae96bc782941ec95e302a3870ce96bb968e8348116bf76502"},"schema_version":"1.0","source":{"id":"1706.00112","kind":"arxiv","version":1}},"canonical_sha256":"cc9c64c007297e6d3de50a8c8be107b72b27954815956eae10ab9742cd3b972b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc9c64c007297e6d3de50a8c8be107b72b27954815956eae10ab9742cd3b972b","first_computed_at":"2026-05-18T00:43:15.010781Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:15.010781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y/gSEvCLJaCnq6TFZ7MbHwI333/Dnztb3ieySasxykbdF9tukcHLY0SrFP57Sv1OARI9XIv0/BZwi+s6m1clDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:15.011304Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.00112","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ee61f734f2e2bfee063c5c81bca80e6e4e956a8a47a6d1f1c2909c230a4f840","sha256:d011390bf9794b8f53782a920a0e6ce76bc4f92f257cbe9d9e3d42118aab1440"],"state_sha256":"92d78a9700f6e91f524af2db47f4ff917f27d6f19f692179779fe9858a48fcac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iGTKQlMNfPqjneUpPDGM5Ulw+JHmin0cxJnaA56ONp3D0xwxY2YzDUd6Ib6uSZ+TOER+FBzJwmZjofc22rKvAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T12:42:44.090335Z","bundle_sha256":"e42dabc68adde79058730be8ef32a298665c21ed1f433565d2b47c05099766f0"}}