{"as_of":"2026-08-08T21:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c832e1260f8855a4a477d61c4e6d8d9be310b9245d5f85dd1983118b83b5d15a","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-06T23:55:55.347794Z","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.022998Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2006.14567","last_updated":"2021-06-23T17:54:03Z","snapshot_observed_at":"2026-07-06T09:32:48.916535Z","submitted_at":"2020-06-25T17:13:23Z","title":"Taming GANs with Lookahead-Minmax","version":3},"cited_work":{"arxiv_id":"2006.14567","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.14567","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a5906f74-5a16-4322-92d0-8469ac31ff5e","year":2006},"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":16,"source":"arxiv_source","source_observed_at":"2026-05-21T21:22:36.870292Z"},"links":{"cited_paper":"/paper/2006.14567","citing_paper":"/paper/2502.07529"},"observation_digest":"sha256:a4f3b9e0dc1369d55d9595bf8a351928f33371481d361d707458993a16e77d88","observation_id":"1bbfb3aa-c2d2-4aaf-850c-f88a2f8e063b","resolution":{"observed_at":"2026-05-21T21:22:37.025401Z","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":"2006.14567","last_updated":"2021-06-23T17:54:03Z","snapshot_observed_at":"2026-07-06T09:32:48.916535Z","submitted_at":"2020-06-25T17:13:23Z","title":"Taming GANs with Lookahead-Minmax","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.14567","snapshot_observed_at":"2026-08-06T23:55:55.347794Z","title":"Stich, Francois Fleuret, and Martin Jaggi","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.347794Z"},"links":{"cited_paper":"/paper/2006.14567","citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:5f92ee83caa8a02794cb697f35b2c2a548b7e39f916b42771cdb534ff5a9e9bd","observation_id":"037e7605-5069-48e2-ad05-bfe9988ca768","resolution":{"observed_at":"2026-08-06T23:55:55.347794Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2006.14567/citation-record","integrity":"/paper/2006.14567/integrity","json":"/paper/2006.14567/citation-record.json","paper":"/paper/2006.14567"},"outbound":[],"paper":{"arxiv_id":"2006.14567","last_updated":"2021-06-23T17:54:03Z","latest_version":3,"primary_category":"stat.ML","snapshot_observed_at":"2026-07-06T09:32:48.916535Z","submitted_at":"2020-06-25T17:13:23Z","title":"Taming GANs with Lookahead-Minmax"},"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:2006.14567."}