{"as_of":"2026-08-08T18:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e9206ca08cd17f9a71d2f9d42d9d1aa175290a212f98d971dd38b6b84f9d83fa","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-08T06:32:00.761636+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-04T16:23:20.694753Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1902.08297","last_updated":"2019-10-31T03:24:41Z","snapshot_observed_at":"2026-07-06T07:34:43.373594Z","submitted_at":"2019-02-21T23:02:38Z","title":"Solving a Class of Non-Convex Min-Max Games Using Iterative First Order Methods","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.08297","snapshot_observed_at":"2026-08-04T16:23:20.694753Z","title":"Nouiehed, M","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"2509.15543","last_updated":"2026-05-25T16:32:52Z","snapshot_observed_at":"2026-08-06T13:05:42.112772Z","submitted_at":"2025-09-19T02:51:19Z","title":"Nonconvex Decentralized Stochastic Bilevel Optimization under Heavy-Tailed Noise","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T16:23:20.694753Z"},"links":{"cited_paper":"/paper/1902.08297","citing_paper":"/paper/2509.15543"},"observation_digest":"sha256:df2af039911974e94f7eaa1706688ecb20c5521d924d80a9c5f41867c03077af","observation_id":"04001f9e-d07b-4a3d-a2ce-90728f32d5fe","resolution":{"observed_at":"2026-08-04T16:23:20.694753Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1902.08297/citation-record","integrity":"/paper/1902.08297/integrity","json":"/paper/1902.08297/citation-record.json","paper":"/paper/1902.08297"},"outbound":[],"paper":{"arxiv_id":"1902.08297","last_updated":"2019-10-31T03:24:41Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T07:34:43.373594Z","submitted_at":"2019-02-21T23:02:38Z","title":"Solving a Class of Non-Convex Min-Max Games Using Iterative First Order Methods"},"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 1 inbound Pith citation observation for arXiv:1902.08297."}