{"as_of":"2026-08-23T04:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6103c0139d831a9077555590307cd774b124b96446e4082bb992a05dcf97bc80","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:45:51.782198Z","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-05-25T20:07:08.561230Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1902.05679","last_updated":"2019-03-29T03:28:35Z","snapshot_observed_at":"2026-08-19T19:09:59.073236Z","submitted_at":"2019-02-15T04:10:12Z","title":"ProxSARAH: An Efficient Algorithmic Framework for Stochastic Composite Nonconvex Optimization","version":2},"cited_work":{"arxiv_id":"1902.05679","doi":null,"metadata_source":"pith","pith_arxiv_id":"1902.05679","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"ProxSARAH: An Efficient Algorithmic Framework for Stochastic Composite Nonconvex Optimization","venue":"math.OC","work_id":"9c669b18-a14e-4809-8c5c-37d62e9df384","year":2019},"citing_paper":{"arxiv_id":"1906.08496","last_updated":"2019-06-20T08:22:48Z","snapshot_observed_at":"2026-08-19T05:31:08.852261Z","submitted_at":"2019-06-20T08:22:48Z","title":"Accelerating Mini-batch SARAH by Step Size Rules","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-25T20:03:01.738514Z"},"links":{"cited_paper":"/paper/1902.05679","citing_paper":"/paper/1906.08496"},"observation_digest":"sha256:a00dba5ae7648d8348d1d3838f394dd0784a4e3df29e861075ba285e1c44ea9b","observation_id":"78160e48-ed2c-41e9-8f2c-ba611d41db6f","resolution":{"observed_at":"2026-05-25T20:07:08.563865Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.05679","last_updated":"2019-03-29T03:28:35Z","snapshot_observed_at":"2026-08-19T19:09:59.073236Z","submitted_at":"2019-02-15T04:10:12Z","title":"ProxSARAH: An Efficient Algorithmic Framework for Stochastic Composite Nonconvex Optimization","version":2},"cited_work":{"arxiv_id":"1902.05679","doi":null,"metadata_source":"pith","pith_arxiv_id":"1902.05679","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"ProxSARAH: An Efficient Algorithmic Framework for Stochastic Composite Nonconvex Optimization","venue":"math.OC","work_id":"9c669b18-a14e-4809-8c5c-37d62e9df384","year":2019},"citing_paper":{"arxiv_id":"1906.10186","last_updated":"2019-06-24T19:21:29Z","snapshot_observed_at":"2026-08-02T11:11:25.599799Z","submitted_at":"2019-06-24T19:21:29Z","title":"A Stochastic Composite Gradient Method with Incremental Variance Reduction","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-25T17:02:34.602404Z"},"links":{"cited_paper":"/paper/1902.05679","citing_paper":"/paper/1906.10186"},"observation_digest":"sha256:31bbb3f7db72b0ca48e241a20ad253caf34e8496f7588097b05ebddc673edd73","observation_id":"1bb51306-5d6d-4294-9c15-d0af97f64adc","resolution":{"observed_at":"2026-05-25T17:06:07.878497Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.05679","last_updated":"2019-03-29T03:28:35Z","snapshot_observed_at":"2026-08-19T19:09:59.073236Z","submitted_at":"2019-02-15T04:10:12Z","title":"ProxSARAH: An Efficient Algorithmic Framework for Stochastic Composite Nonconvex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.05679","snapshot_observed_at":"2026-08-14T14:45:51.782198Z","title":"H., Nguyen, L","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.02734","last_updated":"2022-01-27T00:38:36Z","snapshot_observed_at":"2026-08-19T18:29:25.539516Z","submitted_at":"2019-08-07T17:10:52Z","title":"Stochastic First-order Methods for Convex and Nonconvex Functional Constrained Optimization","version":4},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T14:45:51.782198Z"},"links":{"cited_paper":"/paper/1902.05679","citing_paper":"/paper/1908.02734"},"observation_digest":"sha256:c3d69076ce0b2c0f21b8cf817e45e9c7b1a5280a79a6e08e9b848a0c18422ede","observation_id":"6e23db4b-f889-4b54-9e81-03985e7a0a3c","resolution":{"observed_at":"2026-08-14T14:45:51.782198Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.05679","last_updated":"2019-03-29T03:28:35Z","snapshot_observed_at":"2026-08-19T19:09:59.073236Z","submitted_at":"2019-02-15T04:10:12Z","title":"ProxSARAH: An Efficient Algorithmic Framework for Stochastic Composite Nonconvex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.05679","snapshot_observed_at":"2026-08-14T10:27:44.277111Z","title":"Pham, Lam M","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"1908.11468","last_updated":"2021-05-10T22:58:57Z","snapshot_observed_at":"2026-08-19T18:26:05.718803Z","submitted_at":"2019-08-29T22:22:06Z","title":"Multi-Level Composite Stochastic Optimization via Nested Variance Reduction","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T10:27:44.277111Z"},"links":{"cited_paper":"/paper/1902.05679","citing_paper":"/paper/1908.11468"},"observation_digest":"sha256:f9a1614ae7ed935a1b868c8fcfd48363bfc93c068acf2b5a8a542f0e2384659d","observation_id":"69704b07-3412-4757-a1fb-f4cdca8933db","resolution":{"observed_at":"2026-08-14T10:27:44.277111Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1902.05679/citation-record","integrity":"/paper/1902.05679/integrity","json":"/paper/1902.05679/citation-record.json","paper":"/paper/1902.05679"},"outbound":[],"paper":{"arxiv_id":"1902.05679","last_updated":"2019-03-29T03:28:35Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-19T19:09:59.073236Z","submitted_at":"2019-02-15T04:10:12Z","title":"ProxSARAH: An Efficient Algorithmic Framework for Stochastic Composite Nonconvex Optimization"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:1902.05679."}