{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TPPBK4EDEARZNJ4Y4F7CKIYXUS","short_pith_number":"pith:TPPBK4ED","canonical_record":{"source":{"id":"1612.04268","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-13T16:24:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f537fc2ca4ac1c26a75527948b04ff1962b176a5988673ac46b1fb00ad543156","abstract_canon_sha256":"f23aeb2aa95cc0a4aa529c5654c0ab03edfe8f9c9de8927ee1ce89a2581d886e"},"schema_version":"1.0"},"canonical_sha256":"9bde157083202396a798e17e252317a4a4ef46495df6a692578adc2a88caf6f0","source":{"kind":"arxiv","id":"1612.04268","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.04268","created_at":"2026-05-18T00:55:04Z"},{"alias_kind":"arxiv_version","alias_value":"1612.04268v1","created_at":"2026-05-18T00:55:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04268","created_at":"2026-05-18T00:55:04Z"},{"alias_kind":"pith_short_12","alias_value":"TPPBK4EDEARZ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TPPBK4EDEARZNJ4Y","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TPPBK4ED","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TPPBK4EDEARZNJ4Y4F7CKIYXUS","target":"record","payload":{"canonical_record":{"source":{"id":"1612.04268","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-13T16:24:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f537fc2ca4ac1c26a75527948b04ff1962b176a5988673ac46b1fb00ad543156","abstract_canon_sha256":"f23aeb2aa95cc0a4aa529c5654c0ab03edfe8f9c9de8927ee1ce89a2581d886e"},"schema_version":"1.0"},"canonical_sha256":"9bde157083202396a798e17e252317a4a4ef46495df6a692578adc2a88caf6f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:04.941524Z","signature_b64":"IKOSm3rF615DncpM0+qlF1x1+9PB0gK8Gn1XcHtmzqN3peAm9wcdGsV2FFgq12TezYbWY0wbMlLfTjRnCztBAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bde157083202396a798e17e252317a4a4ef46495df6a692578adc2a88caf6f0","last_reissued_at":"2026-05-18T00:55:04.940909Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:04.940909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.04268","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-18T00:55:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1VnSHukVt0uZ1hHKYIfBtjuHXXyFedtistMnDURtqWactvKpzwzhUQjv6Mnu9aPqzK9cczoYHyRQqZb2w5/JDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T15:03:40.100875Z"},"content_sha256":"40795882eb021dabe6d939487389717456bdced7f4e04d3e56743d48d2c6349b","schema_version":"1.0","event_id":"sha256:40795882eb021dabe6d939487389717456bdced7f4e04d3e56743d48d2c6349b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TPPBK4EDEARZNJ4Y4F7CKIYXUS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On dually almost MRD codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Javier de la Cruz","submitted_at":"2016-12-13T16:24:40Z","abstract_excerpt":"In this paper we define and study a family of codes which come close to be MRD codes, so we call them AMRD codes (almost MRD). An AMRD code is a code with rank defect equal to 1. AMRD codes whose duals are AMRD are called dually AMRD. Dually AMRD codes are the closest to the MRD codes given that both they and their dual codes are almost optimal. Necessary and sufficient conditions for the codes to be dually AMRD are given. Furthermore we show that dually AMRD codes and codes of rank defect one and maximum 2-generalized weight coincide when the size of the matrix divides the dimension."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04268","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-18T00:55:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CA2av+UG0BQkSOxZJaT+IfUaZPZP7NO/YbeiopC07z/QrrvS4MBxOVhsgVQvBq+o6lkWFUBwJmLYFAe+eHBaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T15:03:40.101535Z"},"content_sha256":"c32688050ba045659410ab5864927405ea573da5fee75c64c9ac31ea5e0c706e","schema_version":"1.0","event_id":"sha256:c32688050ba045659410ab5864927405ea573da5fee75c64c9ac31ea5e0c706e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TPPBK4EDEARZNJ4Y4F7CKIYXUS/bundle.json","state_url":"https://pith.science/pith/TPPBK4EDEARZNJ4Y4F7CKIYXUS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TPPBK4EDEARZNJ4Y4F7CKIYXUS/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-10T15:03:40Z","links":{"resolver":"https://pith.science/pith/TPPBK4EDEARZNJ4Y4F7CKIYXUS","bundle":"https://pith.science/pith/TPPBK4EDEARZNJ4Y4F7CKIYXUS/bundle.json","state":"https://pith.science/pith/TPPBK4EDEARZNJ4Y4F7CKIYXUS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TPPBK4EDEARZNJ4Y4F7CKIYXUS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TPPBK4EDEARZNJ4Y4F7CKIYXUS","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":"f23aeb2aa95cc0a4aa529c5654c0ab03edfe8f9c9de8927ee1ce89a2581d886e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-13T16:24:40Z","title_canon_sha256":"f537fc2ca4ac1c26a75527948b04ff1962b176a5988673ac46b1fb00ad543156"},"schema_version":"1.0","source":{"id":"1612.04268","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.04268","created_at":"2026-05-18T00:55:04Z"},{"alias_kind":"arxiv_version","alias_value":"1612.04268v1","created_at":"2026-05-18T00:55:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04268","created_at":"2026-05-18T00:55:04Z"},{"alias_kind":"pith_short_12","alias_value":"TPPBK4EDEARZ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TPPBK4EDEARZNJ4Y","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TPPBK4ED","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:c32688050ba045659410ab5864927405ea573da5fee75c64c9ac31ea5e0c706e","target":"graph","created_at":"2026-05-18T00:55:04Z","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":"In this paper we define and study a family of codes which come close to be MRD codes, so we call them AMRD codes (almost MRD). An AMRD code is a code with rank defect equal to 1. AMRD codes whose duals are AMRD are called dually AMRD. Dually AMRD codes are the closest to the MRD codes given that both they and their dual codes are almost optimal. Necessary and sufficient conditions for the codes to be dually AMRD are given. Furthermore we show that dually AMRD codes and codes of rank defect one and maximum 2-generalized weight coincide when the size of the matrix divides the dimension.","authors_text":"Javier de la Cruz","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-13T16:24:40Z","title":"On dually almost MRD codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04268","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:40795882eb021dabe6d939487389717456bdced7f4e04d3e56743d48d2c6349b","target":"record","created_at":"2026-05-18T00:55:04Z","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":"f23aeb2aa95cc0a4aa529c5654c0ab03edfe8f9c9de8927ee1ce89a2581d886e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-13T16:24:40Z","title_canon_sha256":"f537fc2ca4ac1c26a75527948b04ff1962b176a5988673ac46b1fb00ad543156"},"schema_version":"1.0","source":{"id":"1612.04268","kind":"arxiv","version":1}},"canonical_sha256":"9bde157083202396a798e17e252317a4a4ef46495df6a692578adc2a88caf6f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9bde157083202396a798e17e252317a4a4ef46495df6a692578adc2a88caf6f0","first_computed_at":"2026-05-18T00:55:04.940909Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:04.940909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IKOSm3rF615DncpM0+qlF1x1+9PB0gK8Gn1XcHtmzqN3peAm9wcdGsV2FFgq12TezYbWY0wbMlLfTjRnCztBAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:04.941524Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.04268","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40795882eb021dabe6d939487389717456bdced7f4e04d3e56743d48d2c6349b","sha256:c32688050ba045659410ab5864927405ea573da5fee75c64c9ac31ea5e0c706e"],"state_sha256":"a0fc6c7fad85d39d84175a460a4da28c3d20e565f208602ba70f9ebda97a2804"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"br/QcPKhs6FmwVfbRxm9geVLg/hloLeYSYljFsifYPWO0NC5aSFVG7uKFOrEhIKY+f2LOvnwGZFxc5WCBruqBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T15:03:40.105204Z","bundle_sha256":"c97b874c9bb896d9f983c47a0b755336f2d23f7d52dbe0c71067d52c2cf9a380"}}