{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4C2D3MUXYPCXK7X6LE5OT2YVGD","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":"eb51c838d50587b9cdf9a80942bb5c97d9a4186ea1dd47e6d9fc4006265bc855","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-10T16:35:03Z","title_canon_sha256":"5820b60a893d0b6c62f951b7ed58bc35597b93a65495658400c3c5da9c0352b1"},"schema_version":"1.0","source":{"id":"1207.2406","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2406","created_at":"2026-05-18T03:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2406v1","created_at":"2026-05-18T03:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2406","created_at":"2026-05-18T03:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"4C2D3MUXYPCX","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4C2D3MUXYPCXK7X6","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4C2D3MUX","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:d56385fce697eb9aeabd3446c79eb73b1353c750541c6737dcd644913dcecae6","target":"graph","created_at":"2026-05-18T03:51:24Z","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":"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.","authors_text":"Andrew Barron, Antony Joseph","cross_cats":["math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-10T16:35:03Z","title":"Fast Sparse Superposition Codes have Exponentially Small Error Probability for R < C"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2406","kind":"arxiv","version":1},"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:b201a158d3cf1def61137ed2509061117893db40c0c43389b696778fa44d7097","target":"record","created_at":"2026-05-18T03:51:24Z","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":"eb51c838d50587b9cdf9a80942bb5c97d9a4186ea1dd47e6d9fc4006265bc855","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-10T16:35:03Z","title_canon_sha256":"5820b60a893d0b6c62f951b7ed58bc35597b93a65495658400c3c5da9c0352b1"},"schema_version":"1.0","source":{"id":"1207.2406","kind":"arxiv","version":1}},"canonical_sha256":"e0b43db297c3c5757efe593ae9eb1530d931bfc67368c9221be5775e26da2ea1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0b43db297c3c5757efe593ae9eb1530d931bfc67368c9221be5775e26da2ea1","first_computed_at":"2026-05-18T03:51:24.210262Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:24.210262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L2PupGtBTLJfMZwQlkmoD9/U5rBjuLlmbivFy0Y6vnhK5qTzfh6qn3LWnbVhKn58XeYr/xS+r/4acEeXtvZ6AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:24.210735Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.2406","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b201a158d3cf1def61137ed2509061117893db40c0c43389b696778fa44d7097","sha256:d56385fce697eb9aeabd3446c79eb73b1353c750541c6737dcd644913dcecae6"],"state_sha256":"2b0c1281f9c97dc5c01e02e421b8128445ef37bb7d1ea533a92b581f615d1c26"}