{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UOYOO52NXPAFM2NL6EB7VHZRG7","short_pith_number":"pith:UOYOO52N","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"},"canonical_sha256":"a3b0e7774dbbc05669abf103fa9f3137f4a55456e1e7604187082499cb5e3698","source":{"kind":"arxiv","id":"1407.0516","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0516","created_at":"2026-05-18T02:48:26Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0516v1","created_at":"2026-05-18T02:48:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0516","created_at":"2026-05-18T02:48:26Z"},{"alias_kind":"pith_short_12","alias_value":"UOYOO52NXPAF","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UOYOO52NXPAFM2NL","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UOYOO52N","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UOYOO52NXPAFM2NL6EB7VHZRG7","target":"record","payload":{"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"},"canonical_sha256":"a3b0e7774dbbc05669abf103fa9f3137f4a55456e1e7604187082499cb5e3698","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"},"source_kind":"arxiv","source_id":"1407.0516","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-18T02:48:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/KcrJH4xxVjXiYh42oNF82N5XbDYmL5JHiUHOzczyYsimkHvL3RLUol3gx389WATQsROWLH8tWRsZkOJl5FSBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T07:00:53.370562Z"},"content_sha256":"50e226ab994468e4108abf86d1ab604f073d8b7eeed6802f35c36809c53c4eeb","schema_version":"1.0","event_id":"sha256:50e226ab994468e4108abf86d1ab604f073d8b7eeed6802f35c36809c53c4eeb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UOYOO52NXPAFM2NL6EB7VHZRG7","target":"graph","payload":{"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"},"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-18T02:48:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aLkEqXOZuT2ikJiQfrYexCnVZoxe3KNw4DSPDO3L7PmEnqzOhqGrjQ8qybbYQjuiuL2dsviTLvdZitLIXLsbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T07:00:53.370908Z"},"content_sha256":"801e81b4088d0a1f2b3d6ad1b2493895db557abc9484f6c5e61ef753aacb0115","schema_version":"1.0","event_id":"sha256:801e81b4088d0a1f2b3d6ad1b2493895db557abc9484f6c5e61ef753aacb0115"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UOYOO52NXPAFM2NL6EB7VHZRG7/bundle.json","state_url":"https://pith.science/pith/UOYOO52NXPAFM2NL6EB7VHZRG7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UOYOO52NXPAFM2NL6EB7VHZRG7/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-20T07:00:53Z","links":{"resolver":"https://pith.science/pith/UOYOO52NXPAFM2NL6EB7VHZRG7","bundle":"https://pith.science/pith/UOYOO52NXPAFM2NL6EB7VHZRG7/bundle.json","state":"https://pith.science/pith/UOYOO52NXPAFM2NL6EB7VHZRG7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UOYOO52NXPAFM2NL6EB7VHZRG7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UOYOO52NXPAFM2NL6EB7VHZRG7","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":"9c68a20a37ef5883ca49cfe39791829fbe27473025e6492d6711f0e956ffc6c6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-02T10:54:37Z","title_canon_sha256":"662b8e79600231200c3e648c783eec1c51345a6ee62a8f22edd03e6600388bac"},"schema_version":"1.0","source":{"id":"1407.0516","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0516","created_at":"2026-05-18T02:48:26Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0516v1","created_at":"2026-05-18T02:48:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0516","created_at":"2026-05-18T02:48:26Z"},{"alias_kind":"pith_short_12","alias_value":"UOYOO52NXPAF","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UOYOO52NXPAFM2NL","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UOYOO52N","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:801e81b4088d0a1f2b3d6ad1b2493895db557abc9484f6c5e61ef753aacb0115","target":"graph","created_at":"2026-05-18T02:48:26Z","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":"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","authors_text":"Alexandre Graell i Amat, Michael Lentmaier, Saeedeh Moloudi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-02T10:54:37Z","title":"Spatially Coupled Turbo Codes: Principles and Finite Length Performance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0516","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:50e226ab994468e4108abf86d1ab604f073d8b7eeed6802f35c36809c53c4eeb","target":"record","created_at":"2026-05-18T02:48:26Z","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":"9c68a20a37ef5883ca49cfe39791829fbe27473025e6492d6711f0e956ffc6c6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-02T10:54:37Z","title_canon_sha256":"662b8e79600231200c3e648c783eec1c51345a6ee62a8f22edd03e6600388bac"},"schema_version":"1.0","source":{"id":"1407.0516","kind":"arxiv","version":1}},"canonical_sha256":"a3b0e7774dbbc05669abf103fa9f3137f4a55456e1e7604187082499cb5e3698","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3b0e7774dbbc05669abf103fa9f3137f4a55456e1e7604187082499cb5e3698","first_computed_at":"2026-05-18T02:48:26.702636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:26.702636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uiK2+FXjdQJkq5SOdcRSXh9uI5/WT2LrSIQdQ6nHljNHDkIEthWo2r9YBJwmb0X1wBKoEPQvrqaR3WjzCwgVCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:26.703105Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.0516","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50e226ab994468e4108abf86d1ab604f073d8b7eeed6802f35c36809c53c4eeb","sha256:801e81b4088d0a1f2b3d6ad1b2493895db557abc9484f6c5e61ef753aacb0115"],"state_sha256":"4e883250d9501381e63b4e9e6f58a3451d6ca269ffa7101bb1ff785ef342ce7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vLVs66cqdN8eVvutpC1wPBf0eRMzBP1bOoQuIqJeetxCQo5p9PhsAL9cytp3mr5wLxpBULHb1kq+4CsIaDw6DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T07:00:53.372954Z","bundle_sha256":"befa50d2e81da77bf7f3a107827d83a0673deb9ba33557da8b18e80dd7495177"}}