{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LDZSNBLPBEJVNJYRA7FJRQHOWC","short_pith_number":"pith:LDZSNBLP","canonical_record":{"source":{"id":"1501.05892","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-23T18:09:25Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"e8b717d7af44aca11c05445f5f0e5888d2482f83b219f7d689d8825159498fb7","abstract_canon_sha256":"eb9f26091b85a01d5a4ac9164b7f195d82ec20cba7dd084a076872f25ae36c1e"},"schema_version":"1.0"},"canonical_sha256":"58f326856f091356a71107ca98c0eeb083fe72319f72b9ec3309d0d69b31c7c5","source":{"kind":"arxiv","id":"1501.05892","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05892","created_at":"2026-05-18T00:48:55Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05892v5","created_at":"2026-05-18T00:48:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05892","created_at":"2026-05-18T00:48:55Z"},{"alias_kind":"pith_short_12","alias_value":"LDZSNBLPBEJV","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LDZSNBLPBEJVNJYR","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LDZSNBLP","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LDZSNBLPBEJVNJYRA7FJRQHOWC","target":"record","payload":{"canonical_record":{"source":{"id":"1501.05892","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-23T18:09:25Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"e8b717d7af44aca11c05445f5f0e5888d2482f83b219f7d689d8825159498fb7","abstract_canon_sha256":"eb9f26091b85a01d5a4ac9164b7f195d82ec20cba7dd084a076872f25ae36c1e"},"schema_version":"1.0"},"canonical_sha256":"58f326856f091356a71107ca98c0eeb083fe72319f72b9ec3309d0d69b31c7c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:55.143679Z","signature_b64":"P5t6IOsUDCxpT62kH/1qHGJAX1DamQeBgbmBHMhg8kDSnr7UoPoYMxvFs+lfvKzoag2vmTDA+a+oqOUqc390Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58f326856f091356a71107ca98c0eeb083fe72319f72b9ec3309d0d69b31c7c5","last_reissued_at":"2026-05-18T00:48:55.143003Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:55.143003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.05892","source_version":5,"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:48:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NCS0bR5+TXOi+41kadZDsD3oU14kx7WKpSOphyTn5UNSAIwgPb+MsRG3b6MRSgU7NzfSh8iNs7zWAhggWGt9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:28:25.639168Z"},"content_sha256":"b589b80cf62fe4d7157c7cecfe21d6466380429ef0adca75ae13e8276af034a8","schema_version":"1.0","event_id":"sha256:b589b80cf62fe4d7157c7cecfe21d6466380429ef0adca75ae13e8276af034a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LDZSNBLPBEJVNJYRA7FJRQHOWC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Capacity-achieving Sparse Superposition Codes via Approximate Message Passing Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Adam Greig, Cynthia Rush, Ramji Venkataramanan","submitted_at":"2015-01-23T18:09:25Z","abstract_excerpt":"Sparse superposition codes were recently introduced by Barron and Joseph for reliable communication over the AWGN channel at rates approaching the channel capacity. The codebook is defined in terms of a Gaussian design matrix, and codewords are sparse linear combinations of columns of the matrix. In this paper, we propose an approximate message passing decoder for sparse superposition codes, whose decoding complexity scales linearly with the size of the design matrix. The performance of the decoder is rigorously analyzed and it is shown to asymptotically achieve the AWGN capacity with an appro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05892","kind":"arxiv","version":5},"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:48:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ovr07+Jpm7OUuURNVhkgGTbMQDpLFKzpO71oMYQjMY3Y+TErjAJFMYjAydc0kbfPxHqVLfCWv3LhODsD152YCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:28:25.639539Z"},"content_sha256":"cf310ad9c7ab6049224ed82456636bc4e9e8dfa08a1044a146831d97a3f12c97","schema_version":"1.0","event_id":"sha256:cf310ad9c7ab6049224ed82456636bc4e9e8dfa08a1044a146831d97a3f12c97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LDZSNBLPBEJVNJYRA7FJRQHOWC/bundle.json","state_url":"https://pith.science/pith/LDZSNBLPBEJVNJYRA7FJRQHOWC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LDZSNBLPBEJVNJYRA7FJRQHOWC/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-26T02:28:25Z","links":{"resolver":"https://pith.science/pith/LDZSNBLPBEJVNJYRA7FJRQHOWC","bundle":"https://pith.science/pith/LDZSNBLPBEJVNJYRA7FJRQHOWC/bundle.json","state":"https://pith.science/pith/LDZSNBLPBEJVNJYRA7FJRQHOWC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LDZSNBLPBEJVNJYRA7FJRQHOWC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LDZSNBLPBEJVNJYRA7FJRQHOWC","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":"eb9f26091b85a01d5a4ac9164b7f195d82ec20cba7dd084a076872f25ae36c1e","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-23T18:09:25Z","title_canon_sha256":"e8b717d7af44aca11c05445f5f0e5888d2482f83b219f7d689d8825159498fb7"},"schema_version":"1.0","source":{"id":"1501.05892","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05892","created_at":"2026-05-18T00:48:55Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05892v5","created_at":"2026-05-18T00:48:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05892","created_at":"2026-05-18T00:48:55Z"},{"alias_kind":"pith_short_12","alias_value":"LDZSNBLPBEJV","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LDZSNBLPBEJVNJYR","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LDZSNBLP","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:cf310ad9c7ab6049224ed82456636bc4e9e8dfa08a1044a146831d97a3f12c97","target":"graph","created_at":"2026-05-18T00:48:55Z","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 were recently introduced by Barron and Joseph for reliable communication over the AWGN channel at rates approaching the channel capacity. The codebook is defined in terms of a Gaussian design matrix, and codewords are sparse linear combinations of columns of the matrix. In this paper, we propose an approximate message passing decoder for sparse superposition codes, whose decoding complexity scales linearly with the size of the design matrix. The performance of the decoder is rigorously analyzed and it is shown to asymptotically achieve the AWGN capacity with an appro","authors_text":"Adam Greig, Cynthia Rush, Ramji Venkataramanan","cross_cats":["math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-23T18:09:25Z","title":"Capacity-achieving Sparse Superposition Codes via Approximate Message Passing Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05892","kind":"arxiv","version":5},"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:b589b80cf62fe4d7157c7cecfe21d6466380429ef0adca75ae13e8276af034a8","target":"record","created_at":"2026-05-18T00:48:55Z","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":"eb9f26091b85a01d5a4ac9164b7f195d82ec20cba7dd084a076872f25ae36c1e","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-23T18:09:25Z","title_canon_sha256":"e8b717d7af44aca11c05445f5f0e5888d2482f83b219f7d689d8825159498fb7"},"schema_version":"1.0","source":{"id":"1501.05892","kind":"arxiv","version":5}},"canonical_sha256":"58f326856f091356a71107ca98c0eeb083fe72319f72b9ec3309d0d69b31c7c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58f326856f091356a71107ca98c0eeb083fe72319f72b9ec3309d0d69b31c7c5","first_computed_at":"2026-05-18T00:48:55.143003Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:55.143003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P5t6IOsUDCxpT62kH/1qHGJAX1DamQeBgbmBHMhg8kDSnr7UoPoYMxvFs+lfvKzoag2vmTDA+a+oqOUqc390Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:55.143679Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.05892","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b589b80cf62fe4d7157c7cecfe21d6466380429ef0adca75ae13e8276af034a8","sha256:cf310ad9c7ab6049224ed82456636bc4e9e8dfa08a1044a146831d97a3f12c97"],"state_sha256":"4ec425b145b0a0283230be082ee8f24be5090e5f6a71556a559fc4d09a3756f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Uixm7UMpiM4nflRp6UXuK24CQaqso7yxuIPdPDH6rRVxEqRsmEdEGrMinB9Q2szrDlfr1ynpA6cwZgra6Z8Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T02:28:25.641637Z","bundle_sha256":"67d4bbe734a0a9f2a858667c161e0e4970605aaac5c0324bf11f2b20668457bc"}}