{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BZVG7EYN3BLABH4CZKVN4RIZWU","short_pith_number":"pith:BZVG7EYN","schema_version":"1.0","canonical_sha256":"0e6a6f930dd856009f82caaade4519b537531c0041fc1c19270a3e30308775b4","source":{"kind":"arxiv","id":"1204.5703","version":3},"attestation_state":"computed","paper":{"title":"A Simple Proof of Threshold Saturation for Coupled Scalar Recursions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arvind Yedla, Henry D. Pfister, Phong S. Nguyen, Yung-Yih Jian","submitted_at":"2012-04-25T16:44:24Z","abstract_excerpt":"Low-density parity-check (LDPC) convolutional codes (or spatially-coupled codes) have been shown to approach capacity on the binary erasure channel (BEC) and binary-input memoryless symmetric channels. The mechanism behind this spectacular performance is the threshold saturation phenomenon, which is characterized by the belief-propagation threshold of the spatially-coupled ensemble increasing to an intrinsic noise threshold defined by the uncoupled system.\n  In this paper, we present a simple proof of threshold saturation that applies to a broad class of coupled scalar recursions. The conditio"},"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":"1204.5703","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-25T16:44:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"634aa21ece860abffbe2b8c3d5174a56f0d2f36d584b9cae63e60f585cedaa6b","abstract_canon_sha256":"982830624a81f271e47aec629dbb2709b7fa65bef302a1432cad837249e10d7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:15.933829Z","signature_b64":"00MRFWXBv1kO1MH5rj9xNbig0ItkSHjqVeaAzw9GIVDm3+0hmW4lxG+8hyVuEg7dKlWO26kGJL8XNUo+qtRqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e6a6f930dd856009f82caaade4519b537531c0041fc1c19270a3e30308775b4","last_reissued_at":"2026-05-18T02:21:15.933343Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:15.933343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Simple Proof of Threshold Saturation for Coupled Scalar Recursions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arvind Yedla, Henry D. Pfister, Phong S. Nguyen, Yung-Yih Jian","submitted_at":"2012-04-25T16:44:24Z","abstract_excerpt":"Low-density parity-check (LDPC) convolutional codes (or spatially-coupled codes) have been shown to approach capacity on the binary erasure channel (BEC) and binary-input memoryless symmetric channels. The mechanism behind this spectacular performance is the threshold saturation phenomenon, which is characterized by the belief-propagation threshold of the spatially-coupled ensemble increasing to an intrinsic noise threshold defined by the uncoupled system.\n  In this paper, we present a simple proof of threshold saturation that applies to a broad class of coupled scalar recursions. The conditio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5703","kind":"arxiv","version":3},"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":"1204.5703","created_at":"2026-05-18T02:21:15.933413+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.5703v3","created_at":"2026-05-18T02:21:15.933413+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5703","created_at":"2026-05-18T02:21:15.933413+00:00"},{"alias_kind":"pith_short_12","alias_value":"BZVG7EYN3BLA","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"BZVG7EYN3BLABH4C","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"BZVG7EYN","created_at":"2026-05-18T12:27:01.376967+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/BZVG7EYN3BLABH4CZKVN4RIZWU","json":"https://pith.science/pith/BZVG7EYN3BLABH4CZKVN4RIZWU.json","graph_json":"https://pith.science/api/pith-number/BZVG7EYN3BLABH4CZKVN4RIZWU/graph.json","events_json":"https://pith.science/api/pith-number/BZVG7EYN3BLABH4CZKVN4RIZWU/events.json","paper":"https://pith.science/paper/BZVG7EYN"},"agent_actions":{"view_html":"https://pith.science/pith/BZVG7EYN3BLABH4CZKVN4RIZWU","download_json":"https://pith.science/pith/BZVG7EYN3BLABH4CZKVN4RIZWU.json","view_paper":"https://pith.science/paper/BZVG7EYN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.5703&json=true","fetch_graph":"https://pith.science/api/pith-number/BZVG7EYN3BLABH4CZKVN4RIZWU/graph.json","fetch_events":"https://pith.science/api/pith-number/BZVG7EYN3BLABH4CZKVN4RIZWU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BZVG7EYN3BLABH4CZKVN4RIZWU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BZVG7EYN3BLABH4CZKVN4RIZWU/action/storage_attestation","attest_author":"https://pith.science/pith/BZVG7EYN3BLABH4CZKVN4RIZWU/action/author_attestation","sign_citation":"https://pith.science/pith/BZVG7EYN3BLABH4CZKVN4RIZWU/action/citation_signature","submit_replication":"https://pith.science/pith/BZVG7EYN3BLABH4CZKVN4RIZWU/action/replication_record"}},"created_at":"2026-05-18T02:21:15.933413+00:00","updated_at":"2026-05-18T02:21:15.933413+00:00"}