{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:EKPFPECC2J6LQAKJ4LU7JYGGPH","short_pith_number":"pith:EKPFPECC","schema_version":"1.0","canonical_sha256":"229e579042d27cb80149e2e9f4e0c679e7852688f65659140d5daddbc8d559ea","source":{"kind":"arxiv","id":"1011.2361","version":2},"attestation_state":"computed","paper":{"title":"Distributed Storage Codes with Repair-by-Transfer and Non-achievability of Interior Points on the Storage-Bandwidth Tradeoff","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Kannan Ramchandran, K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar","submitted_at":"2010-11-10T12:34:46Z","abstract_excerpt":"Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-Solomon codes, permit data recovery from any subset of k nodes within the n-node network. However, regenerating codes possess in addition, the ability to repair a failed node by connecting to an arbitrary subset of d nodes. It has been shown that for the case of functional-repair, there is a tradeoff between the amount of data stored per node and the bandwidth required to repair a failed node. A special case of functional-repair is exact-repair where the replacement node is required to store data"},"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":"1011.2361","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-10T12:34:46Z","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"title_canon_sha256":"cb8c5f89a7dc6c1f858e5a777e312e89563799c30f028adc0831711497286ddd","abstract_canon_sha256":"f9965d33fbe85adc85d484c998a894ac010c89904d2a079996d066fbdf4933af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:37.110487Z","signature_b64":"uiquMOEpuFZ8I+493+/FHC0Ho1CBs2VKY48YlMOr+iHNXoixtkHeSDQLJ9ZWo3Blj54RFUupjgY6VQwjBwSVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"229e579042d27cb80149e2e9f4e0c679e7852688f65659140d5daddbc8d559ea","last_reissued_at":"2026-05-18T02:23:37.109843Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:37.109843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Storage Codes with Repair-by-Transfer and Non-achievability of Interior Points on the Storage-Bandwidth Tradeoff","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Kannan Ramchandran, K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar","submitted_at":"2010-11-10T12:34:46Z","abstract_excerpt":"Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-Solomon codes, permit data recovery from any subset of k nodes within the n-node network. However, regenerating codes possess in addition, the ability to repair a failed node by connecting to an arbitrary subset of d nodes. It has been shown that for the case of functional-repair, there is a tradeoff between the amount of data stored per node and the bandwidth required to repair a failed node. A special case of functional-repair is exact-repair where the replacement node is required to store data"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2361","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":"1011.2361","created_at":"2026-05-18T02:23:37.109927+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.2361v2","created_at":"2026-05-18T02:23:37.109927+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2361","created_at":"2026-05-18T02:23:37.109927+00:00"},{"alias_kind":"pith_short_12","alias_value":"EKPFPECC2J6L","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"EKPFPECC2J6LQAKJ","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"EKPFPECC","created_at":"2026-05-18T12:26:06.534383+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/EKPFPECC2J6LQAKJ4LU7JYGGPH","json":"https://pith.science/pith/EKPFPECC2J6LQAKJ4LU7JYGGPH.json","graph_json":"https://pith.science/api/pith-number/EKPFPECC2J6LQAKJ4LU7JYGGPH/graph.json","events_json":"https://pith.science/api/pith-number/EKPFPECC2J6LQAKJ4LU7JYGGPH/events.json","paper":"https://pith.science/paper/EKPFPECC"},"agent_actions":{"view_html":"https://pith.science/pith/EKPFPECC2J6LQAKJ4LU7JYGGPH","download_json":"https://pith.science/pith/EKPFPECC2J6LQAKJ4LU7JYGGPH.json","view_paper":"https://pith.science/paper/EKPFPECC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.2361&json=true","fetch_graph":"https://pith.science/api/pith-number/EKPFPECC2J6LQAKJ4LU7JYGGPH/graph.json","fetch_events":"https://pith.science/api/pith-number/EKPFPECC2J6LQAKJ4LU7JYGGPH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EKPFPECC2J6LQAKJ4LU7JYGGPH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EKPFPECC2J6LQAKJ4LU7JYGGPH/action/storage_attestation","attest_author":"https://pith.science/pith/EKPFPECC2J6LQAKJ4LU7JYGGPH/action/author_attestation","sign_citation":"https://pith.science/pith/EKPFPECC2J6LQAKJ4LU7JYGGPH/action/citation_signature","submit_replication":"https://pith.science/pith/EKPFPECC2J6LQAKJ4LU7JYGGPH/action/replication_record"}},"created_at":"2026-05-18T02:23:37.109927+00:00","updated_at":"2026-05-18T02:23:37.109927+00:00"}