{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UA2RJ4LC6JFWLIMLQLBHGZLGMW","short_pith_number":"pith:UA2RJ4LC","canonical_record":{"source":{"id":"1511.07233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-23T14:23:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"50edbfcfd53f496c1c595624a2a44b022048b0005cd0453d0d86711167de936b","abstract_canon_sha256":"f772a2d354f7c19ad92d4b2500ea5906918cab6e5f814013f04105abbeac6de9"},"schema_version":"1.0"},"canonical_sha256":"a03514f162f24b65a18b82c27365666589a0aa8880f86f7cb18a0a865f5494ba","source":{"kind":"arxiv","id":"1511.07233","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07233","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07233v1","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07233","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"UA2RJ4LC6JFW","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UA2RJ4LC6JFWLIML","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UA2RJ4LC","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UA2RJ4LC6JFWLIMLQLBHGZLGMW","target":"record","payload":{"canonical_record":{"source":{"id":"1511.07233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-23T14:23:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"50edbfcfd53f496c1c595624a2a44b022048b0005cd0453d0d86711167de936b","abstract_canon_sha256":"f772a2d354f7c19ad92d4b2500ea5906918cab6e5f814013f04105abbeac6de9"},"schema_version":"1.0"},"canonical_sha256":"a03514f162f24b65a18b82c27365666589a0aa8880f86f7cb18a0a865f5494ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:11.892611Z","signature_b64":"w5Ak4Lu8hZi0ixLX10TSVh0H6C0N3Hxreaanh6PI0+SHNEZ+c+UJUWl1eIkdTXntADAaGBSpBPf5i9HK58XKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a03514f162f24b65a18b82c27365666589a0aa8880f86f7cb18a0a865f5494ba","last_reissued_at":"2026-05-18T01:26:11.892080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:11.892080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.07233","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-18T01:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OfvbgPV8vOR9z80mOn/tNc8AKkcP1oNmV8xAA/a8m1IPs1BYAfGP22TygOi+WqFHdZrENCnRNBl3d05GimqyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:02:39.852959Z"},"content_sha256":"33e3e809de7373fdf203c1e3c380a5725fb337ce4d78c883001dd949ccd1b8fb","schema_version":"1.0","event_id":"sha256:33e3e809de7373fdf203c1e3c380a5725fb337ce4d78c883001dd949ccd1b8fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UA2RJ4LC6JFWLIMLQLBHGZLGMW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Construction of Unit-Memory MDS Convolutional Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chin Hei Chan, Maosheng Xiong","submitted_at":"2015-11-23T14:23:33Z","abstract_excerpt":"Maximum-distance separable (MDS) convolutional codes form an optimal family of convolutional codes, the study of which is of great importance. There are very few general algebraic constructions of MDS convolutional codes. In this paper, we construct a large family of unit-memory MDS convolutional codes over $\\F$ with flexible parameters. Compared with previous works, the field size $q$ required to define these codes is much smaller. The construction also leads to many new strongly-MDS convolutional codes, an important subclass of MDS convolutional codes proposed and studied in \\cite{GL2}. Many"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07233","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-18T01:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EjFMaOSlLHss3VMwWJO/lUJINjlD8u+U/CyL/urnJxajBlES8Kr4ntovAxWXBuCAIFfjTzHkzAdtd8lsD5LPCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:02:39.853309Z"},"content_sha256":"4ab887e90144e4ddcef50b266e3ecfd567dcb611392e4e2c2d715e45da00505a","schema_version":"1.0","event_id":"sha256:4ab887e90144e4ddcef50b266e3ecfd567dcb611392e4e2c2d715e45da00505a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UA2RJ4LC6JFWLIMLQLBHGZLGMW/bundle.json","state_url":"https://pith.science/pith/UA2RJ4LC6JFWLIMLQLBHGZLGMW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UA2RJ4LC6JFWLIMLQLBHGZLGMW/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-23T00:02:39Z","links":{"resolver":"https://pith.science/pith/UA2RJ4LC6JFWLIMLQLBHGZLGMW","bundle":"https://pith.science/pith/UA2RJ4LC6JFWLIMLQLBHGZLGMW/bundle.json","state":"https://pith.science/pith/UA2RJ4LC6JFWLIMLQLBHGZLGMW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UA2RJ4LC6JFWLIMLQLBHGZLGMW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UA2RJ4LC6JFWLIMLQLBHGZLGMW","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":"f772a2d354f7c19ad92d4b2500ea5906918cab6e5f814013f04105abbeac6de9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-23T14:23:33Z","title_canon_sha256":"50edbfcfd53f496c1c595624a2a44b022048b0005cd0453d0d86711167de936b"},"schema_version":"1.0","source":{"id":"1511.07233","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07233","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07233v1","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07233","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"UA2RJ4LC6JFW","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UA2RJ4LC6JFWLIML","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UA2RJ4LC","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:4ab887e90144e4ddcef50b266e3ecfd567dcb611392e4e2c2d715e45da00505a","target":"graph","created_at":"2026-05-18T01:26:11Z","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 (MDS) convolutional codes form an optimal family of convolutional codes, the study of which is of great importance. There are very few general algebraic constructions of MDS convolutional codes. In this paper, we construct a large family of unit-memory MDS convolutional codes over $\\F$ with flexible parameters. Compared with previous works, the field size $q$ required to define these codes is much smaller. The construction also leads to many new strongly-MDS convolutional codes, an important subclass of MDS convolutional codes proposed and studied in \\cite{GL2}. Many","authors_text":"Chin Hei Chan, Maosheng Xiong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-23T14:23:33Z","title":"Construction of Unit-Memory MDS Convolutional Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07233","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:33e3e809de7373fdf203c1e3c380a5725fb337ce4d78c883001dd949ccd1b8fb","target":"record","created_at":"2026-05-18T01:26:11Z","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":"f772a2d354f7c19ad92d4b2500ea5906918cab6e5f814013f04105abbeac6de9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-23T14:23:33Z","title_canon_sha256":"50edbfcfd53f496c1c595624a2a44b022048b0005cd0453d0d86711167de936b"},"schema_version":"1.0","source":{"id":"1511.07233","kind":"arxiv","version":1}},"canonical_sha256":"a03514f162f24b65a18b82c27365666589a0aa8880f86f7cb18a0a865f5494ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a03514f162f24b65a18b82c27365666589a0aa8880f86f7cb18a0a865f5494ba","first_computed_at":"2026-05-18T01:26:11.892080Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:11.892080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w5Ak4Lu8hZi0ixLX10TSVh0H6C0N3Hxreaanh6PI0+SHNEZ+c+UJUWl1eIkdTXntADAaGBSpBPf5i9HK58XKDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:11.892611Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.07233","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33e3e809de7373fdf203c1e3c380a5725fb337ce4d78c883001dd949ccd1b8fb","sha256:4ab887e90144e4ddcef50b266e3ecfd567dcb611392e4e2c2d715e45da00505a"],"state_sha256":"a57a04bbf7a7664ab43b724c8d55bc42ff08e6e8e28b674f88db6d41b8138a34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wE5lXW5H5SBSj5mbgKj+SJT17WrjxYEZI07d4TvkCHekugdlPDN8ioN/Aw27cTLThczldBH87NyshWGXHB5wAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T00:02:39.855303Z","bundle_sha256":"5c00251e25267a66d6dbac67dc7f38478947a0f046fe139d31bdfe6db08ee8f9"}}