{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ONUEYW23W4W5EWQ43PR26KRLYU","short_pith_number":"pith:ONUEYW23","schema_version":"1.0","canonical_sha256":"73684c5b5bb72dd25a1cdbe3af2a2bc539d9fb01835f69b0e9a72c68c2fd61e2","source":{"kind":"arxiv","id":"1610.09767","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1610.09767","created_at":"2026-05-18T01:00:47.237679+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.09767v1","created_at":"2026-05-18T01:00:47.237679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09767","created_at":"2026-05-18T01:00:47.237679+00:00"},{"alias_kind":"pith_short_12","alias_value":"ONUEYW23W4W5","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"ONUEYW23W4W5EWQ4","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"ONUEYW23","created_at":"2026-05-18T12:30:36.002864+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ONUEYW23W4W5EWQ43PR26KRLYU","json":"https://pith.science/pith/ONUEYW23W4W5EWQ43PR26KRLYU.json","graph_json":"https://pith.science/api/pith-number/ONUEYW23W4W5EWQ43PR26KRLYU/graph.json","events_json":"https://pith.science/api/pith-number/ONUEYW23W4W5EWQ43PR26KRLYU/events.json","paper":"https://pith.science/paper/ONUEYW23"},"agent_actions":{"view_html":"https://pith.science/pith/ONUEYW23W4W5EWQ43PR26KRLYU","download_json":"https://pith.science/pith/ONUEYW23W4W5EWQ43PR26KRLYU.json","view_paper":"https://pith.science/paper/ONUEYW23","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.09767&json=true","fetch_graph":"https://pith.science/api/pith-number/ONUEYW23W4W5EWQ43PR26KRLYU/graph.json","fetch_events":"https://pith.science/api/pith-number/ONUEYW23W4W5EWQ43PR26KRLYU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ONUEYW23W4W5EWQ43PR26KRLYU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ONUEYW23W4W5EWQ43PR26KRLYU/action/storage_attestation","attest_author":"https://pith.science/pith/ONUEYW23W4W5EWQ43PR26KRLYU/action/author_attestation","sign_citation":"https://pith.science/pith/ONUEYW23W4W5EWQ43PR26KRLYU/action/citation_signature","submit_replication":"https://pith.science/pith/ONUEYW23W4W5EWQ43PR26KRLYU/action/replication_record"}},"created_at":"2026-05-18T01:00:47.237679+00:00","updated_at":"2026-05-18T01:00:47.237679+00:00"}