{"as_of":"2026-08-10T16:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9926981620698d70152748d7f7c355b55a547db8ed70ef138803357bab0dffdf","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T13:53:06.068984Z","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-05-23T19:03:21.942936Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2208.05287","last_updated":"2022-08-10T11:36:00Z","snapshot_observed_at":"2026-08-09T15:36:40.843647Z","submitted_at":"2022-08-10T11:36:00Z","title":"Adaptive Learning Rates for Faster Stochastic Gradient Methods","version":1},"cited_work":{"arxiv_id":"2208.05287","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2208.05287","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Adaptive learning rates for faster stochastic gradient methods","venue":null,"work_id":"ab62595f-4fd1-4c7e-9047-05e18f506c04","year":2022},"citing_paper":{"arxiv_id":"2410.15368","last_updated":"2026-04-18T10:06:33Z","snapshot_observed_at":"2026-07-06T19:36:36.994783Z","submitted_at":"2024-10-20T11:53:25Z","title":"Tighter Performance Theory of FedExProx","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-23T18:58:32.168274Z"},"links":{"cited_paper":"/paper/2208.05287","citing_paper":"/paper/2410.15368"},"observation_digest":"sha256:e5f7b82b903f98cccf3c237e855fa1534fb6b1aa3fc2c0da5df98a5952a6e70c","observation_id":"5adb17da-ad5a-46da-b5b3-05ffdbf10a0e","resolution":{"observed_at":"2026-05-23T19:03:21.946282Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2208.05287","last_updated":"2022-08-10T11:36:00Z","snapshot_observed_at":"2026-08-09T15:36:40.843647Z","submitted_at":"2022-08-10T11:36:00Z","title":"Adaptive Learning Rates for Faster Stochastic Gradient Methods","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.05287","snapshot_observed_at":"2026-08-09T13:53:06.068984Z","title":"Adaptive learning rates for faster stochastic gradient methods","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.02002","last_updated":"2025-07-30T08:25:58Z","snapshot_observed_at":"2026-08-09T15:36:50.248580Z","submitted_at":"2025-02-04T04:30:03Z","title":"The Ball-Proximal (=\"Broximal\") Point Method: a New Algorithm, Convergence Theory, and Applications","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-09T13:53:06.068984Z"},"links":{"cited_paper":"/paper/2208.05287","citing_paper":"/paper/2502.02002"},"observation_digest":"sha256:94724310d9cbd3b4de2895709fa7b6278dff111686b31f70900b204b53136db5","observation_id":"47b95590-d0b5-4e95-b70d-e18acadf2c7a","resolution":{"observed_at":"2026-08-09T13:53:06.068984Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.05287","last_updated":"2022-08-10T11:36:00Z","snapshot_observed_at":"2026-08-09T15:36:40.843647Z","submitted_at":"2022-08-10T11:36:00Z","title":"Adaptive Learning Rates for Faster Stochastic Gradient Methods","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.05287","snapshot_observed_at":"2026-08-03T19:10:48.546822Z","title":"Adaptive learning rates for faster stochastic gradient methods.arXiv preprint arXiv:2208.05287,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.02342","last_updated":"2026-06-01T07:48:25Z","snapshot_observed_at":"2026-08-06T14:41:54.013603Z","submitted_at":"2025-12-02T02:24:32Z","title":"Safeguarded Stochastic Polyak Step Sizes for Non-smooth Optimization: Robust Performance Without Small (Sub)Gradients","version":3},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-03T19:10:48.546822Z"},"links":{"cited_paper":"/paper/2208.05287","citing_paper":"/paper/2512.02342"},"observation_digest":"sha256:c68ebf67d55902e011e922a1cd4d4a0c7d2d5ae07024127c1eccce2e30b29c22","observation_id":"32766695-93b6-4213-8436-5fe17a3bdafd","resolution":{"observed_at":"2026-08-03T19:10:48.546822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2208.05287/citation-record","integrity":"/paper/2208.05287/integrity","json":"/paper/2208.05287/citation-record.json","paper":"/paper/2208.05287"},"outbound":[],"paper":{"arxiv_id":"2208.05287","last_updated":"2022-08-10T11:36:00Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T15:36:40.843647Z","submitted_at":"2022-08-10T11:36:00Z","title":"Adaptive Learning Rates for Faster Stochastic Gradient Methods"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2208.05287."}