{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5MWBXJ4AE2LYD55GVNJHYN7APL","short_pith_number":"pith:5MWBXJ4A","schema_version":"1.0","canonical_sha256":"eb2c1ba780269781f7a6ab527c37e07ae41b4f5fd26beed3fdd924dbc9b40551","source":{"kind":"arxiv","id":"1809.11158","version":2},"attestation_state":"computed","paper":{"title":"Universal and Dynamic Locally Repairable Codes with Maximal Recoverability via Sum-Rank Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Frank R. Kschischang, Umberto Mart\\'inez-Pe\\~nas","submitted_at":"2018-09-28T17:46:13Z","abstract_excerpt":"Locally repairable codes (LRCs) are considered with equal or unequal localities, local distances and local field sizes. An explicit two-layer architecture with a sum-rank outer code is obtained, having disjoint local groups and achieving maximal recoverability (MR) for all families of local linear codes (MDS or not) simultaneously, up to a specified maximum locality $ r $. Furthermore, the local linear codes (thus the localities, local distances and local fields) can be efficiently and dynamically modified without global recoding or changes in architecture or outer code, while preserving the M"},"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":"1809.11158","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-28T17:46:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4e488218416fd7933a5b67345967e76b8bf1f7f85278e6c355741f93bc35cd52","abstract_canon_sha256":"a25ffbe713d5c2422a3d52a9678765838bae44486a94aecc5bb567e0b4119fad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:52.674672Z","signature_b64":"ugF9TSMgN9F35r+bGt85grkesBXrcoAX3O7oTSqgf5+qxSc4nUxOdfEQodmSYqK7JtsIQQM+INFC67L/fFsDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb2c1ba780269781f7a6ab527c37e07ae41b4f5fd26beed3fdd924dbc9b40551","last_reissued_at":"2026-05-17T23:47:52.674068Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:52.674068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal and Dynamic Locally Repairable Codes with Maximal Recoverability via Sum-Rank Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Frank R. Kschischang, Umberto Mart\\'inez-Pe\\~nas","submitted_at":"2018-09-28T17:46:13Z","abstract_excerpt":"Locally repairable codes (LRCs) are considered with equal or unequal localities, local distances and local field sizes. An explicit two-layer architecture with a sum-rank outer code is obtained, having disjoint local groups and achieving maximal recoverability (MR) for all families of local linear codes (MDS or not) simultaneously, up to a specified maximum locality $ r $. Furthermore, the local linear codes (thus the localities, local distances and local fields) can be efficiently and dynamically modified without global recoding or changes in architecture or outer code, while preserving the M"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.11158","kind":"arxiv","version":2},"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":"1809.11158","created_at":"2026-05-17T23:47:52.674159+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.11158v2","created_at":"2026-05-17T23:47:52.674159+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.11158","created_at":"2026-05-17T23:47:52.674159+00:00"},{"alias_kind":"pith_short_12","alias_value":"5MWBXJ4AE2LY","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5MWBXJ4AE2LYD55G","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5MWBXJ4A","created_at":"2026-05-18T12:32:08.215937+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/5MWBXJ4AE2LYD55GVNJHYN7APL","json":"https://pith.science/pith/5MWBXJ4AE2LYD55GVNJHYN7APL.json","graph_json":"https://pith.science/api/pith-number/5MWBXJ4AE2LYD55GVNJHYN7APL/graph.json","events_json":"https://pith.science/api/pith-number/5MWBXJ4AE2LYD55GVNJHYN7APL/events.json","paper":"https://pith.science/paper/5MWBXJ4A"},"agent_actions":{"view_html":"https://pith.science/pith/5MWBXJ4AE2LYD55GVNJHYN7APL","download_json":"https://pith.science/pith/5MWBXJ4AE2LYD55GVNJHYN7APL.json","view_paper":"https://pith.science/paper/5MWBXJ4A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.11158&json=true","fetch_graph":"https://pith.science/api/pith-number/5MWBXJ4AE2LYD55GVNJHYN7APL/graph.json","fetch_events":"https://pith.science/api/pith-number/5MWBXJ4AE2LYD55GVNJHYN7APL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5MWBXJ4AE2LYD55GVNJHYN7APL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5MWBXJ4AE2LYD55GVNJHYN7APL/action/storage_attestation","attest_author":"https://pith.science/pith/5MWBXJ4AE2LYD55GVNJHYN7APL/action/author_attestation","sign_citation":"https://pith.science/pith/5MWBXJ4AE2LYD55GVNJHYN7APL/action/citation_signature","submit_replication":"https://pith.science/pith/5MWBXJ4AE2LYD55GVNJHYN7APL/action/replication_record"}},"created_at":"2026-05-17T23:47:52.674159+00:00","updated_at":"2026-05-17T23:47:52.674159+00:00"}