{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TJCEHWHR54VYCVR45BFC6F24YQ","short_pith_number":"pith:TJCEHWHR","schema_version":"1.0","canonical_sha256":"9a4443d8f1ef2b81563ce84a2f175cc422dc2b1e52c5eb24fa1f39e12562508f","source":{"kind":"arxiv","id":"1901.09559","version":4},"attestation_state":"computed","paper":{"title":"Capacity Optimality of AMP in Coded Systems","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chulong Liang, Junjie Ma, Lei Liu, Li Ping","submitted_at":"2019-01-28T09:09:07Z","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1901.09559","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2019-01-28T09:09:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"83f900edc59c2ba161986f5bf46fe6860c75938dd13350fb72d0f6adde5276fa","abstract_canon_sha256":"05a4ed71396e4fdcb5d18c8cabdbcd25ced9e67c3def621e12f6b4f067a7edfd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:45:47.158006Z","signature_b64":"NXt83VOemOU4zhN+H/eLUq5mTWV3CvDmK+FNOR9q1rfdnXCjSXvQvmJJBz2FhPRmUD0oO2EWW+LaikgI3n0tCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a4443d8f1ef2b81563ce84a2f175cc422dc2b1e52c5eb24fa1f39e12562508f","last_reissued_at":"2026-07-05T02:45:47.157520Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:45:47.157520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity Optimality of AMP in Coded Systems","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chulong Liang, Junjie Ma, Lei Liu, Li Ping","submitted_at":"2019-01-28T09:09:07Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09559","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1901.09559/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.09559","created_at":"2026-07-05T02:45:47.157578+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.09559v4","created_at":"2026-07-05T02:45:47.157578+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09559","created_at":"2026-07-05T02:45:47.157578+00:00"},{"alias_kind":"pith_short_12","alias_value":"TJCEHWHR54VY","created_at":"2026-07-05T02:45:47.157578+00:00"},{"alias_kind":"pith_short_16","alias_value":"TJCEHWHR54VYCVR4","created_at":"2026-07-05T02:45:47.157578+00:00"},{"alias_kind":"pith_short_8","alias_value":"TJCEHWHR","created_at":"2026-07-05T02:45:47.157578+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1907.02247","citing_title":"A New Insight into GAMP and AMP","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TJCEHWHR54VYCVR45BFC6F24YQ","json":"https://pith.science/pith/TJCEHWHR54VYCVR45BFC6F24YQ.json","graph_json":"https://pith.science/api/pith-number/TJCEHWHR54VYCVR45BFC6F24YQ/graph.json","events_json":"https://pith.science/api/pith-number/TJCEHWHR54VYCVR45BFC6F24YQ/events.json","paper":"https://pith.science/paper/TJCEHWHR"},"agent_actions":{"view_html":"https://pith.science/pith/TJCEHWHR54VYCVR45BFC6F24YQ","download_json":"https://pith.science/pith/TJCEHWHR54VYCVR45BFC6F24YQ.json","view_paper":"https://pith.science/paper/TJCEHWHR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.09559&json=true","fetch_graph":"https://pith.science/api/pith-number/TJCEHWHR54VYCVR45BFC6F24YQ/graph.json","fetch_events":"https://pith.science/api/pith-number/TJCEHWHR54VYCVR45BFC6F24YQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TJCEHWHR54VYCVR45BFC6F24YQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TJCEHWHR54VYCVR45BFC6F24YQ/action/storage_attestation","attest_author":"https://pith.science/pith/TJCEHWHR54VYCVR45BFC6F24YQ/action/author_attestation","sign_citation":"https://pith.science/pith/TJCEHWHR54VYCVR45BFC6F24YQ/action/citation_signature","submit_replication":"https://pith.science/pith/TJCEHWHR54VYCVR45BFC6F24YQ/action/replication_record"}},"created_at":"2026-07-05T02:45:47.157578+00:00","updated_at":"2026-07-05T02:45:47.157578+00:00"}