{"as_of":"2026-08-04T20:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:51147c56cb55b1c9eb82d9e8c00055c40ff395325ced1e5230042ca24cd0478c","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T19:10:48.546822Z","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-07-06T13:40:34.929858Z","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:88a740108b7a9372e04f4f941ed1f0d36072905140c6bfcb5e289002f3255e70","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-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"}},{"citation":{"cited_paper":{"arxiv_id":"2208.05287","last_updated":"2022-08-10T11:36:00Z","snapshot_observed_at":"2026-07-06T13:40:34.929858Z","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-03T19:10:46.610428Z","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:7de2f39eccf329374af675438273bef8d830c3572b751f97cb58275d3e0c6d4c","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-07-06T13:40:34.929858Z","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-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 2 inbound Pith citation observations for arXiv:2208.05287."}