{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TZIRZCXJHKSMISOG3OTXYKKHGB","short_pith_number":"pith:TZIRZCXJ","schema_version":"1.0","canonical_sha256":"9e511c8ae93aa4c449c6dba77c29473040ca9d174ca767c0b324071891bef27f","source":{"kind":"arxiv","id":"1504.06982","version":1},"attestation_state":"computed","paper":{"title":"Further Results on the Classification of MDS Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Janne I. Kokkala, Patric R. J. \\\"Osterg{\\aa}rd","submitted_at":"2015-04-27T09:12:38Z","abstract_excerpt":"A $q$-ary maximum distance separable (MDS) code $C$ with length $n$, dimension $k$ over an alphabet $\\mathcal{A}$ of size $q$ is a set of $q^k$ codewords that are elements of $\\mathcal{A}^n$, such that the Hamming distance between two distinct codewords in $C$ is at least $n-k+1$. Sets of mutually orthogonal Latin squares of orders $q\\leq 9$, corresponding to two-dimensional \\mbox{$q$-}ary MDS codes, and $q$-ary one-error-correcting MDS codes for $q\\leq 8$ have been classified in earlier studies. These results are used here to complete the classification of all $7$-ary and $8$-ary MDS codes wi"},"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":"1504.06982","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-27T09:12:38Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d99d24442b40e747ef06518908e94e298ba96af63d3e617154c3f45258b7b04d","abstract_canon_sha256":"f6ea9c5e386ef54842b2ef0a1b905c552a7f949a0ddba4aa114fbfc155f78c17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:43.971908Z","signature_b64":"DhZjmrWdRu9B8cZiP4xdyfAEEav3iwUxH9awJpuz4Dt2IcZ2hkyZNu3sERCWDy5ojAdbJT1Ai/RkjS5VqDX1DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e511c8ae93aa4c449c6dba77c29473040ca9d174ca767c0b324071891bef27f","last_reissued_at":"2026-05-18T02:17:43.971407Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:43.971407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Further Results on the Classification of MDS Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Janne I. Kokkala, Patric R. J. \\\"Osterg{\\aa}rd","submitted_at":"2015-04-27T09:12:38Z","abstract_excerpt":"A $q$-ary maximum distance separable (MDS) code $C$ with length $n$, dimension $k$ over an alphabet $\\mathcal{A}$ of size $q$ is a set of $q^k$ codewords that are elements of $\\mathcal{A}^n$, such that the Hamming distance between two distinct codewords in $C$ is at least $n-k+1$. Sets of mutually orthogonal Latin squares of orders $q\\leq 9$, corresponding to two-dimensional \\mbox{$q$-}ary MDS codes, and $q$-ary one-error-correcting MDS codes for $q\\leq 8$ have been classified in earlier studies. These results are used here to complete the classification of all $7$-ary and $8$-ary MDS codes wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06982","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":"1504.06982","created_at":"2026-05-18T02:17:43.971489+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.06982v1","created_at":"2026-05-18T02:17:43.971489+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06982","created_at":"2026-05-18T02:17:43.971489+00:00"},{"alias_kind":"pith_short_12","alias_value":"TZIRZCXJHKSM","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"TZIRZCXJHKSMISOG","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"TZIRZCXJ","created_at":"2026-05-18T12:29:44.643036+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/TZIRZCXJHKSMISOG3OTXYKKHGB","json":"https://pith.science/pith/TZIRZCXJHKSMISOG3OTXYKKHGB.json","graph_json":"https://pith.science/api/pith-number/TZIRZCXJHKSMISOG3OTXYKKHGB/graph.json","events_json":"https://pith.science/api/pith-number/TZIRZCXJHKSMISOG3OTXYKKHGB/events.json","paper":"https://pith.science/paper/TZIRZCXJ"},"agent_actions":{"view_html":"https://pith.science/pith/TZIRZCXJHKSMISOG3OTXYKKHGB","download_json":"https://pith.science/pith/TZIRZCXJHKSMISOG3OTXYKKHGB.json","view_paper":"https://pith.science/paper/TZIRZCXJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.06982&json=true","fetch_graph":"https://pith.science/api/pith-number/TZIRZCXJHKSMISOG3OTXYKKHGB/graph.json","fetch_events":"https://pith.science/api/pith-number/TZIRZCXJHKSMISOG3OTXYKKHGB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TZIRZCXJHKSMISOG3OTXYKKHGB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TZIRZCXJHKSMISOG3OTXYKKHGB/action/storage_attestation","attest_author":"https://pith.science/pith/TZIRZCXJHKSMISOG3OTXYKKHGB/action/author_attestation","sign_citation":"https://pith.science/pith/TZIRZCXJHKSMISOG3OTXYKKHGB/action/citation_signature","submit_replication":"https://pith.science/pith/TZIRZCXJHKSMISOG3OTXYKKHGB/action/replication_record"}},"created_at":"2026-05-18T02:17:43.971489+00:00","updated_at":"2026-05-18T02:17:43.971489+00:00"}