{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TJCEHWHR54VYCVR45BFC6F24YQ","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":"05a4ed71396e4fdcb5d18c8cabdbcd25ced9e67c3def621e12f6b4f067a7edfd","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2019-01-28T09:09:07Z","title_canon_sha256":"83f900edc59c2ba161986f5bf46fe6860c75938dd13350fb72d0f6adde5276fa"},"schema_version":"1.0","source":{"id":"1901.09559","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09559","created_at":"2026-07-05T02:45:47Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09559v4","created_at":"2026-07-05T02:45:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09559","created_at":"2026-07-05T02:45:47Z"},{"alias_kind":"pith_short_12","alias_value":"TJCEHWHR54VY","created_at":"2026-07-05T02:45:47Z"},{"alias_kind":"pith_short_16","alias_value":"TJCEHWHR54VYCVR4","created_at":"2026-07-05T02:45:47Z"},{"alias_kind":"pith_short_8","alias_value":"TJCEHWHR","created_at":"2026-07-05T02:45:47Z"}],"graph_snapshots":[{"event_id":"sha256:a246c1d2436561a07a186970db0ae3014a05cc0c3d5b69b1f93b518c7a4aa3e4","target":"graph","created_at":"2026-07-05T02:45:47Z","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/1901.09559/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper studies a large random matrix system (LRMS) model involving an arbitrary signal distribution and forward error control (FEC) coding. We establish an area property based on the so-called Turbo approximate message passing (Turbo-AMP) algorithm. Under the assumption that the state evolution for AMP is correct for the coded system, the achievable rate of Turbo-AMP is analyzed. We prove that Turbo-AMP achieves the constraint capacity of the LRMS with an arbitrary signal distribution provided that a matching condition is satisfied. As a byproduct, we provide an alternative derivation for ","authors_text":"Chulong Liang, Junjie Ma, Lei Liu, Li Ping","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2019-01-28T09:09:07Z","title":"Capacity Optimality of AMP in Coded Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09559","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:6b5c3cc01ebce9d2c68a54587765779fc6c3cbba73f72317376cd706462cc23a","target":"record","created_at":"2026-07-05T02:45:47Z","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":"05a4ed71396e4fdcb5d18c8cabdbcd25ced9e67c3def621e12f6b4f067a7edfd","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2019-01-28T09:09:07Z","title_canon_sha256":"83f900edc59c2ba161986f5bf46fe6860c75938dd13350fb72d0f6adde5276fa"},"schema_version":"1.0","source":{"id":"1901.09559","kind":"arxiv","version":4}},"canonical_sha256":"9a4443d8f1ef2b81563ce84a2f175cc422dc2b1e52c5eb24fa1f39e12562508f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a4443d8f1ef2b81563ce84a2f175cc422dc2b1e52c5eb24fa1f39e12562508f","first_computed_at":"2026-07-05T02:45:47.157520Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:45:47.157520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NXt83VOemOU4zhN+H/eLUq5mTWV3CvDmK+FNOR9q1rfdnXCjSXvQvmJJBz2FhPRmUD0oO2EWW+LaikgI3n0tCg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:45:47.158006Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.09559","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b5c3cc01ebce9d2c68a54587765779fc6c3cbba73f72317376cd706462cc23a","sha256:a246c1d2436561a07a186970db0ae3014a05cc0c3d5b69b1f93b518c7a4aa3e4"],"state_sha256":"9faa3d7452a5575e550f448f6d5c10a38611ebb167ab4ee38b7f5cdc8ee17ad4"}