{"as_of":"2026-08-18T19:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:26c392a4f92afcfdc38a5ead497cbd4bcca396023c0bf84b74b400bc8bcb5216","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:16:49.509635Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-13T17:03:00.988516Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2201.07487","last_updated":"2022-03-01T02:31:31Z","snapshot_observed_at":"2026-08-18T02:30:03.056604Z","submitted_at":"2022-01-19T09:22:42Z","title":"A Concise Tutorial on Approximate Message Passing","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.07487","snapshot_observed_at":"2026-08-07T05:32:09.856136Z","title":"A concise tutorial on approximate message pass- ing,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.07799","last_updated":"2025-06-09T14:26:40Z","snapshot_observed_at":"2026-08-17T03:32:16.817917Z","submitted_at":"2025-06-09T14:26:40Z","title":"Learned Off-Grid Imager for Low-Altitude Economy with Cooperative ISAC Network","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T05:32:09.856136Z"},"links":{"cited_paper":"/paper/2201.07487","citing_paper":"/paper/2506.07799"},"observation_digest":"sha256:ddf03830b69c744be1b5f7700e80988d4c2f36ebfc4152b92e500e97ef7b1c26","observation_id":"821a4b11-aa80-4df6-87ec-1789dfec5cc4","resolution":{"observed_at":"2026-08-07T05:32:09.856136Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.07487","last_updated":"2022-03-01T02:31:31Z","snapshot_observed_at":"2026-08-18T02:30:03.056604Z","submitted_at":"2022-01-19T09:22:42Z","title":"A Concise Tutorial on Approximate Message Passing","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.07487","snapshot_observed_at":"2026-08-07T04:24:27.226304Z","title":"A concise tutorial on approximate message passing","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.10748","last_updated":"2025-06-12T14:35:26Z","snapshot_observed_at":"2026-08-14T18:28:43.937637Z","submitted_at":"2025-06-12T14:35:26Z","title":"Computational Complexity of Statistics: New Insights from Low-Degree Polynomials","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:27.226304Z"},"links":{"cited_paper":"/paper/2201.07487","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:d0f1ef0a0507622733ca82391f21a8ed1af2c0199fa69e7521153e1c35d9f59a","observation_id":"8029d2bd-4266-4c6f-a8a6-06ee0dd08c31","resolution":{"observed_at":"2026-08-07T04:24:27.226304Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.07487","last_updated":"2022-03-01T02:31:31Z","snapshot_observed_at":"2026-08-18T02:30:03.056604Z","submitted_at":"2022-01-19T09:22:42Z","title":"A Concise Tutorial on Approximate Message Passing","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.07487","snapshot_observed_at":"2026-08-04T13:54:32.704756Z","title":"Zou and H","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.24882","last_updated":"2026-08-06T09:40:55Z","snapshot_observed_at":"2026-08-16T03:28:11.105163Z","submitted_at":"2025-09-29T14:58:13Z","title":"Scaling Laws and Spectra of Shallow Neural Networks in the Feature Learning Regime","version":2},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-04T13:54:32.704756Z"},"links":{"cited_paper":"/paper/2201.07487","citing_paper":"/paper/2509.24882"},"observation_digest":"sha256:92ecb6e76bf9f454395e538c2c3bbc7038e981bdb1d9df4572af9cd09fc6d7d4","observation_id":"9480db28-ef92-42b6-983e-2a4253201362","resolution":{"observed_at":"2026-08-04T13:54:32.704756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.07487","last_updated":"2022-03-01T02:31:31Z","snapshot_observed_at":"2026-08-18T02:30:03.056604Z","submitted_at":"2022-01-19T09:22:42Z","title":"A Concise Tutorial on Approximate Message Passing","version":3},"cited_work":{"arxiv_id":"2201.07487","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2201.07487","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A Concise Tutorial on Approximate Message Passing","venue":null,"work_id":"81a26164-34e9-4f4f-9219-639687a11781","year":2022},"citing_paper":{"arxiv_id":"2604.03717","last_updated":"2026-04-04T12:51:23Z","snapshot_observed_at":"2026-08-06T18:01:09.720614Z","submitted_at":"2026-04-04T12:51:23Z","title":"Regularized Approximate Message Passing for Overloaded Discrete Linear Inversion","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-13T17:02:30.068036Z"},"links":{"cited_paper":"/paper/2201.07487","citing_paper":"/paper/2604.03717"},"observation_digest":"sha256:7ddd2dcece145ff1c284550725549a7e2871c140d167c429d86abf6d03c00aee","observation_id":"7c5b4ccf-f648-4baf-846b-05da4833bb4d","resolution":{"observed_at":"2026-05-13T17:03:00.990256Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.07487","last_updated":"2022-03-01T02:31:31Z","snapshot_observed_at":"2026-08-18T02:30:03.056604Z","submitted_at":"2022-01-19T09:22:42Z","title":"A Concise Tutorial on Approximate Message Passing","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.07487","snapshot_observed_at":"2026-08-16T00:16:49.509635Z","title":"A concise tutorial on approximate message passing.arXiv preprint arXiv:2201.07487, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.12309","last_updated":"2026-08-12T17:54:59Z","snapshot_observed_at":"2026-08-16T06:35:26.815591Z","submitted_at":"2026-08-12T17:54:59Z","title":"A contiguity approach to replica symmetric marginals","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T00:16:49.509635Z"},"links":{"cited_paper":"/paper/2201.07487","citing_paper":"/paper/2608.12309"},"observation_digest":"sha256:636999e041a2a60e57577f82a5e18a7842f5cbd88e23201df080d8cb762b6a91","observation_id":"cee31fc5-7314-4efb-b188-783b49b1191f","resolution":{"observed_at":"2026-08-16T00:16:49.509635Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2201.07487/citation-record","integrity":"/paper/2201.07487/integrity","json":"/paper/2201.07487/citation-record.json","paper":"/paper/2201.07487"},"outbound":[],"paper":{"arxiv_id":"2201.07487","last_updated":"2022-03-01T02:31:31Z","latest_version":3,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-18T02:30:03.056604Z","submitted_at":"2022-01-19T09:22:42Z","title":"A Concise Tutorial on Approximate Message Passing"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2201.07487."}