{"as_of":"2026-08-04T22:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e0c80e2261abd421a134bb29eb1ae757b7c3dbf3c02087d7545873797b61174e","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T03:42:57.288700Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T17:48:46.079770Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1806.05633","last_updated":"2020-04-02T12:50:38Z","snapshot_observed_at":"2026-07-06T06:44:53.896543Z","submitted_at":"2018-06-14T16:22:30Z","title":"Improving SAGA via a Probabilistic Interpolation with Gradient Descent","version":2},"cited_work":{"arxiv_id":"1806.05633","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1806.05633","snapshot_observed_at":"2026-07-03T17:48:46.079770Z","title":null,"venue":null,"work_id":"61ff885f-fb67-4a37-902c-a544da729d31","year":2018},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"cited_paper":"/paper/1806.05633","citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:1f61c7160062afb0542c2d1d82280c4a0326c9430d489da8eec5ca9421c75e98","observation_id":"10520edd-acac-495f-8022-7c3513b10e63","resolution":{"observed_at":"2026-07-03T17:48:46.081089Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1806.05633/citation-record","integrity":"/paper/1806.05633/integrity","json":"/paper/1806.05633/citation-record.json","paper":"/paper/1806.05633"},"outbound":[],"paper":{"arxiv_id":"1806.05633","last_updated":"2020-04-02T12:50:38Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T06:44:53.896543Z","submitted_at":"2018-06-14T16:22:30Z","title":"Improving SAGA via a Probabilistic Interpolation with Gradient Descent"},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1806.05633."}