{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:J5SEEQGCF7K2ZDKPARTZANNNXE","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":"1c2f1b2cc4fdfaa3b9f911599e34aa2c62dbf53ace5392003e9fe4e46f31f47f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-28T14:46:06Z","title_canon_sha256":"bfdab37ddafd074ddbbdccb25f029a1b84d760b570b7d58ba0cfaa5837f37f3a"},"schema_version":"1.0","source":{"id":"1609.08935","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08935","created_at":"2026-05-18T01:03:41Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08935v1","created_at":"2026-05-18T01:03:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08935","created_at":"2026-05-18T01:03:41Z"},{"alias_kind":"pith_short_12","alias_value":"J5SEEQGCF7K2","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J5SEEQGCF7K2ZDKP","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J5SEEQGC","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:0bdd32f7c141fe2b7f6d5a843e84e9d179598f945f4856d705437a4a9e9970f4","target":"graph","created_at":"2026-05-18T01:03:41Z","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":"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","authors_text":"Robert Calderbank, Sreechakra Goparaju","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-28T14:46:06Z","title":"Binary Cyclic Codes that are Locally Repairable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08935","kind":"arxiv","version":1},"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:5b993c8ee9fd40d10fbd90c9504525ec83d2a87a7ff8b905a012c2086aebf663","target":"record","created_at":"2026-05-18T01:03:41Z","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":"1c2f1b2cc4fdfaa3b9f911599e34aa2c62dbf53ace5392003e9fe4e46f31f47f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-28T14:46:06Z","title_canon_sha256":"bfdab37ddafd074ddbbdccb25f029a1b84d760b570b7d58ba0cfaa5837f37f3a"},"schema_version":"1.0","source":{"id":"1609.08935","kind":"arxiv","version":1}},"canonical_sha256":"4f644240c22fd5ac8d4f04679035adb935464fa8c0fd29258edeb1ba4a2e1801","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f644240c22fd5ac8d4f04679035adb935464fa8c0fd29258edeb1ba4a2e1801","first_computed_at":"2026-05-18T01:03:41.534896Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:41.534896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sQE9dxFq96x1G3+o6JxLQhtgedXOn5MA2kwuCLyrfWGg+M6ggY+cqy2XUZli9DVWVsTxpxQJkQ41x4r8580GCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:41.535409Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.08935","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b993c8ee9fd40d10fbd90c9504525ec83d2a87a7ff8b905a012c2086aebf663","sha256:0bdd32f7c141fe2b7f6d5a843e84e9d179598f945f4856d705437a4a9e9970f4"],"state_sha256":"b2b09b5e99f6d41bff6cb2600c2c21605f5586e73137ba87b81bedf202b98a9f"}