{"as_of":"2026-08-08T10:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dab0d9b6fac7dc1a93a316677f03eea619d8f1b627a1a2d17be341d799421ba7","coverage":[{"denominator":3,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:24:28.611408Z","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-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2506.08419/citation-record","integrity":"/paper/2506.08419/integrity","json":"/paper/2506.08419/citation-record.json","paper":"/paper/2506.08419"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.11229","last_updated":"2025-03-16T21:17:53Z","snapshot_observed_at":"2026-08-07T18:14:26.210171Z","submitted_at":"2025-02-16T18:49:02Z","title":"Provable and Practical Online Learning Rate Adaptation with Hypergradient Descent","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.11229","snapshot_observed_at":"2026-08-07T05:24:28.587566Z","title":"Parameter adaptation in stochastic optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.08419","last_updated":"2025-06-10T03:46:41Z","snapshot_observed_at":"2026-08-07T05:09:24.588698Z","submitted_at":"2025-06-10T03:46:41Z","title":"Online Learning-guided Learning Rate Adaptation via Gradient Alignment","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T05:24:28.587566Z"},"links":{"cited_paper":"/paper/2502.11229","citing_paper":"/paper/2506.08419"},"observation_digest":"sha256:01d7d0a2f51c28597b09cfb5c401e260c2a5b8182c080b7a02b44dc0a270eb9e","observation_id":"66452ae3-c590-49df-a718-1e1660c260f2","resolution":{"observed_at":"2026-08-07T05:24:28.587566Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:24:28.721670Z","title":"High Probability Bounds for a Class of Nonconvex Algorithms with AdaGrad Stepsize","venue":null,"work_id":"3481df03-ed12-46bb-9bef-60e23b908e32","year":2023},"citing_paper":{"arxiv_id":"2506.08419","last_updated":"2025-06-10T03:46:41Z","snapshot_observed_at":"2026-08-07T05:09:24.588698Z","submitted_at":"2025-06-10T03:46:41Z","title":"Online Learning-guided Learning Rate Adaptation via Gradient Alignment","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T05:24:28.605387Z"},"links":{"citing_paper":"/paper/2506.08419"},"observation_digest":"sha256:a797dff97cb4ca684647791fd8621dc48995c30379064e455154793d023c18e9","observation_id":"db71fd12-d1b0-41b3-a719-d93ce2f7bdae","resolution":{"observed_at":"2026-08-07T05:24:28.734231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2310.10082","last_updated":"2024-08-17T03:06:14Z","snapshot_observed_at":"2026-08-08T00:23:42.227303Z","submitted_at":"2023-10-16T05:26:03Z","title":"A simple uniformly optimal method without line search for convex optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.10082","snapshot_observed_at":"2026-08-07T05:24:28.611408Z","title":"A High Probability Analysis of Adaptive SGD with Mo- mentum","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.08419","last_updated":"2025-06-10T03:46:41Z","snapshot_observed_at":"2026-08-07T05:09:24.588698Z","submitted_at":"2025-06-10T03:46:41Z","title":"Online Learning-guided Learning Rate Adaptation via Gradient Alignment","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T05:24:28.611408Z"},"links":{"cited_paper":"/paper/2310.10082","citing_paper":"/paper/2506.08419"},"observation_digest":"sha256:aeb343519a6b90aecf954d6bfee77c379ac12e114b6ad459a7d7e16c38cca7ec","observation_id":"1a7f0fb7-aca2-4c02-842a-88d3e1c121da","resolution":{"observed_at":"2026-08-07T05:24:28.611408Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.08419","last_updated":"2025-06-10T03:46:41Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T05:09:24.588698Z","submitted_at":"2025-06-10T03:46:41Z","title":"Online Learning-guided Learning Rate Adaptation via Gradient Alignment"},"reference_resolution":{"displayed":3,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":1},"total_outbound_references":3},"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 3 of 3 outbound references and 0 inbound Pith citation observations for arXiv:2506.08419."}