{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YW7GLOBBXJXOYC6Q25LHH6OP2Y","short_pith_number":"pith:YW7GLOBB","schema_version":"1.0","canonical_sha256":"c5be65b821ba6eec0bd0d75673f9cfd63e844718bbc34cfc57248069c431201c","source":{"kind":"arxiv","id":"2605.29439","version":1},"attestation_state":"computed","paper":{"title":"On the Maximal Length of MDS Elliptic Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chang-An Zhao, Chuangqiang Hu, Haojie Chen, Junjie Huang","submitted_at":"2026-05-28T06:33:38Z","abstract_excerpt":"The determination of the maximal length of maximum distance separable (MDS) codes arising from elliptic curves is a central problem in coding theory. For an elliptic curve $E$ over $\\mathbb{F}_q$, let $\\operatorname{MEC}(k,q)$ denote the maximal length of a $q$-ary MDS elliptic code of dimension $k$. It was recently shown that $\\operatorname{MEC}(k,q)\\le\\frac{q+1}{2}+\\sqrt{q}$ for $q\\ge289$ and $3\\le k\\le(q+1-2\\sqrt{q})/10$, with equality for odd $k$ when $q$ is an odd square. This paper investigates the remaining open cases, namely even dimension $k$, non-square $q$ and fields of characterist"},"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":"2605.29439","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-28T06:33:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"294786f6660c14c41395dcb334d31cf574aa6af2aa93710db1c79c2f91163740","abstract_canon_sha256":"57595616664e56a30dd8bca83ef6c1a6fc15634c190a56f39ed4907a4c671eb3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T01:05:39.083664Z","signature_b64":"pQrZjKIr2PxRPE5Hz8uEOn901ozRVGlOsqYBjQAnIqairhtH0RACC/VEqsP1Ndlwv9KIrouC3bNakevhfo4VBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5be65b821ba6eec0bd0d75673f9cfd63e844718bbc34cfc57248069c431201c","last_reissued_at":"2026-05-29T01:05:39.083102Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T01:05:39.083102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Maximal Length of MDS Elliptic Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chang-An Zhao, Chuangqiang Hu, Haojie Chen, Junjie Huang","submitted_at":"2026-05-28T06:33:38Z","abstract_excerpt":"The determination of the maximal length of maximum distance separable (MDS) codes arising from elliptic curves is a central problem in coding theory. For an elliptic curve $E$ over $\\mathbb{F}_q$, let $\\operatorname{MEC}(k,q)$ denote the maximal length of a $q$-ary MDS elliptic code of dimension $k$. It was recently shown that $\\operatorname{MEC}(k,q)\\le\\frac{q+1}{2}+\\sqrt{q}$ for $q\\ge289$ and $3\\le k\\le(q+1-2\\sqrt{q})/10$, with equality for odd $k$ when $q$ is an odd square. This paper investigates the remaining open cases, namely even dimension $k$, non-square $q$ and fields of characterist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.29439","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/2605.29439/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":"2605.29439","created_at":"2026-05-29T01:05:39.083195+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.29439v1","created_at":"2026-05-29T01:05:39.083195+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.29439","created_at":"2026-05-29T01:05:39.083195+00:00"},{"alias_kind":"pith_short_12","alias_value":"YW7GLOBBXJXO","created_at":"2026-05-29T01:05:39.083195+00:00"},{"alias_kind":"pith_short_16","alias_value":"YW7GLOBBXJXOYC6Q","created_at":"2026-05-29T01:05:39.083195+00:00"},{"alias_kind":"pith_short_8","alias_value":"YW7GLOBB","created_at":"2026-05-29T01:05:39.083195+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/YW7GLOBBXJXOYC6Q25LHH6OP2Y","json":"https://pith.science/pith/YW7GLOBBXJXOYC6Q25LHH6OP2Y.json","graph_json":"https://pith.science/api/pith-number/YW7GLOBBXJXOYC6Q25LHH6OP2Y/graph.json","events_json":"https://pith.science/api/pith-number/YW7GLOBBXJXOYC6Q25LHH6OP2Y/events.json","paper":"https://pith.science/paper/YW7GLOBB"},"agent_actions":{"view_html":"https://pith.science/pith/YW7GLOBBXJXOYC6Q25LHH6OP2Y","download_json":"https://pith.science/pith/YW7GLOBBXJXOYC6Q25LHH6OP2Y.json","view_paper":"https://pith.science/paper/YW7GLOBB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.29439&json=true","fetch_graph":"https://pith.science/api/pith-number/YW7GLOBBXJXOYC6Q25LHH6OP2Y/graph.json","fetch_events":"https://pith.science/api/pith-number/YW7GLOBBXJXOYC6Q25LHH6OP2Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YW7GLOBBXJXOYC6Q25LHH6OP2Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YW7GLOBBXJXOYC6Q25LHH6OP2Y/action/storage_attestation","attest_author":"https://pith.science/pith/YW7GLOBBXJXOYC6Q25LHH6OP2Y/action/author_attestation","sign_citation":"https://pith.science/pith/YW7GLOBBXJXOYC6Q25LHH6OP2Y/action/citation_signature","submit_replication":"https://pith.science/pith/YW7GLOBBXJXOYC6Q25LHH6OP2Y/action/replication_record"}},"created_at":"2026-05-29T01:05:39.083195+00:00","updated_at":"2026-05-29T01:05:39.083195+00:00"}