{"as_of":"2026-08-05T11:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a36838173c8737313a5120b618f6b782b1f8a8fe25eafca0ba038729ed16645a","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-05T06:32:48.257954+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-07-11T20:46:05.467029Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.18471","last_updated":"2023-09-28T08:58:09Z","snapshot_observed_at":"2026-07-06T15:34:59.457879Z","submitted_at":"2023-05-29T09:33:04Z","title":"Convergence of AdaGrad for Non-convex Objectives: Simple Proofs and Relaxed Assumptions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.18471","snapshot_observed_at":"2026-07-11T20:46:05.467029Z","title":"Convergence of AdaGrad for Non-convex Objectives: Simple Proofs and Relaxed Assumptions","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04233","last_updated":"2026-07-05T11:11:40Z","snapshot_observed_at":"2026-08-02T19:43:06.845476Z","submitted_at":"2026-07-05T11:11:40Z","title":"Unified convergence analysis for gradient descent optimization methods in the training of deep neural networks","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-07-11T20:46:05.467029Z"},"links":{"cited_paper":"/paper/2305.18471","citing_paper":"/paper/2607.04233"},"observation_digest":"sha256:4b512af6b73096022dc947e0cd874c8b6a69256862f5bfeb2760afe7ecb0c86a","observation_id":"70a36b4a-bd04-4ce1-b257-255ef1d66528","resolution":{"observed_at":"2026-07-11T20:46:05.467029Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2305.18471/citation-record","integrity":"/paper/2305.18471/integrity","json":"/paper/2305.18471/citation-record.json","paper":"/paper/2305.18471"},"outbound":[],"paper":{"arxiv_id":"2305.18471","last_updated":"2023-09-28T08:58:09Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T15:34:59.457879Z","submitted_at":"2023-05-29T09:33:04Z","title":"Convergence of AdaGrad for Non-convex Objectives: Simple Proofs and Relaxed Assumptions"},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2305.18471."}