{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LDBWJIVA4URXYJV7DBJKMC4QSY","short_pith_number":"pith:LDBWJIVA","canonical_record":{"source":{"id":"1508.02196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-10T10:39:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"669b5ade7e0bbc23e1d77da7e88b169ca1897722a2955b8ba74448df3b6f9bf7","abstract_canon_sha256":"35537c3bd514227a4a1d02bbdfcecf0c53b565dda24a63f3d09a1e8309adc907"},"schema_version":"1.0"},"canonical_sha256":"58c364a2a0e5237c26bf1852a60b909614c5461fb0551020708d9448c2892063","source":{"kind":"arxiv","id":"1508.02196","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02196","created_at":"2026-05-18T01:35:33Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02196v1","created_at":"2026-05-18T01:35:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02196","created_at":"2026-05-18T01:35:33Z"},{"alias_kind":"pith_short_12","alias_value":"LDBWJIVA4URX","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LDBWJIVA4URXYJV7","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LDBWJIVA","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LDBWJIVA4URXYJV7DBJKMC4QSY","target":"record","payload":{"canonical_record":{"source":{"id":"1508.02196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-10T10:39:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"669b5ade7e0bbc23e1d77da7e88b169ca1897722a2955b8ba74448df3b6f9bf7","abstract_canon_sha256":"35537c3bd514227a4a1d02bbdfcecf0c53b565dda24a63f3d09a1e8309adc907"},"schema_version":"1.0"},"canonical_sha256":"58c364a2a0e5237c26bf1852a60b909614c5461fb0551020708d9448c2892063","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:33.901568Z","signature_b64":"6ku4pGHTmz/MJ5sXwcOIukULDYSzGagE74aoM97UTKJKT1bXkneLGRou9Ecs/LBsseXbMyzJIPVzOXsESJEiBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58c364a2a0e5237c26bf1852a60b909614c5461fb0551020708d9448c2892063","last_reissued_at":"2026-05-18T01:35:33.900951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:33.900951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.02196","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-18T01:35:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rPWQR/GnZ1iWCbgU8hxNvWQfSay1dM0JKEix+w2iXm+PPC7Re5AwWJaRR9u0q4PcLkN/sTnjmJnbGP6SVnDtDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:23:10.021699Z"},"content_sha256":"117b6a107b181e232424112db466b2313f773cb799497a1bd0017700720070dc","schema_version":"1.0","event_id":"sha256:117b6a107b181e232424112db466b2313f773cb799497a1bd0017700720070dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LDBWJIVA4URXYJV7DBJKMC4QSY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Threshold Saturation for Spatially Coupled Turbo-like Codes over the Binary Erasure Channel","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":"2015-08-10T10:39:38Z","abstract_excerpt":"In this paper we prove threshold saturation for spatially coupled turbo codes (SC-TCs) and braided convolutional codes (BCCs) over the binary erasure channel. We introduce a compact graph representation for the ensembles of SC-TC and BCC codes which simplifies their description and the analysis of the message passing decoding. We demonstrate that by few assumptions in the ensembles of these codes, it is possible to rewrite their vector recursions in a form which places these ensembles under the category of scalar admissible systems. This allows us to define potential functions and prove thresh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02196","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-18T01:35:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wwGsq5HpF7Gx1YcySJi9Ycvm0cqeyTiiO56VytDjCformeWr/wGc+gQQVgZH/u2qGgIzm5Ekn636Fwkvr7i7AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:23:10.022416Z"},"content_sha256":"3d38166a0ce3eb39da564068d465b2009fc753e8636eff337268761029cf4a0e","schema_version":"1.0","event_id":"sha256:3d38166a0ce3eb39da564068d465b2009fc753e8636eff337268761029cf4a0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LDBWJIVA4URXYJV7DBJKMC4QSY/bundle.json","state_url":"https://pith.science/pith/LDBWJIVA4URXYJV7DBJKMC4QSY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LDBWJIVA4URXYJV7DBJKMC4QSY/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-25T17:23:10Z","links":{"resolver":"https://pith.science/pith/LDBWJIVA4URXYJV7DBJKMC4QSY","bundle":"https://pith.science/pith/LDBWJIVA4URXYJV7DBJKMC4QSY/bundle.json","state":"https://pith.science/pith/LDBWJIVA4URXYJV7DBJKMC4QSY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LDBWJIVA4URXYJV7DBJKMC4QSY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LDBWJIVA4URXYJV7DBJKMC4QSY","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":"35537c3bd514227a4a1d02bbdfcecf0c53b565dda24a63f3d09a1e8309adc907","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-10T10:39:38Z","title_canon_sha256":"669b5ade7e0bbc23e1d77da7e88b169ca1897722a2955b8ba74448df3b6f9bf7"},"schema_version":"1.0","source":{"id":"1508.02196","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02196","created_at":"2026-05-18T01:35:33Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02196v1","created_at":"2026-05-18T01:35:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02196","created_at":"2026-05-18T01:35:33Z"},{"alias_kind":"pith_short_12","alias_value":"LDBWJIVA4URX","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LDBWJIVA4URXYJV7","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LDBWJIVA","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:3d38166a0ce3eb39da564068d465b2009fc753e8636eff337268761029cf4a0e","target":"graph","created_at":"2026-05-18T01:35:33Z","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 prove threshold saturation for spatially coupled turbo codes (SC-TCs) and braided convolutional codes (BCCs) over the binary erasure channel. We introduce a compact graph representation for the ensembles of SC-TC and BCC codes which simplifies their description and the analysis of the message passing decoding. We demonstrate that by few assumptions in the ensembles of these codes, it is possible to rewrite their vector recursions in a form which places these ensembles under the category of scalar admissible systems. This allows us to define potential functions and prove thresh","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":"2015-08-10T10:39:38Z","title":"Threshold Saturation for Spatially Coupled Turbo-like Codes over the Binary Erasure Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02196","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:117b6a107b181e232424112db466b2313f773cb799497a1bd0017700720070dc","target":"record","created_at":"2026-05-18T01:35:33Z","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":"35537c3bd514227a4a1d02bbdfcecf0c53b565dda24a63f3d09a1e8309adc907","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-10T10:39:38Z","title_canon_sha256":"669b5ade7e0bbc23e1d77da7e88b169ca1897722a2955b8ba74448df3b6f9bf7"},"schema_version":"1.0","source":{"id":"1508.02196","kind":"arxiv","version":1}},"canonical_sha256":"58c364a2a0e5237c26bf1852a60b909614c5461fb0551020708d9448c2892063","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58c364a2a0e5237c26bf1852a60b909614c5461fb0551020708d9448c2892063","first_computed_at":"2026-05-18T01:35:33.900951Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:33.900951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6ku4pGHTmz/MJ5sXwcOIukULDYSzGagE74aoM97UTKJKT1bXkneLGRou9Ecs/LBsseXbMyzJIPVzOXsESJEiBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:33.901568Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.02196","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:117b6a107b181e232424112db466b2313f773cb799497a1bd0017700720070dc","sha256:3d38166a0ce3eb39da564068d465b2009fc753e8636eff337268761029cf4a0e"],"state_sha256":"60e2da8fa5f0a1f81c043663fd89805625dccfd1176b932e56bb0d7a641ad34a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zAVWUjuxUG2LHa2HqtUU0wdfDKxAhuz74Nulb77Dtlx7BPIWcrVjfRvIKXn2hxvbIL3/p9hcOwcLZrzztDU2CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:23:10.026052Z","bundle_sha256":"480c8c9fe45af9024232b9505ef2ea24df5265fe9f4e1f0ebb8f798179dae1c3"}}