{"as_of":"2026-08-09T02:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9781e0a16ec35ec91750904044b2d37020b6b12ca86443760723670bdeb12a6f","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-08T06:32:00.761636+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-06T18:59:58.726205Z","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-05T10:49:34.995346Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.03309","last_updated":"2024-06-05T14:22:33Z","snapshot_observed_at":"2026-08-07T19:49:07.534558Z","submitted_at":"2024-06-05T14:22:33Z","title":"Forward-backward algorithms devised by graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.03309","snapshot_observed_at":"2026-08-06T18:59:58.726205Z","title":"Forward-backward algorithms de- vised by graphs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.07428","last_updated":"2026-06-10T03:37:25Z","snapshot_observed_at":"2026-08-08T11:43:29.516970Z","submitted_at":"2025-07-10T04:44:05Z","title":"Relocated Fixed-Point Iterations with Applications to Variable Stepsize Resolvent Splitting","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T18:59:58.726205Z"},"links":{"cited_paper":"/paper/2406.03309","citing_paper":"/paper/2507.07428"},"observation_digest":"sha256:993b4a3259a19288471ec237122fb93653a4b97080ad548ab4caf9fc4c1979ab","observation_id":"d86f3db5-63f0-440a-878b-123be30b2112","resolution":{"observed_at":"2026-08-06T18:59:58.726205Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.03309","last_updated":"2024-06-05T14:22:33Z","snapshot_observed_at":"2026-08-07T19:49:07.534558Z","submitted_at":"2024-06-05T14:22:33Z","title":"Forward-backward algorithms devised by graphs","version":1},"cited_work":{"arxiv_id":"2406.03309","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.03309","snapshot_observed_at":"2026-08-05T10:49:34.995346Z","title":"Forward-backward algorithms devised by graphs","venue":"math.OC","work_id":"65734236-4ee6-4d8d-9c2b-33931e0ff223","year":2024},"citing_paper":{"arxiv_id":"2509.03865","last_updated":"2025-09-04T03:55:11Z","snapshot_observed_at":"2026-08-07T12:24:21.676822Z","submitted_at":"2025-09-04T03:55:11Z","title":"Frugal forward-backward splitting methods with deviations","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T10:49:33.559928Z"},"links":{"cited_paper":"/paper/2406.03309","citing_paper":"/paper/2509.03865"},"observation_digest":"sha256:8c65076126113b20d3c4e2c6bcb3ab16228dea7d9f95aff9027ed8351b347b43","observation_id":"1f0bbdb7-9353-4a00-a35a-2b6f415cc8ee","resolution":{"observed_at":"2026-08-05T10:49:35.026540Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2406.03309/citation-record","integrity":"/paper/2406.03309/integrity","json":"/paper/2406.03309/citation-record.json","paper":"/paper/2406.03309"},"outbound":[],"paper":{"arxiv_id":"2406.03309","last_updated":"2024-06-05T14:22:33Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T19:49:07.534558Z","submitted_at":"2024-06-05T14:22:33Z","title":"Forward-backward algorithms devised by graphs"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:2406.03309."}