{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4C2D3MUXYPCXK7X6LE5OT2YVGD","short_pith_number":"pith:4C2D3MUX","schema_version":"1.0","canonical_sha256":"e0b43db297c3c5757efe593ae9eb1530d931bfc67368c9221be5775e26da2ea1","source":{"kind":"arxiv","id":"1207.2406","version":1},"attestation_state":"computed","paper":{"title":"Fast Sparse Superposition Codes have Exponentially Small Error Probability for R < C","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Andrew Barron, Antony Joseph","submitted_at":"2012-07-10T16:35:03Z","abstract_excerpt":"For the additive white Gaussian noise channel with average codeword power constraint, sparse superposition codes are developed. These codes are based on the statistical high-dimensional regression framework. The paper [IEEE Trans. Inform. Theory 55 (2012), 2541 - 2557] investigated decoding using the optimal maximum-likelihood decoding scheme. Here a fast decoding algorithm, called adaptive successive decoder, is developed. For any rate R less than the capacity C communication is shown to be reliable with exponentially small error probability."},"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":"1207.2406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-10T16:35:03Z","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"title_canon_sha256":"5820b60a893d0b6c62f951b7ed58bc35597b93a65495658400c3c5da9c0352b1","abstract_canon_sha256":"eb51c838d50587b9cdf9a80942bb5c97d9a4186ea1dd47e6d9fc4006265bc855"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:24.210735Z","signature_b64":"L2PupGtBTLJfMZwQlkmoD9/U5rBjuLlmbivFy0Y6vnhK5qTzfh6qn3LWnbVhKn58XeYr/xS+r/4acEeXtvZ6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0b43db297c3c5757efe593ae9eb1530d931bfc67368c9221be5775e26da2ea1","last_reissued_at":"2026-05-18T03:51:24.210262Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:24.210262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Sparse Superposition Codes have Exponentially Small Error Probability for R < C","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Andrew Barron, Antony Joseph","submitted_at":"2012-07-10T16:35:03Z","abstract_excerpt":"For the additive white Gaussian noise channel with average codeword power constraint, sparse superposition codes are developed. These codes are based on the statistical high-dimensional regression framework. The paper [IEEE Trans. Inform. Theory 55 (2012), 2541 - 2557] investigated decoding using the optimal maximum-likelihood decoding scheme. Here a fast decoding algorithm, called adaptive successive decoder, is developed. For any rate R less than the capacity C communication is shown to be reliable with exponentially small error probability."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2406","kind":"arxiv","version":1},"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":"1207.2406","created_at":"2026-05-18T03:51:24.210340+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.2406v1","created_at":"2026-05-18T03:51:24.210340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2406","created_at":"2026-05-18T03:51:24.210340+00:00"},{"alias_kind":"pith_short_12","alias_value":"4C2D3MUXYPCX","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4C2D3MUXYPCXK7X6","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4C2D3MUX","created_at":"2026-05-18T12:26:53.410803+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/4C2D3MUXYPCXK7X6LE5OT2YVGD","json":"https://pith.science/pith/4C2D3MUXYPCXK7X6LE5OT2YVGD.json","graph_json":"https://pith.science/api/pith-number/4C2D3MUXYPCXK7X6LE5OT2YVGD/graph.json","events_json":"https://pith.science/api/pith-number/4C2D3MUXYPCXK7X6LE5OT2YVGD/events.json","paper":"https://pith.science/paper/4C2D3MUX"},"agent_actions":{"view_html":"https://pith.science/pith/4C2D3MUXYPCXK7X6LE5OT2YVGD","download_json":"https://pith.science/pith/4C2D3MUXYPCXK7X6LE5OT2YVGD.json","view_paper":"https://pith.science/paper/4C2D3MUX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.2406&json=true","fetch_graph":"https://pith.science/api/pith-number/4C2D3MUXYPCXK7X6LE5OT2YVGD/graph.json","fetch_events":"https://pith.science/api/pith-number/4C2D3MUXYPCXK7X6LE5OT2YVGD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4C2D3MUXYPCXK7X6LE5OT2YVGD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4C2D3MUXYPCXK7X6LE5OT2YVGD/action/storage_attestation","attest_author":"https://pith.science/pith/4C2D3MUXYPCXK7X6LE5OT2YVGD/action/author_attestation","sign_citation":"https://pith.science/pith/4C2D3MUXYPCXK7X6LE5OT2YVGD/action/citation_signature","submit_replication":"https://pith.science/pith/4C2D3MUXYPCXK7X6LE5OT2YVGD/action/replication_record"}},"created_at":"2026-05-18T03:51:24.210340+00:00","updated_at":"2026-05-18T03:51:24.210340+00:00"}