{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:PJQBMHGRQYMVB7RGZWAY2VNTU4","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":"3e56d082db2670999b7628569de3631fae65bb0cce23b58ac3d8c4c81fdb5c2f","cross_cats_sorted":["cond-mat.dis-nn","math.IT"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2022-05-18T15:04:40Z","title_canon_sha256":"f5edb5f46bdc5d0f4d4fd89723166fdb20327440b05f50e81d3795c7043967ed"},"schema_version":"1.0","source":{"id":"2205.08980","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.08980","created_at":"2026-07-05T04:38:50Z"},{"alias_kind":"arxiv_version","alias_value":"2205.08980v2","created_at":"2026-07-05T04:38:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.08980","created_at":"2026-07-05T04:38:50Z"},{"alias_kind":"pith_short_12","alias_value":"PJQBMHGRQYMV","created_at":"2026-07-05T04:38:50Z"},{"alias_kind":"pith_short_16","alias_value":"PJQBMHGRQYMVB7RG","created_at":"2026-07-05T04:38:50Z"},{"alias_kind":"pith_short_8","alias_value":"PJQBMHGR","created_at":"2026-07-05T04:38:50Z"}],"graph_snapshots":[{"event_id":"sha256:9f13e1ed3c59d184bec47589793b665aa1cbfe8276650dc56d0acd8c56fe773b","target":"graph","created_at":"2026-07-05T04:38:50Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2205.08980/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We recently showed in [1] the superiority of certain structured coding matrices ensembles (such as partial row-orthogonal) for sparse superposition codes when compared with purely random matrices with i.i.d. entries, both information-theoretically and under practical vector approximate message-passing decoding. Here we generalize this result to binary input channels under generalized vector approximate message-passing decoding [2].We focus on specific binary output channels for concreteness but our analysis based on the replica symmetric method from statistical physics applies to any memoryles","authors_text":"Jean Barbier, Teng Fu, TianQi Hou, Yuhao Liu","cross_cats":["cond-mat.dis-nn","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2022-05-18T15:04:40Z","title":"Sparse superposition codes with rotational invariant coding matrices for memoryless channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.08980","kind":"arxiv","version":2},"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:b320bf487b84281ebda0835c1d5c0e7ce565322171ea8983710c25e0b456d7f3","target":"record","created_at":"2026-07-05T04:38:50Z","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":"3e56d082db2670999b7628569de3631fae65bb0cce23b58ac3d8c4c81fdb5c2f","cross_cats_sorted":["cond-mat.dis-nn","math.IT"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2022-05-18T15:04:40Z","title_canon_sha256":"f5edb5f46bdc5d0f4d4fd89723166fdb20327440b05f50e81d3795c7043967ed"},"schema_version":"1.0","source":{"id":"2205.08980","kind":"arxiv","version":2}},"canonical_sha256":"7a60161cd1861950fe26cd818d55b3a709e54ad3be9e246e3bcc0d581c893380","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a60161cd1861950fe26cd818d55b3a709e54ad3be9e246e3bcc0d581c893380","first_computed_at":"2026-07-05T04:38:50.772098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:38:50.772098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9YJv1OVxZYlfg5U2z8u4cz3ITkFlI1yqBGRRY9FXrJ9P8Z4PAPqyS8oHpz+5F3irUipGOtY1F8MIpvyYlJ+DAw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:38:50.772576Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.08980","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b320bf487b84281ebda0835c1d5c0e7ce565322171ea8983710c25e0b456d7f3","sha256:9f13e1ed3c59d184bec47589793b665aa1cbfe8276650dc56d0acd8c56fe773b"],"state_sha256":"8523d566711d2f42427be872ceada1cb70fada50af6e80bb5355ce8261eba678"}