{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:O4Z7SDBHLRYRZEKKHMZV75IUDD","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":"9784dce7b1cb4c7d406c53ed68fca8bd68d043211a396c499bf8eacc3afd44fb","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-09T03:01:41Z","title_canon_sha256":"d175f21e87feac102b1d64a41a8a7d2087c379d0f778e4efcaf10e098c118858"},"schema_version":"1.0","source":{"id":"1702.02685","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02685","created_at":"2026-05-18T00:15:59Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02685v2","created_at":"2026-05-18T00:15:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02685","created_at":"2026-05-18T00:15:59Z"},{"alias_kind":"pith_short_12","alias_value":"O4Z7SDBHLRYR","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"O4Z7SDBHLRYRZEKK","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"O4Z7SDBH","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:13cc718bb3242c6a7956087c15ab1d1c8f7d45bd69ce8b073dc2ac51dacb4a47","target":"graph","created_at":"2026-05-18T00:15:59Z","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":"Locally recoverable (LRC) codes have recently been a focus point of research in coding theory due to their theoretical appeal and applications in distributed storage systems. In an LRC code, any erased symbol of a codeword can be recovered by accessing only a small number of other symbols. For LRC codes over a small alphabet (such as binary), the optimal rate-distance trade-off is unknown. We present several new combinatorial bounds on LRC codes including the locality-aware sphere packing and Plotkin bounds. We also develop an approach to linear programming (LP) bounds on LRC codes. The result","authors_text":"Abhishek Agarwal, Alexander Barg, Arya Mazumdar, Itzhak Tamo, Sihuang Hu","cross_cats":["cs.DM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-09T03:01:41Z","title":"Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02685","kind":"arxiv","version":2},"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:14ee230f18a852d2443550d849930a30edca834a8a7ece0752dd03f376fbe7c8","target":"record","created_at":"2026-05-18T00:15:59Z","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":"9784dce7b1cb4c7d406c53ed68fca8bd68d043211a396c499bf8eacc3afd44fb","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-09T03:01:41Z","title_canon_sha256":"d175f21e87feac102b1d64a41a8a7d2087c379d0f778e4efcaf10e098c118858"},"schema_version":"1.0","source":{"id":"1702.02685","kind":"arxiv","version":2}},"canonical_sha256":"7733f90c275c711c914a3b335ff51418e87aef944670b3b58119d6b3785a84a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7733f90c275c711c914a3b335ff51418e87aef944670b3b58119d6b3785a84a6","first_computed_at":"2026-05-18T00:15:59.431403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:59.431403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NV/NuSPr93m0Ee0JRX/eKoDSm4tz7dubCXkhj1Xdn13nvcuVroCclb5NW76JYASob2r9PTv8afh+0izWHHiNBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:59.432006Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.02685","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14ee230f18a852d2443550d849930a30edca834a8a7ece0752dd03f376fbe7c8","sha256:13cc718bb3242c6a7956087c15ab1d1c8f7d45bd69ce8b073dc2ac51dacb4a47"],"state_sha256":"050a3789fb802be39aa9f28e3885fd3e87cb6f5aa97302e69c3e09158c9533b4"}