{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EIJGI2JVJPLB73AU72APA5UMLG","short_pith_number":"pith:EIJGI2JV","schema_version":"1.0","canonical_sha256":"22126469354bd61fec14fe80f0768c59afbcacd06afb0037030912cbf21e8610","source":{"kind":"arxiv","id":"2411.14779","version":1},"attestation_state":"computed","paper":{"title":"New families of non-Reed-Solomon MDS codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chaoping Xing, Haiyan Zhou, Liming Ma, Lingfei Jin","submitted_at":"2024-11-22T07:49:57Z","abstract_excerpt":"MDS codes have garnered significant attention due to their wide applications in practice. To date, most known MDS codes are equivalent to Reed-Solomon codes. The construction of non-Reed-Solomon (non-RS) type MDS codes has emerged as an intriguing and important problem in both coding theory and finite geometry. Although some constructions of non-RS type MDS codes have been presented in the literature, the parameters of these MDS codes remain subject to strict constraints. In this paper, we introduce a general framework of constructing $[n,k]$ MDS codes using the idea of selecting a suitable se"},"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":"2411.14779","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-11-22T07:49:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"edd006b800ffa36073a155bd816eee5f9db57c428274ffd9a134ac839b8a9f2f","abstract_canon_sha256":"d498435f0416881d6a2eae6236f0b5325c0954c5c3415046fcaf25ad0149a9c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:39:11.803672Z","signature_b64":"IOS5Q0Cj/Hp2R50G9ldfsAbzCJSu9OotfNRjgKAMqKeZxZWF1q2hSwfntDM3CfTkI4dupmKxWW9Kl+Zq7OjuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22126469354bd61fec14fe80f0768c59afbcacd06afb0037030912cbf21e8610","last_reissued_at":"2026-07-05T09:39:11.803161Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:39:11.803161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New families of non-Reed-Solomon MDS codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chaoping Xing, Haiyan Zhou, Liming Ma, Lingfei Jin","submitted_at":"2024-11-22T07:49:57Z","abstract_excerpt":"MDS codes have garnered significant attention due to their wide applications in practice. To date, most known MDS codes are equivalent to Reed-Solomon codes. The construction of non-Reed-Solomon (non-RS) type MDS codes has emerged as an intriguing and important problem in both coding theory and finite geometry. Although some constructions of non-RS type MDS codes have been presented in the literature, the parameters of these MDS codes remain subject to strict constraints. In this paper, we introduce a general framework of constructing $[n,k]$ MDS codes using the idea of selecting a suitable se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14779","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.14779/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2411.14779","created_at":"2026-07-05T09:39:11.803229+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.14779v1","created_at":"2026-07-05T09:39:11.803229+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14779","created_at":"2026-07-05T09:39:11.803229+00:00"},{"alias_kind":"pith_short_12","alias_value":"EIJGI2JVJPLB","created_at":"2026-07-05T09:39:11.803229+00:00"},{"alias_kind":"pith_short_16","alias_value":"EIJGI2JVJPLB73AU","created_at":"2026-07-05T09:39:11.803229+00:00"},{"alias_kind":"pith_short_8","alias_value":"EIJGI2JV","created_at":"2026-07-05T09:39:11.803229+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2412.14615","citing_title":"Additive codes attaining the Griesmer bound","ref_index":71,"is_internal_anchor":false},{"citing_arxiv_id":"2509.03034","citing_title":"On a class of twisted elliptic curve codes","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2512.13429","citing_title":"Two Families of Linear Codes Containing Non-GRS MDS Codes","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EIJGI2JVJPLB73AU72APA5UMLG","json":"https://pith.science/pith/EIJGI2JVJPLB73AU72APA5UMLG.json","graph_json":"https://pith.science/api/pith-number/EIJGI2JVJPLB73AU72APA5UMLG/graph.json","events_json":"https://pith.science/api/pith-number/EIJGI2JVJPLB73AU72APA5UMLG/events.json","paper":"https://pith.science/paper/EIJGI2JV"},"agent_actions":{"view_html":"https://pith.science/pith/EIJGI2JVJPLB73AU72APA5UMLG","download_json":"https://pith.science/pith/EIJGI2JVJPLB73AU72APA5UMLG.json","view_paper":"https://pith.science/paper/EIJGI2JV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.14779&json=true","fetch_graph":"https://pith.science/api/pith-number/EIJGI2JVJPLB73AU72APA5UMLG/graph.json","fetch_events":"https://pith.science/api/pith-number/EIJGI2JVJPLB73AU72APA5UMLG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EIJGI2JVJPLB73AU72APA5UMLG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EIJGI2JVJPLB73AU72APA5UMLG/action/storage_attestation","attest_author":"https://pith.science/pith/EIJGI2JVJPLB73AU72APA5UMLG/action/author_attestation","sign_citation":"https://pith.science/pith/EIJGI2JVJPLB73AU72APA5UMLG/action/citation_signature","submit_replication":"https://pith.science/pith/EIJGI2JVJPLB73AU72APA5UMLG/action/replication_record"}},"created_at":"2026-07-05T09:39:11.803229+00:00","updated_at":"2026-07-05T09:39:11.803229+00:00"}