{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CLLSQCLZPW7XCQFYSSO7GNTUKK","short_pith_number":"pith:CLLSQCLZ","schema_version":"1.0","canonical_sha256":"12d72809797dbf7140b8949df336745292d31d63e106693a1dd18b5dbf4f3fe9","source":{"kind":"arxiv","id":"1208.4080","version":3},"attestation_state":"computed","paper":{"title":"A Simple Proof of Threshold Saturation for Coupled Vector 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-08-20T18:35:23Z","abstract_excerpt":"Convolutional low-density parity-check (LDPC) codes (or spatially-coupled codes) have now been shown to achieve capacity on binary-input memoryless symmetric channels. The principle behind this surprising result is the threshold-saturation phenomenon, which is defined by the belief-propagation threshold of the spatially-coupled ensemble saturating to a fundamental threshold defined by the uncoupled system.\n  Previously, the authors demonstrated that potential functions can be used to provide a simple proof of threshold saturation for coupled scalar recursions. In this paper, we present a simpl"},"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":"1208.4080","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-20T18:35:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"87adc2b2c6aa9c4253fbdfe73a4f94b10b5a0c12df716344c73e89ff3c9790c7","abstract_canon_sha256":"d845f9bb79719b0dd59bd070edc2bd96951314deb8eaf9a538fe854c04ebb117"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:38.360950Z","signature_b64":"4GAsR+cFHErc5YVmQ0yeBuC/i2aAXVLQfyyrRViDIS+s32wpNGtv1p62OqjIcPRCypk0XwxWyiUZwsaYtYjwDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12d72809797dbf7140b8949df336745292d31d63e106693a1dd18b5dbf4f3fe9","last_reissued_at":"2026-05-18T03:35:38.360095Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:38.360095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Simple Proof of Threshold Saturation for Coupled Vector 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-08-20T18:35:23Z","abstract_excerpt":"Convolutional low-density parity-check (LDPC) codes (or spatially-coupled codes) have now been shown to achieve capacity on binary-input memoryless symmetric channels. The principle behind this surprising result is the threshold-saturation phenomenon, which is defined by the belief-propagation threshold of the spatially-coupled ensemble saturating to a fundamental threshold defined by the uncoupled system.\n  Previously, the authors demonstrated that potential functions can be used to provide a simple proof of threshold saturation for coupled scalar recursions. In this paper, we present a simpl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.4080","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":"1208.4080","created_at":"2026-05-18T03:35:38.360247+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.4080v3","created_at":"2026-05-18T03:35:38.360247+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.4080","created_at":"2026-05-18T03:35:38.360247+00:00"},{"alias_kind":"pith_short_12","alias_value":"CLLSQCLZPW7X","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CLLSQCLZPW7XCQFY","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CLLSQCLZ","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/CLLSQCLZPW7XCQFYSSO7GNTUKK","json":"https://pith.science/pith/CLLSQCLZPW7XCQFYSSO7GNTUKK.json","graph_json":"https://pith.science/api/pith-number/CLLSQCLZPW7XCQFYSSO7GNTUKK/graph.json","events_json":"https://pith.science/api/pith-number/CLLSQCLZPW7XCQFYSSO7GNTUKK/events.json","paper":"https://pith.science/paper/CLLSQCLZ"},"agent_actions":{"view_html":"https://pith.science/pith/CLLSQCLZPW7XCQFYSSO7GNTUKK","download_json":"https://pith.science/pith/CLLSQCLZPW7XCQFYSSO7GNTUKK.json","view_paper":"https://pith.science/paper/CLLSQCLZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.4080&json=true","fetch_graph":"https://pith.science/api/pith-number/CLLSQCLZPW7XCQFYSSO7GNTUKK/graph.json","fetch_events":"https://pith.science/api/pith-number/CLLSQCLZPW7XCQFYSSO7GNTUKK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CLLSQCLZPW7XCQFYSSO7GNTUKK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CLLSQCLZPW7XCQFYSSO7GNTUKK/action/storage_attestation","attest_author":"https://pith.science/pith/CLLSQCLZPW7XCQFYSSO7GNTUKK/action/author_attestation","sign_citation":"https://pith.science/pith/CLLSQCLZPW7XCQFYSSO7GNTUKK/action/citation_signature","submit_replication":"https://pith.science/pith/CLLSQCLZPW7XCQFYSSO7GNTUKK/action/replication_record"}},"created_at":"2026-05-18T03:35:38.360247+00:00","updated_at":"2026-05-18T03:35:38.360247+00:00"}