{"as_of":"2026-08-09T21:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dde8e482768809d27c089b134ba8081703632a3ea5787344eea3015a0a173d74","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T00:40:46.396278Z","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-24T02:43:47.539490Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2202.09674","last_updated":"2024-01-10T05:05:20Z","snapshot_observed_at":"2026-08-09T13:14:52.132096Z","submitted_at":"2022-02-19T20:31:05Z","title":"Generalized Optimistic Methods for Convex-Concave Saddle Point Problems","version":2},"cited_work":{"arxiv_id":"2202.09674","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.09674","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Generalized optimistic methods for convex-concave saddle point problems","venue":null,"work_id":"ee48e4a1-9d43-4f98-b83e-1aa8819d6c95","year":2022},"citing_paper":{"arxiv_id":"2403.07806","last_updated":"2026-05-13T10:55:50Z","snapshot_observed_at":"2026-07-06T17:43:22.965126Z","submitted_at":"2024-03-12T16:43:55Z","title":"A Stochastic GDA Method With Backtracking For Solving Nonconvex Concave Minimax Problems","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-24T02:40:21.808440Z"},"links":{"cited_paper":"/paper/2202.09674","citing_paper":"/paper/2403.07806"},"observation_digest":"sha256:c6ddaab15db58453ff98e2fb825d74643041db94ba8e476098cc7407ee0546f1","observation_id":"2bf7a311-4169-4e8b-83cf-c649bc918d58","resolution":{"observed_at":"2026-05-24T02:43:47.543509Z","resolver_source":"arxiv_id","status":"verified_exact"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2202.09674","last_updated":"2024-01-10T05:05:20Z","snapshot_observed_at":"2026-08-09T13:14:52.132096Z","submitted_at":"2022-02-19T20:31:05Z","title":"Generalized Optimistic Methods for Convex-Concave Saddle Point Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.09674","snapshot_observed_at":"2026-08-04T00:40:46.396278Z","title":"Generalized optimistic methods for convex-concave saddle point problems.arXiv preprint arXiv:2202.09674, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.00680","last_updated":"2026-07-07T03:07:53Z","snapshot_observed_at":"2026-08-09T21:01:12.427950Z","submitted_at":"2025-11-01T19:48:08Z","title":"Accelerating Trust-Region Methods: An Attempt to Balance Global and Local Efficiency","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.396278Z"},"links":{"cited_paper":"/paper/2202.09674","citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:f2d829af98dcb2b36048e2879e92081868b5b19e9c55ec56dc9ce421a81338f8","observation_id":"09d2aae2-2b09-445e-8410-8a4968ef05b4","resolution":{"observed_at":"2026-08-04T00:40:46.396278Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.09674","last_updated":"2024-01-10T05:05:20Z","snapshot_observed_at":"2026-08-09T13:14:52.132096Z","submitted_at":"2022-02-19T20:31:05Z","title":"Generalized Optimistic Methods for Convex-Concave Saddle Point Problems","version":2},"cited_work":{"arxiv_id":"2202.09674","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.09674","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Generalized optimistic methods for convex-concave saddle point problems","venue":null,"work_id":"ee48e4a1-9d43-4f98-b83e-1aa8819d6c95","year":2022},"citing_paper":{"arxiv_id":"2604.19462","last_updated":"2026-04-21T13:38:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-21T13:38:36Z","title":"Solving Convex-Concave Problems with $\\tilde{\\mathcal{O}}(\\epsilon^{-4/(3p+1)})$ $p$th-Order Oracle Complexity","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-10T02:06:13.893775Z"},"links":{"cited_paper":"/paper/2202.09674","citing_paper":"/paper/2604.19462"},"observation_digest":"sha256:3786ba57640089becef0a00b45c18817ee6b963719092f98763531b27c92ba6f","observation_id":"ffdcaebb-429a-42e2-a98f-9691169b8ba5","resolution":{"observed_at":"2026-05-11T13:16:05.968105Z","resolver_source":"arxiv_id","status":"verified_exact"},"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/2202.09674/citation-record","integrity":"/paper/2202.09674/integrity","json":"/paper/2202.09674/citation-record.json","paper":"/paper/2202.09674"},"outbound":[],"paper":{"arxiv_id":"2202.09674","last_updated":"2024-01-10T05:05:20Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-09T13:14:52.132096Z","submitted_at":"2022-02-19T20:31:05Z","title":"Generalized Optimistic Methods for Convex-Concave Saddle Point 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-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 3 inbound Pith citation observations for arXiv:2202.09674."}