{"as_of":"2026-08-08T08:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:80a6e1576a0c094311c05145fa3381771afcbc7fb441986911f5dc2bcaed0491","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-08T06:32:00.761636+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-08-06T17:59:06.173684Z","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-06T17:59:08.623179Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1604.05275","last_updated":"2017-11-27T14:39:00Z","snapshot_observed_at":"2026-08-06T05:08:56.949625Z","submitted_at":"2016-04-18T18:43:36Z","title":"Universal fast gradient method for stochastic composit optimization problems","version":16},"cited_work":{"arxiv_id":"1604.05275","doi":null,"metadata_source":"pith","pith_arxiv_id":"1604.05275","snapshot_observed_at":"2026-08-06T17:59:08.623179Z","title":"Universal fast gradient method for stochastic composit optimization problems","venue":"math.OC","work_id":"4fc17ec6-8985-4814-b6eb-a3cee2bb9195","year":2016},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-06T17:44:16.269487Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:06.173684Z"},"links":{"cited_paper":"/paper/1604.05275","citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:dc15587c9b2ed196726209a6567be7c93ae08dc4423bb502effd28e434dd3a1e","observation_id":"2fd90a81-0e51-439d-bbdb-09633f2b06e5","resolution":{"observed_at":"2026-08-06T17:59:08.683842Z","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/1604.05275/citation-record","integrity":"/paper/1604.05275/integrity","json":"/paper/1604.05275/citation-record.json","paper":"/paper/1604.05275"},"outbound":[],"paper":{"arxiv_id":"1604.05275","last_updated":"2017-11-27T14:39:00Z","latest_version":16,"primary_category":"math.OC","snapshot_observed_at":"2026-08-06T05:08:56.949625Z","submitted_at":"2016-04-18T18:43:36Z","title":"Universal fast gradient method for stochastic composit optimization problems"},"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 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1604.05275."}