{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:57YSEMMCJDSNREZANFP7CXP4GJ","short_pith_number":"pith:57YSEMMC","schema_version":"1.0","canonical_sha256":"eff122318248e4d89320695ff15dfc3264c3028cec721cd0fffb663c030e9c39","source":{"kind":"arxiv","id":"1402.7170","version":1},"attestation_state":"computed","paper":{"title":"Improving the Finite-Length Performance of Spatially Coupled LDPC Codes by Connecting Multiple Code Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel J. Costello Jr, David G. M. Mitchell, Dmitri Truhachev, Pablo M. Olmos","submitted_at":"2014-02-28T09:10:34Z","abstract_excerpt":"In this paper, we analyze the finite-length performance of codes on graphs constructed by connecting spatially coupled low-density parity-check (SC-LDPC) code chains. Successive (peeling) decoding is considered for the binary erasure channel (BEC). The evolution of the undecoded portion of the bipartite graph remaining after each iteration is analyzed as a dynamical system. When connecting short SC-LDPC chains, we show that, in addition to superior iterative decoding thresholds, connected chain ensembles have better finite-length performance than single chain ensembles of the same rate and len"},"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":"1402.7170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-28T09:10:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bb579efc68f1f797411d1126a28b1202cdb6f496f695514d737f9cd8783b4905","abstract_canon_sha256":"db5df1f823dc2c7a933d60e17a4f1f736db76b22aba16dba0634dde3f78b77a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:34.766541Z","signature_b64":"90DfMJSiTi+37RVreozxh2Ups8xSzc80ImUfmON+GlLgrtDtILBJmv23geuQdKwD3r++KzAwGkte8BlhfqIFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eff122318248e4d89320695ff15dfc3264c3028cec721cd0fffb663c030e9c39","last_reissued_at":"2026-05-18T02:57:34.765845Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:34.765845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving the Finite-Length Performance of Spatially Coupled LDPC Codes by Connecting Multiple Code Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel J. Costello Jr, David G. M. Mitchell, Dmitri Truhachev, Pablo M. Olmos","submitted_at":"2014-02-28T09:10:34Z","abstract_excerpt":"In this paper, we analyze the finite-length performance of codes on graphs constructed by connecting spatially coupled low-density parity-check (SC-LDPC) code chains. Successive (peeling) decoding is considered for the binary erasure channel (BEC). The evolution of the undecoded portion of the bipartite graph remaining after each iteration is analyzed as a dynamical system. When connecting short SC-LDPC chains, we show that, in addition to superior iterative decoding thresholds, connected chain ensembles have better finite-length performance than single chain ensembles of the same rate and len"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.7170","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":"1402.7170","created_at":"2026-05-18T02:57:34.765940+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.7170v1","created_at":"2026-05-18T02:57:34.765940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.7170","created_at":"2026-05-18T02:57:34.765940+00:00"},{"alias_kind":"pith_short_12","alias_value":"57YSEMMCJDSN","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"57YSEMMCJDSNREZA","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"57YSEMMC","created_at":"2026-05-18T12:28:14.216126+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/57YSEMMCJDSNREZANFP7CXP4GJ","json":"https://pith.science/pith/57YSEMMCJDSNREZANFP7CXP4GJ.json","graph_json":"https://pith.science/api/pith-number/57YSEMMCJDSNREZANFP7CXP4GJ/graph.json","events_json":"https://pith.science/api/pith-number/57YSEMMCJDSNREZANFP7CXP4GJ/events.json","paper":"https://pith.science/paper/57YSEMMC"},"agent_actions":{"view_html":"https://pith.science/pith/57YSEMMCJDSNREZANFP7CXP4GJ","download_json":"https://pith.science/pith/57YSEMMCJDSNREZANFP7CXP4GJ.json","view_paper":"https://pith.science/paper/57YSEMMC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.7170&json=true","fetch_graph":"https://pith.science/api/pith-number/57YSEMMCJDSNREZANFP7CXP4GJ/graph.json","fetch_events":"https://pith.science/api/pith-number/57YSEMMCJDSNREZANFP7CXP4GJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/57YSEMMCJDSNREZANFP7CXP4GJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/57YSEMMCJDSNREZANFP7CXP4GJ/action/storage_attestation","attest_author":"https://pith.science/pith/57YSEMMCJDSNREZANFP7CXP4GJ/action/author_attestation","sign_citation":"https://pith.science/pith/57YSEMMCJDSNREZANFP7CXP4GJ/action/citation_signature","submit_replication":"https://pith.science/pith/57YSEMMCJDSNREZANFP7CXP4GJ/action/replication_record"}},"created_at":"2026-05-18T02:57:34.765940+00:00","updated_at":"2026-05-18T02:57:34.765940+00:00"}