{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VCEKFILAZZSR6GWKAEM7PQUYUW","short_pith_number":"pith:VCEKFILA","schema_version":"1.0","canonical_sha256":"a888a2a160ce651f1aca0119f7c298a5ab99b562ea9af5688721cc4efefd05d9","source":{"kind":"arxiv","id":"1801.03623","version":1},"attestation_state":"computed","paper":{"title":"Optimal locally repairable codes of distance $3$ and $4$ via cyclic codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chaoping Xing, Chen Yuan, Yuan Luo","submitted_at":"2018-01-11T03:26:40Z","abstract_excerpt":"Like classical block codes, a locally repairable code also obeys the Singleton-type bound (we call a locally repairable code {\\it optimal} if it achieves the Singleton-type bound). In the breakthrough work of \\cite{TB14}, several classes of optimal locally repairable codes were constructed via subcodes of Reed-Solomon codes. Thus, the lengths of the codes given in \\cite{TB14} are upper bounded by the code alphabet size $q$. Recently, it was proved through extension of construction in \\cite{TB14} that length of $q$-ary optimal locally repairable codes can be $q+1$ in \\cite{JMX17}. Surprisingly,"},"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":"1801.03623","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-11T03:26:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"74ed6930fc8e0587d6b0b286017d5d5ee2778a6e908694ec700b5a679e715d87","abstract_canon_sha256":"8496b43ebfcea44882fd1a07d55bd8a0181033660cd1183f5f497283e98724df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:13.766436Z","signature_b64":"x/5XRKRzLewl+xVzqfzDX23E0fkg1JW1lnpAsQK0w7prWdYzRPGHmSk2uzLCLMKAl+RN0nNdfXCRj8XT0usOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a888a2a160ce651f1aca0119f7c298a5ab99b562ea9af5688721cc4efefd05d9","last_reissued_at":"2026-05-18T00:26:13.765799Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:13.765799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal locally repairable codes of distance $3$ and $4$ via cyclic codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chaoping Xing, Chen Yuan, Yuan Luo","submitted_at":"2018-01-11T03:26:40Z","abstract_excerpt":"Like classical block codes, a locally repairable code also obeys the Singleton-type bound (we call a locally repairable code {\\it optimal} if it achieves the Singleton-type bound). In the breakthrough work of \\cite{TB14}, several classes of optimal locally repairable codes were constructed via subcodes of Reed-Solomon codes. Thus, the lengths of the codes given in \\cite{TB14} are upper bounded by the code alphabet size $q$. Recently, it was proved through extension of construction in \\cite{TB14} that length of $q$-ary optimal locally repairable codes can be $q+1$ in \\cite{JMX17}. Surprisingly,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03623","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":"1801.03623","created_at":"2026-05-18T00:26:13.765897+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.03623v1","created_at":"2026-05-18T00:26:13.765897+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03623","created_at":"2026-05-18T00:26:13.765897+00:00"},{"alias_kind":"pith_short_12","alias_value":"VCEKFILAZZSR","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VCEKFILAZZSR6GWK","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VCEKFILA","created_at":"2026-05-18T12:32:59.047623+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/VCEKFILAZZSR6GWKAEM7PQUYUW","json":"https://pith.science/pith/VCEKFILAZZSR6GWKAEM7PQUYUW.json","graph_json":"https://pith.science/api/pith-number/VCEKFILAZZSR6GWKAEM7PQUYUW/graph.json","events_json":"https://pith.science/api/pith-number/VCEKFILAZZSR6GWKAEM7PQUYUW/events.json","paper":"https://pith.science/paper/VCEKFILA"},"agent_actions":{"view_html":"https://pith.science/pith/VCEKFILAZZSR6GWKAEM7PQUYUW","download_json":"https://pith.science/pith/VCEKFILAZZSR6GWKAEM7PQUYUW.json","view_paper":"https://pith.science/paper/VCEKFILA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.03623&json=true","fetch_graph":"https://pith.science/api/pith-number/VCEKFILAZZSR6GWKAEM7PQUYUW/graph.json","fetch_events":"https://pith.science/api/pith-number/VCEKFILAZZSR6GWKAEM7PQUYUW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VCEKFILAZZSR6GWKAEM7PQUYUW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VCEKFILAZZSR6GWKAEM7PQUYUW/action/storage_attestation","attest_author":"https://pith.science/pith/VCEKFILAZZSR6GWKAEM7PQUYUW/action/author_attestation","sign_citation":"https://pith.science/pith/VCEKFILAZZSR6GWKAEM7PQUYUW/action/citation_signature","submit_replication":"https://pith.science/pith/VCEKFILAZZSR6GWKAEM7PQUYUW/action/replication_record"}},"created_at":"2026-05-18T00:26:13.765897+00:00","updated_at":"2026-05-18T00:26:13.765897+00:00"}