{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:H4ENVZIQ5VCOIPWKB62OU532J3","short_pith_number":"pith:H4ENVZIQ","schema_version":"1.0","canonical_sha256":"3f08dae510ed44e43eca0fb4ea777a4efa3c2de113961180647cce97abf62ed4","source":{"kind":"arxiv","id":"2112.15327","version":4},"attestation_state":"computed","paper":{"title":"Sufficient-Statistic Memory AMP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG","eess.SP","math.IT","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.IT","authors_text":"Brian M. Kurkoski, Lei Liu, Shunqi Huang, Yuzhi Yang, Zhaoyang Zhang","submitted_at":"2021-12-31T07:25:18Z","abstract_excerpt":"Approximate message passing (AMP) type algorithms have been widely used in the signal reconstruction of certain large random linear systems. A key feature of the AMP-type algorithms is that their dynamics can be correctly described by state evolution. While state evolution is a useful analytic tool, its convergence is not guaranteed. To solve the convergence problem of the state evolution of AMP-type algorithms in principle, this paper proposes a sufficient-statistic memory AMP (SS-MAMP) algorithm framework under the conditions of right-unitarily invariant sensing matrices, Lipschitz-continuou"},"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":"2112.15327","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2021-12-31T07:25:18Z","cross_cats_sorted":["cs.LG","eess.SP","math.IT","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"7b693756fc7a18ae3676fb80b1b87aa8851b2fad489058f0cba914d68eff6921","abstract_canon_sha256":"7728c854ab307aed1bf90c9bf1f9359a2c857eb634afea06bc74c9b200a991b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:26:15.273169Z","signature_b64":"6a0/2wH2RdQeFilNViacBSh1fVITWhPxAgrhrUroJEsyx5ny0Jfl0idkgEh6FQCAo0LoQIIX5tbLMSSCWte6Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f08dae510ed44e43eca0fb4ea777a4efa3c2de113961180647cce97abf62ed4","last_reissued_at":"2026-07-05T06:26:15.272740Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:26:15.272740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sufficient-Statistic Memory AMP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG","eess.SP","math.IT","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.IT","authors_text":"Brian M. Kurkoski, Lei Liu, Shunqi Huang, Yuzhi Yang, Zhaoyang Zhang","submitted_at":"2021-12-31T07:25:18Z","abstract_excerpt":"Approximate message passing (AMP) type algorithms have been widely used in the signal reconstruction of certain large random linear systems. A key feature of the AMP-type algorithms is that their dynamics can be correctly described by state evolution. While state evolution is a useful analytic tool, its convergence is not guaranteed. To solve the convergence problem of the state evolution of AMP-type algorithms in principle, this paper proposes a sufficient-statistic memory AMP (SS-MAMP) algorithm framework under the conditions of right-unitarily invariant sensing matrices, Lipschitz-continuou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.15327","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/2112.15327/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":"2112.15327","created_at":"2026-07-05T06:26:15.272805+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.15327v4","created_at":"2026-07-05T06:26:15.272805+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.15327","created_at":"2026-07-05T06:26:15.272805+00:00"},{"alias_kind":"pith_short_12","alias_value":"H4ENVZIQ5VCO","created_at":"2026-07-05T06:26:15.272805+00:00"},{"alias_kind":"pith_short_16","alias_value":"H4ENVZIQ5VCOIPWK","created_at":"2026-07-05T06:26:15.272805+00:00"},{"alias_kind":"pith_short_8","alias_value":"H4ENVZIQ","created_at":"2026-07-05T06:26:15.272805+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.08513","citing_title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","ref_index":48,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H4ENVZIQ5VCOIPWKB62OU532J3","json":"https://pith.science/pith/H4ENVZIQ5VCOIPWKB62OU532J3.json","graph_json":"https://pith.science/api/pith-number/H4ENVZIQ5VCOIPWKB62OU532J3/graph.json","events_json":"https://pith.science/api/pith-number/H4ENVZIQ5VCOIPWKB62OU532J3/events.json","paper":"https://pith.science/paper/H4ENVZIQ"},"agent_actions":{"view_html":"https://pith.science/pith/H4ENVZIQ5VCOIPWKB62OU532J3","download_json":"https://pith.science/pith/H4ENVZIQ5VCOIPWKB62OU532J3.json","view_paper":"https://pith.science/paper/H4ENVZIQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.15327&json=true","fetch_graph":"https://pith.science/api/pith-number/H4ENVZIQ5VCOIPWKB62OU532J3/graph.json","fetch_events":"https://pith.science/api/pith-number/H4ENVZIQ5VCOIPWKB62OU532J3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H4ENVZIQ5VCOIPWKB62OU532J3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H4ENVZIQ5VCOIPWKB62OU532J3/action/storage_attestation","attest_author":"https://pith.science/pith/H4ENVZIQ5VCOIPWKB62OU532J3/action/author_attestation","sign_citation":"https://pith.science/pith/H4ENVZIQ5VCOIPWKB62OU532J3/action/citation_signature","submit_replication":"https://pith.science/pith/H4ENVZIQ5VCOIPWKB62OU532J3/action/replication_record"}},"created_at":"2026-07-05T06:26:15.272805+00:00","updated_at":"2026-07-05T06:26:15.272805+00:00"}