{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:M7BABSK76WGULLANB2MNMTRBEB","short_pith_number":"pith:M7BABSK7","canonical_record":{"source":{"id":"1903.10986","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2019-03-26T16:16:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5987c4b4ce2727e3be7b1c6d35bfb56bc8a24df5c8019829edb969b63ea3d8d1","abstract_canon_sha256":"043a5db8a8e8d3b87e2f50fae800555f50822761d6f4a9c347f3063e03d8f043"},"schema_version":"1.0"},"canonical_sha256":"67c200c95ff58d45ac0d0e98d64e21205962938c75b23b1a2b7391e69d2d39a4","source":{"kind":"arxiv","id":"1903.10986","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.10986","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"1903.10986v3","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10986","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"M7BABSK76WGU","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"M7BABSK76WGULLAN","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"M7BABSK7","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:M7BABSK76WGULLANB2MNMTRBEB","target":"record","payload":{"canonical_record":{"source":{"id":"1903.10986","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2019-03-26T16:16:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5987c4b4ce2727e3be7b1c6d35bfb56bc8a24df5c8019829edb969b63ea3d8d1","abstract_canon_sha256":"043a5db8a8e8d3b87e2f50fae800555f50822761d6f4a9c347f3063e03d8f043"},"schema_version":"1.0"},"canonical_sha256":"67c200c95ff58d45ac0d0e98d64e21205962938c75b23b1a2b7391e69d2d39a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:47.371385Z","signature_b64":"uumeVYZCTDV78ITbMI2md7+v8zsyrzJvHnSOSlxPoPVtdpDJF6geOgTsYXuHGnlM706UyatrF/v/DULO7eZXCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67c200c95ff58d45ac0d0e98d64e21205962938c75b23b1a2b7391e69d2d39a4","last_reissued_at":"2026-05-17T23:44:47.370693Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:47.370693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.10986","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:44:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NKrBzZiBJXce8Wggl2xPJmNaTPw0j5x5rEnLDwITxYOs9pk6lcKp9FZws6FN9al2YbjLgITsD40fNx0l8yBZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:26:05.971224Z"},"content_sha256":"2fc3d0da41659ee9916878ab30a10753c29120d129d27352b3fb6f795f1690c0","schema_version":"1.0","event_id":"sha256:2fc3d0da41659ee9916878ab30a10753c29120d129d27352b3fb6f795f1690c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:M7BABSK76WGULLANB2MNMTRBEB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constructions of MDS convolutional codes using superregular matrices","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Julia Lieb, Raquel Pinto","submitted_at":"2019-03-26T16:16:51Z","abstract_excerpt":"Maximum distance separable convolutional codes are the codes that present best performance in error correction among all convolutional codes with certain rate and degree. In this paper, we show that taking the constant matrix coefficients of a polynomial matrix as submatrices of a superregular matrix, we obtain a column reduced generator matrix of an MDS convolutional code with a certain rate and a certain degree. We then present two novel constructions that fulfill these conditions by considering two types of superregular matrices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10986","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:44:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3usbqwaXIes7upvGNUxNXD6fHP4fuFTwgN+mOpJvk1RyWUb7SnH18sTbhlad5yeZHiK+pPNDhiYNtey7II80Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:26:05.971586Z"},"content_sha256":"2d5337077a21a3fa002245b9f890a45f60ac16e0c1b1dae3970730b807707225","schema_version":"1.0","event_id":"sha256:2d5337077a21a3fa002245b9f890a45f60ac16e0c1b1dae3970730b807707225"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M7BABSK76WGULLANB2MNMTRBEB/bundle.json","state_url":"https://pith.science/pith/M7BABSK76WGULLANB2MNMTRBEB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M7BABSK76WGULLANB2MNMTRBEB/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-09T00:26:05Z","links":{"resolver":"https://pith.science/pith/M7BABSK76WGULLANB2MNMTRBEB","bundle":"https://pith.science/pith/M7BABSK76WGULLANB2MNMTRBEB/bundle.json","state":"https://pith.science/pith/M7BABSK76WGULLANB2MNMTRBEB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M7BABSK76WGULLANB2MNMTRBEB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:M7BABSK76WGULLANB2MNMTRBEB","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":"043a5db8a8e8d3b87e2f50fae800555f50822761d6f4a9c347f3063e03d8f043","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2019-03-26T16:16:51Z","title_canon_sha256":"5987c4b4ce2727e3be7b1c6d35bfb56bc8a24df5c8019829edb969b63ea3d8d1"},"schema_version":"1.0","source":{"id":"1903.10986","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.10986","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"1903.10986v3","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10986","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"M7BABSK76WGU","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"M7BABSK76WGULLAN","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"M7BABSK7","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:2d5337077a21a3fa002245b9f890a45f60ac16e0c1b1dae3970730b807707225","target":"graph","created_at":"2026-05-17T23:44:47Z","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":"Maximum distance separable convolutional codes are the codes that present best performance in error correction among all convolutional codes with certain rate and degree. In this paper, we show that taking the constant matrix coefficients of a polynomial matrix as submatrices of a superregular matrix, we obtain a column reduced generator matrix of an MDS convolutional code with a certain rate and a certain degree. We then present two novel constructions that fulfill these conditions by considering two types of superregular matrices.","authors_text":"Julia Lieb, Raquel Pinto","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2019-03-26T16:16:51Z","title":"Constructions of MDS convolutional codes using superregular matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10986","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:2fc3d0da41659ee9916878ab30a10753c29120d129d27352b3fb6f795f1690c0","target":"record","created_at":"2026-05-17T23:44:47Z","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":"043a5db8a8e8d3b87e2f50fae800555f50822761d6f4a9c347f3063e03d8f043","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2019-03-26T16:16:51Z","title_canon_sha256":"5987c4b4ce2727e3be7b1c6d35bfb56bc8a24df5c8019829edb969b63ea3d8d1"},"schema_version":"1.0","source":{"id":"1903.10986","kind":"arxiv","version":3}},"canonical_sha256":"67c200c95ff58d45ac0d0e98d64e21205962938c75b23b1a2b7391e69d2d39a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67c200c95ff58d45ac0d0e98d64e21205962938c75b23b1a2b7391e69d2d39a4","first_computed_at":"2026-05-17T23:44:47.370693Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:47.370693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uumeVYZCTDV78ITbMI2md7+v8zsyrzJvHnSOSlxPoPVtdpDJF6geOgTsYXuHGnlM706UyatrF/v/DULO7eZXCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:47.371385Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.10986","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2fc3d0da41659ee9916878ab30a10753c29120d129d27352b3fb6f795f1690c0","sha256:2d5337077a21a3fa002245b9f890a45f60ac16e0c1b1dae3970730b807707225"],"state_sha256":"71c668525f56838104011625c6ccacea963590b35a086b0ea0ad634e1ccf6911"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wDtpH6gQq+CgxDh7tCQVd36meAENehpjiCdthGjkAbMFjY4cPU0PuJOOwGHglOBoS6SXcufwvuF39M1dc8rhAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T00:26:05.973488Z","bundle_sha256":"a82e5bed744a8cb5e6b8d41c76ae4fae4a2c3e04b3b18355f8a1a78fa6605963"}}