{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CLLSQCLZPW7XCQFYSSO7GNTUKK","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":"d845f9bb79719b0dd59bd070edc2bd96951314deb8eaf9a538fe854c04ebb117","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-20T18:35:23Z","title_canon_sha256":"87adc2b2c6aa9c4253fbdfe73a4f94b10b5a0c12df716344c73e89ff3c9790c7"},"schema_version":"1.0","source":{"id":"1208.4080","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.4080","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"arxiv_version","alias_value":"1208.4080v3","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.4080","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"pith_short_12","alias_value":"CLLSQCLZPW7X","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CLLSQCLZPW7XCQFY","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CLLSQCLZ","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:b95c9a1979e8364f9050acd72498b985685a0482b401084ce9855e6d6873a474","target":"graph","created_at":"2026-05-18T03:35:38Z","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":"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","authors_text":"Arvind Yedla, Henry D. Pfister, Phong S. Nguyen, Yung-Yih Jian","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-20T18:35:23Z","title":"A Simple Proof of Threshold Saturation for Coupled Vector Recursions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.4080","kind":"arxiv","version":3},"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:e40497e9b645721adf1ad1fcd7f8e9a9a988c2a676a939ee4bcdd5be15ecddfd","target":"record","created_at":"2026-05-18T03:35:38Z","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":"d845f9bb79719b0dd59bd070edc2bd96951314deb8eaf9a538fe854c04ebb117","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-20T18:35:23Z","title_canon_sha256":"87adc2b2c6aa9c4253fbdfe73a4f94b10b5a0c12df716344c73e89ff3c9790c7"},"schema_version":"1.0","source":{"id":"1208.4080","kind":"arxiv","version":3}},"canonical_sha256":"12d72809797dbf7140b8949df336745292d31d63e106693a1dd18b5dbf4f3fe9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12d72809797dbf7140b8949df336745292d31d63e106693a1dd18b5dbf4f3fe9","first_computed_at":"2026-05-18T03:35:38.360095Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:38.360095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4GAsR+cFHErc5YVmQ0yeBuC/i2aAXVLQfyyrRViDIS+s32wpNGtv1p62OqjIcPRCypk0XwxWyiUZwsaYtYjwDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:38.360950Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.4080","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e40497e9b645721adf1ad1fcd7f8e9a9a988c2a676a939ee4bcdd5be15ecddfd","sha256:b95c9a1979e8364f9050acd72498b985685a0482b401084ce9855e6d6873a474"],"state_sha256":"56b8b92e210efd00e324ac5cc939451ac19cbb4b04d2d521dc00dae58992f977"}