{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NBKP2I7TXCO7MFH2VKSDOBXFZQ","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":"d2de528fe79a6d01ed90c200483600c97fd1294e477d1282ce01d7063e64b667","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-05T00:46:04Z","title_canon_sha256":"a8c0531646ab0b5bf3c755367885f4ee5a996a96b732137518e9e2faadfc74ab"},"schema_version":"1.0","source":{"id":"1402.0916","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0916","created_at":"2026-05-18T03:00:02Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0916v1","created_at":"2026-05-18T03:00:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0916","created_at":"2026-05-18T03:00:02Z"},{"alias_kind":"pith_short_12","alias_value":"NBKP2I7TXCO7","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NBKP2I7TXCO7MFH2","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NBKP2I7T","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:06dadc1e2912878a0a06be02b9645331a4fd7eed3737798679c2f545d5134f46","target":"graph","created_at":"2026-05-18T03:00:02Z","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":"A locally recoverable code (LRC code) is a code over a finite alphabet such that every symbol in the encoding is a function of a small number of other symbols that form a recovering set. Bounds on the rate and distance of such codes have been extensively studied in the literature. In this paper we derive upper bounds on the rate and distance of codes in which every symbol has $t\\geq 1$ disjoint recovering sets.","authors_text":"Alexander Barg, Itzhak Tamo","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-05T00:46:04Z","title":"Bounds on Locally Recoverable Codes with Multiple Recovering Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0916","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:b402ade41e6b0dbf866f7be3f0869cb5892b2eed6ec2c0a1d57f8ea19bf522bc","target":"record","created_at":"2026-05-18T03:00:02Z","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":"d2de528fe79a6d01ed90c200483600c97fd1294e477d1282ce01d7063e64b667","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-05T00:46:04Z","title_canon_sha256":"a8c0531646ab0b5bf3c755367885f4ee5a996a96b732137518e9e2faadfc74ab"},"schema_version":"1.0","source":{"id":"1402.0916","kind":"arxiv","version":1}},"canonical_sha256":"6854fd23f3b89df614faaaa43706e5cc18be3b4275d017fc5466581ad16180c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6854fd23f3b89df614faaaa43706e5cc18be3b4275d017fc5466581ad16180c0","first_computed_at":"2026-05-18T03:00:02.320926Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:02.320926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3ZSh4NQK+58+ex0U3EabFBhegzsRQvvc+ucmmNsWqcb49YL9nT60y0RxldyqdSXoJ7JMh8EbLsxT6tJRGVDvAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:02.321829Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.0916","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b402ade41e6b0dbf866f7be3f0869cb5892b2eed6ec2c0a1d57f8ea19bf522bc","sha256:06dadc1e2912878a0a06be02b9645331a4fd7eed3737798679c2f545d5134f46"],"state_sha256":"1edd8867338b3fe37f3a47efac271708b70de244a8d98e2f43258ae3eedc7ad5"}