{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YOSSS3CDSR2PKDCPRQIXIFIZKZ","short_pith_number":"pith:YOSSS3CD","schema_version":"1.0","canonical_sha256":"c3a5296c439474f50c4f8c11741519564ba6281bb3a90b30a299ac69f53a5070","source":{"kind":"arxiv","id":"1712.06866","version":4},"attestation_state":"computed","paper":{"title":"The Error Probability of Sparse Superposition Codes with Approximate Message Passing Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cynthia Rush, Ramji Venkataramanan","submitted_at":"2017-12-19T11:06:08Z","abstract_excerpt":"Sparse superposition codes, or sparse regression codes (SPARCs), are a recent class of codes for reliable communication over the AWGN channel at rates approaching the channel capacity. Approximate message passing (AMP) decoding, a computationally efficient technique for decoding SPARCs, has been proven to be asymptotically capacity-achieving for the AWGN channel. In this paper, we refine the asymptotic result by deriving a large deviations bound on the probability of AMP decoding error. This bound gives insight into the error performance of the AMP decoder for large but finite problem sizes, g"},"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":"1712.06866","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-19T11:06:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"aa2311835eac494873f1b672ffda920a212f5ad098ad5be649d18b4e3554ad9a","abstract_canon_sha256":"09fe2a7ecc31db4eb4e5a0f40acae31042a6b63ffc45bc1508bc85ba03bfda9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:02.189241Z","signature_b64":"iatBPq1ZwNdRjczp2AIrb3MS+ACKAYAws/UQc0prkmveKrRCWEC+pC+UXHILn2jXbltqA4qlAJ6IMSp8yCxEBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3a5296c439474f50c4f8c11741519564ba6281bb3a90b30a299ac69f53a5070","last_reissued_at":"2026-05-17T23:48:02.188607Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:02.188607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Error Probability of Sparse Superposition Codes with Approximate Message Passing Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cynthia Rush, Ramji Venkataramanan","submitted_at":"2017-12-19T11:06:08Z","abstract_excerpt":"Sparse superposition codes, or sparse regression codes (SPARCs), are a recent class of codes for reliable communication over the AWGN channel at rates approaching the channel capacity. Approximate message passing (AMP) decoding, a computationally efficient technique for decoding SPARCs, has been proven to be asymptotically capacity-achieving for the AWGN channel. In this paper, we refine the asymptotic result by deriving a large deviations bound on the probability of AMP decoding error. This bound gives insight into the error performance of the AMP decoder for large but finite problem sizes, g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06866","kind":"arxiv","version":4},"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":"1712.06866","created_at":"2026-05-17T23:48:02.188689+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.06866v4","created_at":"2026-05-17T23:48:02.188689+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06866","created_at":"2026-05-17T23:48:02.188689+00:00"},{"alias_kind":"pith_short_12","alias_value":"YOSSS3CDSR2P","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YOSSS3CDSR2PKDCP","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YOSSS3CD","created_at":"2026-05-18T12:31:56.362134+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/YOSSS3CDSR2PKDCPRQIXIFIZKZ","json":"https://pith.science/pith/YOSSS3CDSR2PKDCPRQIXIFIZKZ.json","graph_json":"https://pith.science/api/pith-number/YOSSS3CDSR2PKDCPRQIXIFIZKZ/graph.json","events_json":"https://pith.science/api/pith-number/YOSSS3CDSR2PKDCPRQIXIFIZKZ/events.json","paper":"https://pith.science/paper/YOSSS3CD"},"agent_actions":{"view_html":"https://pith.science/pith/YOSSS3CDSR2PKDCPRQIXIFIZKZ","download_json":"https://pith.science/pith/YOSSS3CDSR2PKDCPRQIXIFIZKZ.json","view_paper":"https://pith.science/paper/YOSSS3CD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.06866&json=true","fetch_graph":"https://pith.science/api/pith-number/YOSSS3CDSR2PKDCPRQIXIFIZKZ/graph.json","fetch_events":"https://pith.science/api/pith-number/YOSSS3CDSR2PKDCPRQIXIFIZKZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YOSSS3CDSR2PKDCPRQIXIFIZKZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YOSSS3CDSR2PKDCPRQIXIFIZKZ/action/storage_attestation","attest_author":"https://pith.science/pith/YOSSS3CDSR2PKDCPRQIXIFIZKZ/action/author_attestation","sign_citation":"https://pith.science/pith/YOSSS3CDSR2PKDCPRQIXIFIZKZ/action/citation_signature","submit_replication":"https://pith.science/pith/YOSSS3CDSR2PKDCPRQIXIFIZKZ/action/replication_record"}},"created_at":"2026-05-17T23:48:02.188689+00:00","updated_at":"2026-05-17T23:48:02.188689+00:00"}