Pith. sign in

Paper Citation Record · LEDGER

Approximate message-passing for convex optimization with non-separable penalties

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
1809.06304 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T04:24:26.423484Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-06T22:07:38.672425Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 291cdc5b-0798-4815-b338-af6d5b941e6b · inbound

Computational Complexity of Statistics: New Insights from Low-Degree Polynomials cites this paper.

Computational Complexity of Statistics: New Insights from Low-Degree Polynomials Approximate message-passing for convex optimization with non-separable penalties

Reference 2019

Resolution
unresolved
no resolver link, observed 2026-08-07T04:24:26.423484Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T04:24:26.423484Z digest=sha256:71fb1cbdbbfcfc118533e1224dea7e0ea5da380c69ff3126f18c49534497f037

Observation 4f9f4c9f-b5e6-4b64-988f-91036a798d64 · inbound

On Universality of Non-Separable Approximate Message Passing Algorithms cites this paper.

On Universality of Non-Separable Approximate Message Passing Algorithms Approximate message-passing for convex optimization with non-separable penalties

Reference 51

Resolution
verified exact
local_arxiv, observed 2026-08-06T22:07:38.750701Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-08-06T22:07:35.805172Z digest=sha256:cf43e30adf5e1a5ca1347a3ea0d4762ed8b7d67b4192b8bfcc6aca1daa96535c