{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3OG7IZM63QP4OT2NZTKAW2PAL2","short_pith_number":"pith:3OG7IZM6","schema_version":"1.0","canonical_sha256":"db8df4659edc1fc74f4dccd40b69e05e91fe3c4bccef711f3c578ef8fbea8f92","source":{"kind":"arxiv","id":"1312.3368","version":1},"attestation_state":"computed","paper":{"title":"New Codes on Graphs Constructed by Connecting Spatially Coupled 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, Michael Lentmaier","submitted_at":"2013-12-11T22:58:28Z","abstract_excerpt":"A novel code construction based on spatially coupled low-density parity-check (SC-LDPC) codes is presented. The proposed code ensembles are described by protographs, comprised of several protograph-based chains characterizing individual SC-LDPC codes. We demonstrate that code ensembles obtained by connecting appropriately chosen SC-LDPC code chains at specific points have improved iterative decoding thresholds compared to those of single SC-LDPC coupled chains. In addition, it is shown that the improved decoding properties of the connected ensembles result in reduced decoding complexity requir"},"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":"1312.3368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-11T22:58:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"51fe992efe527835d320b66bb7dee78ffe46ebea0c01150b5130b3d020bdb071","abstract_canon_sha256":"e6f809bd11501636219edd7a1bfb61a5a813287e3fbc9feba22821b71513d644"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:52.446605Z","signature_b64":"21PfQxr1GninK+BQXfNqetkT5D/K7heDR9VGEr2YK6WfoMKSlGJ4evTvr+RkIzRM8v4GI2CnL+npam5uWpDvBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db8df4659edc1fc74f4dccd40b69e05e91fe3c4bccef711f3c578ef8fbea8f92","last_reissued_at":"2026-05-18T00:57:52.446066Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:52.446066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Codes on Graphs Constructed by Connecting Spatially Coupled 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, Michael Lentmaier","submitted_at":"2013-12-11T22:58:28Z","abstract_excerpt":"A novel code construction based on spatially coupled low-density parity-check (SC-LDPC) codes is presented. The proposed code ensembles are described by protographs, comprised of several protograph-based chains characterizing individual SC-LDPC codes. We demonstrate that code ensembles obtained by connecting appropriately chosen SC-LDPC code chains at specific points have improved iterative decoding thresholds compared to those of single SC-LDPC coupled chains. In addition, it is shown that the improved decoding properties of the connected ensembles result in reduced decoding complexity requir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3368","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":"1312.3368","created_at":"2026-05-18T00:57:52.446151+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.3368v1","created_at":"2026-05-18T00:57:52.446151+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3368","created_at":"2026-05-18T00:57:52.446151+00:00"},{"alias_kind":"pith_short_12","alias_value":"3OG7IZM63QP4","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3OG7IZM63QP4OT2N","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3OG7IZM6","created_at":"2026-05-18T12:27:32.513160+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/3OG7IZM63QP4OT2NZTKAW2PAL2","json":"https://pith.science/pith/3OG7IZM63QP4OT2NZTKAW2PAL2.json","graph_json":"https://pith.science/api/pith-number/3OG7IZM63QP4OT2NZTKAW2PAL2/graph.json","events_json":"https://pith.science/api/pith-number/3OG7IZM63QP4OT2NZTKAW2PAL2/events.json","paper":"https://pith.science/paper/3OG7IZM6"},"agent_actions":{"view_html":"https://pith.science/pith/3OG7IZM63QP4OT2NZTKAW2PAL2","download_json":"https://pith.science/pith/3OG7IZM63QP4OT2NZTKAW2PAL2.json","view_paper":"https://pith.science/paper/3OG7IZM6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.3368&json=true","fetch_graph":"https://pith.science/api/pith-number/3OG7IZM63QP4OT2NZTKAW2PAL2/graph.json","fetch_events":"https://pith.science/api/pith-number/3OG7IZM63QP4OT2NZTKAW2PAL2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3OG7IZM63QP4OT2NZTKAW2PAL2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3OG7IZM63QP4OT2NZTKAW2PAL2/action/storage_attestation","attest_author":"https://pith.science/pith/3OG7IZM63QP4OT2NZTKAW2PAL2/action/author_attestation","sign_citation":"https://pith.science/pith/3OG7IZM63QP4OT2NZTKAW2PAL2/action/citation_signature","submit_replication":"https://pith.science/pith/3OG7IZM63QP4OT2NZTKAW2PAL2/action/replication_record"}},"created_at":"2026-05-18T00:57:52.446151+00:00","updated_at":"2026-05-18T00:57:52.446151+00:00"}