{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:N5JRW4ELTBAQGLIHEF7WCZ3O7P","short_pith_number":"pith:N5JRW4EL","canonical_record":{"source":{"id":"1212.6952","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-31T19:22:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5a287db7fb25b1382883f04bee5a8ac24a803e4ce6f6a41f514395b525b09418","abstract_canon_sha256":"5341cd87f39458f1b3aa751fdd1eca6b903319673e00b136593387997be8d681"},"schema_version":"1.0"},"canonical_sha256":"6f531b708b9841032d07217f61676efbf18561fd8f6869bc785f146ba8a2c4ae","source":{"kind":"arxiv","id":"1212.6952","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6952","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6952v2","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6952","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"pith_short_12","alias_value":"N5JRW4ELTBAQ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"N5JRW4ELTBAQGLIH","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"N5JRW4EL","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:N5JRW4ELTBAQGLIHEF7WCZ3O7P","target":"record","payload":{"canonical_record":{"source":{"id":"1212.6952","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-31T19:22:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5a287db7fb25b1382883f04bee5a8ac24a803e4ce6f6a41f514395b525b09418","abstract_canon_sha256":"5341cd87f39458f1b3aa751fdd1eca6b903319673e00b136593387997be8d681"},"schema_version":"1.0"},"canonical_sha256":"6f531b708b9841032d07217f61676efbf18561fd8f6869bc785f146ba8a2c4ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:04.571269Z","signature_b64":"7gn3H2riOSYw0q1cQYc+8jWbayOgLf4PrPCC88HLIjVXiIvS3da+gptiAoNxMCqU1WgxP8kLinIeZzAUWRyMAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f531b708b9841032d07217f61676efbf18561fd8f6869bc785f146ba8a2c4ae","last_reissued_at":"2026-05-18T00:59:04.570679Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:04.570679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.6952","source_version":2,"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:59:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Epr2bIpKnDIuGw3lrM2OKQHktMpF4UElj7RDmrFn3m2UB/R9rb2QB9Fuz5PuSLFfEoVySq2BPHim3MnTInh3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:54:23.748838Z"},"content_sha256":"1b6469538ac89fdbde77ce4f1d54445c909f9c8492e6c4d5952a46e56c225ac5","schema_version":"1.0","event_id":"sha256:1b6469538ac89fdbde77ce4f1d54445c909f9c8492e6c4d5952a46e56c225ac5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:N5JRW4ELTBAQGLIHEF7WCZ3O7P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Minimizing Data-read and Download for Storage-Node Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nihar B. Shah","submitted_at":"2012-12-31T19:22:07Z","abstract_excerpt":"We consider the problem of efficient recovery of the data stored in any individual node of a distributed storage system, from the rest of the nodes. Applications include handling failures and degraded reads. We measure efficiency in terms of the amount of data-read and the download required. To minimize the download, we focus on the minimum bandwidth setting of the 'regenerating codes' model for distributed storage. Under this model, the system has a total of n nodes, and the data stored in any node must be (efficiently) recoverable from any d of the other (n-1) nodes. Lower bounds on the two "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6952","kind":"arxiv","version":2},"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:59:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rZjUjqg1hYb79SpG6YiU3iHoOkASY80lEoCPSFsnItSHQVhcLIZd2Z8eu8I5W8pNa7r7Bng9nMNeGUlUzLFnCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:54:23.749543Z"},"content_sha256":"762e55072b074c1cd9a47a011599a589865bce9197de8790238dd0517cf64cbd","schema_version":"1.0","event_id":"sha256:762e55072b074c1cd9a47a011599a589865bce9197de8790238dd0517cf64cbd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N5JRW4ELTBAQGLIHEF7WCZ3O7P/bundle.json","state_url":"https://pith.science/pith/N5JRW4ELTBAQGLIHEF7WCZ3O7P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N5JRW4ELTBAQGLIHEF7WCZ3O7P/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-09T06:54:23Z","links":{"resolver":"https://pith.science/pith/N5JRW4ELTBAQGLIHEF7WCZ3O7P","bundle":"https://pith.science/pith/N5JRW4ELTBAQGLIHEF7WCZ3O7P/bundle.json","state":"https://pith.science/pith/N5JRW4ELTBAQGLIHEF7WCZ3O7P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N5JRW4ELTBAQGLIHEF7WCZ3O7P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:N5JRW4ELTBAQGLIHEF7WCZ3O7P","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":"5341cd87f39458f1b3aa751fdd1eca6b903319673e00b136593387997be8d681","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-31T19:22:07Z","title_canon_sha256":"5a287db7fb25b1382883f04bee5a8ac24a803e4ce6f6a41f514395b525b09418"},"schema_version":"1.0","source":{"id":"1212.6952","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6952","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6952v2","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6952","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"pith_short_12","alias_value":"N5JRW4ELTBAQ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"N5JRW4ELTBAQGLIH","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"N5JRW4EL","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:762e55072b074c1cd9a47a011599a589865bce9197de8790238dd0517cf64cbd","target":"graph","created_at":"2026-05-18T00:59:04Z","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":"We consider the problem of efficient recovery of the data stored in any individual node of a distributed storage system, from the rest of the nodes. Applications include handling failures and degraded reads. We measure efficiency in terms of the amount of data-read and the download required. To minimize the download, we focus on the minimum bandwidth setting of the 'regenerating codes' model for distributed storage. Under this model, the system has a total of n nodes, and the data stored in any node must be (efficiently) recoverable from any d of the other (n-1) nodes. Lower bounds on the two ","authors_text":"Nihar B. Shah","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-31T19:22:07Z","title":"On Minimizing Data-read and Download for Storage-Node Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6952","kind":"arxiv","version":2},"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:1b6469538ac89fdbde77ce4f1d54445c909f9c8492e6c4d5952a46e56c225ac5","target":"record","created_at":"2026-05-18T00:59:04Z","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":"5341cd87f39458f1b3aa751fdd1eca6b903319673e00b136593387997be8d681","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-31T19:22:07Z","title_canon_sha256":"5a287db7fb25b1382883f04bee5a8ac24a803e4ce6f6a41f514395b525b09418"},"schema_version":"1.0","source":{"id":"1212.6952","kind":"arxiv","version":2}},"canonical_sha256":"6f531b708b9841032d07217f61676efbf18561fd8f6869bc785f146ba8a2c4ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f531b708b9841032d07217f61676efbf18561fd8f6869bc785f146ba8a2c4ae","first_computed_at":"2026-05-18T00:59:04.570679Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:04.570679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7gn3H2riOSYw0q1cQYc+8jWbayOgLf4PrPCC88HLIjVXiIvS3da+gptiAoNxMCqU1WgxP8kLinIeZzAUWRyMAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:04.571269Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.6952","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b6469538ac89fdbde77ce4f1d54445c909f9c8492e6c4d5952a46e56c225ac5","sha256:762e55072b074c1cd9a47a011599a589865bce9197de8790238dd0517cf64cbd"],"state_sha256":"cea3e70efa08dc892a8654181a19260a423ed13d1818fa0eddd51b95446f1e4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hNPbZmecUE9Hjd+tIBWQQX6z6UOSbYCKohO41ueEf6JSprI7WBk5O63SFkZxjGUabNqyXD2yZa0yeigsROzHBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:54:23.753242Z","bundle_sha256":"b85d2d0601913f89e53606d019a0ae4559d66dcb6dda9c8108f428752d761e12"}}