{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ISM5U2WFM6RMBQPS7LWVCSRIL7","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":"7580587bb771d8dcb522fa036b89ed47af598d9ed7c7bbc1137be36ecd7d2c29","cross_cats_sorted":["cond-mat.dis-nn","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-15T08:43:25Z","title_canon_sha256":"caa16e6627a826bdf31c3b7776df84234c4c9898b88d737542560df5a8b3395e"},"schema_version":"1.0","source":{"id":"1603.04591","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04591","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04591v1","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04591","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"pith_short_12","alias_value":"ISM5U2WFM6RM","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"ISM5U2WFM6RMBQPS","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"ISM5U2WF","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:f3c95bb5ec4584bddfe9616b58d41deb44676a85e236063ebba53117a317fdc8","target":"graph","created_at":"2026-05-18T01:19:04Z","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":"We recently proved threshold saturation for spatially coupled sparse superposition codes on the additive white Gaussian noise channel. Here we generalize our analysis to a much broader setting. We show for any memoryless channel that spatial coupling allows generalized approximate message-passing (GAMP) decoding to reach the potential (or Bayes optimal) threshold of the code ensemble. Moreover in the large input alphabet size limit: i) the GAMP algorithmic threshold of the underlying (or uncoupled) code ensemble is simply expressed as a Fisher information; ii) the potential threshold tends to ","authors_text":"Jean Barbier, Mohamad Dia, Nicolas Macris","cross_cats":["cond-mat.dis-nn","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-15T08:43:25Z","title":"Threshold Saturation of Spatially Coupled Sparse Superposition Codes for All Memoryless Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04591","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:253f2381c8f73a9feb08818c9047c714f745891ccb1c914633aedc7e813fab95","target":"record","created_at":"2026-05-18T01:19:04Z","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":"7580587bb771d8dcb522fa036b89ed47af598d9ed7c7bbc1137be36ecd7d2c29","cross_cats_sorted":["cond-mat.dis-nn","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-15T08:43:25Z","title_canon_sha256":"caa16e6627a826bdf31c3b7776df84234c4c9898b88d737542560df5a8b3395e"},"schema_version":"1.0","source":{"id":"1603.04591","kind":"arxiv","version":1}},"canonical_sha256":"4499da6ac567a2c0c1f2faed514a285fc3db14747ad3e6211ec834a2f62ec630","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4499da6ac567a2c0c1f2faed514a285fc3db14747ad3e6211ec834a2f62ec630","first_computed_at":"2026-05-18T01:19:04.420434Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:04.420434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CUn876uf4kCZyH/OuLtPk6FBfbPnopDa7UdcZzbI5jqayU0BjAeBng1Trc2IvZbkeU+HETvCY8mbfdSZ9kUHAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:04.420897Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.04591","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:253f2381c8f73a9feb08818c9047c714f745891ccb1c914633aedc7e813fab95","sha256:f3c95bb5ec4584bddfe9616b58d41deb44676a85e236063ebba53117a317fdc8"],"state_sha256":"c7b3a6ad21144b48c76348ab296faef24dfa0ff187b97e54abf91a405eabdbec"}