{"as_of":"2026-08-17T02:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9846a6c261eae18d50d0e79859f5f4398d4f64e527aa2adadee2f4e5a069177d","coverage":[{"denominator":51,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":51,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T04:41:03.101559Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/2608.08513/citation-record","integrity":"/paper/2608.08513/integrity","json":"/paper/2608.08513/citation-record.json","paper":"/paper/2608.08513"},"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-14T04:41:04.055107Z","title":"Overflow-avoiding memory AMP,","venue":null,"work_id":"732a0723-902d-499d-b311-247f112b02b7","year":2024},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.848790Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:c56e9faa92bdf17d6c789140cc8fd5c3f7c3d29e64293cb1df9f759247915132","observation_id":"72010206-8969-4f90-8dd3-110bd7f64bee","resolution":{"observed_at":"2026-08-14T04:41:04.059610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:04.039482Z","title":"Optimum multiuser signal detection (Ph.D. Abstr.),","venue":null,"work_id":"4b48d32a-7b92-402c-a180-a3114da567c5","year":1985},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.854059Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:aaaf1e0998e380041d635d9ee6b7a2c24144ce14d351838f7d1915c5f0fef63c","observation_id":"97c43924-9d0e-4a0f-8c84-47b41f3f0bce","resolution":{"observed_at":"2026-08-14T04:41:04.044821Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:04.023731Z","title":"The hardness of the closest vector problem with preprocessing,","venue":null,"work_id":"2ce94fb4-daca-4910-9a34-8e58beff51d9","year":2001},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.860236Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:8c72ca69fc2014be36733c640a264e0f55706485bd9268de5ae7f106027a0a7f","observation_id":"ba331a4a-3dcc-4b84-97d4-87168b2c4540","resolution":{"observed_at":"2026-08-14T04:41:04.028912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:04.007111Z","title":"Message-passing algorithms for compressed sensing,","venue":null,"work_id":"1a782fb3-96ea-45df-a831-255965f177fa","year":2009},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.865419Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:f6215c6b19ccfa7d7ef53b7472ad8b9954bfc46ba0d37456f67aa56726c66f60","observation_id":"354e1b74-609c-401f-bf5d-cedd921b11d4","resolution":{"observed_at":"2026-08-14T04:41:04.012615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:02.870201Z","title":"The dynamics of message passing on dense graphs, with applications to compressed sensing,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.870201Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:b2a50b16c9e087eac05ab3b099ba53139649eea51836d09328e1cb5482c3d55a","observation_id":"144987db-242a-4a6b-85df-cbdf5242214e","resolution":{"observed_at":"2026-08-14T04:41:02.870201Z","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-14T04:41:03.868994Z","title":"The replica-symmetric prediction for random linear estimation with Gaussian matrices is exact,","venue":null,"work_id":"9bf0e47e-0799-4b1f-a653-34abe2591d0c","year":2019},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.875259Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:c45e6b986862c087ab85f0ac14cab3bcb0ed9e3d6cbcfa4e41538444d1452488","observation_id":"25538093-7bcf-4de8-bb3b-8a685353df95","resolution":{"observed_at":"2026-08-14T04:41:03.874064Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.854078Z","title":"Mutual information and optimality of approximate message-passing in random linear estimation,","venue":null,"work_id":"666e2788-cd73-4ecb-b5aa-c1d92b63e808","year":2020},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.880645Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:c4aa3a4d393462567bc9bea2d6f3345d7c5f683a1dcc91c22f252acc619d498c","observation_id":"8ebe3033-c26d-49ef-a011-33ed99ccc604","resolution":{"observed_at":"2026-08-14T04:41:03.859632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.839259Z","title":"Capacity optimality of AMP in coded systems,","venue":null,"work_id":"71b27946-4b86-42d1-8336-23d7ce1ec035","year":2021},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.885275Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:3177a66d130e1eccd89fdc50f77e0d595f7b15355c22732cd2a1ea57f63a2297","observation_id":"21fa3847-dd47-4c5d-95db-eab05b726e77","resolution":{"observed_at":"2026-08-14T04:41:03.844101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1406.4311","last_updated":"2014-06-17T10:49:42Z","snapshot_observed_at":"2026-08-14T23:30:06.765403Z","submitted_at":"2014-06-17T10:49:42Z","title":"Sparse Estimation with the Swept Approximated Message-Passing Algorithm","version":1},"cited_work":{"arxiv_id":"1406.4311","doi":null,"metadata_source":"pith","pith_arxiv_id":"1406.4311","snapshot_observed_at":"2026-08-14T04:41:03.226701Z","title":"Sparse Estimation with the Swept Approximated Message-Passing Algorithm","venue":"cs.IT","work_id":"e863e731-8710-4dd4-91df-7a1de23775d0","year":2014},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.889973Z"},"links":{"cited_paper":"/paper/1406.4311","citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:96a31ee5db268df5e2ab6554305bbd0f1a9cd7c6887f148ae35c4d0f3485b8b0","observation_id":"a795beb6-0059-4871-a1af-5397ad2c0036","resolution":{"observed_at":"2026-08-14T04:41:03.231852Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.822770Z","title":"Adaptive damping and mean removal for the generalized approximate message passing algorithm,","venue":null,"work_id":"74cbffd7-9e64-4195-96bb-27be5dc32bc6","year":2015},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.895690Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:92817367f8f85066d8b2eda8120789c86641a0eb38034136787e49d654b9df84","observation_id":"e6700068-199e-4033-a3f6-fb9ac396fc25","resolution":{"observed_at":"2026-08-14T04:41:03.827774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.800191Z","title":"Inference for generalized linear models via alternating directions and Bethe free energy minimization,","venue":null,"work_id":"f8df654d-0a12-471b-bc81-780e474b49dd","year":2017},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.900115Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:ca997ed4c8d280bb8d81a88fcfe9125db9995f564a15c98002977f46a4ebb70b","observation_id":"96ea5050-de99-4b0e-85f4-da6a4e2cedaf","resolution":{"observed_at":"2026-08-14T04:41:03.807254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.784043Z","title":"Orthogonal AMP,","venue":null,"work_id":"030e1c0c-fae0-4aea-9c20-df197ffd25c4","year":2020},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.905096Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:a05ccf1792012bc0042023d63fc6111e888bdc59a9cc1e8461b48e0bffd61f57","observation_id":"911dc331-961c-4b37-821f-18228513f13c","resolution":{"observed_at":"2026-08-14T04:41:03.789354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.768407Z","title":"Vector approximate message passing,","venue":null,"work_id":"bede090a-e423-42e2-a890-864d0a9a0555","year":2019},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.909627Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:1792d9e6a9e4cac4b576cf1139a23f4b3d497a906f2b71627b0e8cea3afc08ac","observation_id":"463baf10-267d-472d-8fa0-6625dc283a9c","resolution":{"observed_at":"2026-08-14T04:41:03.773322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.753807Z","title":"Rigorous dynamics of expectation-propagation-based signal recovery from unitarily invariant measurements,","venue":null,"work_id":"7479a3c4-ad4a-4600-8e9e-ee185c2327f7","year":2020},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.914371Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:4e836e1e1675ff45d17212a4e4d8c826e7e0f8c03ce1529db3fb84ffc2b139e4","observation_id":"c9885875-c6d0-4509-aae0-ec58c9f4c578","resolution":{"observed_at":"2026-08-14T04:41:03.758755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.737135Z","title":"The mutual information in random linear estimation beyond i.i.d. matrices,","venue":null,"work_id":"6e285972-10ee-4c8f-81db-1ec63c395f7c","year":2018},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.919083Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:ca7bf652711068f090462ac8318271f5e1136af627c003e7e4b04d88aa1f59f9","observation_id":"e8946259-a35e-4d50-93d0-12bb1a7e2625","resolution":{"observed_at":"2026-08-14T04:41:03.742459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.720819Z","title":"Random linear estimation with rotationally-invariant designs: Asymptotics at high temperature,","venue":null,"work_id":"56d65b36-5b65-4a3c-817b-b07e8b54814e","year":2024},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.924421Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:3e580420adac92f386a9397b6a4f1b3e54f9a49d945653a9953081957a70d2fc","observation_id":"a70db6ad-78e8-426b-922b-5b9656f1a59d","resolution":{"observed_at":"2026-08-14T04:41:03.726516Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.704573Z","title":"On capacity optimality of OAMP: Beyond IID sensing matrices and Gaussian signaling,","venue":null,"work_id":"19ca06bc-5eb6-4b80-b016-2e9c7aea6931","year":2024},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.929266Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:390597aed1d958137e73b67f023d856cfa327247b6035b92d334444c8a2a6eba","observation_id":"654c8c49-ebc8-4b08-919a-dd85b7009f71","resolution":{"observed_at":"2026-08-14T04:41:03.709328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:02.933602Z","title":"On OAMP: Impact of the orthogonal principle,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.933602Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:e6e741125b7b20dbab761f0e0f9c1be4ef76a7be4daa64e1817414170f019e16","observation_id":"ad545927-9146-4901-97a5-ad7bba6ec326","resolution":{"observed_at":"2026-08-14T04:41:02.933602Z","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-14T04:41:03.675567Z","title":"A unified framework of state evolution for message-passing algorithms,","venue":null,"work_id":"9014fd13-2015-476d-b2a6-46dd89729efc","year":2019},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.938321Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:ea62f095c12f406b6edf4ebd1acf1fac29ad6936d12b3d9e20010c32295cd7ea","observation_id":"57071e5e-ba0a-4dca-8e41-a1bd7130eea4","resolution":{"observed_at":"2026-08-14T04:41:03.680360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.661776Z","title":"Expectation propagation for approximate Bayesian inference,","venue":null,"work_id":"8ad1dbe0-e482-4470-a8a1-04561b6e14c4","year":2001},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.943091Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:c9ded7d3fad4e10d35ebeac6cedb47408cd5b0f3198d6e6e431cf695c3165fdf","observation_id":"0d5589b4-4564-45e1-9372-85b45ef8d19f","resolution":{"observed_at":"2026-08-14T04:41:03.666416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.647638Z","title":"Expectation consistent approximate inference,","venue":null,"work_id":"0d95302a-3eff-4771-9b7a-840de1fb93af","year":2005},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.947139Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:f76fb315b7877f629a5a4eba7154c39465ec621ea033737b130a76fc3b933224","observation_id":"450ed91d-b21f-4e2e-bd22-d8b4ab89bcdc","resolution":{"observed_at":"2026-08-14T04:41:03.652326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.630783Z","title":"Expectation propagation for approximate inference: Free probability framework,","venue":null,"work_id":"52a8f408-c77d-48c1-988b-d4dbf88099be","year":2018},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.951114Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:9b5cdf91e9b83b67785b387a7f5df3614cfb20bc62a19c5106191d8b6ea283cb","observation_id":"1ede02e2-cb88-4df3-8854-489978c9c607","resolution":{"observed_at":"2026-08-14T04:41:03.636708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.613497Z","title":"Bayes-optimal convolutional AMP,","venue":null,"work_id":"bf445a8b-613f-4190-bca8-215a92d7bff0","year":2021},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.955358Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:ddc368332b39a73b259a71fb212a719cca0c08bd680caffe59ce98fec00c93b6","observation_id":"c88f47d5-4b64-46f3-9c24-21f2ec6a20bd","resolution":{"observed_at":"2026-08-14T04:41:03.617556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.598599Z","title":"Memory AMP,","venue":null,"work_id":"954c37da-0868-4382-b382-2f747fd39d8d","year":2022},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.959739Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:46fd4683da2c228e386ad72ac8063c6b433573088c95056fe29deca8027d122a","observation_id":"33b90ee3-9c0a-499f-9e0c-c240b149d7a9","resolution":{"observed_at":"2026-08-14T04:41:03.603457Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.583086Z","title":"Low-complexity memory AMP detector for high-mobility MIMO-OTFS SCMA systems,","venue":null,"work_id":"fd3a34b6-8549-4b25-a017-569c263bf735","year":2023},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.964367Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:71b50c6186f4cd72748e6e025e9f4f7368c9e6ce7cf1b5976a69cb0eb13cba0b","observation_id":"8871b957-bce0-4203-906d-600d44d3d976","resolution":{"observed_at":"2026-08-14T04:41:03.587755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.566590Z","title":"Joint activity-delay detection and channel estimation for asynchronous massive random access,","venue":null,"work_id":"b7bc50c6-0610-41c1-9913-172c5af2bb35","year":2023},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.968780Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:732e8ac62fcb25607f7b5593dd88a4cc1e1dc76a6ba1aa06793803dea6c42535","observation_id":"56d04cb7-dc06-46e7-8b9d-cc4508dc4b7f","resolution":{"observed_at":"2026-08-14T04:41:03.571646Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.551238Z","title":"Interleave frequency division multiplexing,","venue":null,"work_id":"5d1972a0-52aa-497c-a1df-9b7e3f26886f","year":1963},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.973450Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:b5889cad0f966b119514b43368e248e7e4c573b7449190cd64f71fab1982238b","observation_id":"a654c5c7-f844-429c-ba03-3656a48e50a9","resolution":{"observed_at":"2026-08-14T04:41:03.556219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.536202Z","title":"MAMP detector for AFDM under doubly dispersive channels,","venue":null,"work_id":"b6470898-067b-4275-8009-b95a08e537ad","year":2025},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.978570Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:5badebb034e6924760bc71ae95c9f499c823a77ad0b821d388c4cbcd4198c115","observation_id":"d93420d3-d1a5-4f58-968e-f2585d4f930c","resolution":{"observed_at":"2026-08-14T04:41:03.541430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.522308Z","title":"Random multiplexing,","venue":null,"work_id":"b1818873-3d07-4bd2-a8ab-ce235a91921e","year":2026},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.984078Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:fa86955994e68fd769b7a452a7ec86647459ccd5bfb7a79f00a51accdfadab29","observation_id":"14879b78-8858-4826-a706-a717b3ad91d3","resolution":{"observed_at":"2026-08-14T04:41:03.526437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.507740Z","title":"Channel estimation in massive MIMO systems with orthogonal delay-Doppler division multiplexing,","venue":null,"work_id":"094db896-32b9-42c7-9029-4f2636685da8","year":2026},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.988909Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:0e36727bdd3a51b19bc7cf52e91db905b2b21c9bbff7977120779d2c9279a742","observation_id":"ae00505f-5174-4028-bf54-343019eda1c1","resolution":{"observed_at":"2026-08-14T04:41:03.512379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.492328Z","title":"Achievable rate and coding principle for MIMO multicarrier systems with cross-domain MAMP receiver over doubly selective channels,","venue":null,"work_id":"b598a925-90e2-4686-8858-1bade53c3a6c","year":2026},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:02.993435Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:95c28e936ae7f82503f14c37b3ebad1c5cc484d8606e558111a2d2a6340a44ee","observation_id":"eb6736db-4a7d-4e4e-90cc-bbd9c71e525e","resolution":{"observed_at":"2026-08-14T04:41:03.497154Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.476996Z","title":"Compressed sensing with upscaled vector approximate message passing,","venue":null,"work_id":"a930e0ec-aeda-4c69-9c2c-7caad3d76405","year":2022},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:03.003227Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:3402de4f08d0f608fcb33b470a6909d9650f26aeeea02d9132cc4a751ccb2b01","observation_id":"345650e4-62b3-4c82-8d3f-bb7ff27b2c2e","resolution":{"observed_at":"2026-08-14T04:41:03.482747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.462628Z","title":"Warm-starting in message passing algorithms,","venue":null,"work_id":"82bdb439-fae8-487c-992f-28072684ac7f","year":2022},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:03.008688Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:ade55fac796291c1dc61aa98cc44422d3c6e2160d7b37186e9fd80d11d0b47f2","observation_id":"31699e37-1148-49fd-a41a-a4f842fbbf9e","resolution":{"observed_at":"2026-08-14T04:41:03.467555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.448023Z","title":"Approximate message passing algorithms for rotationally invariant matrices,","venue":null,"work_id":"f88bdf5f-6fc4-4f27-9609-f39c3191146a","year":2022},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:03.013953Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:8c1da0b664a18bec83bfc37608c63768a3fcf1fb30145d377c55a10325c3a541","observation_id":"21b46e17-15d4-4e67-9361-22d6af0b3453","resolution":{"observed_at":"2026-08-14T04:41:03.452831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.432876Z","title":"Estimation in rotationally invariant generalized linear models via approximate message passing,","venue":null,"work_id":"52482804-05bc-4c67-8c21-94b31e5ba9e6","year":2022},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:03.019162Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:93b3ea30e3ce50940125d7609341e5ae761055482c8a172bc86ccbab3f55053d","observation_id":"cc0c2cec-13c9-4578-a1f8-bd4deda7a9e1","resolution":{"observed_at":"2026-08-14T04:41:03.437171Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.01574","last_updated":"2024-12-02T14:56:35Z","snapshot_observed_at":"2026-08-12T19:42:53.162368Z","submitted_at":"2024-12-02T14:56:35Z","title":"Unifying AMP Algorithms for Rotationally-Invariant Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.01574","snapshot_observed_at":"2026-08-14T04:41:03.025249Z","title":"Unifying AMP algorithms for rotationally-invariant models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:03.025249Z"},"links":{"cited_paper":"/paper/2412.01574","citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:54a0ced881be005e59f1403c665a859a13f203b93bcf1f41e996b391feb8918a","observation_id":"eb54885a-86d8-4008-a2e5-efbae08697f5","resolution":{"observed_at":"2026-08-14T04:41:03.025249Z","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-14T04:41:03.418131Z","title":"Rotationally-invariant AMP for compressed sensing with multiple measurement vectors,","venue":null,"work_id":"8c96254e-4176-47a4-ad89-efe540b46756","year":2026},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:03.031176Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:b99c669501e51fe3d7eef3dc3c110b2563096a2da3460d627867f54e85cefe48","observation_id":"0adf8e91-cd7e-4963-9d0f-611119b418a6","resolution":{"observed_at":"2026-08-14T04:41:03.423420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.400050Z","title":null,"venue":null,"work_id":"f527129e-15ae-46d3-a19c-30a0f734e0a5","year":1993},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:03.037061Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:074a4b2eced551ae514311a7a02049b060b60db2309da0e7e479177347e84c1f","observation_id":"0dc3925d-d23e-48ab-aa30-7a17a5345d84","resolution":{"observed_at":"2026-08-14T04:41:03.405138Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.384371Z","title":"Generalized approximate message-passing for compressed sensing with sublinear sparsity,","venue":null,"work_id":"01fe0bc4-0f94-4000-a663-99f7520556a5","year":2025},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:03.041511Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:2564c8950e7295f08d1d31a49ca48b2d8cf6d7d496f21d5aae3f199c4b9fb9ae","observation_id":"c0368276-a1de-4fbf-8b20-8f726d24b600","resolution":{"observed_at":"2026-08-14T04:41:03.389380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2512.03326","last_updated":"2026-04-10T09:45:24Z","snapshot_observed_at":"2026-07-06T22:37:36.521477Z","submitted_at":"2025-12-03T00:36:07Z","title":"Generalized Orthogonal Approximate Message-Passing for Sublinear Sparsity","version":2},"cited_work":{"arxiv_id":"2512.03326","doi":null,"metadata_source":"pith","pith_arxiv_id":"2512.03326","snapshot_observed_at":"2026-08-14T04:41:03.187267Z","title":"Generalized Orthogonal Approximate Message-Passing for Sublinear Sparsity","venue":"cs.IT","work_id":"891e42c5-2d63-450b-a6f8-67ad237a2a5e","year":2025},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:03.046081Z"},"links":{"cited_paper":"/paper/2512.03326","citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:fc0f2ecbdbe28c12892b37acb16998725c04fbea093bd81a68c3e63f2afc088f","observation_id":"dbc19e38-0748-4d7e-9e20-47b9a733bede","resolution":{"observed_at":"2026-08-14T04:41:03.192736Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.14621","last_updated":"2026-04-27T05:13:24Z","snapshot_observed_at":"2026-08-02T21:36:48.265291Z","submitted_at":"2026-01-21T03:43:22Z","title":"Direct and Converse Theorems in Estimating Signals with Sublinear Sparsity","version":3},"cited_work":{"arxiv_id":"2601.14621","doi":null,"metadata_source":"pith","pith_arxiv_id":"2601.14621","snapshot_observed_at":"2026-08-14T04:41:03.164934Z","title":"Direct and Converse Theorems in Estimating Signals with Sublinear Sparsity","venue":"cs.IT","work_id":"5a8c15a2-1a7c-4c21-a299-85b0ec8ecc60","year":2026},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:03.051012Z"},"links":{"cited_paper":"/paper/2601.14621","citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:2280fab7a3fa5902420e4fd30b0a6261d3470457def0ed5fe2db42917723a287","observation_id":"130fb4a7-2540-41a6-8830-6160831bf1e4","resolution":{"observed_at":"2026-08-14T04:41:03.171201Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.369588Z","title":"Algebra of L-banded matrices,","venue":null,"work_id":"81f2cf32-3657-4500-aa07-99250b650af0","year":2023},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:03.055932Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:db8d7dd1e414c579e0f0bcc9e0804db33939cb3df8c41c2acd3a5b87bbb0f640","observation_id":"82a6b68c-fad4-4b1b-80c6-75d4f0e7a6be","resolution":{"observed_at":"2026-08-14T04:41:03.374202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.352793Z","title":"L-matrices with lacunary coefficients,","venue":null,"work_id":"fa338eab-2e4a-4f99-96b5-978e33c61e17","year":2021},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:03.060523Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:0a618af3e6d9f5909ece273cc09a9b6818cc023869e670ec27b38010159e1efa","observation_id":"dac6aefc-22a4-468d-ad0a-6134804d8d7e","resolution":{"observed_at":"2026-08-14T04:41:03.359457Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.337887Z","title":"The Hilbert L-matrix,","venue":null,"work_id":"e43581e0-ab79-48b1-b150-0fc77089e47a","year":2022},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:03.065166Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:c0d0a76d83638f358733c8ef41187297d344ed4a8a4032fa5683f5f72a965829","observation_id":"c9030965-fdf3-49ae-b497-f6015db58eec","resolution":{"observed_at":"2026-08-14T04:41:03.341991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.323602Z","title":"Asymptotic spectral properties of the Hilbert L-matrix,","venue":null,"work_id":"6bd38ce6-088f-4856-b470-e39e4a812a4e","year":2022},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:03.070034Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:6499f3400f11e34e1c94230df3739b61d51680b9c1674c9839618c756ff72c50","observation_id":"51aeab4b-2e21-409a-95d4-9ce872e6ec95","resolution":{"observed_at":"2026-08-14T04:41:03.328069Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.305609Z","title":"On the convergence of orthogonal/vector AMP: Long-memory message-passing strategy,","venue":null,"work_id":"20c12160-7ec5-47c7-9059-33a001998003","year":2022},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:03.075646Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:70f8c2f3d8f1ff0b7479caee5a1607842b8e4b2ef370c2f604f3fcac63a87fcf","observation_id":"4c1aa256-dc3e-48b1-a8fc-407544af5580","resolution":{"observed_at":"2026-08-14T04:41:03.311316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.290021Z","title":"Sufficient statistic memory approximate message passing,","venue":null,"work_id":"d6667891-2a7d-4ca2-8b24-63e03c3ab209","year":2022},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:03.080217Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:b5ded2854f1b59d0194ef4da65b33b19e11e9a76266c8b6645f8cfa2d7f63345","observation_id":"e8501998-865b-4208-92d9-543d6ad500c5","resolution":{"observed_at":"2026-08-14T04:41:03.295092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.15327","last_updated":"2023-06-30T03:26:48Z","snapshot_observed_at":"2026-08-16T19:30:31.701676Z","submitted_at":"2021-12-31T07:25:18Z","title":"Sufficient-Statistic Memory AMP","version":4},"cited_work":{"arxiv_id":"2112.15327","doi":null,"metadata_source":"pith","pith_arxiv_id":"2112.15327","snapshot_observed_at":"2026-08-14T04:41:03.140437Z","title":"Sufficient-Statistic Memory AMP","venue":"cs.IT","work_id":"11ee568a-1039-4a85-8af5-ed3703556983","year":2021},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:03.084543Z"},"links":{"cited_paper":"/paper/2112.15327","citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:b2d5dfa1dce572ba4cad554509ab38424b15287e5ac99a8f32f41e7103affe58","observation_id":"785346c3-1349-43cd-8d2f-bb84d75bed00","resolution":{"observed_at":"2026-08-14T04:41:03.146894Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.274044Z","title":"Rigorous dynamics of expectation-propagation signal detection via the conjugate gradient method,","venue":null,"work_id":"e82cfa37-c8c3-4ec4-b47d-60fa5c16c3bb","year":2017},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:03.089327Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:b6732cd74dc49535c5e8707aae8d07575881b6ac1daf611d2ae09bcf0525dc9d","observation_id":"e0e48314-8332-42a2-a5d9-8d417d716b9f","resolution":{"observed_at":"2026-08-14T04:41:03.279233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.258138Z","title":"Spectral universality in regularized linear regression with nearly deterministic sensing matrices,","venue":null,"work_id":"a2d942ce-cc54-4714-8efe-b3694f28b986","year":2024},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:03.094191Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:6121f869553375e9d9aaca0633bc3a0e39cf8b2b4ac81f075081c70b69160629","observation_id":"5e8eb61c-b878-4c49-91f6-d19bb45f1437","resolution":{"observed_at":"2026-08-14T04:41:03.263114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:41:03.243096Z","title":"Universality of approximate message passing algorithms and tensor networks,","venue":null,"work_id":"5f04dc06-d3b3-4da7-bcbd-024482a2e4a5","year":2024},"citing_paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:03.101559Z"},"links":{"citing_paper":"/paper/2608.08513"},"observation_digest":"sha256:93e9734ab4f99076645948860e78ec030edf9398709cb1b84dde60133df26bca","observation_id":"3f58cfe6-27ae-4895-976d-b7d7438d1227","resolution":{"observed_at":"2026-08-14T04:41:03.247648Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.08513","last_updated":"2026-08-09T06:19:51Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-14T04:30:39.820843Z","submitted_at":"2026-08-09T06:19:51Z","title":"Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis"},"reference_resolution":{"displayed":51,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":4,"verified_fuzzy":43},"total_outbound_references":51},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 51 of 51 outbound references and 0 inbound Pith citation observations for arXiv:2608.08513."}