{"as_of":"2026-08-08T02:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:874cc76b0a9516ea9fc052742c9f2115cc801222df4196b56a39851077dc259c","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-07T06:34:17.273281+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-06T10:32:29.867233Z","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-07-10T11:57:03.279012Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2301.04431","last_updated":"2024-03-13T12:01:29Z","snapshot_observed_at":"2026-08-05T03:08:48.581475Z","submitted_at":"2023-01-11T12:19:28Z","title":"Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient","version":4},"cited_work":{"arxiv_id":"2301.04431","doi":null,"metadata_source":"pith","pith_arxiv_id":"2301.04431","snapshot_observed_at":"2026-07-10T11:57:03.279012Z","title":"Latafat, A","venue":"math.OC","work_id":"c1b61027-3924-4e5f-bb4c-61faa4fbc7ee","year":2023},"citing_paper":{"arxiv_id":"2412.14291","last_updated":"2026-05-14T16:58:17Z","snapshot_observed_at":"2026-07-06T20:09:33.491422Z","submitted_at":"2024-12-18T19:34:16Z","title":"Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-23T06:23:51.617737Z"},"links":{"cited_paper":"/paper/2301.04431","citing_paper":"/paper/2412.14291"},"observation_digest":"sha256:86067919eb95d42195cce7b723651b4dcdd6169cb1ba5b88dc27e2a55d19abd0","observation_id":"87639928-5f7b-48d8-a397-1710003e9166","resolution":{"observed_at":"2026-05-23T06:25:28.059606Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.04431","last_updated":"2024-03-13T12:01:29Z","snapshot_observed_at":"2026-08-05T03:08:48.581475Z","submitted_at":"2023-01-11T12:19:28Z","title":"Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.04431","snapshot_observed_at":"2026-08-06T10:32:29.867233Z","title":"Latafat, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.23725","last_updated":"2025-07-31T16:58:40Z","snapshot_observed_at":"2026-08-06T10:32:29.026702Z","submitted_at":"2025-07-31T16:58:40Z","title":"Adaptive Stepsize Selection in Decentralized Convex Optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T10:32:29.867233Z"},"links":{"cited_paper":"/paper/2301.04431","citing_paper":"/paper/2507.23725"},"observation_digest":"sha256:e4bcca531b5246e68c0acd0c9065ce90373802b57e317bc3f77224622b39a75a","observation_id":"400b61af-b8f5-478c-9a33-85c8495e5db5","resolution":{"observed_at":"2026-08-06T10:32:29.867233Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.04431","last_updated":"2024-03-13T12:01:29Z","snapshot_observed_at":"2026-08-05T03:08:48.581475Z","submitted_at":"2023-01-11T12:19:28Z","title":"Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.04431","snapshot_observed_at":"2026-08-05T23:05:49.702787Z","title":"Latafat, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.06002","last_updated":"2025-08-08T04:09:48Z","snapshot_observed_at":"2026-08-05T23:05:48.338397Z","submitted_at":"2025-08-08T04:09:48Z","title":"Kahan's Automatic Step-Size Control for Unconstrained Optimization","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:49.702787Z"},"links":{"cited_paper":"/paper/2301.04431","citing_paper":"/paper/2508.06002"},"observation_digest":"sha256:0fafa319415510bd7e9c9b63c7c0354bae966ca092bc9b4b69da416c618514d7","observation_id":"c176c4d3-9315-4cbc-989e-0e2ed18df4b5","resolution":{"observed_at":"2026-08-05T23:05:49.702787Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.04431","last_updated":"2024-03-13T12:01:29Z","snapshot_observed_at":"2026-08-05T03:08:48.581475Z","submitted_at":"2023-01-11T12:19:28Z","title":"Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient","version":4},"cited_work":{"arxiv_id":"2301.04431","doi":null,"metadata_source":"pith","pith_arxiv_id":"2301.04431","snapshot_observed_at":"2026-07-10T11:57:03.279012Z","title":"Latafat, A","venue":"math.OC","work_id":"c1b61027-3924-4e5f-bb4c-61faa4fbc7ee","year":2023},"citing_paper":{"arxiv_id":"2607.08174","last_updated":"2026-08-02T11:58:16Z","snapshot_observed_at":"2026-08-07T06:26:58.365233Z","submitted_at":"2026-07-09T07:19:36Z","title":"Two Adaptive Accelerated Golden Ratio Primal--Dual Algorithms With an Application to Poisson Imaging Problem","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-10T11:53:56.856853Z"},"links":{"cited_paper":"/paper/2301.04431","citing_paper":"/paper/2607.08174"},"observation_digest":"sha256:c45b40e48403143682195daa87da8a0d5820091654e220a4c7aaad569627128d","observation_id":"f9f42870-d830-455e-a45b-96af399e177c","resolution":{"observed_at":"2026-07-10T11:57:03.280526Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.04431","last_updated":"2024-03-13T12:01:29Z","snapshot_observed_at":"2026-08-05T03:08:48.581475Z","submitted_at":"2023-01-11T12:19:28Z","title":"Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.04431","snapshot_observed_at":"2026-08-04T04:27:58.683439Z","title":"arXiv preprint arXiv:2301.04431v4 (2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.08174","last_updated":"2026-08-02T11:58:16Z","snapshot_observed_at":"2026-08-07T06:26:58.365233Z","submitted_at":"2026-07-09T07:19:36Z","title":"Two Adaptive Accelerated Golden Ratio Primal--Dual Algorithms With an Application to Poisson Imaging Problem","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T04:27:58.683439Z"},"links":{"cited_paper":"/paper/2301.04431","citing_paper":"/paper/2607.08174"},"observation_digest":"sha256:6e4df0d6dd9ed67bb4705cb178ae7aedbb671bdfb435ce77d6a9e234a4c909a3","observation_id":"b9ec990e-91aa-4aa4-be06-8cde238dc506","resolution":{"observed_at":"2026-08-04T04:27:58.683439Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2301.04431/citation-record","integrity":"/paper/2301.04431/integrity","json":"/paper/2301.04431/citation-record.json","paper":"/paper/2301.04431"},"outbound":[],"paper":{"arxiv_id":"2301.04431","last_updated":"2024-03-13T12:01:29Z","latest_version":4,"primary_category":"math.OC","snapshot_observed_at":"2026-08-05T03:08:48.581475Z","submitted_at":"2023-01-11T12:19:28Z","title":"Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2301.04431."}