{"as_of":"2026-08-21T01:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ccd19ee0f941078d5661d0ea8029ccc1f990696f5667bf45be556aa8bcd03272","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-20T06:33:59.587034+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-06T21:05:44.297261Z","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-06T21:05:46.832019Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2109.08282","last_updated":"2021-09-17T01:45:25Z","snapshot_observed_at":"2026-08-18T02:12:50.447344Z","submitted_at":"2021-09-17T01:45:25Z","title":"AdaLoss: A computationally-efficient and provably convergent adaptive gradient method","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.08282","snapshot_observed_at":"2026-07-11T20:46:05.467029Z","title":"AdaLoss: A computationally-efficient and provably convergent adaptive gradient method","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.04233","last_updated":"2026-07-05T11:11:40Z","snapshot_observed_at":"2026-08-16T20:56:16.792561Z","submitted_at":"2026-07-05T11:11:40Z","title":"Unified convergence analysis for gradient descent optimization methods in the training of deep neural networks","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-07-11T20:46:05.467029Z"},"links":{"cited_paper":"/paper/2109.08282","citing_paper":"/paper/2607.04233"},"observation_digest":"sha256:39b1ce724b584098a6a685e1b4bbb1b4e580e3f31976494a1d10162bd3ce347e","observation_id":"f0a9de00-d99e-4d07-9f82-6cb5c4cce1e1","resolution":{"observed_at":"2026-07-11T20:46:05.467029Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.08282","last_updated":"2021-09-17T01:45:25Z","snapshot_observed_at":"2026-08-18T02:12:50.447344Z","submitted_at":"2021-09-17T01:45:25Z","title":"AdaLoss: A computationally-efficient and provably convergent adaptive gradient method","version":1},"cited_work":{"arxiv_id":"2109.08282","doi":null,"metadata_source":"pith","pith_arxiv_id":"2109.08282","snapshot_observed_at":"2026-08-06T21:05:46.832019Z","title":"AdaLoss: A computationally-efficient and provably convergent adaptive gradient method","venue":"stat.ML","work_id":"874f0942-f2d0-406a-98e2-a8fbb8763098","year":2021},"citing_paper":{"arxiv_id":"2608.04607","last_updated":"2026-08-05T09:14:22Z","snapshot_observed_at":"2026-08-19T08:22:55.066034Z","submitted_at":"2026-08-05T09:14:22Z","title":"On MUON optimization: From non-convergence to an error analysis with Polar Express and the Newton-Schulz polynomial from implementations","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T21:05:44.297261Z"},"links":{"cited_paper":"/paper/2109.08282","citing_paper":"/paper/2608.04607"},"observation_digest":"sha256:9f9519a85636dc88b06568c7640a135f271bb440bd156a863b67971784022800","observation_id":"4a427748-22ed-4098-910b-d3ec38d1d512","resolution":{"observed_at":"2026-08-06T21:05:46.835080Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2109.08282/citation-record","integrity":"/paper/2109.08282/integrity","json":"/paper/2109.08282/citation-record.json","paper":"/paper/2109.08282"},"outbound":[],"paper":{"arxiv_id":"2109.08282","last_updated":"2021-09-17T01:45:25Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-18T02:12:50.447344Z","submitted_at":"2021-09-17T01:45:25Z","title":"AdaLoss: A computationally-efficient and provably convergent adaptive gradient method"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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:2109.08282."}