{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IZYTUAYK4EYBSV4KHIY6LJB7XP","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":"7a4c0d06502ad3009e2894d1b7d847614fdae7e18c6b4788a498c96916e30b24","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-25T19:16:32Z","title_canon_sha256":"6622540116baebb7e771f68b9bc8c998ac98bcb65671d7b567a93b36ba906487"},"schema_version":"1.0","source":{"id":"1611.08561","kind":"arxiv","version":8}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08561","created_at":"2026-05-18T00:50:35Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08561v8","created_at":"2026-05-18T00:50:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08561","created_at":"2026-05-18T00:50:35Z"},{"alias_kind":"pith_short_12","alias_value":"IZYTUAYK4EYB","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IZYTUAYK4EYBSV4K","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IZYTUAYK","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:793c5f0d5233af064466e07307d61e3c01e0f2cafe0c95340853ca664c68e9d5","target":"graph","created_at":"2026-05-18T00:50:35Z","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":"An $[n,k]$ code $\\mathcal{C}$ is said to be locally recoverable in the presence of a single erasure, and with locality parameter $r$, if each of the $n$ code symbols of $\\mathcal{C}$ can be recovered by accessing at most $r$ other code symbols. An $[n,k]$ code is said to be a locally recoverable code with sequential recovery from $t$ erasures, if for any set of $s \\leq t$ erasures, there is an $s$-step sequential recovery process, in which at each step, a single erased symbol is recovered by accessing at most $r$ other code symbols. This is equivalent to the requirement that for any set of $s ","authors_text":"Ganesh R. Kini, P. Vijay Kumar, S.B. Balaji","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-25T19:16:32Z","title":"A Tight Rate Bound and a Matching Construction for Locally Recoverable Codes with Sequential Recovery From Any Number of Multiple Erasures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08561","kind":"arxiv","version":8},"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:3e9a6a794636ae74a97cf40af9d3e536f3f1e5eef6fd9542c506cd41252e946c","target":"record","created_at":"2026-05-18T00:50:35Z","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":"7a4c0d06502ad3009e2894d1b7d847614fdae7e18c6b4788a498c96916e30b24","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-25T19:16:32Z","title_canon_sha256":"6622540116baebb7e771f68b9bc8c998ac98bcb65671d7b567a93b36ba906487"},"schema_version":"1.0","source":{"id":"1611.08561","kind":"arxiv","version":8}},"canonical_sha256":"46713a030ae13019578a3a31e5a43fbbe369e35fb8ee668e4be3758f1fc8859e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46713a030ae13019578a3a31e5a43fbbe369e35fb8ee668e4be3758f1fc8859e","first_computed_at":"2026-05-18T00:50:35.271991Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:35.271991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YM53JWuiVMFQAVQOe8JgGtWPCuITZeggD2OoHB5F5pRIfEKoTAjFB6E8y1tEOmLqJXs33fxAhLYPoAo7rlUOAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:35.272645Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.08561","source_kind":"arxiv","source_version":8}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e9a6a794636ae74a97cf40af9d3e536f3f1e5eef6fd9542c506cd41252e946c","sha256:793c5f0d5233af064466e07307d61e3c01e0f2cafe0c95340853ca664c68e9d5"],"state_sha256":"ebe6f04babc45dab93dca84abd444b59679400d5492a4bc49c6686f8099c90b0"}