{"as_of":"2026-08-10T22:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:877c490674be552f76069901462038fafc901b5f01690be71e730f92cc3fba7e","coverage":[{"denominator":74,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":74,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:07:38.028577Z","state":"measured"},{"denominator":74,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":74,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.23010/citation-record","integrity":"/paper/2506.23010/integrity","json":"/paper/2506.23010/citation-record.json","paper":"/paper/2506.23010"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:50.713256Z","title":"Unsourced random access with coded compressed sensing: Integrating amp and belief propagation.IEEE Transactions on Information Theory, 68(4):2384–2409, 2021","venue":null,"work_id":"f6a2bdec-bcf6-4d7e-8f40-48872eaea065","year":2021},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:30.283008Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:967eff44d4e0b9cddf949a82fd4194bbe6d23b7ca7899f97b20a7893919430e2","observation_id":"f51b24e6-d054-4e31-8282-1bcc5ee943ef","resolution":{"observed_at":"2026-08-06T22:07:50.814414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:50.526144Z","title":"Operator-lipschitz estimates for the singular value functional calculus.Proceedings of the American Mathematical Society, 144(5):1867–1875, 2016","venue":null,"work_id":"71e3affd-750f-48b0-9f04-c8ab8441aa31","year":2016},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:30.351055Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:1ac8bb1a8932e53c6acdea6d015a302f18b41c562fff7a9e640f4a8de49eecd8","observation_id":"dedc440d-e178-44ad-8924-8c68014f6019","resolution":{"observed_at":"2026-08-06T22:07:50.618203Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:50.340242Z","title":"Large deviations for langevin spin glass dynamics","venue":null,"work_id":"07333296-57f0-4d61-aa6f-4ed82f09aeaa","year":1995},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:30.434311Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:13c12fb4f2473c0f5b1a5845653d7b4fb6a94b1ea0540b5a5265f8424829ec29","observation_id":"bf739c87-13a3-42f1-bc1d-e6e929b7d58b","resolution":{"observed_at":"2026-08-06T22:07:50.413665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:50.160452Z","title":"Symmetric langevin spin glass dynamics.The Annals of Probability, 25(3):1367–1422, 1997","venue":null,"work_id":"177fa49d-c2be-4a49-94f3-120c333e5d65","year":1997},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:30.560757Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:e9b4e85b9dd88f56bca08ee59f86dd863cb7838ab083ef93d04dd921857d11fc","observation_id":"d9b8aa31-eedc-4b65-9ed3-9e7ead87803d","resolution":{"observed_at":"2026-08-06T22:07:50.242029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:49.924195Z","title":"Inferring change points in high- dimensional linear regression via approximate message passing","venue":null,"work_id":"5571523f-f61f-4dcf-a00b-7e1f7d4bf101","year":2024},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:30.564349Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:78ba8ed5c50918e979b4d0861f4bee263d413ea6480a38399365959c69ee3efa","observation_id":"81bf343b-37e4-49ba-9d02-2c1bc7516abe","resolution":{"observed_at":"2026-08-06T22:07:50.019123Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:49.729101Z","title":"The spiked matrix model with generative priors.Advances in Neural Information Processing Systems, 32, 2019","venue":null,"work_id":"ed7de752-fd18-4976-bb4a-9a1eecc7c49f","year":2019},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:30.622458Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:17d1a508e846a30f3d3230ac778b5f15e73fd44f80811786047abaa20d474311","observation_id":"a833d76d-87a3-4465-958f-0e6a2bc471fb","resolution":{"observed_at":"2026-08-06T22:07:49.826275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.05911","last_updated":"2025-07-21T02:52:35Z","snapshot_observed_at":"2026-08-10T08:56:01.492768Z","submitted_at":"2023-12-10T15:27:20Z","title":"A leave-one-out approach to approximate message passing","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.05911","snapshot_observed_at":"2026-08-06T22:07:30.744813Z","title":"A leave-one-out approach to approximate message passing","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:30.744813Z"},"links":{"cited_paper":"/paper/2312.05911","citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:3d06045c6fc33f3360d8da3192860fc207db94ce1f5a37e26246178599c2ecd2","observation_id":"7c7351a7-ccd2-4ac2-aa1c-140f50fa7610","resolution":{"observed_at":"2026-08-06T22:07:30.744813Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:49.516226Z","title":"Universality in polytope phase transitions and message passing algorithms.The Annals of Applied Probability, 25(2), April 2015","venue":null,"work_id":"5a50e8f4-9e8b-492a-acbc-6ff4f3d2d210","year":2015},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:30.879546Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:4ac77376b387e9c931e6c40c254efa0779a0d7f08d81720532d78e2d480d9e02","observation_id":"bea1e261-459a-4061-967a-cac7b5459c73","resolution":{"observed_at":"2026-08-06T22:07:49.627737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:49.328905Z","title":"The dynamics of message passing on dense graphs, with applications to compressed sensing.IEEE Transactions on Information Theory, 57(2):764–785, February 2011","venue":null,"work_id":"185cb33e-58fc-401e-9361-e2d51bd25c4d","year":2011},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:30.978890Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:ea105cd737daf61300b042b74da4916947b912895db8772c3ef59fa535d5341e","observation_id":"0ded2bfc-f8d5-40d4-a1d1-76ef8f599b1d","resolution":{"observed_at":"2026-08-06T22:07:49.432798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:31.062747Z","title":"Online stochastic gradient descent on non-convex losses from high-dimensional inference.Journal of Machine Learning Research, 22(106):1–51, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:31.062747Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:72df2530c180935e9bd286b8f5a07083001bc8c5f8b6b6ec63058b1b83c00f23","observation_id":"0bcf0d12-62ce-49a6-b13d-bd68069becbe","resolution":{"observed_at":"2026-08-06T22:07:31.062747Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:49.088130Z","title":"High-dimensional limit theorems for sgd: Effective dynamics and critical scaling.Advances in neural information processing systems, 35:25349–25362, 2022","venue":null,"work_id":"d5cba4b1-1d64-4dbf-a312-02776634f7cb","year":2022},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:31.152953Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:0e1ab61c7ca5c5f213cae46107c1dbb186e7dd4b102c7dc02c5b602baf19affe","observation_id":"51d37649-510c-492f-bbd5-c66890107280","resolution":{"observed_at":"2026-08-06T22:07:49.203700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:48.926906Z","title":"State evolution for approximate message passing with non-separable functions.Information and Inference: A Journal of the IMA, 9(1):33–79, 01 2019","venue":null,"work_id":"5c345bca-692d-47af-8e52-3bc70d290e49","year":2019},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:31.279082Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:050b6c5d618a5115f7e3922f90a4140d3f16e7321077e5fd220d98fbf21fdbb7","observation_id":"eeb2b3ad-3ab6-451d-8ef8-24dcbdaf3c61","resolution":{"observed_at":"2026-08-06T22:07:49.006999Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:48.743428Z","title":"Billingsley.Probability and Measure","venue":null,"work_id":"c14d9d63-d797-4623-82dd-085dbbd6efb0","year":2012},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:31.381342Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:4fe817cd10c38d28ff1cf2f176beb5a6693ad9adde5ab3046e3e2449000b7039","observation_id":"06209d77-f845-4939-a55e-a07d844c5d82","resolution":{"observed_at":"2026-08-06T22:07:48.817873Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:48.564577Z","title":"An iterative construction of solutions of the tap equations for the sherrington– kirkpatrick model","venue":null,"work_id":"fa880e84-c689-4b54-a193-9e30a7186bc6","year":2014},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:31.500949Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:c074207eaa087450c917ce9a2e49ce2e34d877ba9920ab739b6a4c782676fca6","observation_id":"89948a2a-f4b8-4f8f-84a6-02d839d82b6f","resolution":{"observed_at":"2026-08-06T22:07:48.658651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:48.409099Z","title":"Algorithmic analysis and statis- tical estimation of slope via approximate message passing.IEEE Transactions on Information Theory, 67(1):506–537, 2020","venue":null,"work_id":"6e0d3f22-1430-45e1-bdc0-3e383753f4a6","year":2020},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:31.615604Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:4909af6a55e9332f082699a13f932ecdf68dbea802f96d73734158b212bcdd32","observation_id":"6e6d25a9-6886-425b-abe3-bb3eb9af89a0","resolution":{"observed_at":"2026-08-06T22:07:48.474599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:48.136513Z","title":"Characterizing the slope trade-off: A variational perspective and the donoho–tanner limit.The Annals of Statistics, 51(1):33–61, 2023","venue":null,"work_id":"294d65d5-0ed9-4ff8-8fb5-ac5fa3f2c748","year":2023},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:31.711301Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:7a24a15a38a7b892ac8dc4a7ff90092465d8743cd5c4f1f9cd7f78a812826789","observation_id":"f5c2429a-e435-4c37-ac83-c475f000ba88","resolution":{"observed_at":"2026-08-06T22:07:48.266830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.07572","last_updated":"2026-04-18T03:31:29Z","snapshot_observed_at":"2026-07-06T12:18:42.245356Z","submitted_at":"2021-12-14T17:29:32Z","title":"The high-dimensional asymptotics of first order methods with random data","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.07572","snapshot_observed_at":"2026-08-06T22:07:31.791376Z","title":"The high-dimensional asymptotics of first order methods with random data.arXiv preprint arXiv:2112.07572, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:31.791376Z"},"links":{"cited_paper":"/paper/2112.07572","citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:3491db787699e594f39cabe7cd9dbf5a5e95c478abc41e41a038f6edee57ff9d","observation_id":"654f91ff-147b-4df7-a19c-1dd0483ad428","resolution":{"observed_at":"2026-08-06T22:07:31.791376Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:47.978913Z","title":"The estimation error of general first order methods","venue":null,"work_id":"b9d7b296-d54c-4769-9433-0514d072aa07","year":2020},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:31.886513Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:db604e8fa50e90e4f061d94724c2008a4f433d3cdf4cb52399ba3660063598b6","observation_id":"75db0a33-1cfe-420a-95a9-3a8c7477d05d","resolution":{"observed_at":"2026-08-06T22:07:48.046807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:47.819517Z","title":"Universality of approximate message passing algorithms","venue":null,"work_id":"6858faa1-6e15-4b97-a639-534d0f57edb5","year":2021},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:32.001125Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:69b14eec16c4c5fb36c2ac6bfcb7cb55f33e9197b8bc28fa1e71587f62781b67","observation_id":"f8082dde-e65e-4e44-a90d-5395598fad12","resolution":{"observed_at":"2026-08-06T22:07:47.910433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:47.662596Z","title":"Weingarten calculus via orthogonality relations: new applications","venue":null,"work_id":"c1897b05-a9cf-4c33-af8b-31a9ec4b6e04","year":2017},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:32.097702Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:f264ebebf2d1a91e9744b085606cd81d8075efd7e344e2302f9fee34850395e6","observation_id":"6cb1e9d8-c10f-4d86-a2ee-53809ff1a75c","resolution":{"observed_at":"2026-08-06T22:07:47.752695Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:47.493153Z","title":"Integration with respect to the haar measure on unitary, orthogonal and symplectic group.Communications in Mathematical Physics, 264(3):773–795, 2006","venue":null,"work_id":"31a1e7ce-b80a-4f7c-b7d6-2e16ed919d32","year":2006},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:32.185539Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:12ee2c3ebcd1ffc014c6e852317d3987f0eb37032f61dbbe02f03f81b1318552","observation_id":"1fac4a3f-5b47-4ee0-9ddb-1c83ee64d127","resolution":{"observed_at":"2026-08-06T22:07:47.573607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:47.265841Z","title":"Hitting the high-dimensional notes: An ode for sgd learning dynamics on glms and multi-index models","venue":null,"work_id":"649596b6-9ca1-40a6-b31f-102ae8a58202","year":2024},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:32.277929Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:35e172e313c757bceca23017dc48d9869b288866a7f0d84e0ed6e76d15bf1253","observation_id":"2fc53f5a-b07c-495a-a777-24929a9d9f68","resolution":{"observed_at":"2026-08-06T22:07:47.343340Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:47.118429Z","title":"Diffusions interacting through a random matrix: universality via stochastic taylor expansion.Probability Theory and Related Fields, 180:1057–1097, 2021","venue":null,"work_id":"a0209c13-7bc5-4e2a-8bfd-bed266d1f880","year":2021},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:32.407339Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:cb56e3e147c5b3c8f587f6d87134b116ff86c21ae51c67f5b93edccf321a1fa6","observation_id":"ee5b3bdc-70eb-489e-bfd4-2da899927e1e","resolution":{"observed_at":"2026-08-06T22:07:47.182863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:46.939814Z","title":"Universality for langevin-like spin glass dynamics","venue":null,"work_id":"a9d0fdce-d256-48e1-9706-25f49ced73f7","year":2021},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:32.482358Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:68d6a352fcc42875599c2c6f6af91055e061647e746e8ac010ce1066668c0b33","observation_id":"89e66dfe-3402-4b57-923f-2cce96992756","resolution":{"observed_at":"2026-08-06T22:07:47.025315Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:46.723099Z","title":null,"venue":null,"work_id":"61bcb348-2dde-4a4a-8b39-675c133de701","year":2013},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:32.567566Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:07d60b1353cb5eda9055bb3d522e84786e2f73a039eb7843dac3651f975b3529","observation_id":"5fb993e3-68b3-4974-b4f4-d881915cae4d","resolution":{"observed_at":"2026-08-06T22:07:46.827076Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:46.486189Z","title":"Donoho, Arian Maleki, and Andrea Montanari","venue":null,"work_id":"dc21bd24-c064-4ed4-b6d2-2bb38a75a445","year":2009},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:32.653391Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:be6504326222b3eaf6cb188ad6a75478559c9ff2621da323a841dd0a1c1e11f8","observation_id":"e2d3b447-aaac-403a-81ed-3552a6bd17ec","resolution":{"observed_at":"2026-08-06T22:07:46.597588Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:46.279219Z","title":"Lu, and Subhabrata Sen","venue":null,"work_id":"9e5f2184-417b-4892-8131-af93bed5280d","year":2023},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:32.768126Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:9c8fbfe10d043b4c13f3d2b928f989a263e6b702d7bd56c8e4cd315dcd1789a6","observation_id":"713fd9b6-adcd-4f8e-b815-6a7adaf20eee","resolution":{"observed_at":"2026-08-06T22:07:46.395667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:46.102436Z","title":null,"venue":null,"work_id":"25a6cb63-eadd-4167-b63f-8c30daa6d99f","year":2024},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:32.883373Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:999644dca12a77b646b7475470554143adff50cd8864cecce623a264c8221538","observation_id":"9aebc0b7-d517-4a5e-b525-0403bad319fd","resolution":{"observed_at":"2026-08-06T22:07:46.166578Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:45.923289Z","title":"On weighted uniform approximation by polynomials of functions of several variables.Matematicheskii Sbornik, 85(2):227–256, 1957","venue":null,"work_id":"44977c7c-294e-4df0-bad3-573654a9c0e2","year":1957},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:32.977793Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:5c71ee29c2fd896e1db81f1b355e29edbd11296f293ced5577f5cab2e22f35e1","observation_id":"25cd6d34-f281-427b-99fe-2f1b7673606e","resolution":{"observed_at":"2026-08-06T22:07:46.000385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:33.098647Z","title":"Dynamical mean-field analysis of adaptive langevin diffusions: Propagation-of-chaos and convergence of the linear response","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:33.098647Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:74244608403de23fc30994fd64d15de203491ccf34d16bfb14b3a3d5f3ab8338","observation_id":"f2926914-473e-482f-ad96-ba9369bd9efa","resolution":{"observed_at":"2026-08-06T22:07:33.098647Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:33.215336Z","title":"Dynamical mean-field analysis of adaptive langevin diffusions: Replica-symmetric fixed point and empirical bayes","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:33.215336Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:dfdbac99500571fb44cf4709616c90b1b9311d1ae5faa1044e7578e826ea4a89","observation_id":"ea40b67b-6a49-4442-b235-510f1306320f","resolution":{"observed_at":"2026-08-06T22:07:33.215336Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:45.638104Z","title":"Feng, Ramji Venkataramanan, Cynthia Rush, and Richard J","venue":null,"work_id":"5c7a9ed1-8b35-40da-9d38-261e0c554c3a","year":2022},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:33.338198Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:98685a02eacba59173b263a1ee0c370cf10c44883698e4b0c966c9ca8f827011","observation_id":"af0bafaa-83e7-4234-9ce2-16a20ee49ad6","resolution":{"observed_at":"2026-08-06T22:07:45.798307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:45.314413Z","title":"On complete functions in jucys-murphy elements.Annals of Combinatorics, 16:677–707, 2012","venue":null,"work_id":"aa6dfa63-4a8e-49f9-83dc-93f4a7cda7ae","year":2012},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:33.436495Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:45c38eb68068d78cfa0b1e4f5f4d61641de74c733cdd55b2cf212f77361dfb5d","observation_id":"1cc7d62a-c92a-4f65-879a-ce8b37acd7e7","resolution":{"observed_at":"2026-08-06T22:07:45.446963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:45.243766Z","title":"Rigorous dynamical mean-field theory for stochastic gradient descent methods.SIAM Journal on Mathematics of Data Science, 6(2):400–427, 2024","venue":null,"work_id":"b720a5f3-4840-4aff-9cda-5953265e05af","year":2024},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:33.599433Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:4a9a579b4fc857567e6181b3f981906b959d37627f2c4642be6dae2dfd59ca45","observation_id":"a05d523b-3845-4f1a-91d5-e27c7422c540","resolution":{"observed_at":"2026-08-06T22:07:45.308774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:45.082948Z","title":"Graph-based approximate message passing iterations†","venue":null,"work_id":"efe816d0-7d21-4657-a11c-7d88642733fc","year":2023},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:33.708434Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:c4f3932c502a64f59bd296ff5e34bf577c10843964b4296b0b1d13bdbb165e94","observation_id":"f95a6d4c-964a-4933-aa73-f2a904124292","resolution":{"observed_at":"2026-08-06T22:07:45.166894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:44.898092Z","title":null,"venue":null,"work_id":"2435f20c-f2d7-4f04-bb86-86d43b115559","year":2024},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:33.811044Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:ae58c875d71a52f173d6bd180fa90f57edefd6d8a786216859dd55b2b24e9182","observation_id":"c5b1d740-ee86-4df9-9e2b-76af924d0264","resolution":{"observed_at":"2026-08-06T22:07:44.981720Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.19061","last_updated":"2025-05-29T14:37:02Z","snapshot_observed_at":"2026-08-10T21:25:28.911013Z","submitted_at":"2024-06-27T10:28:50Z","title":"Entrywise dynamics and universality of general first order methods","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.19061","snapshot_observed_at":"2026-08-06T22:07:33.940603Z","title":"Entrywise dynamics and universality of general first order methods.arXiv preprint arXiv:2406.19061, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:33.940603Z"},"links":{"cited_paper":"/paper/2406.19061","citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:f5d6d15a181824d73d171377893b90bcf8b8fc7ee2a83f911e73685a87b8a569","observation_id":"7bd35809-4f8c-4e11-91d8-7090b11afc01","resolution":{"observed_at":"2026-08-06T22:07:33.940603Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:34.050701Z","title":"Gradient descent inference in empirical risk minimization.arXiv preprint arXiv:2412.09498, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:34.050701Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:ecdc8e5b0df6ded37deba95e41d0298780f40879aee35e11ee9977eb1c9c8109","observation_id":"ee282170-9089-49cf-935f-3191cee98056","resolution":{"observed_at":"2026-08-06T22:07:34.050701Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:34.138364Z","title":"On a formula for the product-moment coefficient of any order of a normal frequency distribution in any number of variables.Biometrika, 12(1/2):134–139, 1918","venue":null,"work_id":null,"year":1918},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:34.138364Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:76367f357c5fdd549775a39ded7a2eb225d29597579152f3566beb928ae49189","observation_id":"77466dd4-3373-4eb3-b164-7ac8bfd61854","resolution":{"observed_at":"2026-08-06T22:07:34.138364Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:44.703085Z","title":"State evolution for general approximate message passing algorithms, with applications to spatial coupling.Information and Inference: A Journal of the IMA, 2(2):115–144, 12 2013","venue":null,"work_id":"c09bb1b2-140d-4570-9b46-bec0bc302805","year":2013},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:34.290973Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:ef4a62d72f7e6bd21831bd7659c70b0a9b2f242d02639c2afcb33f18aea5795b","observation_id":"041b16f9-4486-4ce3-8e93-91062232b466","resolution":{"observed_at":"2026-08-06T22:07:44.810312Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.07881","last_updated":"2024-11-06T16:30:40Z","snapshot_observed_at":"2026-08-09T11:46:42.699086Z","submitted_at":"2024-04-11T16:10:52Z","title":"Fourier Analysis of Iterative Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.07881","snapshot_observed_at":"2026-08-06T22:07:34.493763Z","title":"Fourier analysis of iterative algorithms","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:34.493763Z"},"links":{"cited_paper":"/paper/2404.07881","citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:f747a25511d98ec724ef9b1732c38cf0eb6b54a9051f160f5548d88ab10b6d48","observation_id":"a724ea45-f3da-4294-a478-68d482ea6329","resolution":{"observed_at":"2026-08-06T22:07:34.493763Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:44.520899Z","title":"Approximate message passing from random initialization with applications to z2 synchronization.Proceedings of the National Academy of Sciences, 120(31):e2302930120, 2023","venue":null,"work_id":"3aa9abb3-bc9e-451a-8dfa-7288e56d184a","year":2023},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:34.639563Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:71abba649624cf36b33706bfcfe61d4d4883f4ced258ac172f4d6a86495e6dab","observation_id":"57590f3a-1f29-4e5e-8938-6fa33370a201","resolution":{"observed_at":"2026-08-06T22:07:44.608742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:44.360106Z","title":"Fluctuations, bias, variance & ensemble of learners: Exact asymptotics for convex losses in high-dimension","venue":null,"work_id":"82a94142-03bc-46ee-b13d-bbc8a2c18405","year":2022},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:34.800687Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:5a77238e62055dd7c4fce55f0dfa466d25b024995c493f37285a9595f5aae090","observation_id":"16707a71-c762-4ba2-a997-f301d1871cc8","resolution":{"observed_at":"2026-08-06T22:07:44.434512Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:44.134924Z","title":"Learning gaussian mixtures with generalized linear models: Precise asymp- totics in high-dimensions.Advances in Neural Information Processing Systems, 34:10144–10157, 2021","venue":null,"work_id":"59ab27e4-ba4e-4467-a584-cee2e4ca6aeb","year":2021},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:34.966921Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:498184252e46510b3c1b4605ddefa1a1ae1d78dc23cce6cf82043aa626033146","observation_id":"57b65ccd-2a81-446b-8a2d-70bca9c99297","resolution":{"observed_at":"2026-08-06T22:07:44.251330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:43.913914Z","title":"Analysis of approximate message passing with non-separable denoisers and markov random field priors.IEEE Transactions on Information Theory, 65(11):7367–7389, 2019","venue":null,"work_id":"f59df50a-5a21-4d9c-8e13-ff69a2024d65","year":2019},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:35.217007Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:0064044d72c962479466a2b3029ddaec8d2573d074f110e336caad78300098a6","observation_id":"efa9328e-d418-4d9e-98b7-3de3d9f9b85e","resolution":{"observed_at":"2026-08-06T22:07:44.015096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:43.729954Z","title":"Approximate message passing algorithm with universal denoising and gaussian mixture learning.IEEE Transactions on Signal Processing, 64(21):5611–5622, 2016","venue":null,"work_id":"a73ac068-9eca-4bf1-b7ac-deeda9a093b7","year":2016},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:35.331902Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:e2a12b8646ded81f4b33f023b25d3e01427afd30267a9808afabd3a1de75d69a","observation_id":"482e873e-a9fd-4b1e-81c3-a9d86596b0c2","resolution":{"observed_at":"2026-08-06T22:07:43.820521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:43.579311Z","title":"Complex dynamics in simple neural networks: Understanding gradient flow in phase retrieval.Advances in Neural Information Processing Systems, 33:3265– 3274, 2020","venue":null,"work_id":"f9e1724c-87a5-42df-b49d-71b0ab140619","year":2020},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:35.448975Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:7d3909a204c2c99aa291994c92cbf16cfc8d8eb266b06920b916383370febfc9","observation_id":"b60ca3fb-890a-414d-a628-c31cdf479e63","resolution":{"observed_at":"2026-08-06T22:07:43.663400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:43.346514Z","title":"Marvels and pitfalls of the langevin algorithm in noisy high- dimensional inference","venue":null,"work_id":"a5f7b01e-cf7b-4f7b-8e71-5892d5d816a8","year":2020},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:35.565803Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:e927224a8da2d2a8830f783a0c2b06cc8fc46c3f25dc34be4ffb60fbb0d3d444","observation_id":"6a0e4431-660a-4d0a-be80-360c26c98bc4","resolution":{"observed_at":"2026-08-06T22:07:43.462225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:43.207871Z","title":"Passed& spurious: Descent algorithms and local minima in spiked matrix-tensor models","venue":null,"work_id":"3014ecb0-45cb-4b6a-8bcd-970ac37307d2","year":2019},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:35.691809Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:6d99c8aa59b952ff3afca13a5ced7c0eb1dbba83c01f223f04ff38b7b0ceb861","observation_id":"aaf93d3a-cb5c-4d72-a58e-64f9e477ff3d","resolution":{"observed_at":"2026-08-06T22:07:43.280619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1809.06304","last_updated":"2018-09-17T16:14:55Z","snapshot_observed_at":"2026-08-07T18:50:11.399042Z","submitted_at":"2018-09-17T16:14:55Z","title":"Approximate message-passing for convex optimization with non-separable penalties","version":1},"cited_work":{"arxiv_id":"1809.06304","doi":null,"metadata_source":"pith","pith_arxiv_id":"1809.06304","snapshot_observed_at":"2026-08-06T22:07:38.672425Z","title":"Approximate message-passing for convex optimization with non-separable penalties","venue":"stat.ML","work_id":"47208e76-87b5-4d80-83f5-805eb772a34a","year":2018},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:35.805172Z"},"links":{"cited_paper":"/paper/1809.06304","citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:c50161fedac0f7ad1c79c69283e036182dc03f52fcc5a7308968a84e305447bd","observation_id":"4f9f4c9f-b5e6-4b64-988f-91036a798d64","resolution":{"observed_at":"2026-08-06T22:07:38.750701Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:42.993461Z","title":"Learned d-amp: Principled neural network based compressive image recovery.Advances in neural information processing systems, 30, 2017","venue":null,"work_id":"2c3654da-dac9-4568-bab9-3e24d06af859","year":2017},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:36.007745Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:28182a93af436e4a7e8294c734b99f7273f1e4943f522b57cad3fa686d126c29","observation_id":"2edcd16a-941a-4b6d-90da-283ebd3fa993","resolution":{"observed_at":"2026-08-06T22:07:43.071185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:42.748240Z","title":"Bm3d-amp: A new image recovery algorithm based on bm3d denoising","venue":null,"work_id":"6e0ae5ed-3f0e-4e13-a78b-841017dffc74","year":2015},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:36.099452Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:bf1ff7dc264140b70b8ffeae689641d1f18352618aa0a45e9db84457e68cd36e","observation_id":"9a050a31-22e4-47bc-b685-384e48a22139","resolution":{"observed_at":"2026-08-06T22:07:42.876596Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:42.583139Z","title":"From denoising to compressed sensing","venue":null,"work_id":"c483b0c1-8c1d-4771-9b61-fb6a9df503cf","year":2016},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:36.159646Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:93564b5ee8e7f02197d8617666b32d76a55c58cb8ab6146792bce41c5e548eda","observation_id":"41d0801d-6321-4025-9268-07f051df76f7","resolution":{"observed_at":"2026-08-06T22:07:42.667361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:36.204822Z","title":"Dynamical decoupling of generalization and overfitting in large two-layer networks.arXiv preprint arXiv:2502.21269, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:36.204822Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:0f9889f05fa9f2a2f344ede6ea748c41090aa431f506f583fe01613560ba4042","observation_id":"f58629cc-655d-4224-bfc7-6aa8e55ee7ca","resolution":{"observed_at":"2026-08-06T22:07:36.204822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:42.372497Z","title":"Homogenization of sgd in high-dimensions: Exact dynamics and generalization properties.Mathematical Programming, pages 1–90, 2024","venue":null,"work_id":"5d63b2f3-1496-4b9b-bc63-881fd4dc2509","year":2024},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:36.311683Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:24ce8b25eaff551072c59228f54324519a7bcbf084a01cb2d4858fd9a6125af3","observation_id":"2fefbba5-c975-4392-90b6-ebb7668d8526","resolution":{"observed_at":"2026-08-06T22:07:42.504194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:42.183691Z","title":"Generalized approximate message passing for estimation with random linear mixing","venue":null,"work_id":"cc2e2ebe-e56c-4b81-9a74-688127c5a632","year":2011},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:36.377753Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:a8af354b016b4929c31b65b1323fc915eea0bbc2252603239cb824a70bff9208","observation_id":"78793430-688c-4fec-9503-8b1bd3f50b26","resolution":{"observed_at":"2026-08-06T22:07:42.289600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:41.964614Z","title":"Fletcher","venue":null,"work_id":"178b6380-1257-4737-9890-f8fdd8dbcd1b","year":2017},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:36.459576Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:e81cd5c42a1b46d456117c0c84e6fa84eac760adcf5b3a4a9ac3fd9fd9bfd255","observation_id":"f205f779-37cb-4a07-8730-24cb7282148e","resolution":{"observed_at":"2026-08-06T22:07:42.053937Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:41.789854Z","title":"Near-optimal matrix recovery from random linear measure- ments","venue":null,"work_id":"f87b60c7-58db-4f80-ad0f-223753781688","year":2018},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:36.577257Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:79996efb6f821ec693e28483e03f65249f7beaab6218f68083f82caa08444c26","observation_id":"7ac2b4df-193c-4285-a47a-38a690467128","resolution":{"observed_at":"2026-08-06T22:07:41.855990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:41.577453Z","title":"Finite sample analysis of approximate message passing algorithms","venue":null,"work_id":"332ef3fb-dfc7-4cba-aa63-9088a42537d5","year":2018},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:36.737752Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:c859477f379fb9414eaedc51188d766790094ff93162d724acdb5b21a7f237ae","observation_id":"039b19b2-c63a-40f7-99c3-8c0d702b34a5","resolution":{"observed_at":"2026-08-06T22:07:41.692284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:41.329582Z","title":"Turbo reconstruction of structured sparse signals","venue":null,"work_id":"a3f58e60-d28c-4881-b82d-eda26d94ad4a","year":2010},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:36.823279Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:60ade0aa34c4df2551329b173c9b0941356afa787cce0da53b2cadfe787d768c","observation_id":"edd4d62b-0373-49a5-92d7-b3f530364d93","resolution":{"observed_at":"2026-08-06T22:07:41.456479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:41.114264Z","title":"Concentration and moment inequalities for polynomials of independent random variables","venue":null,"work_id":"b5412df6-9d97-42dd-a382-5034db9f1f57","year":2012},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:36.935398Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:5dfa1570405f5eae5ed98b26af1ca66d905a6472d9d4a1e7fb61c3ec1f9841e8","observation_id":"41992d4a-1f74-4b8b-aa7f-b5c4675ada6d","resolution":{"observed_at":"2026-08-06T22:07:41.229446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:40.942970Z","title":"On the empirical distribution of eigenvalues of a class of large dimensional random matrices.Journal of Multivariate analysis, 54(2):175–192, 1995","venue":null,"work_id":"e36eab08-40f9-4238-b0d9-fb15eb3489f8","year":1995},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:37.021899Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:e4f774e658f294a9c9002ecd2234691f3457d9908651b998b39a68bcad7db884","observation_id":"bac485e5-1599-4efb-b1eb-b302733b2eec","resolution":{"observed_at":"2026-08-06T22:07:41.027445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:40.721348Z","title":"Compressive imaging using approximate message passing and a markov-tree prior.IEEE transactions on signal processing, 60(7):3439–3448, 2012","venue":null,"work_id":"fd72326e-b84e-481e-b095-6e706b326a8a","year":2012},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:37.131072Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:eddb190d8467656f1598c245589cba293d70a59ca1250aadd660a253f1e7a88f","observation_id":"d0d09298-8459-45e1-b00d-d46452144d36","resolution":{"observed_at":"2026-08-06T22:07:40.832714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:40.512141Z","title":"Compressive imaging via approximate message passing with image denoising.IEEE Transactions on Signal Processing, 63(8):2085–2092, 2015","venue":null,"work_id":"fa63704a-4105-46ea-b379-645c2565c77a","year":2015},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:37.212030Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:4a6b0b8f3255d14c948846d901788df64225873ec84dda091001f182b939e162","observation_id":"6a5ad485-90b2-4e53-bbcf-cd71d73ea4ee","resolution":{"observed_at":"2026-08-06T22:07:40.600214Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:40.331214Z","title":"Approximate message passing with restricted boltzmann machine priors.Journal of Statistical Mechanics: Theory and Experiment, 2016(7):073401, 2016","venue":null,"work_id":"71760ba1-44dc-4040-8235-585dd250b1f6","year":2016},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:37.293272Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:3c18333db74bd165cea309a07047ee2e4a8a36a18b2c9b479901b19f38cbac54","observation_id":"624297a1-3e95-4c83-9a7e-d24931ea2c88","resolution":{"observed_at":"2026-08-06T22:07:40.415049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:40.144163Z","title":"Springer, 2008","venue":null,"work_id":"95b38dd2-5395-4b18-9f86-0bc7be71ba1a","year":2008},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:37.392824Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:86c71a457a5cb117ee7c7e0892d5c518446a9cc07e251f8fd5a3c418ed51008d","observation_id":"0da56ab1-b650-4ad7-b38c-1c883e3ffbba","resolution":{"observed_at":"2026-08-06T22:07:40.257647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.22594","last_updated":"2025-06-29T10:07:14Z","snapshot_observed_at":"2026-08-09T18:00:08.521603Z","submitted_at":"2025-05-28T17:05:09Z","title":"Multi-Environment GLAMP: Approximate Message Passing for Transfer Learning with Applications to Lasso-based Estimators","version":2},"cited_work":{"arxiv_id":"2505.22594","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.22594","snapshot_observed_at":"2026-08-06T22:07:38.400522Z","title":"Multi-Environment GLAMP: Approximate Message Passing for Transfer Learning with Applications to Lasso-based Estimators","venue":"math.ST","work_id":"d0290548-1bf9-4366-b380-acaad015d35a","year":2025},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:37.473922Z"},"links":{"cited_paper":"/paper/2505.22594","citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:8dcc133c61ff7f9c5b433cfcee6ec11cdb177d075e7ab8b77751370e288580dd","observation_id":"cdfc9c57-1ca9-4a5c-a06a-e1d2fba01bfb","resolution":{"observed_at":"2026-08-06T22:07:38.504313Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:39.930758Z","title":"Universality of approximate message passing algorithms and tensor networks.The Annals of Applied Probability, 34(4):3943–3994, 2024","venue":null,"work_id":"5548e393-a0a0-4572-bd27-179a7dc87bbc","year":2024},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:37.568316Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:8a5ae642401908af8c1e94571ff8530397eed75b66182562bb6fae8915198a54","observation_id":"a7707c33-de6f-4fd7-9201-cb2e94c2caac","resolution":{"observed_at":"2026-08-06T22:07:40.027132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2503.14121","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:38.216063Z","title":"Fundamental lim- its of matrix sensing: Exact asymptotics, universality, and applications","venue":null,"work_id":"71b737ee-c647-4b84-a338-2b3b695a41be","year":2025},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:37.641896Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:b1f5877bda66ab5bf99300283a9e00a60e2c2a730c685fb8fff607748aca45fe","observation_id":"b0d7a779-1f2a-4a3f-b8a6-3bcbd4c93025","resolution":{"observed_at":"2026-08-06T22:07:38.284916Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:39.746027Z","title":"Matrix denoising with doubly heteroscedastic noise: Fun- damental limits and optimal spectral methods","venue":null,"work_id":"62fa3fa7-cefa-49a4-af64-94313eacf049","year":2024},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:37.724860Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:df4f3f657ba4ae8421c8b473c8c7fa2a9e30500a4dd32a895ace4747ca4fd573","observation_id":"9cb92d94-a630-4979-bd3f-be1c511de9d6","resolution":{"observed_at":"2026-08-06T22:07:39.845568Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:39.577341Z","title":"LetPu1 = u1u⊤ 1/∥u1∥2 2 be the projection onto the span ofu1, and P⊥ u1 = Id− Pu1","venue":null,"work_id":"ec6c5b63-c69f-4067-9438-76d02aa0a6ac","year":null},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:37.828923Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:dfa0995b23d4dda0274748652ff6f025efbaad2ae60915fef233640255be7742","observation_id":"8482af90-5699-40e9-82b6-48f0881ee448","resolution":{"observed_at":"2026-08-06T22:07:39.655513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:39.423388Z","title":"An example conversion from(G,L)→ ( ˇG, ˇL)→ ( ˜G, ˜L)","venue":null,"work_id":"bbb934ad-d3e5-4787-86bb-7c3a26e8c939","year":null},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:37.887752Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:462d6ebdd0322d412db0d113f6603231a68b9382e91e7407ef35093c46b4a186","observation_id":"89a45ecd-52bb-450e-a9e5-b12112381c16","resolution":{"observed_at":"2026-08-06T22:07:39.485853Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:39.264067Z","title":"Since z1 = W u1 and ˜z1 = W˜u1, (3) holds by (1) and the operator norm bound∥W∥op< 3 a.s","venue":null,"work_id":"546632ee-5e96-4a89-85f2-a78c89b33188","year":null},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:37.966672Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:1265da6f31a0629b6456fe4a086d8ca3577838986291141542e97cced8890e49","observation_id":"2d6b4385-af1d-487d-8b0b-04eddfc7b23b","resolution":{"observed_at":"2026-08-06T22:07:39.318259Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:39.107442Z","title":"placeholders","venue":null,"work_id":"a4da9d76-9835-49e0-bfeb-ad4f670c7bf8","year":null},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:38.028577Z"},"links":{"citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:5455f2dc57f895ada9c9b0160904e633fdb645265197cd628175a5c79f59f4c7","observation_id":"746d0cf5-967a-4d09-9582-76c8374a3f33","resolution":{"observed_at":"2026-08-06T22:07:39.183730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","latest_version":1,"primary_category":"math.ST","snapshot_observed_at":"2026-08-10T10:49:22.483358Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms"},"reference_resolution":{"displayed":74,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":3,"verified_fuzzy":57},"total_outbound_references":74},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 74 of 74 outbound references and 0 inbound Pith citation observations for arXiv:2506.23010."}