{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:LSIUPY6ZEER4GRESB65PLAFQKL","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":"9ce6d8fc268636c11d32c62e9392ef48c1ae77f15df4e2a813d3d22fcf0941f9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-07T19:00:35Z","title_canon_sha256":"63b69ab4395d247895d864c10c2314b8ef84d659290a4cb56fb5e17e8916a4d9"},"schema_version":"1.0","source":{"id":"1106.1414","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.1414","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"arxiv_version","alias_value":"1106.1414v1","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1414","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"pith_short_12","alias_value":"LSIUPY6ZEER4","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LSIUPY6ZEER4GRES","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LSIUPY6Z","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:0689847b2164d4870fe2c16885c8c6fe6e868a6c6186ca340ce0b9dec327e6ad","target":"graph","created_at":"2026-05-18T00:59:10Z","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":"Ensembles of (J,K)-regular low-density parity-check convolutional (LDPCC) codes are known to be asymptotically good, in the sense that the minimum free distance grows linearly with the constraint length. In this paper, we use a protograph-based analysis of terminated LDPCC codes to obtain an upper bound on the free distance growth rate of ensembles of periodically time-varying LDPCC codes. This bound is compared to a lower bound and evaluated numerically. It is found that, for a sufficiently large period, the bounds coincide. This approach is then extended to obtain bounds on the trapping set ","authors_text":"Ali E. Pusane, Daniel J. Costello Jr, David G. M. Mitchell, Michael Lentmaier","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-07T19:00:35Z","title":"Exact Free Distance and Trapping Set Growth Rates for LDPC Convolutional Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1414","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:71b679c3f4d7fcbf085f6b048e91a9c70476fd6695f200ae0b3358813ce4b6ea","target":"record","created_at":"2026-05-18T00:59:10Z","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":"9ce6d8fc268636c11d32c62e9392ef48c1ae77f15df4e2a813d3d22fcf0941f9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-07T19:00:35Z","title_canon_sha256":"63b69ab4395d247895d864c10c2314b8ef84d659290a4cb56fb5e17e8916a4d9"},"schema_version":"1.0","source":{"id":"1106.1414","kind":"arxiv","version":1}},"canonical_sha256":"5c9147e3d92123c344920fbaf580b052f1c389a2631b8c5cfef9dc3dee9dfc50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c9147e3d92123c344920fbaf580b052f1c389a2631b8c5cfef9dc3dee9dfc50","first_computed_at":"2026-05-18T00:59:10.269333Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:10.269333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HPna76A15isJWoi2KwtrvumOt9QDB4zx9Eszn9jfGjxezJKQul5a/E+hNCalKSS329ypKvyfoypldD3cPjwoAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:10.269960Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.1414","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71b679c3f4d7fcbf085f6b048e91a9c70476fd6695f200ae0b3358813ce4b6ea","sha256:0689847b2164d4870fe2c16885c8c6fe6e868a6c6186ca340ce0b9dec327e6ad"],"state_sha256":"51f03d1be067bbceb2c51c0e06870fa047b0ffa5358e281705159e435c0ac58a"}