{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RTUVMHWXPTJVEQCUAAUON4ZYE4","short_pith_number":"pith:RTUVMHWX","schema_version":"1.0","canonical_sha256":"8ce9561ed77cd35240540028e6f33827020ce7cb5309cf32197012f33d453e7f","source":{"kind":"arxiv","id":"1805.12345","version":2},"attestation_state":"computed","paper":{"title":"Optimal cyclic $(r,\\delta)$ locally repairable codes with unbounded length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fang-Wei Fu, Weijun Fang","submitted_at":"2018-05-31T07:04:12Z","abstract_excerpt":"Locally repairable codes with locality $r$ ($r$-LRCs for short) were introduced by Gopalan et al. \\cite{1} to recover a failed node of the code from at most other $r$ available nodes. And then $(r,\\delta)$ locally repairable codes ($(r,\\delta)$-LRCs for short) were produced by Prakash et al. \\cite{2} for tolerating multiple failed nodes. An $r$-LRC can be viewed as an $(r,2)$-LRC. An $(r,\\delta)$-LRC is called optimal if it achieves the Singleton-type bound. It has been a great challenge to construct $q$-ary optimal $(r,\\delta)$-LRCs with length much larger than $q$. Surprisingly, Luo et al. \\"},"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":"1805.12345","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-31T07:04:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b9c168803f59da618ed440b6b7c96f8ffbcaa7075e5f1fa041a715505d6c6dbf","abstract_canon_sha256":"0b7bc666672cc1af59809ea0e11c30d28228a39da24fe3812b4b27f7a5f40724"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:23.041824Z","signature_b64":"0QS1NZMiAqzo1tCV8sisXvqv1K7I3eMCnAvmIuy2QdAAL0wVx9VjvszBWzFLLoI9oZAzgu4a+XywiF7ePcoVCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ce9561ed77cd35240540028e6f33827020ce7cb5309cf32197012f33d453e7f","last_reissued_at":"2026-05-18T00:04:23.041112Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:23.041112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal cyclic $(r,\\delta)$ locally repairable codes with unbounded length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fang-Wei Fu, Weijun Fang","submitted_at":"2018-05-31T07:04:12Z","abstract_excerpt":"Locally repairable codes with locality $r$ ($r$-LRCs for short) were introduced by Gopalan et al. \\cite{1} to recover a failed node of the code from at most other $r$ available nodes. And then $(r,\\delta)$ locally repairable codes ($(r,\\delta)$-LRCs for short) were produced by Prakash et al. \\cite{2} for tolerating multiple failed nodes. An $r$-LRC can be viewed as an $(r,2)$-LRC. An $(r,\\delta)$-LRC is called optimal if it achieves the Singleton-type bound. It has been a great challenge to construct $q$-ary optimal $(r,\\delta)$-LRCs with length much larger than $q$. Surprisingly, Luo et al. \\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.12345","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":"1805.12345","created_at":"2026-05-18T00:04:23.041236+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.12345v2","created_at":"2026-05-18T00:04:23.041236+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.12345","created_at":"2026-05-18T00:04:23.041236+00:00"},{"alias_kind":"pith_short_12","alias_value":"RTUVMHWXPTJV","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RTUVMHWXPTJVEQCU","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RTUVMHWX","created_at":"2026-05-18T12:32:50.500415+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/RTUVMHWXPTJVEQCUAAUON4ZYE4","json":"https://pith.science/pith/RTUVMHWXPTJVEQCUAAUON4ZYE4.json","graph_json":"https://pith.science/api/pith-number/RTUVMHWXPTJVEQCUAAUON4ZYE4/graph.json","events_json":"https://pith.science/api/pith-number/RTUVMHWXPTJVEQCUAAUON4ZYE4/events.json","paper":"https://pith.science/paper/RTUVMHWX"},"agent_actions":{"view_html":"https://pith.science/pith/RTUVMHWXPTJVEQCUAAUON4ZYE4","download_json":"https://pith.science/pith/RTUVMHWXPTJVEQCUAAUON4ZYE4.json","view_paper":"https://pith.science/paper/RTUVMHWX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.12345&json=true","fetch_graph":"https://pith.science/api/pith-number/RTUVMHWXPTJVEQCUAAUON4ZYE4/graph.json","fetch_events":"https://pith.science/api/pith-number/RTUVMHWXPTJVEQCUAAUON4ZYE4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RTUVMHWXPTJVEQCUAAUON4ZYE4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RTUVMHWXPTJVEQCUAAUON4ZYE4/action/storage_attestation","attest_author":"https://pith.science/pith/RTUVMHWXPTJVEQCUAAUON4ZYE4/action/author_attestation","sign_citation":"https://pith.science/pith/RTUVMHWXPTJVEQCUAAUON4ZYE4/action/citation_signature","submit_replication":"https://pith.science/pith/RTUVMHWXPTJVEQCUAAUON4ZYE4/action/replication_record"}},"created_at":"2026-05-18T00:04:23.041236+00:00","updated_at":"2026-05-18T00:04:23.041236+00:00"}