{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Y3Q7EATFNNXWJFGOJYZCKPA4DN","short_pith_number":"pith:Y3Q7EATF","canonical_record":{"source":{"id":"1804.01211","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-04T02:17:04Z","cross_cats_sorted":[],"title_canon_sha256":"94a2f7c3fe12169ee14d9fa78511518de8ef18c306be573d3fcdfd759a8a59ac","abstract_canon_sha256":"cfea360870cc9effb15bf819133ff64750e4a0c18e279fd3405887dd375c2faa"},"schema_version":"1.0"},"canonical_sha256":"c6e1f202656b6f6494ce4e32253c1c1b7e8fd95a07d581af5863a674ad624d65","source":{"kind":"arxiv","id":"1804.01211","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01211","created_at":"2026-05-17T23:48:34Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01211v3","created_at":"2026-05-17T23:48:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01211","created_at":"2026-05-17T23:48:34Z"},{"alias_kind":"pith_short_12","alias_value":"Y3Q7EATFNNXW","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y3Q7EATFNNXWJFGO","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y3Q7EATF","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Y3Q7EATFNNXWJFGOJYZCKPA4DN","target":"record","payload":{"canonical_record":{"source":{"id":"1804.01211","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-04T02:17:04Z","cross_cats_sorted":[],"title_canon_sha256":"94a2f7c3fe12169ee14d9fa78511518de8ef18c306be573d3fcdfd759a8a59ac","abstract_canon_sha256":"cfea360870cc9effb15bf819133ff64750e4a0c18e279fd3405887dd375c2faa"},"schema_version":"1.0"},"canonical_sha256":"c6e1f202656b6f6494ce4e32253c1c1b7e8fd95a07d581af5863a674ad624d65","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:34.289281Z","signature_b64":"0Cns0nu4njvtkkMcWlliqihcT/LAmgoy6t2/ggcn28CGSVbrgKKYA3WRN17NzjXGlIeslYewa7EIywQuRx8+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6e1f202656b6f6494ce4e32253c1c1b7e8fd95a07d581af5863a674ad624d65","last_reissued_at":"2026-05-17T23:48:34.288802Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:34.288802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.01211","source_version":3,"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:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"imdT6yDGmHLB+Qe4nRPTwp7HtsEvt1j0THDl+RBPaptXPWHNH0Eomp12eTV2jjOS7eXmZlST6BKhB22vzU3sAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:49:07.637217Z"},"content_sha256":"3187e91b28d58e404e3970fdd36e53313a086e3b29f8230dd23d62e47a29b30c","schema_version":"1.0","event_id":"sha256:3187e91b28d58e404e3970fdd36e53313a086e3b29f8230dd23d62e47a29b30c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Y3Q7EATFNNXWJFGOJYZCKPA4DN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constructions for optimal Ferrers diagram rank-metric codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shuangqing Liu, Tao Feng, Yanxun Chang","submitted_at":"2018-04-04T02:17:04Z","abstract_excerpt":"Optimal rank-metric codes in Ferrers diagrams can be used to construct good subspace codes. Such codes consist of matrices having zeros at certain fixed positions. This paper generalizes the known constructions for Ferrers diagram rank-metric (FDRM) codes. Via a criteria for linear maximum rank distance (MRD) codes, an explicit construction for a class of systematic MRD codes is presented, which is used to produce new optimal FDRM codes. By exploring subcodes of Gabidulin codes, if each of the rightmost $\\delta-1$ columns in Ferrers diagram $\\cal F$ has at least $n-r$ dots, where $r$ is taken "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01211","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"},"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:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2hC2MYk9XgRii/zZB6HGlLjc9oFqRZTvPD7IvVo65uaijo7WOZuMIIBECL854q0JLj8IreN1PDuRl9h15ZgmAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:49:07.637975Z"},"content_sha256":"0c69d5a03cfb03d316febbc11bcd2c0dcfef0135db0913165df3c903d957a366","schema_version":"1.0","event_id":"sha256:0c69d5a03cfb03d316febbc11bcd2c0dcfef0135db0913165df3c903d957a366"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y3Q7EATFNNXWJFGOJYZCKPA4DN/bundle.json","state_url":"https://pith.science/pith/Y3Q7EATFNNXWJFGOJYZCKPA4DN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y3Q7EATFNNXWJFGOJYZCKPA4DN/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-09T07:49:07Z","links":{"resolver":"https://pith.science/pith/Y3Q7EATFNNXWJFGOJYZCKPA4DN","bundle":"https://pith.science/pith/Y3Q7EATFNNXWJFGOJYZCKPA4DN/bundle.json","state":"https://pith.science/pith/Y3Q7EATFNNXWJFGOJYZCKPA4DN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y3Q7EATFNNXWJFGOJYZCKPA4DN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Y3Q7EATFNNXWJFGOJYZCKPA4DN","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":"cfea360870cc9effb15bf819133ff64750e4a0c18e279fd3405887dd375c2faa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-04T02:17:04Z","title_canon_sha256":"94a2f7c3fe12169ee14d9fa78511518de8ef18c306be573d3fcdfd759a8a59ac"},"schema_version":"1.0","source":{"id":"1804.01211","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01211","created_at":"2026-05-17T23:48:34Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01211v3","created_at":"2026-05-17T23:48:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01211","created_at":"2026-05-17T23:48:34Z"},{"alias_kind":"pith_short_12","alias_value":"Y3Q7EATFNNXW","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y3Q7EATFNNXWJFGO","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y3Q7EATF","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:0c69d5a03cfb03d316febbc11bcd2c0dcfef0135db0913165df3c903d957a366","target":"graph","created_at":"2026-05-17T23:48:34Z","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":"Optimal rank-metric codes in Ferrers diagrams can be used to construct good subspace codes. Such codes consist of matrices having zeros at certain fixed positions. This paper generalizes the known constructions for Ferrers diagram rank-metric (FDRM) codes. Via a criteria for linear maximum rank distance (MRD) codes, an explicit construction for a class of systematic MRD codes is presented, which is used to produce new optimal FDRM codes. By exploring subcodes of Gabidulin codes, if each of the rightmost $\\delta-1$ columns in Ferrers diagram $\\cal F$ has at least $n-r$ dots, where $r$ is taken ","authors_text":"Shuangqing Liu, Tao Feng, Yanxun Chang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-04T02:17:04Z","title":"Constructions for optimal Ferrers diagram rank-metric codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01211","kind":"arxiv","version":3},"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:3187e91b28d58e404e3970fdd36e53313a086e3b29f8230dd23d62e47a29b30c","target":"record","created_at":"2026-05-17T23:48:34Z","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":"cfea360870cc9effb15bf819133ff64750e4a0c18e279fd3405887dd375c2faa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-04T02:17:04Z","title_canon_sha256":"94a2f7c3fe12169ee14d9fa78511518de8ef18c306be573d3fcdfd759a8a59ac"},"schema_version":"1.0","source":{"id":"1804.01211","kind":"arxiv","version":3}},"canonical_sha256":"c6e1f202656b6f6494ce4e32253c1c1b7e8fd95a07d581af5863a674ad624d65","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6e1f202656b6f6494ce4e32253c1c1b7e8fd95a07d581af5863a674ad624d65","first_computed_at":"2026-05-17T23:48:34.288802Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:34.288802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0Cns0nu4njvtkkMcWlliqihcT/LAmgoy6t2/ggcn28CGSVbrgKKYA3WRN17NzjXGlIeslYewa7EIywQuRx8+DA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:34.289281Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.01211","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3187e91b28d58e404e3970fdd36e53313a086e3b29f8230dd23d62e47a29b30c","sha256:0c69d5a03cfb03d316febbc11bcd2c0dcfef0135db0913165df3c903d957a366"],"state_sha256":"bf817b6ef98bfaca414cac190fe792e95b1c8f5a5a528846b163c0c163163714"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L/DWxvo8YQfBoNE/qa2OJiosYZNxyVsOBt5+XrFVeFXEd+o96GY+lDPcfo9pn9HRF4JxbfAytCIuUXC0G5zbBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:49:07.644858Z","bundle_sha256":"fee03fb6a791503fb9856921f98321c872f0e4e33f02b0dbd60a47aff925bc2e"}}