{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AACA5TYF2IML4K43GWL52W6SIF","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":"eb87cd4878a9f689d2a6f154bb9918ffdfeb481511c01bb7841f0b9fdc19b769","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-11T16:12:01Z","title_canon_sha256":"15bd9094ce4de74fb7792a3231acc75937059380031ccab6e0c8082cea6d2a60"},"schema_version":"1.0","source":{"id":"1904.05813","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.05813","created_at":"2026-05-17T23:48:48Z"},{"alias_kind":"arxiv_version","alias_value":"1904.05813v1","created_at":"2026-05-17T23:48:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05813","created_at":"2026-05-17T23:48:48Z"},{"alias_kind":"pith_short_12","alias_value":"AACA5TYF2IML","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AACA5TYF2IML4K43","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AACA5TYF","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:e1412f9bd916aea708355d187d87ba2d0af0f595bda2e217a2be14d76ef26a77","target":"graph","created_at":"2026-05-17T23:48:48Z","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":"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","authors_text":"John Sheekey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-11T16:12:01Z","title":"MRD Codes: Constructions and Connections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05813","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:ffae134d75f6951cc8ceeb861927fd8c0b7e98dcae0c89898d14d3eade7450c8","target":"record","created_at":"2026-05-17T23:48:48Z","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":"eb87cd4878a9f689d2a6f154bb9918ffdfeb481511c01bb7841f0b9fdc19b769","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-11T16:12:01Z","title_canon_sha256":"15bd9094ce4de74fb7792a3231acc75937059380031ccab6e0c8082cea6d2a60"},"schema_version":"1.0","source":{"id":"1904.05813","kind":"arxiv","version":1}},"canonical_sha256":"00040ecf05d218be2b9b3597dd5bd241635ea0cd2dc96db66805d1a4a2f349f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00040ecf05d218be2b9b3597dd5bd241635ea0cd2dc96db66805d1a4a2f349f4","first_computed_at":"2026-05-17T23:48:48.365626Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:48.365626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fb1mbGaaVZJFv4ErRqtwINOXbBUUUiEuwqOOHMEMfELCAx5dSKSzDv/6L38OF5WD7DZJn74IOj37aq6yQodcBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:48.366134Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.05813","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ffae134d75f6951cc8ceeb861927fd8c0b7e98dcae0c89898d14d3eade7450c8","sha256:e1412f9bd916aea708355d187d87ba2d0af0f595bda2e217a2be14d76ef26a77"],"state_sha256":"5a5fe006980dff4321ae4110fed54ee25158acc43d5fd634203c6f36a0aaaa50"}