{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VCEKFILAZZSR6GWKAEM7PQUYUW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8496b43ebfcea44882fd1a07d55bd8a0181033660cd1183f5f497283e98724df","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-11T03:26:40Z","title_canon_sha256":"74ed6930fc8e0587d6b0b286017d5d5ee2778a6e908694ec700b5a679e715d87"},"schema_version":"1.0","source":{"id":"1801.03623","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03623","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03623v1","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03623","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"pith_short_12","alias_value":"VCEKFILAZZSR","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VCEKFILAZZSR6GWK","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VCEKFILA","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:5ede1646f2099c2ef36aabffea5b36a20acda26e20ad6695d0b8cae0445e1145","target":"graph","created_at":"2026-05-18T00:26:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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,","authors_text":"Chaoping Xing, Chen Yuan, Yuan Luo","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-11T03:26:40Z","title":"Optimal locally repairable codes of distance $3$ and $4$ via cyclic codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03623","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8124567ea7b2a38aaf069affb72058ffc42722b78015f24050f03aac462c9b4a","target":"record","created_at":"2026-05-18T00:26:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8496b43ebfcea44882fd1a07d55bd8a0181033660cd1183f5f497283e98724df","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-11T03:26:40Z","title_canon_sha256":"74ed6930fc8e0587d6b0b286017d5d5ee2778a6e908694ec700b5a679e715d87"},"schema_version":"1.0","source":{"id":"1801.03623","kind":"arxiv","version":1}},"canonical_sha256":"a888a2a160ce651f1aca0119f7c298a5ab99b562ea9af5688721cc4efefd05d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a888a2a160ce651f1aca0119f7c298a5ab99b562ea9af5688721cc4efefd05d9","first_computed_at":"2026-05-18T00:26:13.765799Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:13.765799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x/5XRKRzLewl+xVzqfzDX23E0fkg1JW1lnpAsQK0w7prWdYzRPGHmSk2uzLCLMKAl+RN0nNdfXCRj8XT0usOAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:13.766436Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.03623","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8124567ea7b2a38aaf069affb72058ffc42722b78015f24050f03aac462c9b4a","sha256:5ede1646f2099c2ef36aabffea5b36a20acda26e20ad6695d0b8cae0445e1145"],"state_sha256":"bbaf25253dab8317d759d3d90938d80ca80e7dd9b85a6221161af51031eb5205"}