{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:N5JRW4ELTBAQGLIHEF7WCZ3O7P","short_pith_number":"pith:N5JRW4EL","schema_version":"1.0","canonical_sha256":"6f531b708b9841032d07217f61676efbf18561fd8f6869bc785f146ba8a2c4ae","source":{"kind":"arxiv","id":"1212.6952","version":2},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1212.6952","created_at":"2026-05-18T00:59:04.570773+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.6952v2","created_at":"2026-05-18T00:59:04.570773+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6952","created_at":"2026-05-18T00:59:04.570773+00:00"},{"alias_kind":"pith_short_12","alias_value":"N5JRW4ELTBAQ","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"N5JRW4ELTBAQGLIH","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"N5JRW4EL","created_at":"2026-05-18T12:27:16.716162+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N5JRW4ELTBAQGLIHEF7WCZ3O7P","json":"https://pith.science/pith/N5JRW4ELTBAQGLIHEF7WCZ3O7P.json","graph_json":"https://pith.science/api/pith-number/N5JRW4ELTBAQGLIHEF7WCZ3O7P/graph.json","events_json":"https://pith.science/api/pith-number/N5JRW4ELTBAQGLIHEF7WCZ3O7P/events.json","paper":"https://pith.science/paper/N5JRW4EL"},"agent_actions":{"view_html":"https://pith.science/pith/N5JRW4ELTBAQGLIHEF7WCZ3O7P","download_json":"https://pith.science/pith/N5JRW4ELTBAQGLIHEF7WCZ3O7P.json","view_paper":"https://pith.science/paper/N5JRW4EL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.6952&json=true","fetch_graph":"https://pith.science/api/pith-number/N5JRW4ELTBAQGLIHEF7WCZ3O7P/graph.json","fetch_events":"https://pith.science/api/pith-number/N5JRW4ELTBAQGLIHEF7WCZ3O7P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N5JRW4ELTBAQGLIHEF7WCZ3O7P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N5JRW4ELTBAQGLIHEF7WCZ3O7P/action/storage_attestation","attest_author":"https://pith.science/pith/N5JRW4ELTBAQGLIHEF7WCZ3O7P/action/author_attestation","sign_citation":"https://pith.science/pith/N5JRW4ELTBAQGLIHEF7WCZ3O7P/action/citation_signature","submit_replication":"https://pith.science/pith/N5JRW4ELTBAQGLIHEF7WCZ3O7P/action/replication_record"}},"created_at":"2026-05-18T00:59:04.570773+00:00","updated_at":"2026-05-18T00:59:04.570773+00:00"}