{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VCB2GBTL6YB7QAUIRQEQ4I4FEU","short_pith_number":"pith:VCB2GBTL","canonical_record":{"source":{"id":"1411.5822","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-21T10:51:53Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"734f438547624151aee616864fe30399d2c8350fb2064681f3c2a08b9c88cdae","abstract_canon_sha256":"1989faed75dbfcb25a94a9addb62beb84fc3a213efb3f6b86eedbc1c5a2fc3e1"},"schema_version":"1.0"},"canonical_sha256":"a883a3066bf603f802888c090e23852515b9565a69cd0ff6736fc8e3c3039aed","source":{"kind":"arxiv","id":"1411.5822","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.5822","created_at":"2026-05-18T01:24:20Z"},{"alias_kind":"arxiv_version","alias_value":"1411.5822v1","created_at":"2026-05-18T01:24:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5822","created_at":"2026-05-18T01:24:20Z"},{"alias_kind":"pith_short_12","alias_value":"VCB2GBTL6YB7","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"VCB2GBTL6YB7QAUI","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"VCB2GBTL","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VCB2GBTL6YB7QAUIRQEQ4I4FEU","target":"record","payload":{"canonical_record":{"source":{"id":"1411.5822","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-21T10:51:53Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"734f438547624151aee616864fe30399d2c8350fb2064681f3c2a08b9c88cdae","abstract_canon_sha256":"1989faed75dbfcb25a94a9addb62beb84fc3a213efb3f6b86eedbc1c5a2fc3e1"},"schema_version":"1.0"},"canonical_sha256":"a883a3066bf603f802888c090e23852515b9565a69cd0ff6736fc8e3c3039aed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:20.266068Z","signature_b64":"5I1yGRVr0dDVZV/HjpXcpmRSngtc+MIBKAkR3e7xB5ILFhp+8Dg0xotr/4Lt164nDjVfRhVLKbsIt+0+GRRmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a883a3066bf603f802888c090e23852515b9565a69cd0ff6736fc8e3c3039aed","last_reissued_at":"2026-05-18T01:24:20.265657Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:20.265657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.5822","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:24:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2+4KXi4zI1HX5zQ1LFK+bm535DdGJNYkY1E8Pq3LeVx1omi4Qd/YmJF0rXSnpn63sTwgcNXSBsaQ8Aqyb0yLBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T23:51:18.427510Z"},"content_sha256":"6e51f83bafb20722aebdf9d9650b57452184b2416e01a0ab2c385111b7b786ab","schema_version":"1.0","event_id":"sha256:6e51f83bafb20722aebdf9d9650b57452184b2416e01a0ab2c385111b7b786ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VCB2GBTL6YB7QAUIRQEQ4I4FEU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Classification of MDS Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Denis S. Krotov, Janne I. Kokkala, Patric R. J. \\\"Osterg{\\aa}rd","submitted_at":"2014-11-21T10:51:53Z","abstract_excerpt":"A $q$-ary code of length $n$, size $M$, and minimum distance $d$ is called an $(n,M,d)_q$ code. An $(n,q^{k},n-k+1)_q$ code is called a maximum distance separable (MDS) code. In this work, some MDS codes over small alphabets are classified. It is shown that every $(k+d-1,q^k,d)_q$ code with $k\\geq 3$, $d \\geq 3$, $q \\in \\{5,7\\}$ is equivalent to a linear code with the same parameters. This implies that the $(6,5^4,3)_5$ code and the $(n,7^{n-2},3)_7$ MDS codes for $n\\in\\{6,7,8\\}$ are unique. The classification of one-error-correcting $8$-ary MDS codes is also finished; there are $14$, $8$, $4$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5822","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:24:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3nCcZd6N0O9eLemd+y7ZaTrf1COJly0R1GTAz3UG00UNs59TALutccZnZGd0DMMvjqVHha9KUuG9lLmyjjMxDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T23:51:18.427861Z"},"content_sha256":"874d471f4ed21d6d0ca9153db148274c67beb7f9c6e8d9cfdf4086cdaaeec76c","schema_version":"1.0","event_id":"sha256:874d471f4ed21d6d0ca9153db148274c67beb7f9c6e8d9cfdf4086cdaaeec76c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VCB2GBTL6YB7QAUIRQEQ4I4FEU/bundle.json","state_url":"https://pith.science/pith/VCB2GBTL6YB7QAUIRQEQ4I4FEU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VCB2GBTL6YB7QAUIRQEQ4I4FEU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-20T23:51:18Z","links":{"resolver":"https://pith.science/pith/VCB2GBTL6YB7QAUIRQEQ4I4FEU","bundle":"https://pith.science/pith/VCB2GBTL6YB7QAUIRQEQ4I4FEU/bundle.json","state":"https://pith.science/pith/VCB2GBTL6YB7QAUIRQEQ4I4FEU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VCB2GBTL6YB7QAUIRQEQ4I4FEU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VCB2GBTL6YB7QAUIRQEQ4I4FEU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1989faed75dbfcb25a94a9addb62beb84fc3a213efb3f6b86eedbc1c5a2fc3e1","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-21T10:51:53Z","title_canon_sha256":"734f438547624151aee616864fe30399d2c8350fb2064681f3c2a08b9c88cdae"},"schema_version":"1.0","source":{"id":"1411.5822","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.5822","created_at":"2026-05-18T01:24:20Z"},{"alias_kind":"arxiv_version","alias_value":"1411.5822v1","created_at":"2026-05-18T01:24:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5822","created_at":"2026-05-18T01:24:20Z"},{"alias_kind":"pith_short_12","alias_value":"VCB2GBTL6YB7","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"VCB2GBTL6YB7QAUI","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"VCB2GBTL","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:874d471f4ed21d6d0ca9153db148274c67beb7f9c6e8d9cfdf4086cdaaeec76c","target":"graph","created_at":"2026-05-18T01:24:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"A $q$-ary code of length $n$, size $M$, and minimum distance $d$ is called an $(n,M,d)_q$ code. An $(n,q^{k},n-k+1)_q$ code is called a maximum distance separable (MDS) code. In this work, some MDS codes over small alphabets are classified. It is shown that every $(k+d-1,q^k,d)_q$ code with $k\\geq 3$, $d \\geq 3$, $q \\in \\{5,7\\}$ is equivalent to a linear code with the same parameters. This implies that the $(6,5^4,3)_5$ code and the $(n,7^{n-2},3)_7$ MDS codes for $n\\in\\{6,7,8\\}$ are unique. The classification of one-error-correcting $8$-ary MDS codes is also finished; there are $14$, $8$, $4$","authors_text":"Denis S. Krotov, Janne I. Kokkala, Patric R. J. \\\"Osterg{\\aa}rd","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-21T10:51:53Z","title":"On the Classification of MDS Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5822","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6e51f83bafb20722aebdf9d9650b57452184b2416e01a0ab2c385111b7b786ab","target":"record","created_at":"2026-05-18T01:24:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1989faed75dbfcb25a94a9addb62beb84fc3a213efb3f6b86eedbc1c5a2fc3e1","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-21T10:51:53Z","title_canon_sha256":"734f438547624151aee616864fe30399d2c8350fb2064681f3c2a08b9c88cdae"},"schema_version":"1.0","source":{"id":"1411.5822","kind":"arxiv","version":1}},"canonical_sha256":"a883a3066bf603f802888c090e23852515b9565a69cd0ff6736fc8e3c3039aed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a883a3066bf603f802888c090e23852515b9565a69cd0ff6736fc8e3c3039aed","first_computed_at":"2026-05-18T01:24:20.265657Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:20.265657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5I1yGRVr0dDVZV/HjpXcpmRSngtc+MIBKAkR3e7xB5ILFhp+8Dg0xotr/4Lt164nDjVfRhVLKbsIt+0+GRRmBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:20.266068Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.5822","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e51f83bafb20722aebdf9d9650b57452184b2416e01a0ab2c385111b7b786ab","sha256:874d471f4ed21d6d0ca9153db148274c67beb7f9c6e8d9cfdf4086cdaaeec76c"],"state_sha256":"636ee1d770235821d0d6411723e09b75cb9245d96da5e84264c7b85a40f82801"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pO3ub9M+xq7YOdmdDC7W9Uu9Okbw9GEBCOw2ydYptl7SirGXUx9KWdd4XMqZZUHUH1EN3L5a/hoH/ZkPRaoXDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T23:51:18.429876Z","bundle_sha256":"f95e04b1583b044ac0d1a22a203aef6947d354d0e66fc3fe7914eda2cc66df67"}}