{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IZYTUAYK4EYBSV4KHIY6LJB7XP","short_pith_number":"pith:IZYTUAYK","canonical_record":{"source":{"id":"1611.08561","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-25T19:16:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6622540116baebb7e771f68b9bc8c998ac98bcb65671d7b567a93b36ba906487","abstract_canon_sha256":"7a4c0d06502ad3009e2894d1b7d847614fdae7e18c6b4788a498c96916e30b24"},"schema_version":"1.0"},"canonical_sha256":"46713a030ae13019578a3a31e5a43fbbe369e35fb8ee668e4be3758f1fc8859e","source":{"kind":"arxiv","id":"1611.08561","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IZYTUAYK4EYBSV4KHIY6LJB7XP","target":"record","payload":{"canonical_record":{"source":{"id":"1611.08561","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-25T19:16:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6622540116baebb7e771f68b9bc8c998ac98bcb65671d7b567a93b36ba906487","abstract_canon_sha256":"7a4c0d06502ad3009e2894d1b7d847614fdae7e18c6b4788a498c96916e30b24"},"schema_version":"1.0"},"canonical_sha256":"46713a030ae13019578a3a31e5a43fbbe369e35fb8ee668e4be3758f1fc8859e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:35.272645Z","signature_b64":"YM53JWuiVMFQAVQOe8JgGtWPCuITZeggD2OoHB5F5pRIfEKoTAjFB6E8y1tEOmLqJXs33fxAhLYPoAo7rlUOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46713a030ae13019578a3a31e5a43fbbe369e35fb8ee668e4be3758f1fc8859e","last_reissued_at":"2026-05-18T00:50:35.271991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:35.271991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.08561","source_version":8,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:50:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AheMHmbTAt9QHX/R0P48R2ubj3ZW3utf3J0LWuNVR/bX9BiJTY+7/Cp6Hnj14lzUE3E0Do9Nj4P2hKhVNeW3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:43:10.137407Z"},"content_sha256":"3e9a6a794636ae74a97cf40af9d3e536f3f1e5eef6fd9542c506cd41252e946c","schema_version":"1.0","event_id":"sha256:3e9a6a794636ae74a97cf40af9d3e536f3f1e5eef6fd9542c506cd41252e946c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IZYTUAYK4EYBSV4KHIY6LJB7XP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Tight Rate Bound and a Matching Construction for Locally Recoverable Codes with Sequential Recovery From Any Number of Multiple Erasures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ganesh R. Kini, P. Vijay Kumar, S.B. Balaji","submitted_at":"2016-11-25T19:16:32Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08561","kind":"arxiv","version":8},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:50:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o37O+AuH1gbfJb0h1NivVjFYUrZgKOPXurvoTYOIVw7LcsKexl6v8h/eZymdPuC427nJHJOYLzDiC2TDeuIeDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:43:10.137793Z"},"content_sha256":"793c5f0d5233af064466e07307d61e3c01e0f2cafe0c95340853ca664c68e9d5","schema_version":"1.0","event_id":"sha256:793c5f0d5233af064466e07307d61e3c01e0f2cafe0c95340853ca664c68e9d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IZYTUAYK4EYBSV4KHIY6LJB7XP/bundle.json","state_url":"https://pith.science/pith/IZYTUAYK4EYBSV4KHIY6LJB7XP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IZYTUAYK4EYBSV4KHIY6LJB7XP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T03:43:10Z","links":{"resolver":"https://pith.science/pith/IZYTUAYK4EYBSV4KHIY6LJB7XP","bundle":"https://pith.science/pith/IZYTUAYK4EYBSV4KHIY6LJB7XP/bundle.json","state":"https://pith.science/pith/IZYTUAYK4EYBSV4KHIY6LJB7XP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IZYTUAYK4EYBSV4KHIY6LJB7XP/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/R9M24hcR+jgJ6NWAvJlnHkeT5CLNJqDoX16F9XwKs3cHfrd9bw65yho6875gQv+cm94zahrzq3ifLAb5QR+Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:43:10.139943Z","bundle_sha256":"dc3d836153cb36244bb700dbd6699c9099abc9fe9033ec0a491bc5bfaac1393b"}}