{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NTGPKCZZCI2YTUBEP4XKSEB5P5","short_pith_number":"pith:NTGPKCZZ","schema_version":"1.0","canonical_sha256":"6cccf50b39123589d0247f2ea9103d7f56ea1855bf25ee23f04ea33ce2d5e18c","source":{"kind":"arxiv","id":"1712.08767","version":1},"attestation_state":"computed","paper":{"title":"Complete MDP convolutional codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Julia Lieb","submitted_at":"2017-12-23T12:32:19Z","abstract_excerpt":"Maximum distance profile (MDP) convolutional codes have the property that their column distances are as large as possible. It has been shown that, transmitting over an erasure channel, these codes have optimal recovery rate for windows of a certain length. Reverse MDP convolutional codes have the additional advantage that they are suitable for forward and backward decoding algorithms. Beyond that the subclass of complete MDP convolutional codes has the ability to reduce the waiting time during decoding. The first main result of this paper is to show the existence and genericity of complete MDP"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1712.08767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-23T12:32:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8dc417b818e8480749313b38301632e7280efe4c40c201eea06ac2d7f65ccfc2","abstract_canon_sha256":"cbe5b6a714e101cc9e5b12105e00544a8a847de8f5b4f68e9dacea4fa38f990a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:16.860970Z","signature_b64":"/sH9LA80JuJW1wZRIwodeVY8ho1APrskN/9XX4ZOyNQO8n7BsRT+XxT5mjiP7akdOYTG6iqe5E0795MA0Y6IBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cccf50b39123589d0247f2ea9103d7f56ea1855bf25ee23f04ea33ce2d5e18c","last_reissued_at":"2026-05-18T00:27:16.860515Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:16.860515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complete MDP convolutional codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Julia Lieb","submitted_at":"2017-12-23T12:32:19Z","abstract_excerpt":"Maximum distance profile (MDP) convolutional codes have the property that their column distances are as large as possible. It has been shown that, transmitting over an erasure channel, these codes have optimal recovery rate for windows of a certain length. Reverse MDP convolutional codes have the additional advantage that they are suitable for forward and backward decoding algorithms. Beyond that the subclass of complete MDP convolutional codes has the ability to reduce the waiting time during decoding. The first main result of this paper is to show the existence and genericity of complete MDP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08767","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.08767","created_at":"2026-05-18T00:27:16.860610+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.08767v1","created_at":"2026-05-18T00:27:16.860610+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08767","created_at":"2026-05-18T00:27:16.860610+00:00"},{"alias_kind":"pith_short_12","alias_value":"NTGPKCZZCI2Y","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"NTGPKCZZCI2YTUBE","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"NTGPKCZZ","created_at":"2026-05-18T12:31:34.259226+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NTGPKCZZCI2YTUBEP4XKSEB5P5","json":"https://pith.science/pith/NTGPKCZZCI2YTUBEP4XKSEB5P5.json","graph_json":"https://pith.science/api/pith-number/NTGPKCZZCI2YTUBEP4XKSEB5P5/graph.json","events_json":"https://pith.science/api/pith-number/NTGPKCZZCI2YTUBEP4XKSEB5P5/events.json","paper":"https://pith.science/paper/NTGPKCZZ"},"agent_actions":{"view_html":"https://pith.science/pith/NTGPKCZZCI2YTUBEP4XKSEB5P5","download_json":"https://pith.science/pith/NTGPKCZZCI2YTUBEP4XKSEB5P5.json","view_paper":"https://pith.science/paper/NTGPKCZZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.08767&json=true","fetch_graph":"https://pith.science/api/pith-number/NTGPKCZZCI2YTUBEP4XKSEB5P5/graph.json","fetch_events":"https://pith.science/api/pith-number/NTGPKCZZCI2YTUBEP4XKSEB5P5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NTGPKCZZCI2YTUBEP4XKSEB5P5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NTGPKCZZCI2YTUBEP4XKSEB5P5/action/storage_attestation","attest_author":"https://pith.science/pith/NTGPKCZZCI2YTUBEP4XKSEB5P5/action/author_attestation","sign_citation":"https://pith.science/pith/NTGPKCZZCI2YTUBEP4XKSEB5P5/action/citation_signature","submit_replication":"https://pith.science/pith/NTGPKCZZCI2YTUBEP4XKSEB5P5/action/replication_record"}},"created_at":"2026-05-18T00:27:16.860610+00:00","updated_at":"2026-05-18T00:27:16.860610+00:00"}