{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AACA5TYF2IML4K43GWL52W6SIF","short_pith_number":"pith:AACA5TYF","schema_version":"1.0","canonical_sha256":"00040ecf05d218be2b9b3597dd5bd241635ea0cd2dc96db66805d1a4a2f349f4","source":{"kind":"arxiv","id":"1904.05813","version":1},"attestation_state":"computed","paper":{"title":"MRD Codes: Constructions and Connections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John Sheekey","submitted_at":"2019-04-11T16:12:01Z","abstract_excerpt":"This preprint is of a chapter to appear in {\\it Combinatorics and finite fields: Difference sets, polynomials, pseudorandomness and applications. Radon Series on Computational and Applied Mathematics}, K.-U. Schmidt and A. Winterhof (eds.).\n  Rank-metric codes are codes consisting of matrices with entries in a finite field, with the distance between two matrices being the rank of their difference. Codes with maximum size for a fixed minimum distance are called Maximum Rank Distance (MRD) codes. Such codes were constructed and studied independently by Delsarte (1978), Gabidulin (1985), Roth (19"},"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":"1904.05813","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-11T16:12:01Z","cross_cats_sorted":[],"title_canon_sha256":"15bd9094ce4de74fb7792a3231acc75937059380031ccab6e0c8082cea6d2a60","abstract_canon_sha256":"eb87cd4878a9f689d2a6f154bb9918ffdfeb481511c01bb7841f0b9fdc19b769"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:48.366134Z","signature_b64":"fb1mbGaaVZJFv4ErRqtwINOXbBUUUiEuwqOOHMEMfELCAx5dSKSzDv/6L38OF5WD7DZJn74IOj37aq6yQodcBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00040ecf05d218be2b9b3597dd5bd241635ea0cd2dc96db66805d1a4a2f349f4","last_reissued_at":"2026-05-17T23:48:48.365626Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:48.365626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MRD Codes: Constructions and Connections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John Sheekey","submitted_at":"2019-04-11T16:12:01Z","abstract_excerpt":"This preprint is of a chapter to appear in {\\it Combinatorics and finite fields: Difference sets, polynomials, pseudorandomness and applications. Radon Series on Computational and Applied Mathematics}, K.-U. Schmidt and A. Winterhof (eds.).\n  Rank-metric codes are codes consisting of matrices with entries in a finite field, with the distance between two matrices being the rank of their difference. Codes with maximum size for a fixed minimum distance are called Maximum Rank Distance (MRD) codes. Such codes were constructed and studied independently by Delsarte (1978), Gabidulin (1985), Roth (19"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05813","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.05813","created_at":"2026-05-17T23:48:48.365707+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.05813v1","created_at":"2026-05-17T23:48:48.365707+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05813","created_at":"2026-05-17T23:48:48.365707+00:00"},{"alias_kind":"pith_short_12","alias_value":"AACA5TYF2IML","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"AACA5TYF2IML4K43","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"AACA5TYF","created_at":"2026-05-18T12:33:12.712433+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/AACA5TYF2IML4K43GWL52W6SIF","json":"https://pith.science/pith/AACA5TYF2IML4K43GWL52W6SIF.json","graph_json":"https://pith.science/api/pith-number/AACA5TYF2IML4K43GWL52W6SIF/graph.json","events_json":"https://pith.science/api/pith-number/AACA5TYF2IML4K43GWL52W6SIF/events.json","paper":"https://pith.science/paper/AACA5TYF"},"agent_actions":{"view_html":"https://pith.science/pith/AACA5TYF2IML4K43GWL52W6SIF","download_json":"https://pith.science/pith/AACA5TYF2IML4K43GWL52W6SIF.json","view_paper":"https://pith.science/paper/AACA5TYF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.05813&json=true","fetch_graph":"https://pith.science/api/pith-number/AACA5TYF2IML4K43GWL52W6SIF/graph.json","fetch_events":"https://pith.science/api/pith-number/AACA5TYF2IML4K43GWL52W6SIF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AACA5TYF2IML4K43GWL52W6SIF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AACA5TYF2IML4K43GWL52W6SIF/action/storage_attestation","attest_author":"https://pith.science/pith/AACA5TYF2IML4K43GWL52W6SIF/action/author_attestation","sign_citation":"https://pith.science/pith/AACA5TYF2IML4K43GWL52W6SIF/action/citation_signature","submit_replication":"https://pith.science/pith/AACA5TYF2IML4K43GWL52W6SIF/action/replication_record"}},"created_at":"2026-05-17T23:48:48.365707+00:00","updated_at":"2026-05-17T23:48:48.365707+00:00"}