{"as_of":"2026-08-08T21:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:579337ad4cc2b0aac7f65504b323495cbdbbf8f3f4f6ed527bba91f2a8cf1087","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-08T06:32:00.761636+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-07T05:47:14.565066Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-13T17:33:02.230367Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2105.15042","last_updated":"2022-06-09T12:58:31Z","snapshot_observed_at":"2026-07-06T11:14:24.508408Z","submitted_at":"2021-05-31T15:28:04Z","title":"Semi-Anchored Multi-Step Gradient Descent Ascent Method for Structured Nonconvex-Nonconcave Composite Minimax Problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.15042","snapshot_observed_at":"2026-08-07T05:47:14.565066Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:14.565066Z"},"links":{"cited_paper":"/paper/2105.15042","citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:97771e87b1cb75360931d9ac184f69c3fd263b0948f99d17bf41352a00da6757","observation_id":"e19fe064-fbdb-4c6d-896c-3544e368b4f0","resolution":{"observed_at":"2026-08-07T05:47:14.565066Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.15042","last_updated":"2022-06-09T12:58:31Z","snapshot_observed_at":"2026-07-06T11:14:24.508408Z","submitted_at":"2021-05-31T15:28:04Z","title":"Semi-Anchored Multi-Step Gradient Descent Ascent Method for Structured Nonconvex-Nonconcave Composite Minimax Problems","version":3},"cited_work":{"arxiv_id":"2105.15042","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2105.15042","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"6128e600-7fea-47cd-9921-fefadd505dfa","year":1976},"citing_paper":{"arxiv_id":"2604.03782","last_updated":"2026-04-04T16:08:55Z","snapshot_observed_at":"2026-08-03T00:51:48.176377Z","submitted_at":"2026-04-04T16:08:55Z","title":"An Improved Last-Iterate Convergence Rate for Anchored Gradient Descent Ascent","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-13T17:32:49.343416Z"},"links":{"cited_paper":"/paper/2105.15042","citing_paper":"/paper/2604.03782"},"observation_digest":"sha256:658c719cc14c92863f23fb8e3b5a35d9d31abb95a95cb798596bc7e426c6e9f3","observation_id":"52bb4cd2-962f-489e-99a8-109e96228fd4","resolution":{"observed_at":"2026-05-13T17:33:02.231593Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2105.15042/citation-record","integrity":"/paper/2105.15042/integrity","json":"/paper/2105.15042/citation-record.json","paper":"/paper/2105.15042"},"outbound":[],"paper":{"arxiv_id":"2105.15042","last_updated":"2022-06-09T12:58:31Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T11:14:24.508408Z","submitted_at":"2021-05-31T15:28:04Z","title":"Semi-Anchored Multi-Step Gradient Descent Ascent Method for Structured Nonconvex-Nonconcave Composite Minimax 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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2105.15042."}