{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4N6ALX6FCCW6NQB7SVCBPAPGNW","short_pith_number":"pith:4N6ALX6F","schema_version":"1.0","canonical_sha256":"e37c05dfc510ade6c03f95441781e66d9372deb6a0b5525ed2d37fc27929ef2c","source":{"kind":"arxiv","id":"1903.05265","version":1},"attestation_state":"computed","paper":{"title":"MDS codes over finite fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ted Hurley","submitted_at":"2019-03-12T23:45:06Z","abstract_excerpt":"The mds (maximum distance separable) conjecture claims that a nontrivial linear mds $[n,k]$ code over the finite field $GF(q)$ satisfies $n \\leq (q + 1)$, except when $q$ is even and $k = 3$ or $k = q- 1$ in which case it satisfies $n \\leq (q + 2)$.\n  For given field $GF(q)$ and any given $k$, series of mds $[q+1,k]$ codes are constructed.\n  Any $[n,3]$ mds or $[n,n-3]$ mds code over $GF(q)$ must satisfy $n\\leq (q+1)$ for $q$ odd and $n\\leq (q+2)$ for $q$ even. For even $q$, mds $[q+2,3]$ and mds $[q+2, q-1]$ codes are constructed over $GF(q)$.\n  The codes constructed have efficient encoding 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":"1903.05265","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-12T23:45:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"38cf7d4be3a23f58192652e55628d083d97dd2703af64aa908857a10a6b6c110","abstract_canon_sha256":"d7583a5e4814a9c1c474ce3f01b35c8ad8383b707ec8e3c40e5756b5ba0a1efd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:24.866398Z","signature_b64":"EBNuA2B40OB3CW9qYIVIMtg4wpgkRqRegpCPjbnmP9lTHBqDsrMLMr2RJzvI+hRVouC9TDfkiVloluqEB6ZhAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e37c05dfc510ade6c03f95441781e66d9372deb6a0b5525ed2d37fc27929ef2c","last_reissued_at":"2026-05-17T23:51:24.865680Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:24.865680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MDS codes over finite fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ted Hurley","submitted_at":"2019-03-12T23:45:06Z","abstract_excerpt":"The mds (maximum distance separable) conjecture claims that a nontrivial linear mds $[n,k]$ code over the finite field $GF(q)$ satisfies $n \\leq (q + 1)$, except when $q$ is even and $k = 3$ or $k = q- 1$ in which case it satisfies $n \\leq (q + 2)$.\n  For given field $GF(q)$ and any given $k$, series of mds $[q+1,k]$ codes are constructed.\n  Any $[n,3]$ mds or $[n,n-3]$ mds code over $GF(q)$ must satisfy $n\\leq (q+1)$ for $q$ odd and $n\\leq (q+2)$ for $q$ even. For even $q$, mds $[q+2,3]$ and mds $[q+2, q-1]$ codes are constructed over $GF(q)$.\n  The codes constructed have efficient encoding a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05265","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":"1903.05265","created_at":"2026-05-17T23:51:24.865795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.05265v1","created_at":"2026-05-17T23:51:24.865795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05265","created_at":"2026-05-17T23:51:24.865795+00:00"},{"alias_kind":"pith_short_12","alias_value":"4N6ALX6FCCW6","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"4N6ALX6FCCW6NQB7","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"4N6ALX6F","created_at":"2026-05-18T12:33:10.108867+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/4N6ALX6FCCW6NQB7SVCBPAPGNW","json":"https://pith.science/pith/4N6ALX6FCCW6NQB7SVCBPAPGNW.json","graph_json":"https://pith.science/api/pith-number/4N6ALX6FCCW6NQB7SVCBPAPGNW/graph.json","events_json":"https://pith.science/api/pith-number/4N6ALX6FCCW6NQB7SVCBPAPGNW/events.json","paper":"https://pith.science/paper/4N6ALX6F"},"agent_actions":{"view_html":"https://pith.science/pith/4N6ALX6FCCW6NQB7SVCBPAPGNW","download_json":"https://pith.science/pith/4N6ALX6FCCW6NQB7SVCBPAPGNW.json","view_paper":"https://pith.science/paper/4N6ALX6F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.05265&json=true","fetch_graph":"https://pith.science/api/pith-number/4N6ALX6FCCW6NQB7SVCBPAPGNW/graph.json","fetch_events":"https://pith.science/api/pith-number/4N6ALX6FCCW6NQB7SVCBPAPGNW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4N6ALX6FCCW6NQB7SVCBPAPGNW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4N6ALX6FCCW6NQB7SVCBPAPGNW/action/storage_attestation","attest_author":"https://pith.science/pith/4N6ALX6FCCW6NQB7SVCBPAPGNW/action/author_attestation","sign_citation":"https://pith.science/pith/4N6ALX6FCCW6NQB7SVCBPAPGNW/action/citation_signature","submit_replication":"https://pith.science/pith/4N6ALX6FCCW6NQB7SVCBPAPGNW/action/replication_record"}},"created_at":"2026-05-17T23:51:24.865795+00:00","updated_at":"2026-05-17T23:51:24.865795+00:00"}