{"as_of":"2026-08-08T19:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a285e36eea79bd35a415d963270c6ed97e2caf22b16914f9088c6b83ddf6b9da","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-07-11T10:27:13.896754Z","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-21T21:22:37.008510Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.05071","last_updated":"2024-08-12T23:43:59Z","snapshot_observed_at":"2026-07-06T17:26:59.606509Z","submitted_at":"2024-02-07T18:22:41Z","title":"Revisiting Inexact Fixed-Point Iterations for Min-Max Problems: Stochasticity and Structured Nonconvexity","version":2},"cited_work":{"arxiv_id":"2402.05071","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.05071","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2402.05071 , year=","venue":null,"work_id":"cf408d8b-7f39-40ed-a8cd-57cd1e4d92ff","year":null},"citing_paper":{"arxiv_id":"2502.07529","last_updated":"2025-06-06T13:42:19Z","snapshot_observed_at":"2026-08-03T03:50:14.086851Z","submitted_at":"2025-02-11T13:10:34Z","title":"Training Deep Learning Models with Norm-Constrained LMOs","version":2},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-05-21T21:22:36.870292Z"},"links":{"cited_paper":"/paper/2402.05071","citing_paper":"/paper/2502.07529"},"observation_digest":"sha256:b5aa29929f97541e347f26b9205c1572a2e5019f8d57669195e771ed97260ead","observation_id":"22596a60-c56c-4142-9fcd-3c1918cf1c08","resolution":{"observed_at":"2026-05-21T21:22:37.010925Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05071","last_updated":"2024-08-12T23:43:59Z","snapshot_observed_at":"2026-07-06T17:26:59.606509Z","submitted_at":"2024-02-07T18:22:41Z","title":"Revisiting Inexact Fixed-Point Iterations for Min-Max Problems: Stochasticity and Structured Nonconvexity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.05071","snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Extending the reach of first- order algorithms for nonconvex min-max problems with cohypomono- tonicity,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"cited_paper":"/paper/2402.05071","citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:9bb1c0cbfc127a5f8fe00ff5ed8f8b6fbe002dda4c4078930b8b1968570fc2ff","observation_id":"c6dbe29c-24ea-42e7-bd1e-1c4ee8562172","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2402.05071/citation-record","integrity":"/paper/2402.05071/integrity","json":"/paper/2402.05071/citation-record.json","paper":"/paper/2402.05071"},"outbound":[],"paper":{"arxiv_id":"2402.05071","last_updated":"2024-08-12T23:43:59Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T17:26:59.606509Z","submitted_at":"2024-02-07T18:22:41Z","title":"Revisiting Inexact Fixed-Point Iterations for Min-Max Problems: Stochasticity and Structured Nonconvexity"},"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:2402.05071."}