{"as_of":"2026-08-09T18:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:62fd99fb536077d8f1bd78ccf72e133a6b59c25f0fcc535e546fb60f8e573b33","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T05:44:07.512737Z","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-08T05:44:07.784947Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2203.01757","last_updated":"2025-01-29T12:44:33Z","snapshot_observed_at":"2026-08-09T14:17:39.992381Z","submitted_at":"2022-03-03T15:10:40Z","title":"Complexity and performance for two classes of noise-tolerant first-order algorithms","version":3},"cited_work":{"arxiv_id":"2203.01757","doi":null,"metadata_source":"pith","pith_arxiv_id":"2203.01757","snapshot_observed_at":"2026-08-08T05:44:07.784947Z","title":"Complexity and performance for two classes of noise-tolerant first-order algorithms","venue":"math.OC","work_id":"90ebe672-a383-4b6d-b030-b5aaf677300a","year":2022},"citing_paper":{"arxiv_id":"2502.08308","last_updated":"2025-02-12T11:22:23Z","snapshot_observed_at":"2026-08-08T05:34:32.720241Z","submitted_at":"2025-02-12T11:22:23Z","title":"prunAdag: an adaptive pruning-aware gradient method","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T05:44:07.512737Z"},"links":{"cited_paper":"/paper/2203.01757","citing_paper":"/paper/2502.08308"},"observation_digest":"sha256:680f9cad2c01125bf21ba314a5c59311b101f87e0a2d6e9126666b1444aff59c","observation_id":"6bdd45c5-518f-468a-8611-0c59bcb7a5ba","resolution":{"observed_at":"2026-08-08T05:44:07.791134Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2203.01757/citation-record","integrity":"/paper/2203.01757/integrity","json":"/paper/2203.01757/citation-record.json","paper":"/paper/2203.01757"},"outbound":[],"paper":{"arxiv_id":"2203.01757","last_updated":"2025-01-29T12:44:33Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-09T14:17:39.992381Z","submitted_at":"2022-03-03T15:10:40Z","title":"Complexity and performance for two classes of noise-tolerant first-order algorithms"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2203.01757."}