{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:V3PQH5HSA4SIAGFLJIYJ3D32DJ","short_pith_number":"pith:V3PQH5HS","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"},"canonical_sha256":"aedf03f4f207248018ab4a309d8f7a1a4d84ce26ac16b20a4fff3ed764c02424","source":{"kind":"arxiv","id":"1705.02091","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02091","created_at":"2026-05-18T00:20:52Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02091v4","created_at":"2026-05-18T00:20:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02091","created_at":"2026-05-18T00:20:52Z"},{"alias_kind":"pith_short_12","alias_value":"V3PQH5HSA4SI","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V3PQH5HSA4SIAGFL","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V3PQH5HS","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:V3PQH5HSA4SIAGFLJIYJ3D32DJ","target":"record","payload":{"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"},"canonical_sha256":"aedf03f4f207248018ab4a309d8f7a1a4d84ce26ac16b20a4fff3ed764c02424","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"},"source_kind":"arxiv","source_id":"1705.02091","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-18T00:20:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nt6yjZ/IsXJRiHK8bIba9CKJ8omwgSU7H7tKJxhbG+nCkcwOOOw8qEyCyfPI+OnPnI9RJcXBMuUvyZ3lZh61Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T05:55:41.163671Z"},"content_sha256":"61045512360923b09fe43ed647044283e644cf2536ee0dea25c4d681bb871188","schema_version":"1.0","event_id":"sha256:61045512360923b09fe43ed647044283e644cf2536ee0dea25c4d681bb871188"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:V3PQH5HSA4SIAGFLJIYJ3D32DJ","target":"graph","payload":{"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"},"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:20:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DeoK52semin0RIRqfBHptiqBCybAc6aZxIiIppqeFS84ohC36aKBbGUwzLWy7dMK5HaUc6pkue6X/BJh6crMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T05:55:41.164041Z"},"content_sha256":"8bd495d103d77f9be9500bd486ee09d31dc55f5f91e29e26014f43e504fad539","schema_version":"1.0","event_id":"sha256:8bd495d103d77f9be9500bd486ee09d31dc55f5f91e29e26014f43e504fad539"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V3PQH5HSA4SIAGFLJIYJ3D32DJ/bundle.json","state_url":"https://pith.science/pith/V3PQH5HSA4SIAGFLJIYJ3D32DJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V3PQH5HSA4SIAGFLJIYJ3D32DJ/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-26T05:55:41Z","links":{"resolver":"https://pith.science/pith/V3PQH5HSA4SIAGFLJIYJ3D32DJ","bundle":"https://pith.science/pith/V3PQH5HSA4SIAGFLJIYJ3D32DJ/bundle.json","state":"https://pith.science/pith/V3PQH5HSA4SIAGFLJIYJ3D32DJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V3PQH5HSA4SIAGFLJIYJ3D32DJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:V3PQH5HSA4SIAGFLJIYJ3D32DJ","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":"32923b18b04365856d89f7049d46b6386cd5df65ed85387025b55fdc12f807e5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-05T05:45:48Z","title_canon_sha256":"83874394ed1ac95200af27f7ed20b2b3cfa0501310ecdd280f433790df93c14d"},"schema_version":"1.0","source":{"id":"1705.02091","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02091","created_at":"2026-05-18T00:20:52Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02091v4","created_at":"2026-05-18T00:20:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02091","created_at":"2026-05-18T00:20:52Z"},{"alias_kind":"pith_short_12","alias_value":"V3PQH5HSA4SI","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V3PQH5HSA4SIAGFL","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V3PQH5HS","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:8bd495d103d77f9be9500bd486ee09d31dc55f5f91e29e26014f43e504fad539","target":"graph","created_at":"2026-05-18T00:20:52Z","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 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","authors_text":"Adam Greig, Ramji Venkataramanan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-05T05:45:48Z","title":"Techniques for improving the finite length performance of sparse superposition codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02091","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:61045512360923b09fe43ed647044283e644cf2536ee0dea25c4d681bb871188","target":"record","created_at":"2026-05-18T00:20:52Z","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":"32923b18b04365856d89f7049d46b6386cd5df65ed85387025b55fdc12f807e5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-05T05:45:48Z","title_canon_sha256":"83874394ed1ac95200af27f7ed20b2b3cfa0501310ecdd280f433790df93c14d"},"schema_version":"1.0","source":{"id":"1705.02091","kind":"arxiv","version":4}},"canonical_sha256":"aedf03f4f207248018ab4a309d8f7a1a4d84ce26ac16b20a4fff3ed764c02424","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aedf03f4f207248018ab4a309d8f7a1a4d84ce26ac16b20a4fff3ed764c02424","first_computed_at":"2026-05-18T00:20:52.317441Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:52.317441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q4N5E3wgn1FL/ebC0WbXFLi9Og0mXVuMWmEHo4z2QxBqwa34+7yDHRBwsfNmcP+vv8myxF/qEEAlZ4R8UbsFAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:52.318386Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.02091","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61045512360923b09fe43ed647044283e644cf2536ee0dea25c4d681bb871188","sha256:8bd495d103d77f9be9500bd486ee09d31dc55f5f91e29e26014f43e504fad539"],"state_sha256":"a105a1362ab77fbfee5971bc632b90bdd5f64cbed6e35303a7a6c85b5e604d43"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TAFc3acOpqXWhi7nSE43Dtxxa1JrcIK9GsGWAeYMj4RgJMYV8QcAlulkTe7P60V/RlGAkD7uGLtInpu01dKHCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T05:55:41.166019Z","bundle_sha256":"77eb48e0dd716edcc770bad2f42b74246a0067fafe0efbd63d031acdca96a9d7"}}