{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XRIUFDGLE7YMV2WCPI5X3FRVTN","short_pith_number":"pith:XRIUFDGL","schema_version":"1.0","canonical_sha256":"bc51428ccb27f0caeac27a3b7d96359b4269bf2c5967c91eb9f0502f7726656e","source":{"kind":"arxiv","id":"1810.08510","version":2},"attestation_state":"computed","paper":{"title":"Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Camilla Hollanti, Matthias Grezet, Ragnar Freij-Hollanti, Thomas Westerb\\\"ack","submitted_at":"2018-10-19T14:05:54Z","abstract_excerpt":"Locally repairable codes (LRCs) have gained significant interest for the design of large distributed storage systems as they allow a small number of erased nodes to be recovered by accessing only a few others. Several works have thus been carried out to understand the optimal rate-distance tradeoff, but only recently the size of the alphabet has been taken into account. In this paper, a novel definition of locality is proposed to keep track of the precise number of nodes required for a local repair when the repair sets do not yield MDS codes. Then, a new alphabet-dependent bound is derived, wh"},"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":"1810.08510","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-19T14:05:54Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"179a17fc39dda8c5f2e030afec06a4ab143fe7856061b8fbd769138675e84bb5","abstract_canon_sha256":"5526a47aeae0be2689c3c5680ee37f0589457995be8910152458b5ebc7f0926c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:02.750036Z","signature_b64":"Fud4OLVB6wFiJQPZUgtiPLhsqMx45OoWck+TXyLBUkhafEBbGnxob0HxeoKObBi5SRtUvFV4l5yod797iNo2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc51428ccb27f0caeac27a3b7d96359b4269bf2c5967c91eb9f0502f7726656e","last_reissued_at":"2026-05-17T23:44:02.749541Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:02.749541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Camilla Hollanti, Matthias Grezet, Ragnar Freij-Hollanti, Thomas Westerb\\\"ack","submitted_at":"2018-10-19T14:05:54Z","abstract_excerpt":"Locally repairable codes (LRCs) have gained significant interest for the design of large distributed storage systems as they allow a small number of erased nodes to be recovered by accessing only a few others. Several works have thus been carried out to understand the optimal rate-distance tradeoff, but only recently the size of the alphabet has been taken into account. In this paper, a novel definition of locality is proposed to keep track of the precise number of nodes required for a local repair when the repair sets do not yield MDS codes. Then, a new alphabet-dependent bound is derived, wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08510","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":"1810.08510","created_at":"2026-05-17T23:44:02.749622+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.08510v2","created_at":"2026-05-17T23:44:02.749622+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08510","created_at":"2026-05-17T23:44:02.749622+00:00"},{"alias_kind":"pith_short_12","alias_value":"XRIUFDGLE7YM","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XRIUFDGLE7YMV2WC","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XRIUFDGL","created_at":"2026-05-18T12:33:01.666342+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/XRIUFDGLE7YMV2WCPI5X3FRVTN","json":"https://pith.science/pith/XRIUFDGLE7YMV2WCPI5X3FRVTN.json","graph_json":"https://pith.science/api/pith-number/XRIUFDGLE7YMV2WCPI5X3FRVTN/graph.json","events_json":"https://pith.science/api/pith-number/XRIUFDGLE7YMV2WCPI5X3FRVTN/events.json","paper":"https://pith.science/paper/XRIUFDGL"},"agent_actions":{"view_html":"https://pith.science/pith/XRIUFDGLE7YMV2WCPI5X3FRVTN","download_json":"https://pith.science/pith/XRIUFDGLE7YMV2WCPI5X3FRVTN.json","view_paper":"https://pith.science/paper/XRIUFDGL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.08510&json=true","fetch_graph":"https://pith.science/api/pith-number/XRIUFDGLE7YMV2WCPI5X3FRVTN/graph.json","fetch_events":"https://pith.science/api/pith-number/XRIUFDGLE7YMV2WCPI5X3FRVTN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XRIUFDGLE7YMV2WCPI5X3FRVTN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XRIUFDGLE7YMV2WCPI5X3FRVTN/action/storage_attestation","attest_author":"https://pith.science/pith/XRIUFDGLE7YMV2WCPI5X3FRVTN/action/author_attestation","sign_citation":"https://pith.science/pith/XRIUFDGLE7YMV2WCPI5X3FRVTN/action/citation_signature","submit_replication":"https://pith.science/pith/XRIUFDGLE7YMV2WCPI5X3FRVTN/action/replication_record"}},"created_at":"2026-05-17T23:44:02.749622+00:00","updated_at":"2026-05-17T23:44:02.749622+00:00"}