{"as_of":"2026-08-07T10:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:074458d1a194e8626109066921c770e94ca56f3f385a529c91ec40a9c434871f","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-07T06:34:17.273281+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-06T20:48:50.480589Z","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-06T18:39:45.044616Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2202.04509","last_updated":"2022-02-09T15:15:39Z","snapshot_observed_at":"2026-07-06T12:36:04.284368Z","submitted_at":"2022-02-09T15:15:39Z","title":"Optimal learning rate schedules in high-dimensional non-convex optimization problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.04509","snapshot_observed_at":"2026-08-06T20:48:50.480589Z","title":"Optimal learning rate schedules in high-dimensional non-convex optimization problems","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.02119","last_updated":"2025-07-07T06:13:26Z","snapshot_observed_at":"2026-08-06T20:35:13.610100Z","submitted_at":"2025-07-02T20:03:34Z","title":"Scaling Collapse Reveals Universal Dynamics in Compute-Optimally Trained Neural Networks","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T20:48:50.480589Z"},"links":{"cited_paper":"/paper/2202.04509","citing_paper":"/paper/2507.02119"},"observation_digest":"sha256:dea4b9bca6063f26d3b75eb3fcb5f4cc0d4950fb97dc9ab897ff0b299c18db75","observation_id":"80156d54-db79-46f4-8069-df4302dbccae","resolution":{"observed_at":"2026-08-06T20:48:50.480589Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.04509","last_updated":"2022-02-09T15:15:39Z","snapshot_observed_at":"2026-07-06T12:36:04.284368Z","submitted_at":"2022-02-09T15:15:39Z","title":"Optimal learning rate schedules in high-dimensional non-convex optimization problems","version":1},"cited_work":{"arxiv_id":"2202.04509","doi":null,"metadata_source":"pith","pith_arxiv_id":"2202.04509","snapshot_observed_at":"2026-08-06T18:39:45.044616Z","title":"Optimal learning rate schedules in high-dimensional non-convex optimization problems","venue":"cs.LG","work_id":"fe014e07-cd2b-4509-8ad6-15ce7a9a78c6","year":2022},"citing_paper":{"arxiv_id":"2507.07907","last_updated":"2026-06-22T15:49:10Z","snapshot_observed_at":"2026-08-06T18:27:13.743294Z","submitted_at":"2025-07-10T16:39:46Z","title":"A statistical physics framework for optimal learning","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T18:39:39.539635Z"},"links":{"cited_paper":"/paper/2202.04509","citing_paper":"/paper/2507.07907"},"observation_digest":"sha256:1e2250fe4cf0084e4ed16adb7d3e90c4a7b73f27a53354e77f33111d81d7ef2f","observation_id":"f25371e4-785c-4b18-b5ac-b47287052cdb","resolution":{"observed_at":"2026-08-06T18:39:45.097555Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2202.04509/citation-record","integrity":"/paper/2202.04509/integrity","json":"/paper/2202.04509/citation-record.json","paper":"/paper/2202.04509"},"outbound":[],"paper":{"arxiv_id":"2202.04509","last_updated":"2022-02-09T15:15:39Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T12:36:04.284368Z","submitted_at":"2022-02-09T15:15:39Z","title":"Optimal learning rate schedules in high-dimensional non-convex optimization problems"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2202.04509."}