{"as_of":"2026-08-21T13:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:84a528ccd013f2f82ca3aefb97de054dc507f841f55bcf2ccfc36a64d449e1b2","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-06T18:35:40.247371Z","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:35:40.304676Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.14958","last_updated":"2024-03-22T05:23:31Z","snapshot_observed_at":"2026-08-16T14:07:27.249651Z","submitted_at":"2024-03-22T05:23:31Z","title":"Adapprox: Adaptive Approximation in Adam Optimization via Randomized Low-Rank Matrices","version":1},"cited_work":{"arxiv_id":"2403.14958","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.14958","snapshot_observed_at":"2026-08-06T18:35:40.304676Z","title":"Adapprox: Adaptive Approximation in Adam Optimization via Randomized Low-Rank Matrices","venue":"cs.LG","work_id":"3074e8f4-0e4c-4805-932d-a4740f3250fc","year":2024},"citing_paper":{"arxiv_id":"2507.08091","last_updated":"2025-07-10T18:04:52Z","snapshot_observed_at":"2026-08-14T06:41:55.088814Z","submitted_at":"2025-07-10T18:04:52Z","title":"Low-rank Momentum Factorization for Memory Efficient Training","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-06T18:35:40.247371Z"},"links":{"cited_paper":"/paper/2403.14958","citing_paper":"/paper/2507.08091"},"observation_digest":"sha256:183af71fc2fa83856ae13367c5fc1803edbc4b16efdb35f4c50f642e4656f135","observation_id":"0b28fa6a-0895-48f6-8cb4-0bdc270963a8","resolution":{"observed_at":"2026-08-06T18:35:40.307682Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2403.14958","last_updated":"2024-03-22T05:23:31Z","snapshot_observed_at":"2026-08-16T14:07:27.249651Z","submitted_at":"2024-03-22T05:23:31Z","title":"Adapprox: Adaptive Approximation in Adam Optimization via Randomized Low-Rank Matrices","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.14958","snapshot_observed_at":"2026-08-04T12:51:27.244782Z","title":"Adapprox: Adaptive approximation in adam optimization via randomized low-rank matrices, 2024 b","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.01878","last_updated":"2026-06-26T18:31:10Z","snapshot_observed_at":"2026-08-19T11:17:23.698292Z","submitted_at":"2025-10-02T10:35:38Z","title":"Geometrically Principled Randomized Optimization for Efficient LLM Training","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-04T12:51:27.244782Z"},"links":{"cited_paper":"/paper/2403.14958","citing_paper":"/paper/2510.01878"},"observation_digest":"sha256:2efb3209ec64b9fbf2b8a07c277d8ed802abc94a4a12e38e9f7677814ea32516","observation_id":"b1c3a37b-2c5e-43af-a6be-8bf5131f3b4a","resolution":{"observed_at":"2026-08-04T12:51:27.244782Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2403.14958/citation-record","integrity":"/paper/2403.14958/integrity","json":"/paper/2403.14958/citation-record.json","paper":"/paper/2403.14958"},"outbound":[],"paper":{"arxiv_id":"2403.14958","last_updated":"2024-03-22T05:23:31Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T14:07:27.249651Z","submitted_at":"2024-03-22T05:23:31Z","title":"Adapprox: Adaptive Approximation in Adam Optimization via Randomized Low-Rank Matrices"},"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:2403.14958."}