{"as_of":"2026-08-08T21:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ca78ab74c83a77bb1533d32544ee3b541492f6278b1a7aab78efd3bbbb4faefc","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-07T10:31:55.394359Z","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-07T10:31:55.798559Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2208.03085","last_updated":"2022-11-23T08:49:39Z","snapshot_observed_at":"2026-07-06T13:39:03.515752Z","submitted_at":"2022-08-05T10:42:26Z","title":"Optimistic Gradient Descent Ascent in Zero-Sum and General-Sum Bilinear Games","version":2},"cited_work":{"arxiv_id":"2208.03085","doi":null,"metadata_source":"pith","pith_arxiv_id":"2208.03085","snapshot_observed_at":"2026-08-07T10:31:55.798559Z","title":"Optimistic Gradient Descent Ascent in Zero-Sum and General-Sum Bilinear Games","venue":"math.OC","work_id":"15f3f350-c0d5-414c-9587-d9c929c79a25","year":2022},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-08T18:53:01.448449Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.394359Z"},"links":{"cited_paper":"/paper/2208.03085","citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:7b205deaefea666653f623e75c4f060a505f9798158ba2744d9539f923613c30","observation_id":"674c6118-7ed3-4655-b6fb-d40c02b0d5bb","resolution":{"observed_at":"2026-08-07T10:31:55.810381Z","resolver_source":"local_arxiv","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"}},{"citation":{"cited_paper":{"arxiv_id":"2208.03085","last_updated":"2022-11-23T08:49:39Z","snapshot_observed_at":"2026-07-06T13:39:03.515752Z","submitted_at":"2022-08-05T10:42:26Z","title":"Optimistic Gradient Descent Ascent in Zero-Sum and General-Sum Bilinear Games","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.03085","snapshot_observed_at":"2026-08-04T09:40:00.344752Z","title":"Optimistic gradient descent ascent in zero-sum and general-sum bilinear games","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.14907","last_updated":"2026-07-12T22:39:58Z","snapshot_observed_at":"2026-08-04T09:39:55.660449Z","submitted_at":"2025-10-16T17:25:32Z","title":"Learnable Mixed Nash Equilibria are Collectively Rational","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-04T09:40:00.344752Z"},"links":{"cited_paper":"/paper/2208.03085","citing_paper":"/paper/2510.14907"},"observation_digest":"sha256:b1ed4e5e7e7f40a032001634caa926badcb0c6d2b159f0cd8cd1d4c8c8284710","observation_id":"5ca3ca7e-20b0-4fdc-8396-703d7889e07f","resolution":{"observed_at":"2026-08-04T09:40:00.344752Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2208.03085/citation-record","integrity":"/paper/2208.03085/integrity","json":"/paper/2208.03085/citation-record.json","paper":"/paper/2208.03085"},"outbound":[],"paper":{"arxiv_id":"2208.03085","last_updated":"2022-11-23T08:49:39Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T13:39:03.515752Z","submitted_at":"2022-08-05T10:42:26Z","title":"Optimistic Gradient Descent Ascent in Zero-Sum and General-Sum Bilinear Games"},"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:2208.03085."}