{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EZOAJOLI7SW5SWRMRXI2ZFRNYD","short_pith_number":"pith:EZOAJOLI","schema_version":"1.0","canonical_sha256":"265c04b968fcadd95a2c8dd1ac962dc0ed6cbec908b53a7a327760cab60ced79","source":{"kind":"arxiv","id":"1507.07855","version":3},"attestation_state":"computed","paper":{"title":"Generalized Twisted Gabidulin Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Guglielmo Lunardon, Rocco Trombetti, Yue Zhou","submitted_at":"2015-07-28T17:19:46Z","abstract_excerpt":"Let $\\mathcal{C}$ be a set of $m$ by $n$ matrices over $\\mathbb{F}_q$ such that the rank of $A-B$ is at least $d$ for all distinct $A,B\\in \\mathcal{C}$. Suppose that $m\\leqslant n$. If $\\#\\mathcal{C}= q^{n(m-d+1)}$, then $\\mathcal{C}$ is a maximum rank distance (MRD for short) code. Until 2016, there were only two known constructions of MRD codes for arbitrary $1<d<m-1$. One was found by Delsarte (1978) and Gabidulin (1985) independently, and it was later generalized by Kshevetskiy and Gabidulin (2005). We often call them (generalized) Gabidulin codes. Another family was recently obtained by S"},"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":"1507.07855","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-28T17:19:46Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5ec821034335d147ad67f19bf991a4e8bbfaaec72e46791c7c065782f83b3f54","abstract_canon_sha256":"7cbd096c3c61cf63a9c1565644a85a814b1b743b63eb3c4be6d14a0b9dd5d429"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:57.566012Z","signature_b64":"RjEE2qUm6/s8aPpKSPAnM7hMcotHMyUF4kbBssHWN0zZcNFH9sPyXzgXvdTzpqSlqjvbWz6A4XDYk4Ozc2cbDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"265c04b968fcadd95a2c8dd1ac962dc0ed6cbec908b53a7a327760cab60ced79","last_reissued_at":"2026-05-18T00:14:57.565290Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:57.565290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Twisted Gabidulin Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Guglielmo Lunardon, Rocco Trombetti, Yue Zhou","submitted_at":"2015-07-28T17:19:46Z","abstract_excerpt":"Let $\\mathcal{C}$ be a set of $m$ by $n$ matrices over $\\mathbb{F}_q$ such that the rank of $A-B$ is at least $d$ for all distinct $A,B\\in \\mathcal{C}$. Suppose that $m\\leqslant n$. If $\\#\\mathcal{C}= q^{n(m-d+1)}$, then $\\mathcal{C}$ is a maximum rank distance (MRD for short) code. Until 2016, there were only two known constructions of MRD codes for arbitrary $1<d<m-1$. One was found by Delsarte (1978) and Gabidulin (1985) independently, and it was later generalized by Kshevetskiy and Gabidulin (2005). We often call them (generalized) Gabidulin codes. Another family was recently obtained by S"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07855","kind":"arxiv","version":3},"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":"1507.07855","created_at":"2026-05-18T00:14:57.565411+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.07855v3","created_at":"2026-05-18T00:14:57.565411+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07855","created_at":"2026-05-18T00:14:57.565411+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZOAJOLI7SW5","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZOAJOLI7SW5SWRM","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZOAJOLI","created_at":"2026-05-18T12:29:19.899920+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/EZOAJOLI7SW5SWRMRXI2ZFRNYD","json":"https://pith.science/pith/EZOAJOLI7SW5SWRMRXI2ZFRNYD.json","graph_json":"https://pith.science/api/pith-number/EZOAJOLI7SW5SWRMRXI2ZFRNYD/graph.json","events_json":"https://pith.science/api/pith-number/EZOAJOLI7SW5SWRMRXI2ZFRNYD/events.json","paper":"https://pith.science/paper/EZOAJOLI"},"agent_actions":{"view_html":"https://pith.science/pith/EZOAJOLI7SW5SWRMRXI2ZFRNYD","download_json":"https://pith.science/pith/EZOAJOLI7SW5SWRMRXI2ZFRNYD.json","view_paper":"https://pith.science/paper/EZOAJOLI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.07855&json=true","fetch_graph":"https://pith.science/api/pith-number/EZOAJOLI7SW5SWRMRXI2ZFRNYD/graph.json","fetch_events":"https://pith.science/api/pith-number/EZOAJOLI7SW5SWRMRXI2ZFRNYD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZOAJOLI7SW5SWRMRXI2ZFRNYD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZOAJOLI7SW5SWRMRXI2ZFRNYD/action/storage_attestation","attest_author":"https://pith.science/pith/EZOAJOLI7SW5SWRMRXI2ZFRNYD/action/author_attestation","sign_citation":"https://pith.science/pith/EZOAJOLI7SW5SWRMRXI2ZFRNYD/action/citation_signature","submit_replication":"https://pith.science/pith/EZOAJOLI7SW5SWRMRXI2ZFRNYD/action/replication_record"}},"created_at":"2026-05-18T00:14:57.565411+00:00","updated_at":"2026-05-18T00:14:57.565411+00:00"}