{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DU7YBRLDDCS4QZEGJ6Y7OBYU2C","short_pith_number":"pith:DU7YBRLD","schema_version":"1.0","canonical_sha256":"1d3f80c56318a5c864864fb1f70714d0bc1decb486dc20712ef1c0809a00fa21","source":{"kind":"arxiv","id":"2412.01574","version":1},"attestation_state":"computed","paper":{"title":"Unifying AMP Algorithms for Rotationally-Invariant Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Junjie Ma, Songbin Liu","submitted_at":"2024-12-02T14:56:35Z","abstract_excerpt":"This paper presents a unified framework for constructing Approximate Message Passing (AMP) algorithms for rotationally-invariant models. By employing a general iterative algorithm template and reducing it to long-memory Orthogonal AMP (OAMP), we systematically derive the correct Onsager terms of AMP algorithms. This approach allows us to rederive an AMP algorithm introduced by Fan and Opper et al., while shedding new light on the role of free cumulants of the spectral law. The free cumulants arise naturally from a recursive centering operation, potentially of independent interest beyond the sc"},"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":"2412.01574","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2024-12-02T14:56:35Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.PR","stat.TH"],"title_canon_sha256":"db764d418d4a1dfabe1ddb03b562e51b3a72100694f1ca09c962e7f0cd3599cd","abstract_canon_sha256":"312081b5ed5c75cf101be6bbadfb83e03449f6d623489ad4f3132dba319eb70c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:43:15.403951Z","signature_b64":"9eJth1sPd661voIwfL70SqCdu+ck95Q2qmwkF0Ll5lyi4ZImdxT+9IDnor+g1oWxqq+zBhSoVLZ7qu/BzB1qCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d3f80c56318a5c864864fb1f70714d0bc1decb486dc20712ef1c0809a00fa21","last_reissued_at":"2026-07-05T09:43:15.403429Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:43:15.403429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unifying AMP Algorithms for Rotationally-Invariant Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Junjie Ma, Songbin Liu","submitted_at":"2024-12-02T14:56:35Z","abstract_excerpt":"This paper presents a unified framework for constructing Approximate Message Passing (AMP) algorithms for rotationally-invariant models. By employing a general iterative algorithm template and reducing it to long-memory Orthogonal AMP (OAMP), we systematically derive the correct Onsager terms of AMP algorithms. This approach allows us to rederive an AMP algorithm introduced by Fan and Opper et al., while shedding new light on the role of free cumulants of the spectral law. The free cumulants arise naturally from a recursive centering operation, potentially of independent interest beyond the sc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.01574","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/2412.01574/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":"2412.01574","created_at":"2026-07-05T09:43:15.403495+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.01574v1","created_at":"2026-07-05T09:43:15.403495+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.01574","created_at":"2026-07-05T09:43:15.403495+00:00"},{"alias_kind":"pith_short_12","alias_value":"DU7YBRLDDCS4","created_at":"2026-07-05T09:43:15.403495+00:00"},{"alias_kind":"pith_short_16","alias_value":"DU7YBRLDDCS4QZEG","created_at":"2026-07-05T09:43:15.403495+00:00"},{"alias_kind":"pith_short_8","alias_value":"DU7YBRLD","created_at":"2026-07-05T09:43:15.403495+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.04531","citing_title":"Gaussian-Process Dynamics of Diagonal Expectation Propagation under Variance-Profile Gaussian Measurements","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2509.13955","citing_title":"Asymptotic Analysis of Nonlinear One-Bit Precoding in Massive MIMO Systems via Approximate Message Passing","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DU7YBRLDDCS4QZEGJ6Y7OBYU2C","json":"https://pith.science/pith/DU7YBRLDDCS4QZEGJ6Y7OBYU2C.json","graph_json":"https://pith.science/api/pith-number/DU7YBRLDDCS4QZEGJ6Y7OBYU2C/graph.json","events_json":"https://pith.science/api/pith-number/DU7YBRLDDCS4QZEGJ6Y7OBYU2C/events.json","paper":"https://pith.science/paper/DU7YBRLD"},"agent_actions":{"view_html":"https://pith.science/pith/DU7YBRLDDCS4QZEGJ6Y7OBYU2C","download_json":"https://pith.science/pith/DU7YBRLDDCS4QZEGJ6Y7OBYU2C.json","view_paper":"https://pith.science/paper/DU7YBRLD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.01574&json=true","fetch_graph":"https://pith.science/api/pith-number/DU7YBRLDDCS4QZEGJ6Y7OBYU2C/graph.json","fetch_events":"https://pith.science/api/pith-number/DU7YBRLDDCS4QZEGJ6Y7OBYU2C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DU7YBRLDDCS4QZEGJ6Y7OBYU2C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DU7YBRLDDCS4QZEGJ6Y7OBYU2C/action/storage_attestation","attest_author":"https://pith.science/pith/DU7YBRLDDCS4QZEGJ6Y7OBYU2C/action/author_attestation","sign_citation":"https://pith.science/pith/DU7YBRLDDCS4QZEGJ6Y7OBYU2C/action/citation_signature","submit_replication":"https://pith.science/pith/DU7YBRLDDCS4QZEGJ6Y7OBYU2C/action/replication_record"}},"created_at":"2026-07-05T09:43:15.403495+00:00","updated_at":"2026-07-05T09:43:15.403495+00:00"}