{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BOOLQWAHP57XIZ2J3TG6IXZJCB","short_pith_number":"pith:BOOLQWAH","schema_version":"1.0","canonical_sha256":"0b9cb858077f7f746749dccde45f2910543c1c9b5d458927b69ba34e678ce126","source":{"kind":"arxiv","id":"1211.1932","version":3},"attestation_state":"computed","paper":{"title":"Codes with Local Regeneration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Govinda M. Kamath, N. Prakash, P. Vijay Kumar, V. Lalitha","submitted_at":"2012-11-08T18:28:10Z","abstract_excerpt":"Regenerating codes and codes with locality are two schemes that have recently been proposed to ensure data collection and reliability in a distributed storage network. In a situation where one is attempting to repair a failed node, regenerating codes seek to minimize the amount of data downloaded for node repair, while codes with locality attempt to minimize the number of helper nodes accessed. In this paper, we provide several constructions for a class of vector codes with locality in which the local codes are regenerating codes, that enjoy both advantages. We derive an upper bound on the min"},"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":"1211.1932","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-08T18:28:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"47dbb6262d18b67381455d61d5af10e6cf4e8e2a6df977f2d0ab546ff33065cc","abstract_canon_sha256":"758d38e3a1e09d98aeeb177d4d8cab7b423eb81fc18cc692dc997fba754f1b0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:37.812086Z","signature_b64":"HD2PCNlCc0vjqGJ8ZiP+29101dJ0QE8LvTKFder6XyWw0IbDCY/Mj97IWFc3StWkHGLTi8hO7BiCkwPL04TNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b9cb858077f7f746749dccde45f2910543c1c9b5d458927b69ba34e678ce126","last_reissued_at":"2026-05-18T03:34:37.811534Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:37.811534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Codes with Local Regeneration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Govinda M. Kamath, N. Prakash, P. Vijay Kumar, V. Lalitha","submitted_at":"2012-11-08T18:28:10Z","abstract_excerpt":"Regenerating codes and codes with locality are two schemes that have recently been proposed to ensure data collection and reliability in a distributed storage network. In a situation where one is attempting to repair a failed node, regenerating codes seek to minimize the amount of data downloaded for node repair, while codes with locality attempt to minimize the number of helper nodes accessed. In this paper, we provide several constructions for a class of vector codes with locality in which the local codes are regenerating codes, that enjoy both advantages. We derive an upper bound on the min"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1932","kind":"arxiv","version":3},"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":"1211.1932","created_at":"2026-05-18T03:34:37.811608+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.1932v3","created_at":"2026-05-18T03:34:37.811608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1932","created_at":"2026-05-18T03:34:37.811608+00:00"},{"alias_kind":"pith_short_12","alias_value":"BOOLQWAHP57X","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"BOOLQWAHP57XIZ2J","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"BOOLQWAH","created_at":"2026-05-18T12:27:01.376967+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/BOOLQWAHP57XIZ2J3TG6IXZJCB","json":"https://pith.science/pith/BOOLQWAHP57XIZ2J3TG6IXZJCB.json","graph_json":"https://pith.science/api/pith-number/BOOLQWAHP57XIZ2J3TG6IXZJCB/graph.json","events_json":"https://pith.science/api/pith-number/BOOLQWAHP57XIZ2J3TG6IXZJCB/events.json","paper":"https://pith.science/paper/BOOLQWAH"},"agent_actions":{"view_html":"https://pith.science/pith/BOOLQWAHP57XIZ2J3TG6IXZJCB","download_json":"https://pith.science/pith/BOOLQWAHP57XIZ2J3TG6IXZJCB.json","view_paper":"https://pith.science/paper/BOOLQWAH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.1932&json=true","fetch_graph":"https://pith.science/api/pith-number/BOOLQWAHP57XIZ2J3TG6IXZJCB/graph.json","fetch_events":"https://pith.science/api/pith-number/BOOLQWAHP57XIZ2J3TG6IXZJCB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BOOLQWAHP57XIZ2J3TG6IXZJCB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BOOLQWAHP57XIZ2J3TG6IXZJCB/action/storage_attestation","attest_author":"https://pith.science/pith/BOOLQWAHP57XIZ2J3TG6IXZJCB/action/author_attestation","sign_citation":"https://pith.science/pith/BOOLQWAHP57XIZ2J3TG6IXZJCB/action/citation_signature","submit_replication":"https://pith.science/pith/BOOLQWAHP57XIZ2J3TG6IXZJCB/action/replication_record"}},"created_at":"2026-05-18T03:34:37.811608+00:00","updated_at":"2026-05-18T03:34:37.811608+00:00"}