{"as_of":"2026-08-09T07:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:38c26363c9ad45f649a7f0fb3614c08581bb175ecae90aa08de799be944bd49c","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:24:26.423484Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T22:07:38.672425Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.06304","snapshot_observed_at":"2026-08-07T04:24:26.423484Z","title":"Approximate message-passing for convex optimization with non-separable penalties","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-07T21:46:25.184559Z","submitted_at":"2025-06-12T14:35:26Z","title":"Computational Complexity of Statistics: New Insights from Low-Degree Polynomials","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:26.423484Z"},"links":{"cited_paper":"/paper/1809.06304","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:71fb1cbdbbfcfc118533e1224dea7e0ea5da380c69ff3126f18c49534497f037","observation_id":"291cdc5b-0798-4815-b338-af6d5b941e6b","resolution":{"observed_at":"2026-08-07T04:24:26.423484Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-08T10:49:06.781060Z","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:7d2de219acff6346cab30fd94866e087de26871b1e7835445dad4e2dff4236f5","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1809.06304/citation-record","integrity":"/paper/1809.06304/integrity","json":"/paper/1809.06304/citation-record.json","paper":"/paper/1809.06304"},"outbound":[],"paper":{"arxiv_id":"1809.06304","last_updated":"2018-09-17T16:14:55Z","latest_version":1,"primary_category":"stat.ML","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"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1809.06304."}