{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:LSIUPY6ZEER4GRESB65PLAFQKL","short_pith_number":"pith:LSIUPY6Z","canonical_record":{"source":{"id":"1106.1414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-07T19:00:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"63b69ab4395d247895d864c10c2314b8ef84d659290a4cb56fb5e17e8916a4d9","abstract_canon_sha256":"9ce6d8fc268636c11d32c62e9392ef48c1ae77f15df4e2a813d3d22fcf0941f9"},"schema_version":"1.0"},"canonical_sha256":"5c9147e3d92123c344920fbaf580b052f1c389a2631b8c5cfef9dc3dee9dfc50","source":{"kind":"arxiv","id":"1106.1414","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:LSIUPY6ZEER4GRESB65PLAFQKL","target":"record","payload":{"canonical_record":{"source":{"id":"1106.1414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-07T19:00:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"63b69ab4395d247895d864c10c2314b8ef84d659290a4cb56fb5e17e8916a4d9","abstract_canon_sha256":"9ce6d8fc268636c11d32c62e9392ef48c1ae77f15df4e2a813d3d22fcf0941f9"},"schema_version":"1.0"},"canonical_sha256":"5c9147e3d92123c344920fbaf580b052f1c389a2631b8c5cfef9dc3dee9dfc50","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:10.269960Z","signature_b64":"HPna76A15isJWoi2KwtrvumOt9QDB4zx9Eszn9jfGjxezJKQul5a/E+hNCalKSS329ypKvyfoypldD3cPjwoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c9147e3d92123c344920fbaf580b052f1c389a2631b8c5cfef9dc3dee9dfc50","last_reissued_at":"2026-05-18T00:59:10.269333Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:10.269333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.1414","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:59:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jFhxdxOUKqbZJjJ64gqgwfTnRpNDEjOZ50FFLjXERw/cxJYuCvni5XcefLPQ1gT0I/t2yHniRsS7p0uaWyDcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T02:33:25.162082Z"},"content_sha256":"71b679c3f4d7fcbf085f6b048e91a9c70476fd6695f200ae0b3358813ce4b6ea","schema_version":"1.0","event_id":"sha256:71b679c3f4d7fcbf085f6b048e91a9c70476fd6695f200ae0b3358813ce4b6ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:LSIUPY6ZEER4GRESB65PLAFQKL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact Free Distance and Trapping Set Growth Rates for LDPC Convolutional Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali E. Pusane, Daniel J. Costello Jr, David G. M. Mitchell, Michael Lentmaier","submitted_at":"2011-06-07T19:00:35Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1414","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:59:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GYKNsEQL8J9s97ZrXfmvZSR2CU3G8JZlLqdl+TySekhaR2bKsDKxhigZIb7D9L8RziBf+j7qQLGVcyhAeMQ7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T02:33:25.162775Z"},"content_sha256":"0689847b2164d4870fe2c16885c8c6fe6e868a6c6186ca340ce0b9dec327e6ad","schema_version":"1.0","event_id":"sha256:0689847b2164d4870fe2c16885c8c6fe6e868a6c6186ca340ce0b9dec327e6ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LSIUPY6ZEER4GRESB65PLAFQKL/bundle.json","state_url":"https://pith.science/pith/LSIUPY6ZEER4GRESB65PLAFQKL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LSIUPY6ZEER4GRESB65PLAFQKL/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-05-20T02:33:25Z","links":{"resolver":"https://pith.science/pith/LSIUPY6ZEER4GRESB65PLAFQKL","bundle":"https://pith.science/pith/LSIUPY6ZEER4GRESB65PLAFQKL/bundle.json","state":"https://pith.science/pith/LSIUPY6ZEER4GRESB65PLAFQKL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LSIUPY6ZEER4GRESB65PLAFQKL/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3a6/A2gIRBq/KhbYlqJs7AD78HII5kvcASmhQHfb9H5fF4Fbuln6bUtpFjw9adjm3KKdvyuAIofB3dW7KUX8Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T02:33:25.167788Z","bundle_sha256":"a9d4fa47d58b72930cf43d8d7fda2d25b085e2e129e89d9ef7cd6fe7058e2694"}}