{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4N6ALX6FCCW6NQB7SVCBPAPGNW","short_pith_number":"pith:4N6ALX6F","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"},"canonical_sha256":"e37c05dfc510ade6c03f95441781e66d9372deb6a0b5525ed2d37fc27929ef2c","source":{"kind":"arxiv","id":"1903.05265","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.05265","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1903.05265v1","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05265","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"4N6ALX6FCCW6","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4N6ALX6FCCW6NQB7","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4N6ALX6F","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4N6ALX6FCCW6NQB7SVCBPAPGNW","target":"record","payload":{"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"},"canonical_sha256":"e37c05dfc510ade6c03f95441781e66d9372deb6a0b5525ed2d37fc27929ef2c","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"},"source_kind":"arxiv","source_id":"1903.05265","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-17T23:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mfVgoOcA2HH1VrlIW4ob/xOBhaJBKCHQMbsburw26qyaTMftICDn06MCqAOHEsxL9C5yebKpAX060nqDNvm3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:23:05.165153Z"},"content_sha256":"0865c3edfc645a12d83b647bd61d7333b31556b79062e87f5a65dd097add0581","schema_version":"1.0","event_id":"sha256:0865c3edfc645a12d83b647bd61d7333b31556b79062e87f5a65dd097add0581"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4N6ALX6FCCW6NQB7SVCBPAPGNW","target":"graph","payload":{"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"},"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-17T23:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kVC9Ue+l32/QBBNNbwoKrjrojIqxc1LmsZMRRZK8YdgKuJemKkWT0kdVH2YFnC9JJShIKqEWVje24oYcys8WAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:23:05.165526Z"},"content_sha256":"5fa649aa7f3b9c0e3ef9e30bb2c38dc4be909f4dfc85fffe6f1f79978e85c481","schema_version":"1.0","event_id":"sha256:5fa649aa7f3b9c0e3ef9e30bb2c38dc4be909f4dfc85fffe6f1f79978e85c481"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4N6ALX6FCCW6NQB7SVCBPAPGNW/bundle.json","state_url":"https://pith.science/pith/4N6ALX6FCCW6NQB7SVCBPAPGNW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4N6ALX6FCCW6NQB7SVCBPAPGNW/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-05-31T11:23:05Z","links":{"resolver":"https://pith.science/pith/4N6ALX6FCCW6NQB7SVCBPAPGNW","bundle":"https://pith.science/pith/4N6ALX6FCCW6NQB7SVCBPAPGNW/bundle.json","state":"https://pith.science/pith/4N6ALX6FCCW6NQB7SVCBPAPGNW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4N6ALX6FCCW6NQB7SVCBPAPGNW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4N6ALX6FCCW6NQB7SVCBPAPGNW","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":"d7583a5e4814a9c1c474ce3f01b35c8ad8383b707ec8e3c40e5756b5ba0a1efd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-12T23:45:06Z","title_canon_sha256":"38cf7d4be3a23f58192652e55628d083d97dd2703af64aa908857a10a6b6c110"},"schema_version":"1.0","source":{"id":"1903.05265","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.05265","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1903.05265v1","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05265","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"4N6ALX6FCCW6","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4N6ALX6FCCW6NQB7","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4N6ALX6F","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:5fa649aa7f3b9c0e3ef9e30bb2c38dc4be909f4dfc85fffe6f1f79978e85c481","target":"graph","created_at":"2026-05-17T23:51:24Z","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":"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","authors_text":"Ted Hurley","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-12T23:45:06Z","title":"MDS codes over finite fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05265","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:0865c3edfc645a12d83b647bd61d7333b31556b79062e87f5a65dd097add0581","target":"record","created_at":"2026-05-17T23:51:24Z","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":"d7583a5e4814a9c1c474ce3f01b35c8ad8383b707ec8e3c40e5756b5ba0a1efd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-12T23:45:06Z","title_canon_sha256":"38cf7d4be3a23f58192652e55628d083d97dd2703af64aa908857a10a6b6c110"},"schema_version":"1.0","source":{"id":"1903.05265","kind":"arxiv","version":1}},"canonical_sha256":"e37c05dfc510ade6c03f95441781e66d9372deb6a0b5525ed2d37fc27929ef2c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e37c05dfc510ade6c03f95441781e66d9372deb6a0b5525ed2d37fc27929ef2c","first_computed_at":"2026-05-17T23:51:24.865680Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:24.865680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EBNuA2B40OB3CW9qYIVIMtg4wpgkRqRegpCPjbnmP9lTHBqDsrMLMr2RJzvI+hRVouC9TDfkiVloluqEB6ZhAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:24.866398Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.05265","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0865c3edfc645a12d83b647bd61d7333b31556b79062e87f5a65dd097add0581","sha256:5fa649aa7f3b9c0e3ef9e30bb2c38dc4be909f4dfc85fffe6f1f79978e85c481"],"state_sha256":"5be763a62c6023904c2409dc1c725e196e81b5eaf57cacab4bff66bcd73ef4ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JvKy06wROC4FgAwYPp4DiaY4/bjH1Xkq7KxC+oxnUmidPeDqH3MxNFrg/Logv7Ha2/2XhhMFCF9Bco5kW5KBDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:23:05.167722Z","bundle_sha256":"984a23881b2454cc5c4d15dcc2cb84e9d0a2110ec00320280794fa3e0a3e8a76"}}