{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YOSSS3CDSR2PKDCPRQIXIFIZKZ","short_pith_number":"pith:YOSSS3CD","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"},"canonical_sha256":"c3a5296c439474f50c4f8c11741519564ba6281bb3a90b30a299ac69f53a5070","source":{"kind":"arxiv","id":"1712.06866","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06866","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06866v4","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06866","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"pith_short_12","alias_value":"YOSSS3CDSR2P","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YOSSS3CDSR2PKDCP","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YOSSS3CD","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YOSSS3CDSR2PKDCPRQIXIFIZKZ","target":"record","payload":{"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"},"canonical_sha256":"c3a5296c439474f50c4f8c11741519564ba6281bb3a90b30a299ac69f53a5070","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"},"source_kind":"arxiv","source_id":"1712.06866","source_version":4,"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-17T23:48:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"guBrZwKKNCeno56N8n55uQbhwkLe4lC9gmVUDKJBG5RQEFEQAOe0qtsN9oUd6xihOsQubJS+ou25tYnC6S3IAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:36:31.948403Z"},"content_sha256":"b62be42548a5a25152539bd9f7a10acc1c7b8edd818c5a61be09e0c08904d613","schema_version":"1.0","event_id":"sha256:b62be42548a5a25152539bd9f7a10acc1c7b8edd818c5a61be09e0c08904d613"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YOSSS3CDSR2PKDCPRQIXIFIZKZ","target":"graph","payload":{"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"},"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-17T23:48:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1WRf6z27YoF3biWNv6F/YcjzxHZZcuTgc0mJn5lYFmjzVDGsNf/gRVS/y8SqkdwhTN4o0SrgaXqw+Lt+aE5UDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:36:31.948783Z"},"content_sha256":"2c9d8a229511cd8b01a25e1ab9ff13d034fe059144754ffab54edcf39fef45eb","schema_version":"1.0","event_id":"sha256:2c9d8a229511cd8b01a25e1ab9ff13d034fe059144754ffab54edcf39fef45eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YOSSS3CDSR2PKDCPRQIXIFIZKZ/bundle.json","state_url":"https://pith.science/pith/YOSSS3CDSR2PKDCPRQIXIFIZKZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YOSSS3CDSR2PKDCPRQIXIFIZKZ/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-06-25T20:36:31Z","links":{"resolver":"https://pith.science/pith/YOSSS3CDSR2PKDCPRQIXIFIZKZ","bundle":"https://pith.science/pith/YOSSS3CDSR2PKDCPRQIXIFIZKZ/bundle.json","state":"https://pith.science/pith/YOSSS3CDSR2PKDCPRQIXIFIZKZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YOSSS3CDSR2PKDCPRQIXIFIZKZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YOSSS3CDSR2PKDCPRQIXIFIZKZ","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":"09fe2a7ecc31db4eb4e5a0f40acae31042a6b63ffc45bc1508bc85ba03bfda9d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-19T11:06:08Z","title_canon_sha256":"aa2311835eac494873f1b672ffda920a212f5ad098ad5be649d18b4e3554ad9a"},"schema_version":"1.0","source":{"id":"1712.06866","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06866","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06866v4","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06866","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"pith_short_12","alias_value":"YOSSS3CDSR2P","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YOSSS3CDSR2PKDCP","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YOSSS3CD","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:2c9d8a229511cd8b01a25e1ab9ff13d034fe059144754ffab54edcf39fef45eb","target":"graph","created_at":"2026-05-17T23:48:02Z","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 (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","authors_text":"Cynthia Rush, Ramji Venkataramanan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-19T11:06:08Z","title":"The Error Probability of Sparse Superposition Codes with Approximate Message Passing Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06866","kind":"arxiv","version":4},"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:b62be42548a5a25152539bd9f7a10acc1c7b8edd818c5a61be09e0c08904d613","target":"record","created_at":"2026-05-17T23:48:02Z","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":"09fe2a7ecc31db4eb4e5a0f40acae31042a6b63ffc45bc1508bc85ba03bfda9d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-19T11:06:08Z","title_canon_sha256":"aa2311835eac494873f1b672ffda920a212f5ad098ad5be649d18b4e3554ad9a"},"schema_version":"1.0","source":{"id":"1712.06866","kind":"arxiv","version":4}},"canonical_sha256":"c3a5296c439474f50c4f8c11741519564ba6281bb3a90b30a299ac69f53a5070","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3a5296c439474f50c4f8c11741519564ba6281bb3a90b30a299ac69f53a5070","first_computed_at":"2026-05-17T23:48:02.188607Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:02.188607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iatBPq1ZwNdRjczp2AIrb3MS+ACKAYAws/UQc0prkmveKrRCWEC+pC+UXHILn2jXbltqA4qlAJ6IMSp8yCxEBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:02.189241Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.06866","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b62be42548a5a25152539bd9f7a10acc1c7b8edd818c5a61be09e0c08904d613","sha256:2c9d8a229511cd8b01a25e1ab9ff13d034fe059144754ffab54edcf39fef45eb"],"state_sha256":"6a8f16cad453613bc5955b7db1b3a6086602a41676c34892a841cd7a5985ea6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w9IrK4CgwVeOtANIlvGFB+z8vwitwTzYj8878i/8oORWfBjdqSNpCrfTagno9c6wMoF70oDQMhFdmqPd+6cODw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T20:36:31.950844Z","bundle_sha256":"32e2d04c75fcd1111bd515db04d69c578380f55a199ae21a639cb05eb62f3593"}}