{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:J5SEEQGCF7K2ZDKPARTZANNNXE","short_pith_number":"pith:J5SEEQGC","schema_version":"1.0","canonical_sha256":"4f644240c22fd5ac8d4f04679035adb935464fa8c0fd29258edeb1ba4a2e1801","source":{"kind":"arxiv","id":"1609.08935","version":1},"attestation_state":"computed","paper":{"title":"Binary Cyclic Codes that are Locally Repairable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Robert Calderbank, Sreechakra Goparaju","submitted_at":"2016-09-28T14:46:06Z","abstract_excerpt":"Codes for storage systems aim to minimize the repair locality, which is the number of disks (or nodes) that participate in the repair of a single failed disk. Simultaneously, the code must sustain a high rate, operate on a small finite field to be practically significant and be tolerant to a large number of erasures. To this end, we construct new families of binary linear codes that have an optimal dimension (rate) for a given minimum distance and locality. Specifically, we construct cyclic codes that are locally repairable for locality 2 and distances 2, 6 and 10. In doing so, we discover new"},"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":"1609.08935","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-28T14:46:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bfdab37ddafd074ddbbdccb25f029a1b84d760b570b7d58ba0cfaa5837f37f3a","abstract_canon_sha256":"1c2f1b2cc4fdfaa3b9f911599e34aa2c62dbf53ace5392003e9fe4e46f31f47f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:41.535409Z","signature_b64":"sQE9dxFq96x1G3+o6JxLQhtgedXOn5MA2kwuCLyrfWGg+M6ggY+cqy2XUZli9DVWVsTxpxQJkQ41x4r8580GCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f644240c22fd5ac8d4f04679035adb935464fa8c0fd29258edeb1ba4a2e1801","last_reissued_at":"2026-05-18T01:03:41.534896Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:41.534896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary Cyclic Codes that are Locally Repairable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Robert Calderbank, Sreechakra Goparaju","submitted_at":"2016-09-28T14:46:06Z","abstract_excerpt":"Codes for storage systems aim to minimize the repair locality, which is the number of disks (or nodes) that participate in the repair of a single failed disk. Simultaneously, the code must sustain a high rate, operate on a small finite field to be practically significant and be tolerant to a large number of erasures. To this end, we construct new families of binary linear codes that have an optimal dimension (rate) for a given minimum distance and locality. Specifically, we construct cyclic codes that are locally repairable for locality 2 and distances 2, 6 and 10. In doing so, we discover new"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08935","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.08935","created_at":"2026-05-18T01:03:41.534974+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.08935v1","created_at":"2026-05-18T01:03:41.534974+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08935","created_at":"2026-05-18T01:03:41.534974+00:00"},{"alias_kind":"pith_short_12","alias_value":"J5SEEQGCF7K2","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"J5SEEQGCF7K2ZDKP","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"J5SEEQGC","created_at":"2026-05-18T12:30:22.444734+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/J5SEEQGCF7K2ZDKPARTZANNNXE","json":"https://pith.science/pith/J5SEEQGCF7K2ZDKPARTZANNNXE.json","graph_json":"https://pith.science/api/pith-number/J5SEEQGCF7K2ZDKPARTZANNNXE/graph.json","events_json":"https://pith.science/api/pith-number/J5SEEQGCF7K2ZDKPARTZANNNXE/events.json","paper":"https://pith.science/paper/J5SEEQGC"},"agent_actions":{"view_html":"https://pith.science/pith/J5SEEQGCF7K2ZDKPARTZANNNXE","download_json":"https://pith.science/pith/J5SEEQGCF7K2ZDKPARTZANNNXE.json","view_paper":"https://pith.science/paper/J5SEEQGC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.08935&json=true","fetch_graph":"https://pith.science/api/pith-number/J5SEEQGCF7K2ZDKPARTZANNNXE/graph.json","fetch_events":"https://pith.science/api/pith-number/J5SEEQGCF7K2ZDKPARTZANNNXE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J5SEEQGCF7K2ZDKPARTZANNNXE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J5SEEQGCF7K2ZDKPARTZANNNXE/action/storage_attestation","attest_author":"https://pith.science/pith/J5SEEQGCF7K2ZDKPARTZANNNXE/action/author_attestation","sign_citation":"https://pith.science/pith/J5SEEQGCF7K2ZDKPARTZANNNXE/action/citation_signature","submit_replication":"https://pith.science/pith/J5SEEQGCF7K2ZDKPARTZANNNXE/action/replication_record"}},"created_at":"2026-05-18T01:03:41.534974+00:00","updated_at":"2026-05-18T01:03:41.534974+00:00"}