{"as_of":"2026-08-21T22:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:437cfef416520040e5c542b6c2ec1c890b7f622773a55941906c2cb33d4b80d6","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-21T06:32:19.484+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-11T20:02:09.767583Z","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-08T16:39:14.355410Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.11291","last_updated":"2023-10-17T14:15:57Z","snapshot_observed_at":"2026-08-16T14:51:22.039910Z","submitted_at":"2023-10-17T14:15:57Z","title":"An Automatic Learning Rate Schedule Algorithm for Achieving Faster Convergence and Steeper Descent","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11291","snapshot_observed_at":"2026-08-11T20:02:09.767583Z","title":"An automatic learning rate schedule algorithm for achieving faster convergence and steeper descent","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.06148","last_updated":"2025-02-20T18:38:08Z","snapshot_observed_at":"2026-08-16T15:11:45.900161Z","submitted_at":"2024-12-09T02:01:18Z","title":"The Computational Limits of State-Space Models and Mamba via the Lens of Circuit Complexity","version":2},"reference_index":109,"source":"arxiv_source","source_observed_at":"2026-08-11T20:02:09.767583Z"},"links":{"cited_paper":"/paper/2310.11291","citing_paper":"/paper/2412.06148"},"observation_digest":"sha256:5e907c071c0b39c57adb69e8e195e3fd6bd162734896e1ed1bd52a6f9075f5a4","observation_id":"a9937cf7-5e43-4f6a-a456-51258d88dfd1","resolution":{"observed_at":"2026-08-11T20:02:09.767583Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11291","last_updated":"2023-10-17T14:15:57Z","snapshot_observed_at":"2026-08-16T14:51:22.039910Z","submitted_at":"2023-10-17T14:15:57Z","title":"An Automatic Learning Rate Schedule Algorithm for Achieving Faster Convergence and Steeper Descent","version":1},"cited_work":{"arxiv_id":"2310.11291","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.11291","snapshot_observed_at":"2026-08-08T16:39:14.355410Z","title":"An Automatic Learning Rate Schedule Algorithm for Achieving Faster Convergence and Steeper Descent","venue":"cs.LG","work_id":"1221aacc-9974-4946-806f-60f545b1ee07","year":2023},"citing_paper":{"arxiv_id":"2502.06167","last_updated":"2025-02-10T05:36:30Z","snapshot_observed_at":"2026-08-13T16:11:29.220404Z","submitted_at":"2025-02-10T05:36:30Z","title":"Universal Approximation of Visual Autoregressive Transformers","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-08T16:39:14.293545Z"},"links":{"cited_paper":"/paper/2310.11291","citing_paper":"/paper/2502.06167"},"observation_digest":"sha256:458d05fac855f87d9143b117622c5e28d013b1c35b97b0dfaccae90310814f6c","observation_id":"c624e87b-2e6c-479e-bb8c-0d3e4fcc3111","resolution":{"observed_at":"2026-08-08T16:39:14.360814Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2310.11291/citation-record","integrity":"/paper/2310.11291/integrity","json":"/paper/2310.11291/citation-record.json","paper":"/paper/2310.11291"},"outbound":[],"paper":{"arxiv_id":"2310.11291","last_updated":"2023-10-17T14:15:57Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T14:51:22.039910Z","submitted_at":"2023-10-17T14:15:57Z","title":"An Automatic Learning Rate Schedule Algorithm for Achieving Faster Convergence and Steeper 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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2310.11291."}