{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TZIRZCXJHKSMISOG3OTXYKKHGB","short_pith_number":"pith:TZIRZCXJ","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"},"canonical_sha256":"9e511c8ae93aa4c449c6dba77c29473040ca9d174ca767c0b324071891bef27f","source":{"kind":"arxiv","id":"1504.06982","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06982","created_at":"2026-05-18T02:17:43Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06982v1","created_at":"2026-05-18T02:17:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06982","created_at":"2026-05-18T02:17:43Z"},{"alias_kind":"pith_short_12","alias_value":"TZIRZCXJHKSM","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"TZIRZCXJHKSMISOG","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"TZIRZCXJ","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TZIRZCXJHKSMISOG3OTXYKKHGB","target":"record","payload":{"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"},"canonical_sha256":"9e511c8ae93aa4c449c6dba77c29473040ca9d174ca767c0b324071891bef27f","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"},"source_kind":"arxiv","source_id":"1504.06982","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-18T02:17:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N+hyCC/0dSbkzT+PtCCraqarebuq1tRuA5ongWqz3Fh8QebBjck/KjYNClRQQdkQX6QOrCzs1ChziaCw13KiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T00:23:55.465033Z"},"content_sha256":"7f2d3eb919f13d40144b0fd24de502eb21ea3cb3692f3037661940f69f16770e","schema_version":"1.0","event_id":"sha256:7f2d3eb919f13d40144b0fd24de502eb21ea3cb3692f3037661940f69f16770e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TZIRZCXJHKSMISOG3OTXYKKHGB","target":"graph","payload":{"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"},"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-18T02:17:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qi73Wkr974NtQkxah2CSNim/Rg1gb+SIJwzScgqRQdgGFEpralUy3cqmFHTLk2ahLioNhJJl6+6Tou3SEJy/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T00:23:55.465392Z"},"content_sha256":"481cfc1b4f8f0c1b6341ac3cba487c087ddc0d2da586275eb4a4cb0a3531c2ff","schema_version":"1.0","event_id":"sha256:481cfc1b4f8f0c1b6341ac3cba487c087ddc0d2da586275eb4a4cb0a3531c2ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TZIRZCXJHKSMISOG3OTXYKKHGB/bundle.json","state_url":"https://pith.science/pith/TZIRZCXJHKSMISOG3OTXYKKHGB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TZIRZCXJHKSMISOG3OTXYKKHGB/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-21T00:23:55Z","links":{"resolver":"https://pith.science/pith/TZIRZCXJHKSMISOG3OTXYKKHGB","bundle":"https://pith.science/pith/TZIRZCXJHKSMISOG3OTXYKKHGB/bundle.json","state":"https://pith.science/pith/TZIRZCXJHKSMISOG3OTXYKKHGB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TZIRZCXJHKSMISOG3OTXYKKHGB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TZIRZCXJHKSMISOG3OTXYKKHGB","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":"f6ea9c5e386ef54842b2ef0a1b905c552a7f949a0ddba4aa114fbfc155f78c17","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-27T09:12:38Z","title_canon_sha256":"d99d24442b40e747ef06518908e94e298ba96af63d3e617154c3f45258b7b04d"},"schema_version":"1.0","source":{"id":"1504.06982","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06982","created_at":"2026-05-18T02:17:43Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06982v1","created_at":"2026-05-18T02:17:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06982","created_at":"2026-05-18T02:17:43Z"},{"alias_kind":"pith_short_12","alias_value":"TZIRZCXJHKSM","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"TZIRZCXJHKSMISOG","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"TZIRZCXJ","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:481cfc1b4f8f0c1b6341ac3cba487c087ddc0d2da586275eb4a4cb0a3531c2ff","target":"graph","created_at":"2026-05-18T02:17:43Z","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 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","authors_text":"Janne I. Kokkala, Patric R. J. \\\"Osterg{\\aa}rd","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-27T09:12:38Z","title":"Further Results on the Classification of MDS Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06982","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:7f2d3eb919f13d40144b0fd24de502eb21ea3cb3692f3037661940f69f16770e","target":"record","created_at":"2026-05-18T02:17:43Z","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":"f6ea9c5e386ef54842b2ef0a1b905c552a7f949a0ddba4aa114fbfc155f78c17","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-27T09:12:38Z","title_canon_sha256":"d99d24442b40e747ef06518908e94e298ba96af63d3e617154c3f45258b7b04d"},"schema_version":"1.0","source":{"id":"1504.06982","kind":"arxiv","version":1}},"canonical_sha256":"9e511c8ae93aa4c449c6dba77c29473040ca9d174ca767c0b324071891bef27f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e511c8ae93aa4c449c6dba77c29473040ca9d174ca767c0b324071891bef27f","first_computed_at":"2026-05-18T02:17:43.971407Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:43.971407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DhZjmrWdRu9B8cZiP4xdyfAEEav3iwUxH9awJpuz4Dt2IcZ2hkyZNu3sERCWDy5ojAdbJT1Ai/RkjS5VqDX1DA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:43.971908Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.06982","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f2d3eb919f13d40144b0fd24de502eb21ea3cb3692f3037661940f69f16770e","sha256:481cfc1b4f8f0c1b6341ac3cba487c087ddc0d2da586275eb4a4cb0a3531c2ff"],"state_sha256":"5c59751fbb813d1fa80819aef7d27d46bf344450d2d4efdd1196251a3c3b2c34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sfiUkqBwyo9pExMt0+I2tEx8nTJXJjvMpJHqdjgRauqXhasaJ4htYSbegtAhSysww5rMEMxLhRd5xmBKvxBQCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T00:23:55.467270Z","bundle_sha256":"aa6a8d64f021e36bc0d88e100a5bb7016998aef707b454c58681eaafbd06ff42"}}