{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:M6C46MLVH4OGWUCQ4DW7JRJF2V","short_pith_number":"pith:M6C46MLV","canonical_record":{"source":{"id":"1707.04203","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-13T16:26:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"64729778048d9e013276efed0464fb8a90589feaa52f1a137f1017a378a2153e","abstract_canon_sha256":"d6b44879e4400dc3a2d55eb223017455fbaf1b2fde838fd6126cdba4637e8cd8"},"schema_version":"1.0"},"canonical_sha256":"6785cf31753f1c6b5050e0edf4c525d57ebd0146f6eac3fb331594ca5396ec74","source":{"kind":"arxiv","id":"1707.04203","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04203","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04203v2","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04203","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"pith_short_12","alias_value":"M6C46MLVH4OG","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"M6C46MLVH4OGWUCQ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"M6C46MLV","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:M6C46MLVH4OGWUCQ4DW7JRJF2V","target":"record","payload":{"canonical_record":{"source":{"id":"1707.04203","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-13T16:26:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"64729778048d9e013276efed0464fb8a90589feaa52f1a137f1017a378a2153e","abstract_canon_sha256":"d6b44879e4400dc3a2d55eb223017455fbaf1b2fde838fd6126cdba4637e8cd8"},"schema_version":"1.0"},"canonical_sha256":"6785cf31753f1c6b5050e0edf4c525d57ebd0146f6eac3fb331594ca5396ec74","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:15.368407Z","signature_b64":"jP6tySQfZSRzuI6wv0VPreHVPgn2/t+CgyKRHqbrr/cbhaMyz8BAfs7nTWJfL0tXJBuwLbogVjqBshDP9BBMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6785cf31753f1c6b5050e0edf4c525d57ebd0146f6eac3fb331594ca5396ec74","last_reissued_at":"2026-05-18T00:01:15.367911Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:15.367911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.04203","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qsl/7vFEfGF6z2W4pnoJnks6HxkmgzR3I8GaVudP3OO/FhAwYvtf3ovNr01Z3AUlTm8+mrLhvnIWtqzGRZufCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:21:46.476007Z"},"content_sha256":"2eace2a7491fa6cc153795afe92613cfdd4b7e7490d3021447087f2dc836fa8b","schema_version":"1.0","event_id":"sha256:2eace2a7491fa6cc153795afe92613cfdd4b7e7490d3021447087f2dc836fa8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:M6C46MLVH4OGWUCQ4DW7JRJF2V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Universal Sparse Superposition Codes with Spatial Coupling and GAMP Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jean Barbier, Mohamad Dia, Nicolas Macris","submitted_at":"2017-07-13T16:26:31Z","abstract_excerpt":"Sparse superposition codes, or sparse regression codes, constitute a new class of codes which was first introduced for communication over the additive white Gaussian noise (AWGN) channel. It has been shown that such codes are capacity-achieving over the AWGN channel under optimal maximum-likelihood decoding as well as under various efficient iterative decoding schemes equipped with power allocation or spatially coupled constructions. Here, we generalize the analysis of these codes to a much broader setting that includes all memoryless channels. We show, for a large class of memoryless channels"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04203","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l1DGONDDVFb7WghQ7lE5ywMimJAtc/fte6zUZ02uVwJldBBBv/fV9UgB/PAs/xRp+e0gvEPrscdWPu5JFqYbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:21:46.476681Z"},"content_sha256":"d81a617f414f31f8ded2b76d712256f04884c557de2465ba6b95e17879f7b218","schema_version":"1.0","event_id":"sha256:d81a617f414f31f8ded2b76d712256f04884c557de2465ba6b95e17879f7b218"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M6C46MLVH4OGWUCQ4DW7JRJF2V/bundle.json","state_url":"https://pith.science/pith/M6C46MLVH4OGWUCQ4DW7JRJF2V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M6C46MLVH4OGWUCQ4DW7JRJF2V/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T00:21:46Z","links":{"resolver":"https://pith.science/pith/M6C46MLVH4OGWUCQ4DW7JRJF2V","bundle":"https://pith.science/pith/M6C46MLVH4OGWUCQ4DW7JRJF2V/bundle.json","state":"https://pith.science/pith/M6C46MLVH4OGWUCQ4DW7JRJF2V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M6C46MLVH4OGWUCQ4DW7JRJF2V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:M6C46MLVH4OGWUCQ4DW7JRJF2V","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":"d6b44879e4400dc3a2d55eb223017455fbaf1b2fde838fd6126cdba4637e8cd8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-13T16:26:31Z","title_canon_sha256":"64729778048d9e013276efed0464fb8a90589feaa52f1a137f1017a378a2153e"},"schema_version":"1.0","source":{"id":"1707.04203","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04203","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04203v2","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04203","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"pith_short_12","alias_value":"M6C46MLVH4OG","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"M6C46MLVH4OGWUCQ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"M6C46MLV","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:d81a617f414f31f8ded2b76d712256f04884c557de2465ba6b95e17879f7b218","target":"graph","created_at":"2026-05-18T00:01:15Z","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":"Sparse superposition codes, or sparse regression codes, constitute a new class of codes which was first introduced for communication over the additive white Gaussian noise (AWGN) channel. It has been shown that such codes are capacity-achieving over the AWGN channel under optimal maximum-likelihood decoding as well as under various efficient iterative decoding schemes equipped with power allocation or spatially coupled constructions. Here, we generalize the analysis of these codes to a much broader setting that includes all memoryless channels. We show, for a large class of memoryless channels","authors_text":"Jean Barbier, Mohamad Dia, Nicolas Macris","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-13T16:26:31Z","title":"Universal Sparse Superposition Codes with Spatial Coupling and GAMP Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04203","kind":"arxiv","version":2},"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:2eace2a7491fa6cc153795afe92613cfdd4b7e7490d3021447087f2dc836fa8b","target":"record","created_at":"2026-05-18T00:01:15Z","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":"d6b44879e4400dc3a2d55eb223017455fbaf1b2fde838fd6126cdba4637e8cd8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-13T16:26:31Z","title_canon_sha256":"64729778048d9e013276efed0464fb8a90589feaa52f1a137f1017a378a2153e"},"schema_version":"1.0","source":{"id":"1707.04203","kind":"arxiv","version":2}},"canonical_sha256":"6785cf31753f1c6b5050e0edf4c525d57ebd0146f6eac3fb331594ca5396ec74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6785cf31753f1c6b5050e0edf4c525d57ebd0146f6eac3fb331594ca5396ec74","first_computed_at":"2026-05-18T00:01:15.367911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:15.367911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jP6tySQfZSRzuI6wv0VPreHVPgn2/t+CgyKRHqbrr/cbhaMyz8BAfs7nTWJfL0tXJBuwLbogVjqBshDP9BBMDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:15.368407Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04203","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2eace2a7491fa6cc153795afe92613cfdd4b7e7490d3021447087f2dc836fa8b","sha256:d81a617f414f31f8ded2b76d712256f04884c557de2465ba6b95e17879f7b218"],"state_sha256":"c2f4961cbc20b9aec7425613f8c91086d0298d45179bc90c07e359470acdd3b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mb5Pq0aQ6LfIt7N3LQUNGB5h7gpwRsGKl/hmN1MOOC8ecKq0rEkTCYOm9z2PqHgLqd/TwPyM2xVNc4fXvFlaAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:21:46.480240Z","bundle_sha256":"59d8c1664f8d1c5f5a417e80e3b88b2b175b42aa10edd72fe99954235c1cfa54"}}