{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:V3PQH5HSA4SIAGFLJIYJ3D32DJ","short_pith_number":"pith:V3PQH5HS","schema_version":"1.0","canonical_sha256":"aedf03f4f207248018ab4a309d8f7a1a4d84ce26ac16b20a4fff3ed764c02424","source":{"kind":"arxiv","id":"1705.02091","version":4},"attestation_state":"computed","paper":{"title":"Techniques for improving the finite length performance of sparse superposition codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Adam Greig, Ramji Venkataramanan","submitted_at":"2017-05-05T05:45:48Z","abstract_excerpt":"Sparse superposition codes are a recent class of codes introduced by Barron and Joseph for efficient communication over the AWGN channel. With an appropriate power allocation, these codes have been shown to be asymptotically capacity-achieving with computationally feasible decoding. However, a direct implementation of the capacity-achieving construction does not give good finite length error performance. In this paper, we consider sparse superposition codes with approximate message passing (AMP) decoding, and describe a variety of techniques to improve their finite length performance. These in"},"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":"1705.02091","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-05T05:45:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"83874394ed1ac95200af27f7ed20b2b3cfa0501310ecdd280f433790df93c14d","abstract_canon_sha256":"32923b18b04365856d89f7049d46b6386cd5df65ed85387025b55fdc12f807e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:52.318386Z","signature_b64":"Q4N5E3wgn1FL/ebC0WbXFLi9Og0mXVuMWmEHo4z2QxBqwa34+7yDHRBwsfNmcP+vv8myxF/qEEAlZ4R8UbsFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aedf03f4f207248018ab4a309d8f7a1a4d84ce26ac16b20a4fff3ed764c02424","last_reissued_at":"2026-05-18T00:20:52.317441Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:52.317441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Techniques for improving the finite length performance of sparse superposition codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Adam Greig, Ramji Venkataramanan","submitted_at":"2017-05-05T05:45:48Z","abstract_excerpt":"Sparse superposition codes are a recent class of codes introduced by Barron and Joseph for efficient communication over the AWGN channel. With an appropriate power allocation, these codes have been shown to be asymptotically capacity-achieving with computationally feasible decoding. However, a direct implementation of the capacity-achieving construction does not give good finite length error performance. In this paper, we consider sparse superposition codes with approximate message passing (AMP) decoding, and describe a variety of techniques to improve their finite length performance. These in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02091","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":"1705.02091","created_at":"2026-05-18T00:20:52.317503+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.02091v4","created_at":"2026-05-18T00:20:52.317503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02091","created_at":"2026-05-18T00:20:52.317503+00:00"},{"alias_kind":"pith_short_12","alias_value":"V3PQH5HSA4SI","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"V3PQH5HSA4SIAGFL","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"V3PQH5HS","created_at":"2026-05-18T12:31:49.984773+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/V3PQH5HSA4SIAGFLJIYJ3D32DJ","json":"https://pith.science/pith/V3PQH5HSA4SIAGFLJIYJ3D32DJ.json","graph_json":"https://pith.science/api/pith-number/V3PQH5HSA4SIAGFLJIYJ3D32DJ/graph.json","events_json":"https://pith.science/api/pith-number/V3PQH5HSA4SIAGFLJIYJ3D32DJ/events.json","paper":"https://pith.science/paper/V3PQH5HS"},"agent_actions":{"view_html":"https://pith.science/pith/V3PQH5HSA4SIAGFLJIYJ3D32DJ","download_json":"https://pith.science/pith/V3PQH5HSA4SIAGFLJIYJ3D32DJ.json","view_paper":"https://pith.science/paper/V3PQH5HS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.02091&json=true","fetch_graph":"https://pith.science/api/pith-number/V3PQH5HSA4SIAGFLJIYJ3D32DJ/graph.json","fetch_events":"https://pith.science/api/pith-number/V3PQH5HSA4SIAGFLJIYJ3D32DJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V3PQH5HSA4SIAGFLJIYJ3D32DJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V3PQH5HSA4SIAGFLJIYJ3D32DJ/action/storage_attestation","attest_author":"https://pith.science/pith/V3PQH5HSA4SIAGFLJIYJ3D32DJ/action/author_attestation","sign_citation":"https://pith.science/pith/V3PQH5HSA4SIAGFLJIYJ3D32DJ/action/citation_signature","submit_replication":"https://pith.science/pith/V3PQH5HSA4SIAGFLJIYJ3D32DJ/action/replication_record"}},"created_at":"2026-05-18T00:20:52.317503+00:00","updated_at":"2026-05-18T00:20:52.317503+00:00"}