{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AACA5TYF2IML4K43GWL52W6SIF","short_pith_number":"pith:AACA5TYF","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"},"canonical_sha256":"00040ecf05d218be2b9b3597dd5bd241635ea0cd2dc96db66805d1a4a2f349f4","source":{"kind":"arxiv","id":"1904.05813","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AACA5TYF2IML4K43GWL52W6SIF","target":"record","payload":{"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"},"canonical_sha256":"00040ecf05d218be2b9b3597dd5bd241635ea0cd2dc96db66805d1a4a2f349f4","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"},"source_kind":"arxiv","source_id":"1904.05813","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:48:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CoeUwBmryC1Gd8hJRfr8takBhjU7ikD5aP4/MJIc6rwF5xPhCVOKNt7lINd//v63gNT5VI333H3rWFIdLfRpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:48:23.119778Z"},"content_sha256":"ffae134d75f6951cc8ceeb861927fd8c0b7e98dcae0c89898d14d3eade7450c8","schema_version":"1.0","event_id":"sha256:ffae134d75f6951cc8ceeb861927fd8c0b7e98dcae0c89898d14d3eade7450c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AACA5TYF2IML4K43GWL52W6SIF","target":"graph","payload":{"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"},"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:48:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9+FmsIElvkQvSqaqRfGhipp0++Sk5miM0Dp5Pox7O2Ws7aTV7Jq7Pv1GPk5Hjf6UzPsU3JoW6+UQs6N4Eh9LBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:48:23.120461Z"},"content_sha256":"e1412f9bd916aea708355d187d87ba2d0af0f595bda2e217a2be14d76ef26a77","schema_version":"1.0","event_id":"sha256:e1412f9bd916aea708355d187d87ba2d0af0f595bda2e217a2be14d76ef26a77"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AACA5TYF2IML4K43GWL52W6SIF/bundle.json","state_url":"https://pith.science/pith/AACA5TYF2IML4K43GWL52W6SIF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AACA5TYF2IML4K43GWL52W6SIF/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-06-07T09:48:23Z","links":{"resolver":"https://pith.science/pith/AACA5TYF2IML4K43GWL52W6SIF","bundle":"https://pith.science/pith/AACA5TYF2IML4K43GWL52W6SIF/bundle.json","state":"https://pith.science/pith/AACA5TYF2IML4K43GWL52W6SIF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AACA5TYF2IML4K43GWL52W6SIF/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S1k7ZEpJDE2sQvTGfwvNQA9g4mav0Yw+UGQgurBhkVizQRZE6uHbj/WM1UYqO9si/fY2+JmuLjWiJdgdS1hEBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:48:23.123942Z","bundle_sha256":"61901df93b1198ddf88ec4995a76785aea64bb1098a81e5a58e05ffb13c736c9"}}