{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4C2D3MUXYPCXK7X6LE5OT2YVGD","short_pith_number":"pith:4C2D3MUX","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"},"canonical_sha256":"e0b43db297c3c5757efe593ae9eb1530d931bfc67368c9221be5775e26da2ea1","source":{"kind":"arxiv","id":"1207.2406","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4C2D3MUXYPCXK7X6LE5OT2YVGD","target":"record","payload":{"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"},"canonical_sha256":"e0b43db297c3c5757efe593ae9eb1530d931bfc67368c9221be5775e26da2ea1","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"},"source_kind":"arxiv","source_id":"1207.2406","source_version":1,"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-18T03:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fx/XvUW5JE3cHFYzVOXnGdLPAP4WNeUAgR0DxW2XQIh62Raf5K9BN43NKuWMJbI+h6+/uA1TuyhIjJUNoEJDCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:30:47.912541Z"},"content_sha256":"b201a158d3cf1def61137ed2509061117893db40c0c43389b696778fa44d7097","schema_version":"1.0","event_id":"sha256:b201a158d3cf1def61137ed2509061117893db40c0c43389b696778fa44d7097"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4C2D3MUXYPCXK7X6LE5OT2YVGD","target":"graph","payload":{"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"},"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-18T03:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FVLb/OFh9GQrnDQS1B0y6BQwJOQwoqa7f2n6CaxuvGBY/OVqV7t+9tO+Ia9xFOiMRgLKaNHu58Czd6ul+rmhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:30:47.913102Z"},"content_sha256":"d56385fce697eb9aeabd3446c79eb73b1353c750541c6737dcd644913dcecae6","schema_version":"1.0","event_id":"sha256:d56385fce697eb9aeabd3446c79eb73b1353c750541c6737dcd644913dcecae6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4C2D3MUXYPCXK7X6LE5OT2YVGD/bundle.json","state_url":"https://pith.science/pith/4C2D3MUXYPCXK7X6LE5OT2YVGD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4C2D3MUXYPCXK7X6LE5OT2YVGD/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-05-26T16:30:47Z","links":{"resolver":"https://pith.science/pith/4C2D3MUXYPCXK7X6LE5OT2YVGD","bundle":"https://pith.science/pith/4C2D3MUXYPCXK7X6LE5OT2YVGD/bundle.json","state":"https://pith.science/pith/4C2D3MUXYPCXK7X6LE5OT2YVGD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4C2D3MUXYPCXK7X6LE5OT2YVGD/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VkbVZvvJB9pEu1zBDU9TdPIoQ8FLeqCAEUuxVsuUQJ0DbW4jT8BkTIORrrnuBVqDgzgDmkCb5oO5VCOYfxJPAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:30:47.915739Z","bundle_sha256":"1464ce8c53a861a5f68c6b10bdfda5640fffa71f18b3196385486e128efedac0"}}