{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NPHAGYWWASTMHOJRPCQDF256N4","short_pith_number":"pith:NPHAGYWW","schema_version":"1.0","canonical_sha256":"6bce0362d604a6c3b93178a032ebbe6f03f02d828e1753ff922400b25d6e6468","source":{"kind":"arxiv","id":"1309.7910","version":3},"attestation_state":"computed","paper":{"title":"A Simple Proof of Maxwell 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":"2013-09-30T16:29:43Z","abstract_excerpt":"Low-density parity-check (LDPC) convolutional codes (or spatially-coupled codes) were recently shown to approach capacity on the binary erasure channel (BEC) and binary-input memoryless symmetric channels. The mechanism behind this spectacular performance is now called threshold saturation via spatial coupling. This new phenomenon is characterized by the belief-propagation threshold of the spatially-coupled ensemble increasing to an intrinsic noise threshold defined by the uncoupled system. In this paper, we present a simple proof of threshold saturation that applies to a wide class of coupled"},"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":"1309.7910","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-30T16:29:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bc5c4eb0bf41e86f0449cbb1894bf3d0303fe848ccce38022edff369334b817a","abstract_canon_sha256":"cf88e4445e03634999001c23bd3919eba6d194c3643f930c67f97f4a0c5ceb5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:16.763766Z","signature_b64":"2aaLyGdUe6dbIS30zsp/bBNwFrUa03Y/NoMoeqSDht5fm7UOAlIFFmk+SNuGX3a/XHRsPi3YFU8FhCqXu/RoDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bce0362d604a6c3b93178a032ebbe6f03f02d828e1753ff922400b25d6e6468","last_reissued_at":"2026-05-18T00:58:16.763045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:16.763045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Simple Proof of Maxwell 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":"2013-09-30T16:29:43Z","abstract_excerpt":"Low-density parity-check (LDPC) convolutional codes (or spatially-coupled codes) were recently shown to approach capacity on the binary erasure channel (BEC) and binary-input memoryless symmetric channels. The mechanism behind this spectacular performance is now called threshold saturation via spatial coupling. This new phenomenon is characterized by the belief-propagation threshold of the spatially-coupled ensemble increasing to an intrinsic noise threshold defined by the uncoupled system. In this paper, we present a simple proof of threshold saturation that applies to a wide class of coupled"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7910","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":"1309.7910","created_at":"2026-05-18T00:58:16.763164+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.7910v3","created_at":"2026-05-18T00:58:16.763164+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7910","created_at":"2026-05-18T00:58:16.763164+00:00"},{"alias_kind":"pith_short_12","alias_value":"NPHAGYWWASTM","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NPHAGYWWASTMHOJR","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NPHAGYWW","created_at":"2026-05-18T12:27:52.871228+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/NPHAGYWWASTMHOJRPCQDF256N4","json":"https://pith.science/pith/NPHAGYWWASTMHOJRPCQDF256N4.json","graph_json":"https://pith.science/api/pith-number/NPHAGYWWASTMHOJRPCQDF256N4/graph.json","events_json":"https://pith.science/api/pith-number/NPHAGYWWASTMHOJRPCQDF256N4/events.json","paper":"https://pith.science/paper/NPHAGYWW"},"agent_actions":{"view_html":"https://pith.science/pith/NPHAGYWWASTMHOJRPCQDF256N4","download_json":"https://pith.science/pith/NPHAGYWWASTMHOJRPCQDF256N4.json","view_paper":"https://pith.science/paper/NPHAGYWW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.7910&json=true","fetch_graph":"https://pith.science/api/pith-number/NPHAGYWWASTMHOJRPCQDF256N4/graph.json","fetch_events":"https://pith.science/api/pith-number/NPHAGYWWASTMHOJRPCQDF256N4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NPHAGYWWASTMHOJRPCQDF256N4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NPHAGYWWASTMHOJRPCQDF256N4/action/storage_attestation","attest_author":"https://pith.science/pith/NPHAGYWWASTMHOJRPCQDF256N4/action/author_attestation","sign_citation":"https://pith.science/pith/NPHAGYWWASTMHOJRPCQDF256N4/action/citation_signature","submit_replication":"https://pith.science/pith/NPHAGYWWASTMHOJRPCQDF256N4/action/replication_record"}},"created_at":"2026-05-18T00:58:16.763164+00:00","updated_at":"2026-05-18T00:58:16.763164+00:00"}