{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ONUEYW23W4W5EWQ43PR26KRLYU","short_pith_number":"pith:ONUEYW23","canonical_record":{"source":{"id":"1610.09767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-31T03:07:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9071ef2fd6b9c5eaed91d2df332216719bb71bcdb28fb0dbce1a74e0ea51230c","abstract_canon_sha256":"e566599d3ed863b506b8c27ba02a836112a8c41318f2e1c857b8b0e31205bacd"},"schema_version":"1.0"},"canonical_sha256":"73684c5b5bb72dd25a1cdbe3af2a2bc539d9fb01835f69b0e9a72c68c2fd61e2","source":{"kind":"arxiv","id":"1610.09767","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.09767","created_at":"2026-05-18T01:00:47Z"},{"alias_kind":"arxiv_version","alias_value":"1610.09767v1","created_at":"2026-05-18T01:00:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09767","created_at":"2026-05-18T01:00:47Z"},{"alias_kind":"pith_short_12","alias_value":"ONUEYW23W4W5","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"ONUEYW23W4W5EWQ4","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"ONUEYW23","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ONUEYW23W4W5EWQ43PR26KRLYU","target":"record","payload":{"canonical_record":{"source":{"id":"1610.09767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-31T03:07:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9071ef2fd6b9c5eaed91d2df332216719bb71bcdb28fb0dbce1a74e0ea51230c","abstract_canon_sha256":"e566599d3ed863b506b8c27ba02a836112a8c41318f2e1c857b8b0e31205bacd"},"schema_version":"1.0"},"canonical_sha256":"73684c5b5bb72dd25a1cdbe3af2a2bc539d9fb01835f69b0e9a72c68c2fd61e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:47.238061Z","signature_b64":"UkwnDIDedHv2GydnwM/hpWB30K3T1CYt4EqK6Utz9bPCFvpS9vCuJ34Z7h5GkiUWHUbh5yufD4WumyohLppyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73684c5b5bb72dd25a1cdbe3af2a2bc539d9fb01835f69b0e9a72c68c2fd61e2","last_reissued_at":"2026-05-18T01:00:47.237616Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:47.237616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.09767","source_version":1,"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-18T01:00:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8tO1p0C2JSaZppO4+4j/eeX1FS/suQNOrIyN9OgoUYwIe0iGaISPNytvVSM1eRuy2tDbkOQCKT+qD68fleptAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:02:49.190576Z"},"content_sha256":"57780eabbaaa1d2f22893ac85d59068a3a889716f16b023e5cca948b2e8ba551","schema_version":"1.0","event_id":"sha256:57780eabbaaa1d2f22893ac85d59068a3a889716f16b023e5cca948b2e8ba551"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ONUEYW23W4W5EWQ43PR26KRLYU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Sequential Locally Repairable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chau Yuen, Kai Cai, Wentu Song","submitted_at":"2016-10-31T03:07:40Z","abstract_excerpt":"We consider the locally repairable codes (LRC), aiming at sequential recovering multiple erasures. We define the (n,k,r,t)-SLRC (Sequential Locally Repairable Codes) as an [n,k] linear code where any t'(>= t) erasures can be sequentially recovered, each one by r (2<=r<k) other code symbols. Sequential recovering means that the erased symbols are recovered one by one, and an already recovered symbol can be used to recover the remaining erased symbols. This important recovering method, in contrast with the vastly studied parallel recovering, is currently far from understanding, say, lacking code"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09767","kind":"arxiv","version":1},"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-18T01:00:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9OxFJru4vWwNpX+L0v5xzgGM96flGdftbJIO6dfZFeXdRdcpPwftwKGAmySoMoKRK4B5ZRUQZirsPCNM8SGGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:02:49.190961Z"},"content_sha256":"90843a0f88412b8a2c6e04ee071d2122ba290287bc4a271e3fa0012473a4f52f","schema_version":"1.0","event_id":"sha256:90843a0f88412b8a2c6e04ee071d2122ba290287bc4a271e3fa0012473a4f52f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ONUEYW23W4W5EWQ43PR26KRLYU/bundle.json","state_url":"https://pith.science/pith/ONUEYW23W4W5EWQ43PR26KRLYU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ONUEYW23W4W5EWQ43PR26KRLYU/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-06-03T21:02:49Z","links":{"resolver":"https://pith.science/pith/ONUEYW23W4W5EWQ43PR26KRLYU","bundle":"https://pith.science/pith/ONUEYW23W4W5EWQ43PR26KRLYU/bundle.json","state":"https://pith.science/pith/ONUEYW23W4W5EWQ43PR26KRLYU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ONUEYW23W4W5EWQ43PR26KRLYU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ONUEYW23W4W5EWQ43PR26KRLYU","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":"e566599d3ed863b506b8c27ba02a836112a8c41318f2e1c857b8b0e31205bacd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-31T03:07:40Z","title_canon_sha256":"9071ef2fd6b9c5eaed91d2df332216719bb71bcdb28fb0dbce1a74e0ea51230c"},"schema_version":"1.0","source":{"id":"1610.09767","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.09767","created_at":"2026-05-18T01:00:47Z"},{"alias_kind":"arxiv_version","alias_value":"1610.09767v1","created_at":"2026-05-18T01:00:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09767","created_at":"2026-05-18T01:00:47Z"},{"alias_kind":"pith_short_12","alias_value":"ONUEYW23W4W5","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"ONUEYW23W4W5EWQ4","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"ONUEYW23","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:90843a0f88412b8a2c6e04ee071d2122ba290287bc4a271e3fa0012473a4f52f","target":"graph","created_at":"2026-05-18T01:00:47Z","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":"We consider the locally repairable codes (LRC), aiming at sequential recovering multiple erasures. We define the (n,k,r,t)-SLRC (Sequential Locally Repairable Codes) as an [n,k] linear code where any t'(>= t) erasures can be sequentially recovered, each one by r (2<=r<k) other code symbols. Sequential recovering means that the erased symbols are recovered one by one, and an already recovered symbol can be used to recover the remaining erased symbols. This important recovering method, in contrast with the vastly studied parallel recovering, is currently far from understanding, say, lacking code","authors_text":"Chau Yuen, Kai Cai, Wentu Song","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-31T03:07:40Z","title":"On Sequential Locally Repairable Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09767","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:57780eabbaaa1d2f22893ac85d59068a3a889716f16b023e5cca948b2e8ba551","target":"record","created_at":"2026-05-18T01:00:47Z","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":"e566599d3ed863b506b8c27ba02a836112a8c41318f2e1c857b8b0e31205bacd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-31T03:07:40Z","title_canon_sha256":"9071ef2fd6b9c5eaed91d2df332216719bb71bcdb28fb0dbce1a74e0ea51230c"},"schema_version":"1.0","source":{"id":"1610.09767","kind":"arxiv","version":1}},"canonical_sha256":"73684c5b5bb72dd25a1cdbe3af2a2bc539d9fb01835f69b0e9a72c68c2fd61e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73684c5b5bb72dd25a1cdbe3af2a2bc539d9fb01835f69b0e9a72c68c2fd61e2","first_computed_at":"2026-05-18T01:00:47.237616Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:47.237616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UkwnDIDedHv2GydnwM/hpWB30K3T1CYt4EqK6Utz9bPCFvpS9vCuJ34Z7h5GkiUWHUbh5yufD4WumyohLppyCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:47.238061Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.09767","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57780eabbaaa1d2f22893ac85d59068a3a889716f16b023e5cca948b2e8ba551","sha256:90843a0f88412b8a2c6e04ee071d2122ba290287bc4a271e3fa0012473a4f52f"],"state_sha256":"8263498f070f1e811dbb2e2f75a5b50eb14edd591929d940ec49894f6a5bc728"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9go3LLxSYpFWPppAuxToNnV3XEkBol70BbKcRaVg6rE+LYcNX45Gc9GrtOW8msnZwbvpGNFyhaLAAJ0yp83oBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T21:02:49.192968Z","bundle_sha256":"7cab0471960f8ca18888145b24c425b5d087d082cea10b3e64e069e0cb993a69"}}