{"as_of":"2026-08-08T13:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:54a2da43d6f8eb92912750523ff767b09a1eca84ba812a8c653f587d2098ee84","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:14:19.004283Z","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-06T23:35:25.563784Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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-07T13:14:19.004283Z","title":"Provable and practical online learning rate adaptation with hypergradient descent, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.22509","last_updated":"2025-05-28T15:59:13Z","snapshot_observed_at":"2026-08-07T13:03:10.073113Z","submitted_at":"2025-05-28T15:59:13Z","title":"Accelerating Optimization via Differentiable Stopping Time","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T13:14:19.004283Z"},"links":{"cited_paper":"/paper/2502.11229","citing_paper":"/paper/2505.22509"},"observation_digest":"sha256:b6726af5cb83628469a6b8b466130f29c341f0ce0cbae8117458e0da1b917586","observation_id":"a277722c-614f-4e40-a411-d77936011535","resolution":{"observed_at":"2026-08-07T13:14:19.004283Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-07T13:10:07.974495Z","title":"Provable and practical online learning rate adaptation with hypergradient descent.arXiv preprint arXiv:2502.11229, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.23081","last_updated":"2025-09-05T02:19:47Z","snapshot_observed_at":"2026-08-08T05:47:28.129882Z","submitted_at":"2025-05-29T04:35:21Z","title":"Gradient Methods with Online Scaling Part I. Theoretical Foundations","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:07.974495Z"},"links":{"cited_paper":"/paper/2502.11229","citing_paper":"/paper/2505.23081"},"observation_digest":"sha256:7bacd41e894ae58fc88ae2787652fb8a028ce72dd9e7938a33a37221b5f45ac6","observation_id":"08be7905-0102-40c6-a315-5309d64fbfbe","resolution":{"observed_at":"2026-08-07T13:10:07.974495Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":{"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":"2502.11229","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.11229","snapshot_observed_at":"2026-08-06T23:35:25.563784Z","title":"Provable and Practical Online Learning Rate Adaptation with Hypergradient Descent","venue":"math.OC","work_id":"bc5124a5-e670-47f4-a3e6-4eb64ff8b2dd","year":2025},"citing_paper":{"arxiv_id":"2506.17650","last_updated":"2025-06-21T09:20:30Z","snapshot_observed_at":"2026-08-07T18:15:50.465521Z","submitted_at":"2025-06-21T09:20:30Z","title":"Enhanced PDHG for Linear Programming with Online Preconditioning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T23:35:23.707323Z"},"links":{"cited_paper":"/paper/2502.11229","citing_paper":"/paper/2506.17650"},"observation_digest":"sha256:c19fb1514f9a6648ceb33e3ebf0f0b2f5aea68008c6e0ac38968322fc4ff342d","observation_id":"0c6a470f-6ee9-4c1c-9f02-6655826c5fc1","resolution":{"observed_at":"2026-08-06T23:35:25.620841Z","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/2502.11229/citation-record","integrity":"/paper/2502.11229/integrity","json":"/paper/2502.11229/citation-record.json","paper":"/paper/2502.11229"},"outbound":[],"paper":{"arxiv_id":"2502.11229","last_updated":"2025-03-16T21:17:53Z","latest_version":2,"primary_category":"math.OC","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"},"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 4 inbound Pith citation observations for arXiv:2502.11229."}