{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YNCHTITQZ5KKQPQCLGAV63CZ4Y","short_pith_number":"pith:YNCHTITQ","canonical_record":{"source":{"id":"1705.10091","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-29T09:41:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a847690b2d737b1339708cae57cc5604d447cce54da252c1668911098dab2aaa","abstract_canon_sha256":"ad804721f77d26354b9ed455be78d15268df7930a0a004addbaae2e691999762"},"schema_version":"1.0"},"canonical_sha256":"c34479a270cf54a83e0259815f6c59e62ef4fd3468e4cff502e446bb3848cbeb","source":{"kind":"arxiv","id":"1705.10091","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10091","created_at":"2026-05-18T00:43:31Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10091v1","created_at":"2026-05-18T00:43:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10091","created_at":"2026-05-18T00:43:31Z"},{"alias_kind":"pith_short_12","alias_value":"YNCHTITQZ5KK","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YNCHTITQZ5KKQPQC","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YNCHTITQ","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YNCHTITQZ5KKQPQCLGAV63CZ4Y","target":"record","payload":{"canonical_record":{"source":{"id":"1705.10091","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-29T09:41:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a847690b2d737b1339708cae57cc5604d447cce54da252c1668911098dab2aaa","abstract_canon_sha256":"ad804721f77d26354b9ed455be78d15268df7930a0a004addbaae2e691999762"},"schema_version":"1.0"},"canonical_sha256":"c34479a270cf54a83e0259815f6c59e62ef4fd3468e4cff502e446bb3848cbeb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:31.977761Z","signature_b64":"7Ix6wiaj5eLSQYnT6DpH1dcV4DP1e/A787OxGoSMnt/XGWl9MwZqmk2S/KPhm0aYwyXIdgfK+lF1Fuz7A8GACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c34479a270cf54a83e0259815f6c59e62ef4fd3468e4cff502e446bb3848cbeb","last_reissued_at":"2026-05-18T00:43:31.977110Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:31.977110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.10091","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:43:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+p4sjzOLVG8fE3r2lHtoMppXIUUOLwWCUHElhi1jixVBcd8iq/KCJL6wa17embmITenD3J1OB4wsBzo1ODQKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:06:45.368302Z"},"content_sha256":"8a4a3fdbd302d7c552ee6543da6743f5e7f85bf4e1ee96140ed6ed16ab83cd93","schema_version":"1.0","event_id":"sha256:8a4a3fdbd302d7c552ee6543da6743f5e7f85bf4e1ee96140ed6ed16ab83cd93"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YNCHTITQZ5KKQPQCLGAV63CZ4Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rate $(n-1)/n$ Systematic MDS Convolutional Codes over $GF(2^m)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"\\'Angela Barbero, {\\O}yvind Ytrehus","submitted_at":"2017-05-29T09:41:36Z","abstract_excerpt":"A systematic convolutional encoder of rate $(n-1)/n$ and maximum degree $D$ generates a code of free distance at most ${\\cal D} = D+2$ and, at best, a column distance profile (CDP) of $[2,3,\\ldots,{\\cal D}]$. A code is \\emph{Maximum Distance Separable} (MDS) if it possesses this CDP. Applied on a communication channel over which packets are transmitted sequentially and which loses (erases) packets randomly, such a code allows the recovery from any pattern of $j$ erasures in the first $j$ $n$-packet blocks for $j<{\\cal D}$, with a delay of at most $j$ blocks counting from the first erasure. Thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10091","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:43:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X3tuLoDzqfjiEyI3g4cyROhC3SyBSdjRLdio0IeIaNH4w6UwD/ouNB2kKMjDdRVgtF0NiP1omYzw6rwObPxSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:06:45.368957Z"},"content_sha256":"8282008e77ddb2252ae07fd1e37d26b78fc730ce694af7d08ec6481b1b615728","schema_version":"1.0","event_id":"sha256:8282008e77ddb2252ae07fd1e37d26b78fc730ce694af7d08ec6481b1b615728"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YNCHTITQZ5KKQPQCLGAV63CZ4Y/bundle.json","state_url":"https://pith.science/pith/YNCHTITQZ5KKQPQCLGAV63CZ4Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YNCHTITQZ5KKQPQCLGAV63CZ4Y/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-11T22:06:45Z","links":{"resolver":"https://pith.science/pith/YNCHTITQZ5KKQPQCLGAV63CZ4Y","bundle":"https://pith.science/pith/YNCHTITQZ5KKQPQCLGAV63CZ4Y/bundle.json","state":"https://pith.science/pith/YNCHTITQZ5KKQPQCLGAV63CZ4Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YNCHTITQZ5KKQPQCLGAV63CZ4Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YNCHTITQZ5KKQPQCLGAV63CZ4Y","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":"ad804721f77d26354b9ed455be78d15268df7930a0a004addbaae2e691999762","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-29T09:41:36Z","title_canon_sha256":"a847690b2d737b1339708cae57cc5604d447cce54da252c1668911098dab2aaa"},"schema_version":"1.0","source":{"id":"1705.10091","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10091","created_at":"2026-05-18T00:43:31Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10091v1","created_at":"2026-05-18T00:43:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10091","created_at":"2026-05-18T00:43:31Z"},{"alias_kind":"pith_short_12","alias_value":"YNCHTITQZ5KK","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YNCHTITQZ5KKQPQC","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YNCHTITQ","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:8282008e77ddb2252ae07fd1e37d26b78fc730ce694af7d08ec6481b1b615728","target":"graph","created_at":"2026-05-18T00:43:31Z","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":"A systematic convolutional encoder of rate $(n-1)/n$ and maximum degree $D$ generates a code of free distance at most ${\\cal D} = D+2$ and, at best, a column distance profile (CDP) of $[2,3,\\ldots,{\\cal D}]$. A code is \\emph{Maximum Distance Separable} (MDS) if it possesses this CDP. Applied on a communication channel over which packets are transmitted sequentially and which loses (erases) packets randomly, such a code allows the recovery from any pattern of $j$ erasures in the first $j$ $n$-packet blocks for $j<{\\cal D}$, with a delay of at most $j$ blocks counting from the first erasure. Thi","authors_text":"\\'Angela Barbero, {\\O}yvind Ytrehus","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-29T09:41:36Z","title":"Rate $(n-1)/n$ Systematic MDS Convolutional Codes over $GF(2^m)$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10091","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:8a4a3fdbd302d7c552ee6543da6743f5e7f85bf4e1ee96140ed6ed16ab83cd93","target":"record","created_at":"2026-05-18T00:43:31Z","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":"ad804721f77d26354b9ed455be78d15268df7930a0a004addbaae2e691999762","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-29T09:41:36Z","title_canon_sha256":"a847690b2d737b1339708cae57cc5604d447cce54da252c1668911098dab2aaa"},"schema_version":"1.0","source":{"id":"1705.10091","kind":"arxiv","version":1}},"canonical_sha256":"c34479a270cf54a83e0259815f6c59e62ef4fd3468e4cff502e446bb3848cbeb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c34479a270cf54a83e0259815f6c59e62ef4fd3468e4cff502e446bb3848cbeb","first_computed_at":"2026-05-18T00:43:31.977110Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:31.977110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7Ix6wiaj5eLSQYnT6DpH1dcV4DP1e/A787OxGoSMnt/XGWl9MwZqmk2S/KPhm0aYwyXIdgfK+lF1Fuz7A8GACA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:31.977761Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.10091","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a4a3fdbd302d7c552ee6543da6743f5e7f85bf4e1ee96140ed6ed16ab83cd93","sha256:8282008e77ddb2252ae07fd1e37d26b78fc730ce694af7d08ec6481b1b615728"],"state_sha256":"27b4097e3d469cda1dda2ebec67814361e568176702416c3c66de358cfb07b87"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Q7znx6Vn8LlF3Cj8stItY3suYi5wUjLkPO9fhIf1WapIikWdkl++6ySSl+5syuA9AHaAtjS4LL5GmMOhMfDBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:06:45.372279Z","bundle_sha256":"294b6d5bf1979fe22967f6661e3d0dfe047848764592df61ddc79dce153020f4"}}