{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UOYOO52NXPAFM2NL6EB7VHZRG7","short_pith_number":"pith:UOYOO52N","schema_version":"1.0","canonical_sha256":"a3b0e7774dbbc05669abf103fa9f3137f4a55456e1e7604187082499cb5e3698","source":{"kind":"arxiv","id":"1407.0516","version":1},"attestation_state":"computed","paper":{"title":"Spatially Coupled Turbo Codes: Principles and Finite Length Performance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Michael Lentmaier, Saeedeh Moloudi","submitted_at":"2014-07-02T10:54:37Z","abstract_excerpt":"In this paper, we give an overview of spatially coupled turbo codes (SC-TCs), the spatial coupling of parallel and serially concatenated convolutional codes, recently introduced by the authors. For presentation purposes, we focus on spatially coupled serially concatenated codes (SC-SCCs). We review the main principles of SC-TCs and discuss their exact density evolution (DE) analysis on the binary erasure channel. We also consider the construction of a family of rate-compatible SC-SCCs with simple 4-state component encoders. For all considered code rates, threshold saturation of the belief prop"},"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":"1407.0516","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-02T10:54:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"662b8e79600231200c3e648c783eec1c51345a6ee62a8f22edd03e6600388bac","abstract_canon_sha256":"9c68a20a37ef5883ca49cfe39791829fbe27473025e6492d6711f0e956ffc6c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:26.703105Z","signature_b64":"uiK2+FXjdQJkq5SOdcRSXh9uI5/WT2LrSIQdQ6nHljNHDkIEthWo2r9YBJwmb0X1wBKoEPQvrqaR3WjzCwgVCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3b0e7774dbbc05669abf103fa9f3137f4a55456e1e7604187082499cb5e3698","last_reissued_at":"2026-05-18T02:48:26.702636Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:26.702636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spatially Coupled Turbo Codes: Principles and Finite Length Performance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Michael Lentmaier, Saeedeh Moloudi","submitted_at":"2014-07-02T10:54:37Z","abstract_excerpt":"In this paper, we give an overview of spatially coupled turbo codes (SC-TCs), the spatial coupling of parallel and serially concatenated convolutional codes, recently introduced by the authors. For presentation purposes, we focus on spatially coupled serially concatenated codes (SC-SCCs). We review the main principles of SC-TCs and discuss their exact density evolution (DE) analysis on the binary erasure channel. We also consider the construction of a family of rate-compatible SC-SCCs with simple 4-state component encoders. For all considered code rates, threshold saturation of the belief prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0516","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":"1407.0516","created_at":"2026-05-18T02:48:26.702705+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.0516v1","created_at":"2026-05-18T02:48:26.702705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0516","created_at":"2026-05-18T02:48:26.702705+00:00"},{"alias_kind":"pith_short_12","alias_value":"UOYOO52NXPAF","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UOYOO52NXPAFM2NL","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UOYOO52N","created_at":"2026-05-18T12:28:52.271510+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/UOYOO52NXPAFM2NL6EB7VHZRG7","json":"https://pith.science/pith/UOYOO52NXPAFM2NL6EB7VHZRG7.json","graph_json":"https://pith.science/api/pith-number/UOYOO52NXPAFM2NL6EB7VHZRG7/graph.json","events_json":"https://pith.science/api/pith-number/UOYOO52NXPAFM2NL6EB7VHZRG7/events.json","paper":"https://pith.science/paper/UOYOO52N"},"agent_actions":{"view_html":"https://pith.science/pith/UOYOO52NXPAFM2NL6EB7VHZRG7","download_json":"https://pith.science/pith/UOYOO52NXPAFM2NL6EB7VHZRG7.json","view_paper":"https://pith.science/paper/UOYOO52N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.0516&json=true","fetch_graph":"https://pith.science/api/pith-number/UOYOO52NXPAFM2NL6EB7VHZRG7/graph.json","fetch_events":"https://pith.science/api/pith-number/UOYOO52NXPAFM2NL6EB7VHZRG7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UOYOO52NXPAFM2NL6EB7VHZRG7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UOYOO52NXPAFM2NL6EB7VHZRG7/action/storage_attestation","attest_author":"https://pith.science/pith/UOYOO52NXPAFM2NL6EB7VHZRG7/action/author_attestation","sign_citation":"https://pith.science/pith/UOYOO52NXPAFM2NL6EB7VHZRG7/action/citation_signature","submit_replication":"https://pith.science/pith/UOYOO52NXPAFM2NL6EB7VHZRG7/action/replication_record"}},"created_at":"2026-05-18T02:48:26.702705+00:00","updated_at":"2026-05-18T02:48:26.702705+00:00"}