{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:O7CNHTP7PZXMKWAKTVQFZTTATH","short_pith_number":"pith:O7CNHTP7","schema_version":"1.0","canonical_sha256":"77c4d3cdff7e6ec5580a9d605cce6099ea1ede1e5a576305327127a21ffa3127","source":{"kind":"arxiv","id":"1410.6339","version":2},"attestation_state":"computed","paper":{"title":"Constructions and Properties of Linear Locally Repairable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Camilla Hollanti, Ragnar Freij, Thomas Westerb\\\"ack, Toni Ernvall","submitted_at":"2014-10-23T12:16:12Z","abstract_excerpt":"In this paper, locally repairable codes with all-symbol locality are studied. Methods to modify already existing codes are presented. Also, it is shown that with high probability, a random matrix with a few extra columns guaranteeing the locality property, is a generator matrix for a locally repairable code with a good minimum distance. The proof of this also gives a constructive method to find locally repairable codes. Constructions are given of three infinite classes of optimal vector-linear locally repairable codes over an alphabet of small size, not depending on the size of the 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":"1410.6339","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-23T12:16:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a9bee098db1b65068fd644277837a20b7295210ed2dc22e7e76a2c3e814cde61","abstract_canon_sha256":"9ae2e5aff28123d0d8579c16836d7ed31999d8d11fe56398ab231b65a1730f46"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:12.923311Z","signature_b64":"CNkQen2bQdx+TwzB+4EaeM5tfItBxP4p0XXeNqyfdfYgylSwDSBfGVnfU0lJKG1LyEShIB/VOdEkcTcV+MAvAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77c4d3cdff7e6ec5580a9d605cce6099ea1ede1e5a576305327127a21ffa3127","last_reissued_at":"2026-05-18T01:05:12.922355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:12.922355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructions and Properties of Linear Locally Repairable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Camilla Hollanti, Ragnar Freij, Thomas Westerb\\\"ack, Toni Ernvall","submitted_at":"2014-10-23T12:16:12Z","abstract_excerpt":"In this paper, locally repairable codes with all-symbol locality are studied. Methods to modify already existing codes are presented. Also, it is shown that with high probability, a random matrix with a few extra columns guaranteeing the locality property, is a generator matrix for a locally repairable code with a good minimum distance. The proof of this also gives a constructive method to find locally repairable codes. Constructions are given of three infinite classes of optimal vector-linear locally repairable codes over an alphabet of small size, not depending on the size of the code."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6339","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":"1410.6339","created_at":"2026-05-18T01:05:12.922513+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.6339v2","created_at":"2026-05-18T01:05:12.922513+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6339","created_at":"2026-05-18T01:05:12.922513+00:00"},{"alias_kind":"pith_short_12","alias_value":"O7CNHTP7PZXM","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"O7CNHTP7PZXMKWAK","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"O7CNHTP7","created_at":"2026-05-18T12:28:41.024544+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/O7CNHTP7PZXMKWAKTVQFZTTATH","json":"https://pith.science/pith/O7CNHTP7PZXMKWAKTVQFZTTATH.json","graph_json":"https://pith.science/api/pith-number/O7CNHTP7PZXMKWAKTVQFZTTATH/graph.json","events_json":"https://pith.science/api/pith-number/O7CNHTP7PZXMKWAKTVQFZTTATH/events.json","paper":"https://pith.science/paper/O7CNHTP7"},"agent_actions":{"view_html":"https://pith.science/pith/O7CNHTP7PZXMKWAKTVQFZTTATH","download_json":"https://pith.science/pith/O7CNHTP7PZXMKWAKTVQFZTTATH.json","view_paper":"https://pith.science/paper/O7CNHTP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.6339&json=true","fetch_graph":"https://pith.science/api/pith-number/O7CNHTP7PZXMKWAKTVQFZTTATH/graph.json","fetch_events":"https://pith.science/api/pith-number/O7CNHTP7PZXMKWAKTVQFZTTATH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O7CNHTP7PZXMKWAKTVQFZTTATH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O7CNHTP7PZXMKWAKTVQFZTTATH/action/storage_attestation","attest_author":"https://pith.science/pith/O7CNHTP7PZXMKWAKTVQFZTTATH/action/author_attestation","sign_citation":"https://pith.science/pith/O7CNHTP7PZXMKWAKTVQFZTTATH/action/citation_signature","submit_replication":"https://pith.science/pith/O7CNHTP7PZXMKWAKTVQFZTTATH/action/replication_record"}},"created_at":"2026-05-18T01:05:12.922513+00:00","updated_at":"2026-05-18T01:05:12.922513+00:00"}