{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4IBYRFPQWJBM4JPLJQJ6GDSEX2","short_pith_number":"pith:4IBYRFPQ","schema_version":"1.0","canonical_sha256":"e2038895f0b242ce25eb4c13e30e44beb50e60f7ed5c0cf80b8d98830e6defed","source":{"kind":"arxiv","id":"2505.22594","version":2},"attestation_state":"computed","paper":{"title":"Multi-Environment GLAMP: Approximate Message Passing for Transfer Learning with Applications to Lasso-based Estimators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Kuanhao Jiang, Longlin Wang, Pragya Sur, Yanke Song","submitted_at":"2025-05-28T17:05:09Z","abstract_excerpt":"Approximate Message Passing (AMP) algorithms enable precise characterization of certain classes of random objects in the high-dimensional limit, and have found widespread applications in fields such as signal processing, statistics, and communications. In this work, we introduce Multi-Environment Generalized Long AMP, a novel AMP framework that applies to transfer learning problems with multiple data sources and distribution shifts. We rigorously establish state evolution for multi-environment GLAMP. We demonstrate the utility of this framework by precisely characterizing the risk of three Las"},"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":"2505.22594","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2025-05-28T17:05:09Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"7161b98d21c9cdc7763b7e5692d5a582ba5717d1c8752ce3a8388eb7d53db926","abstract_canon_sha256":"7e73fec56e863f9c5f2764d7bf1ca7bba30a112b3ecac4f4b4d16f00a5b39a00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:29:12.021123Z","signature_b64":"w+RwoVkZp29lZvXysRNZGfSHJpamtLTH63iVg3cTtJ6riLgtHxICzYu/P/mhS9y+fXoOWmU5rduRwQdon8n+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2038895f0b242ce25eb4c13e30e44beb50e60f7ed5c0cf80b8d98830e6defed","last_reissued_at":"2026-07-05T11:29:12.020641Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:29:12.020641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Environment GLAMP: Approximate Message Passing for Transfer Learning with Applications to Lasso-based Estimators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Kuanhao Jiang, Longlin Wang, Pragya Sur, Yanke Song","submitted_at":"2025-05-28T17:05:09Z","abstract_excerpt":"Approximate Message Passing (AMP) algorithms enable precise characterization of certain classes of random objects in the high-dimensional limit, and have found widespread applications in fields such as signal processing, statistics, and communications. In this work, we introduce Multi-Environment Generalized Long AMP, a novel AMP framework that applies to transfer learning problems with multiple data sources and distribution shifts. We rigorously establish state evolution for multi-environment GLAMP. We demonstrate the utility of this framework by precisely characterizing the risk of three Las"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.22594","kind":"arxiv","version":2},"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/2505.22594/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":"2505.22594","created_at":"2026-07-05T11:29:12.020696+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.22594v2","created_at":"2026-07-05T11:29:12.020696+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.22594","created_at":"2026-07-05T11:29:12.020696+00:00"},{"alias_kind":"pith_short_12","alias_value":"4IBYRFPQWJBM","created_at":"2026-07-05T11:29:12.020696+00:00"},{"alias_kind":"pith_short_16","alias_value":"4IBYRFPQWJBM4JPL","created_at":"2026-07-05T11:29:12.020696+00:00"},{"alias_kind":"pith_short_8","alias_value":"4IBYRFPQ","created_at":"2026-07-05T11:29:12.020696+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.23010","citing_title":"On Universality of Non-Separable Approximate Message Passing Algorithms","ref_index":68,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4IBYRFPQWJBM4JPLJQJ6GDSEX2","json":"https://pith.science/pith/4IBYRFPQWJBM4JPLJQJ6GDSEX2.json","graph_json":"https://pith.science/api/pith-number/4IBYRFPQWJBM4JPLJQJ6GDSEX2/graph.json","events_json":"https://pith.science/api/pith-number/4IBYRFPQWJBM4JPLJQJ6GDSEX2/events.json","paper":"https://pith.science/paper/4IBYRFPQ"},"agent_actions":{"view_html":"https://pith.science/pith/4IBYRFPQWJBM4JPLJQJ6GDSEX2","download_json":"https://pith.science/pith/4IBYRFPQWJBM4JPLJQJ6GDSEX2.json","view_paper":"https://pith.science/paper/4IBYRFPQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.22594&json=true","fetch_graph":"https://pith.science/api/pith-number/4IBYRFPQWJBM4JPLJQJ6GDSEX2/graph.json","fetch_events":"https://pith.science/api/pith-number/4IBYRFPQWJBM4JPLJQJ6GDSEX2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4IBYRFPQWJBM4JPLJQJ6GDSEX2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4IBYRFPQWJBM4JPLJQJ6GDSEX2/action/storage_attestation","attest_author":"https://pith.science/pith/4IBYRFPQWJBM4JPLJQJ6GDSEX2/action/author_attestation","sign_citation":"https://pith.science/pith/4IBYRFPQWJBM4JPLJQJ6GDSEX2/action/citation_signature","submit_replication":"https://pith.science/pith/4IBYRFPQWJBM4JPLJQJ6GDSEX2/action/replication_record"}},"created_at":"2026-07-05T11:29:12.020696+00:00","updated_at":"2026-07-05T11:29:12.020696+00:00"}