{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SJBHVZDE7HRVVJJ22UP6VH3EV4","short_pith_number":"pith:SJBHVZDE","schema_version":"1.0","canonical_sha256":"92427ae464f9e35aa53ad51fea9f64af3525f11ec956d5b6b63668a2d1b89013","source":{"kind":"arxiv","id":"1402.3210","version":3},"attestation_state":"computed","paper":{"title":"On the Convergence of Approximate Message Passing with Arbitrary Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alyson K. Fletcher, Philip Schniter, Subrata Sarkar, Sundeep Rangan","submitted_at":"2014-02-13T16:42:30Z","abstract_excerpt":"Approximate message passing (AMP) methods and their variants have attracted considerable recent attention for the problem of estimating a random vector $\\mathbf{x}$ observed through a linear transform $\\mathbf{A}$. In the case of large i.i.d. zero-mean Gaussian $\\mathbf{A}$, the methods exhibit fast convergence with precise analytic characterizations on the algorithm behavior. However, the convergence of AMP under general transforms $\\mathbf{A}$ is not fully understood. In this paper, we provide sufficient conditions for the convergence of a damped version of the generalized AMP (GAMP) algorit"},"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":"1402.3210","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-13T16:42:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"67b5e12890d7d1c9bbc16877a964708eb5190891b139d5e4d033d02f01972544","abstract_canon_sha256":"e4af8b34b3016d197e61d1759294ac0e1a57c5ccb52fced135a52faef57307a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:11.399502Z","signature_b64":"XFoQPH5FWmakA3VjIfkfIQF8ffrtlozLPCmAFVB1XsRHzssmWwREfVu3OTBOI4X78SKZ2TLqZeoHY4oJZXXIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92427ae464f9e35aa53ad51fea9f64af3525f11ec956d5b6b63668a2d1b89013","last_reissued_at":"2026-05-18T00:22:11.398918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:11.398918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Convergence of Approximate Message Passing with Arbitrary Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alyson K. Fletcher, Philip Schniter, Subrata Sarkar, Sundeep Rangan","submitted_at":"2014-02-13T16:42:30Z","abstract_excerpt":"Approximate message passing (AMP) methods and their variants have attracted considerable recent attention for the problem of estimating a random vector $\\mathbf{x}$ observed through a linear transform $\\mathbf{A}$. In the case of large i.i.d. zero-mean Gaussian $\\mathbf{A}$, the methods exhibit fast convergence with precise analytic characterizations on the algorithm behavior. However, the convergence of AMP under general transforms $\\mathbf{A}$ is not fully understood. In this paper, we provide sufficient conditions for the convergence of a damped version of the generalized AMP (GAMP) algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3210","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1402.3210","created_at":"2026-05-18T00:22:11.398988+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.3210v3","created_at":"2026-05-18T00:22:11.398988+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3210","created_at":"2026-05-18T00:22:11.398988+00:00"},{"alias_kind":"pith_short_12","alias_value":"SJBHVZDE7HRV","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SJBHVZDE7HRVVJJ2","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SJBHVZDE","created_at":"2026-05-18T12:28:49.207871+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SJBHVZDE7HRVVJJ22UP6VH3EV4","json":"https://pith.science/pith/SJBHVZDE7HRVVJJ22UP6VH3EV4.json","graph_json":"https://pith.science/api/pith-number/SJBHVZDE7HRVVJJ22UP6VH3EV4/graph.json","events_json":"https://pith.science/api/pith-number/SJBHVZDE7HRVVJJ22UP6VH3EV4/events.json","paper":"https://pith.science/paper/SJBHVZDE"},"agent_actions":{"view_html":"https://pith.science/pith/SJBHVZDE7HRVVJJ22UP6VH3EV4","download_json":"https://pith.science/pith/SJBHVZDE7HRVVJJ22UP6VH3EV4.json","view_paper":"https://pith.science/paper/SJBHVZDE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.3210&json=true","fetch_graph":"https://pith.science/api/pith-number/SJBHVZDE7HRVVJJ22UP6VH3EV4/graph.json","fetch_events":"https://pith.science/api/pith-number/SJBHVZDE7HRVVJJ22UP6VH3EV4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SJBHVZDE7HRVVJJ22UP6VH3EV4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SJBHVZDE7HRVVJJ22UP6VH3EV4/action/storage_attestation","attest_author":"https://pith.science/pith/SJBHVZDE7HRVVJJ22UP6VH3EV4/action/author_attestation","sign_citation":"https://pith.science/pith/SJBHVZDE7HRVVJJ22UP6VH3EV4/action/citation_signature","submit_replication":"https://pith.science/pith/SJBHVZDE7HRVVJJ22UP6VH3EV4/action/replication_record"}},"created_at":"2026-05-18T00:22:11.398988+00:00","updated_at":"2026-05-18T00:22:11.398988+00:00"}