{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZDFOUYTRXVMNTFW6GAFIEBB6ZC","short_pith_number":"pith:ZDFOUYTR","schema_version":"1.0","canonical_sha256":"c8caea6271bd58d996de300a82043ec8947bf91810a6ae07ad4ea8e43c3dea34","source":{"kind":"arxiv","id":"2608.08513","version":1},"attestation_state":"computed","paper":{"title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Brian M. Kurkoski, Lei Liu, Shunqi Huang","submitted_at":"2026-08-09T06:19:51Z","abstract_excerpt":"Approximate message passing (AMP)-type algorithms are widely used for signal recovery in high-dimensional noisy linear systems. Recently, a framework called memory AMP (MAMP) was introduced, offering a new approach to incorporating memory terms within AMP algorithms. Building on this, a low-complexity gradient descent MAMP (GD-MAMP) was proposed for right-unitarily invariant matrices. In this paper, we first address an overflow problem in GD-MAMP caused by intermediate variables exceeding the floating-point range, which typically occurs when the condition number is large. Second, we propose tw"},"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":"2608.08513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-08-09T06:19:51Z","cross_cats_sorted":["eess.SP","math.IT","math.ST","stat.TH"],"title_canon_sha256":"26e8df2eee5a73daffa8c9c280594b9278dd1909ca0c565832d33f9bbbfbbd21","abstract_canon_sha256":"4394011a55a76948f4b4c9edd9aed8d232dffd3e02234af5f5e1776410492d67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T01:22:50.862585Z","signature_b64":"McEfRV0iSqiJOLkongNg5k39XTHXZ5yUuF4WggM+vbU2BW935GSAgDusc4GjJK3gOT9QSst6ilO3vSJ6WukaBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8caea6271bd58d996de300a82043ec8947bf91810a6ae07ad4ea8e43c3dea34","last_reissued_at":"2026-08-11T01:22:50.860208Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T01:22:50.860208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Brian M. Kurkoski, Lei Liu, Shunqi Huang","submitted_at":"2026-08-09T06:19:51Z","abstract_excerpt":"Approximate message passing (AMP)-type algorithms are widely used for signal recovery in high-dimensional noisy linear systems. Recently, a framework called memory AMP (MAMP) was introduced, offering a new approach to incorporating memory terms within AMP algorithms. Building on this, a low-complexity gradient descent MAMP (GD-MAMP) was proposed for right-unitarily invariant matrices. In this paper, we first address an overflow problem in GD-MAMP caused by intermediate variables exceeding the floating-point range, which typically occurs when the condition number is large. Second, we propose tw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.08513","kind":"arxiv","version":1},"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/2608.08513/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":"2608.08513","created_at":"2026-08-11T01:22:50.860966+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.08513v1","created_at":"2026-08-11T01:22:50.860966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.08513","created_at":"2026-08-11T01:22:50.860966+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZDFOUYTRXVMN","created_at":"2026-08-11T01:22:50.860966+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZDFOUYTRXVMNTFW6","created_at":"2026-08-11T01:22:50.860966+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZDFOUYTR","created_at":"2026-08-11T01:22:50.860966+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/ZDFOUYTRXVMNTFW6GAFIEBB6ZC","json":"https://pith.science/pith/ZDFOUYTRXVMNTFW6GAFIEBB6ZC.json","graph_json":"https://pith.science/api/pith-number/ZDFOUYTRXVMNTFW6GAFIEBB6ZC/graph.json","events_json":"https://pith.science/api/pith-number/ZDFOUYTRXVMNTFW6GAFIEBB6ZC/events.json","paper":"https://pith.science/paper/ZDFOUYTR"},"agent_actions":{"view_html":"https://pith.science/pith/ZDFOUYTRXVMNTFW6GAFIEBB6ZC","download_json":"https://pith.science/pith/ZDFOUYTRXVMNTFW6GAFIEBB6ZC.json","view_paper":"https://pith.science/paper/ZDFOUYTR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.08513&json=true","fetch_graph":"https://pith.science/api/pith-number/ZDFOUYTRXVMNTFW6GAFIEBB6ZC/graph.json","fetch_events":"https://pith.science/api/pith-number/ZDFOUYTRXVMNTFW6GAFIEBB6ZC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZDFOUYTRXVMNTFW6GAFIEBB6ZC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZDFOUYTRXVMNTFW6GAFIEBB6ZC/action/storage_attestation","attest_author":"https://pith.science/pith/ZDFOUYTRXVMNTFW6GAFIEBB6ZC/action/author_attestation","sign_citation":"https://pith.science/pith/ZDFOUYTRXVMNTFW6GAFIEBB6ZC/action/citation_signature","submit_replication":"https://pith.science/pith/ZDFOUYTRXVMNTFW6GAFIEBB6ZC/action/replication_record"}},"created_at":"2026-08-11T01:22:50.860966+00:00","updated_at":"2026-08-11T01:22:50.860966+00:00"}