{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:O5TFEECIDAKND453YJMO5CCEKN","short_pith_number":"pith:O5TFEECI","schema_version":"1.0","canonical_sha256":"77665210481814d1f3bbc258ee88445367ecd4ceb4a01f8003fd00228001d7ad","source":{"kind":"arxiv","id":"1811.09142","version":2},"attestation_state":"computed","paper":{"title":"Construction of optimal locally recoverable codes and connection with hypergraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Chaoping Xing, Chen Yuan","submitted_at":"2018-11-22T12:46:49Z","abstract_excerpt":"Recently, it was discovered by several authors that a $q$-ary optimal locally recoverable code, i.e., a locally recoverable code archiving the Singleton-type bound, can have length much bigger than $q+1$. This is quite different from the classical $q$-ary MDS codes where it is conjectured that the code length is upper bounded by $q+1$ (or $q+2$ for some special case). This discovery inspired some recent studies on length of an optimal locally recoverable code. It was shown in \\cite{LXY} that a $q$-ary optimal locally recoverable code is unbounded for $d=3,4$. Soon after, it was proved that a $"},"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":"1811.09142","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-22T12:46:49Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"9aa6287e19efeda3d448b1350a235e9844aa185f6a55b11a774b9f7e36875635","abstract_canon_sha256":"3d39d3fd291c5be5c2ddc5c51dc57efa94fe75b9f2d8cb8b025be4cb7e76b37e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:57.370331Z","signature_b64":"899z1++jRhTUmZToI0YzEKlFlsaQwElYp5QzhUj+ZLOflnAR9D3qRPgNi5GmOW3ZrAV+Pq+bTUe94gweVtSZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77665210481814d1f3bbc258ee88445367ecd4ceb4a01f8003fd00228001d7ad","last_reissued_at":"2026-05-17T23:59:57.369640Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:57.369640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Construction of optimal locally recoverable codes and connection with hypergraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Chaoping Xing, Chen Yuan","submitted_at":"2018-11-22T12:46:49Z","abstract_excerpt":"Recently, it was discovered by several authors that a $q$-ary optimal locally recoverable code, i.e., a locally recoverable code archiving the Singleton-type bound, can have length much bigger than $q+1$. This is quite different from the classical $q$-ary MDS codes where it is conjectured that the code length is upper bounded by $q+1$ (or $q+2$ for some special case). This discovery inspired some recent studies on length of an optimal locally recoverable code. It was shown in \\cite{LXY} that a $q$-ary optimal locally recoverable code is unbounded for $d=3,4$. Soon after, it was proved that a $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.09142","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":"1811.09142","created_at":"2026-05-17T23:59:57.369751+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.09142v2","created_at":"2026-05-17T23:59:57.369751+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.09142","created_at":"2026-05-17T23:59:57.369751+00:00"},{"alias_kind":"pith_short_12","alias_value":"O5TFEECIDAKN","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"O5TFEECIDAKND453","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"O5TFEECI","created_at":"2026-05-18T12:32:43.782077+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.26756","citing_title":"Locality for Codes over the Integers","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O5TFEECIDAKND453YJMO5CCEKN","json":"https://pith.science/pith/O5TFEECIDAKND453YJMO5CCEKN.json","graph_json":"https://pith.science/api/pith-number/O5TFEECIDAKND453YJMO5CCEKN/graph.json","events_json":"https://pith.science/api/pith-number/O5TFEECIDAKND453YJMO5CCEKN/events.json","paper":"https://pith.science/paper/O5TFEECI"},"agent_actions":{"view_html":"https://pith.science/pith/O5TFEECIDAKND453YJMO5CCEKN","download_json":"https://pith.science/pith/O5TFEECIDAKND453YJMO5CCEKN.json","view_paper":"https://pith.science/paper/O5TFEECI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.09142&json=true","fetch_graph":"https://pith.science/api/pith-number/O5TFEECIDAKND453YJMO5CCEKN/graph.json","fetch_events":"https://pith.science/api/pith-number/O5TFEECIDAKND453YJMO5CCEKN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O5TFEECIDAKND453YJMO5CCEKN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O5TFEECIDAKND453YJMO5CCEKN/action/storage_attestation","attest_author":"https://pith.science/pith/O5TFEECIDAKND453YJMO5CCEKN/action/author_attestation","sign_citation":"https://pith.science/pith/O5TFEECIDAKND453YJMO5CCEKN/action/citation_signature","submit_replication":"https://pith.science/pith/O5TFEECIDAKND453YJMO5CCEKN/action/replication_record"}},"created_at":"2026-05-17T23:59:57.369751+00:00","updated_at":"2026-05-17T23:59:57.369751+00:00"}