{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OSCQSZOOSQ5TOF34B25ZJWL6VG","short_pith_number":"pith:OSCQSZOO","schema_version":"1.0","canonical_sha256":"74850965ce943b37177c0ebb94d97ea99aea1993cf250c811db7817ee168fd0e","source":{"kind":"arxiv","id":"1504.01581","version":2},"attestation_state":"computed","paper":{"title":"A new family of linear maximum rank distance codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John Sheekey","submitted_at":"2015-04-07T12:40:21Z","abstract_excerpt":"In this article we construct a new family of linear maximum rank distance (MRD) codes for all parameters. This family contains the only known family for general parameters, the Gabidulin codes, and contains codes inequivalent to the Gabidulin codes. This family also contains the well-known family of semifields known as Generalised Twisted Fields. We also calculate the automorphism group of these codes, including the automorphism group of the Gabidulin codes."},"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.01581","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-07T12:40:21Z","cross_cats_sorted":[],"title_canon_sha256":"06dd7d0430699cb929628ed60a1c3b0afc9ca7b672c0d345b0c5e8512de414be","abstract_canon_sha256":"1e5a943b5b3a38551a11b933465e1feec3552221901aa4be707a24770e8aca8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:49.945741Z","signature_b64":"m87WkORJoD4EnbUN/ULZ/xy2kOFlqR4et1L7JuQiLUkGi7FxTu2CgbgPEJYWfV6QF1AEHPDizkAO2gAfyYpZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74850965ce943b37177c0ebb94d97ea99aea1993cf250c811db7817ee168fd0e","last_reissued_at":"2026-05-18T01:12:49.945301Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:49.945301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new family of linear maximum rank distance codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John Sheekey","submitted_at":"2015-04-07T12:40:21Z","abstract_excerpt":"In this article we construct a new family of linear maximum rank distance (MRD) codes for all parameters. This family contains the only known family for general parameters, the Gabidulin codes, and contains codes inequivalent to the Gabidulin codes. This family also contains the well-known family of semifields known as Generalised Twisted Fields. We also calculate the automorphism group of these codes, including the automorphism group of the Gabidulin codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01581","kind":"arxiv","version":2},"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.01581","created_at":"2026-05-18T01:12:49.945386+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.01581v2","created_at":"2026-05-18T01:12:49.945386+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01581","created_at":"2026-05-18T01:12:49.945386+00:00"},{"alias_kind":"pith_short_12","alias_value":"OSCQSZOOSQ5T","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OSCQSZOOSQ5TOF34","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OSCQSZOO","created_at":"2026-05-18T12:29:34.919912+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.23460","citing_title":"Self-Orthogonal Twisted Generalized Reed-Solomon Codes and Their Application to Quantum Error-Correcting Codes","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OSCQSZOOSQ5TOF34B25ZJWL6VG","json":"https://pith.science/pith/OSCQSZOOSQ5TOF34B25ZJWL6VG.json","graph_json":"https://pith.science/api/pith-number/OSCQSZOOSQ5TOF34B25ZJWL6VG/graph.json","events_json":"https://pith.science/api/pith-number/OSCQSZOOSQ5TOF34B25ZJWL6VG/events.json","paper":"https://pith.science/paper/OSCQSZOO"},"agent_actions":{"view_html":"https://pith.science/pith/OSCQSZOOSQ5TOF34B25ZJWL6VG","download_json":"https://pith.science/pith/OSCQSZOOSQ5TOF34B25ZJWL6VG.json","view_paper":"https://pith.science/paper/OSCQSZOO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.01581&json=true","fetch_graph":"https://pith.science/api/pith-number/OSCQSZOOSQ5TOF34B25ZJWL6VG/graph.json","fetch_events":"https://pith.science/api/pith-number/OSCQSZOOSQ5TOF34B25ZJWL6VG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OSCQSZOOSQ5TOF34B25ZJWL6VG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OSCQSZOOSQ5TOF34B25ZJWL6VG/action/storage_attestation","attest_author":"https://pith.science/pith/OSCQSZOOSQ5TOF34B25ZJWL6VG/action/author_attestation","sign_citation":"https://pith.science/pith/OSCQSZOOSQ5TOF34B25ZJWL6VG/action/citation_signature","submit_replication":"https://pith.science/pith/OSCQSZOOSQ5TOF34B25ZJWL6VG/action/replication_record"}},"created_at":"2026-05-18T01:12:49.945386+00:00","updated_at":"2026-05-18T01:12:49.945386+00:00"}