{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:LFX5HSVXP3UDBYZTXUMJKFSS45","short_pith_number":"pith:LFX5HSVX","canonical_record":{"source":{"id":"0805.0241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-05-02T16:13:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"330222807843728a75f96d5071707294f7bd2d01387e2abac62b8b2dec46a9da","abstract_canon_sha256":"50f27b1907a3acbf627f0707555ef5d1cb9e15cf7db6f28247a4b9dd4552bd9c"},"schema_version":"1.0"},"canonical_sha256":"596fd3cab77ee830e333bd18951652e75b59040a55557447293fc49443542161","source":{"kind":"arxiv","id":"0805.0241","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0805.0241","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"0805.0241v1","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0805.0241","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"LFX5HSVXP3UD","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"LFX5HSVXP3UDBYZT","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"LFX5HSVX","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:LFX5HSVXP3UDBYZTXUMJKFSS45","target":"record","payload":{"canonical_record":{"source":{"id":"0805.0241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-05-02T16:13:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"330222807843728a75f96d5071707294f7bd2d01387e2abac62b8b2dec46a9da","abstract_canon_sha256":"50f27b1907a3acbf627f0707555ef5d1cb9e15cf7db6f28247a4b9dd4552bd9c"},"schema_version":"1.0"},"canonical_sha256":"596fd3cab77ee830e333bd18951652e75b59040a55557447293fc49443542161","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:11.799140Z","signature_b64":"EWueDG7jJsixPsxTklHNd2mR5Mb7lBIfspsC9eqNl4E91uplZKkGzOcTIp5uBrrgxzr572nIEBUfY18ghj+bBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"596fd3cab77ee830e333bd18951652e75b59040a55557447293fc49443542161","last_reissued_at":"2026-05-18T00:59:11.798421Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:11.798421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0805.0241","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:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B/SZNQEsowtYeaz6t1uVWqe7S/iRzEFLDCm6oyyRiWFhpiIfWomXgvalB8Uj+gkwAyCbe+3QFsGNVpPFnw5nCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:29:45.383983Z"},"content_sha256":"c57d8d0490234ce78a75320a7a104fa8b61ee267862cc4672791e1984a080197","schema_version":"1.0","event_id":"sha256:c57d8d0490234ce78a75320a7a104fa8b61ee267862cc4672791e1984a080197"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:LFX5HSVXP3UDBYZTXUMJKFSS45","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotically Good LDPC Convolutional Codes Based on Protographs","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, David G. M. Mitchell, jr, Kamil Sh. Zigangirov","submitted_at":"2008-05-02T16:13:16Z","abstract_excerpt":"LDPC convolutional codes have been shown to be capable of achieving the same capacity-approaching performance as LDPC block codes with iterative message-passing decoding. In this paper, asymptotic methods are used to calculate a lower bound on the free distance for several ensembles of asymptotically good protograph-based LDPC convolutional codes. Further, we show that the free distance to constraint length ratio of the LDPC convolutional codes exceeds the minimum distance to block length ratio of corresponding LDPC block codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0805.0241","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:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"peKsth4/funepKydDy9mSwLkkXBksNwyHP/mRKRfzC5zHrZ5XemcsD96H3Tbjm72IUrRzs8ZokW5dFh6tPdpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:29:45.384379Z"},"content_sha256":"79f957a9bb034e82dab5e5e7346ddfab6f947e43eb388fac9868faf95932a6e3","schema_version":"1.0","event_id":"sha256:79f957a9bb034e82dab5e5e7346ddfab6f947e43eb388fac9868faf95932a6e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LFX5HSVXP3UDBYZTXUMJKFSS45/bundle.json","state_url":"https://pith.science/pith/LFX5HSVXP3UDBYZTXUMJKFSS45/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LFX5HSVXP3UDBYZTXUMJKFSS45/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-03T07:29:45Z","links":{"resolver":"https://pith.science/pith/LFX5HSVXP3UDBYZTXUMJKFSS45","bundle":"https://pith.science/pith/LFX5HSVXP3UDBYZTXUMJKFSS45/bundle.json","state":"https://pith.science/pith/LFX5HSVXP3UDBYZTXUMJKFSS45/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LFX5HSVXP3UDBYZTXUMJKFSS45/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:LFX5HSVXP3UDBYZTXUMJKFSS45","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":"50f27b1907a3acbf627f0707555ef5d1cb9e15cf7db6f28247a4b9dd4552bd9c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-05-02T16:13:16Z","title_canon_sha256":"330222807843728a75f96d5071707294f7bd2d01387e2abac62b8b2dec46a9da"},"schema_version":"1.0","source":{"id":"0805.0241","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0805.0241","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"0805.0241v1","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0805.0241","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"LFX5HSVXP3UD","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"LFX5HSVXP3UDBYZT","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"LFX5HSVX","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:79f957a9bb034e82dab5e5e7346ddfab6f947e43eb388fac9868faf95932a6e3","target":"graph","created_at":"2026-05-18T00:59: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":"LDPC convolutional codes have been shown to be capable of achieving the same capacity-approaching performance as LDPC block codes with iterative message-passing decoding. In this paper, asymptotic methods are used to calculate a lower bound on the free distance for several ensembles of asymptotically good protograph-based LDPC convolutional codes. Further, we show that the free distance to constraint length ratio of the LDPC convolutional codes exceeds the minimum distance to block length ratio of corresponding LDPC block codes.","authors_text":"Ali E. Pusane, Daniel J. Costello, David G. M. Mitchell, jr, Kamil Sh. Zigangirov","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-05-02T16:13:16Z","title":"Asymptotically Good LDPC Convolutional Codes Based on Protographs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0805.0241","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:c57d8d0490234ce78a75320a7a104fa8b61ee267862cc4672791e1984a080197","target":"record","created_at":"2026-05-18T00:59: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":"50f27b1907a3acbf627f0707555ef5d1cb9e15cf7db6f28247a4b9dd4552bd9c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-05-02T16:13:16Z","title_canon_sha256":"330222807843728a75f96d5071707294f7bd2d01387e2abac62b8b2dec46a9da"},"schema_version":"1.0","source":{"id":"0805.0241","kind":"arxiv","version":1}},"canonical_sha256":"596fd3cab77ee830e333bd18951652e75b59040a55557447293fc49443542161","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"596fd3cab77ee830e333bd18951652e75b59040a55557447293fc49443542161","first_computed_at":"2026-05-18T00:59:11.798421Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:11.798421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EWueDG7jJsixPsxTklHNd2mR5Mb7lBIfspsC9eqNl4E91uplZKkGzOcTIp5uBrrgxzr572nIEBUfY18ghj+bBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:11.799140Z","signed_message":"canonical_sha256_bytes"},"source_id":"0805.0241","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c57d8d0490234ce78a75320a7a104fa8b61ee267862cc4672791e1984a080197","sha256:79f957a9bb034e82dab5e5e7346ddfab6f947e43eb388fac9868faf95932a6e3"],"state_sha256":"823e49ffba212f5287f2d2b487ed09c8909ed49f4e268b85dd242703fec3e927"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Txe2urVBDJvDf5cSxc99g/tUnivQAWxI1xxW767GbCEbXjYbxZTWyo1ReZxYn2v8eTtqq6g2wAG1Q0DBFllGCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:29:45.386918Z","bundle_sha256":"340b622cca08bdf8ed737202a5dfe7586f9c143575792f57df22ba72ef50e63f"}}