{"as_of":"2026-08-14T13:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:40ed9590cf1300ecb7f97815092edd923849a706a15f2eb19888fd829f97a742","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-14T06:32:32.682623+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-12T14:05:56.412192Z","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-07-03T12:48:11.267161Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2006.09361","last_updated":"2021-03-22T17:09:20Z","snapshot_observed_at":"2026-08-14T10:40:52.233950Z","submitted_at":"2020-06-16T17:55:46Z","title":"Gradient Free Minimax Optimization: Variance Reduction and Faster Convergence","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.09361","snapshot_observed_at":"2026-08-12T14:05:56.412192Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2411.15769","last_updated":"2025-06-15T03:49:05Z","snapshot_observed_at":"2026-08-12T13:53:04.192376Z","submitted_at":"2024-11-24T09:46:36Z","title":"Gradient Norm Regularization Second-Order Algorithms for Solving Nonconvex-Strongly Concave Minimax Problems","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-12T14:05:56.412192Z"},"links":{"cited_paper":"/paper/2006.09361","citing_paper":"/paper/2411.15769"},"observation_digest":"sha256:af0d9928e9c3f049ef06566afa614ae0b41302765ab10011960997120b3fffd2","observation_id":"5e54881b-5f44-445d-96dd-14b39df44222","resolution":{"observed_at":"2026-08-12T14:05:56.412192Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.09361","last_updated":"2021-03-22T17:09:20Z","snapshot_observed_at":"2026-08-14T10:40:52.233950Z","submitted_at":"2020-06-16T17:55:46Z","title":"Gradient Free Minimax Optimization: Variance Reduction and Faster Convergence","version":3},"cited_work":{"arxiv_id":"2006.09361","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.09361","snapshot_observed_at":"2026-07-03T12:48:11.267161Z","title":"Gradient free minimax optimization: Variance reduction and faster convergence.arXiv preprint arXiv:2006.09361","venue":null,"work_id":"971cf5ab-fd49-4894-875a-c3775d9992c4","year":2006},"citing_paper":{"arxiv_id":"2604.21371","last_updated":"2026-04-23T07:35:22Z","snapshot_observed_at":"2026-08-03T21:11:29.529798Z","submitted_at":"2026-04-23T07:35:22Z","title":"Nonsmooth Nonconvex-Concave Minimax Optimization: Convergence Criteria and Algorithms","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-09T21:45:05.692378Z"},"links":{"cited_paper":"/paper/2006.09361","citing_paper":"/paper/2604.21371"},"observation_digest":"sha256:11f50ac0f743afeb8e7d387d3c9481a4561652a5551ba432a2f9ecf16ffdad21","observation_id":"5e3b0394-29d4-4add-8567-2d19e238fb8f","resolution":{"observed_at":"2026-05-11T14:31:04.772241Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.09361","last_updated":"2021-03-22T17:09:20Z","snapshot_observed_at":"2026-08-14T10:40:52.233950Z","submitted_at":"2020-06-16T17:55:46Z","title":"Gradient Free Minimax Optimization: Variance Reduction and Faster Convergence","version":3},"cited_work":{"arxiv_id":"2006.09361","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.09361","snapshot_observed_at":"2026-07-03T12:48:11.267161Z","title":"Gradient free minimax optimization: Variance reduction and faster convergence.arXiv preprint arXiv:2006.09361","venue":null,"work_id":"971cf5ab-fd49-4894-875a-c3775d9992c4","year":2006},"citing_paper":{"arxiv_id":"2606.12124","last_updated":"2026-06-10T14:18:48Z","snapshot_observed_at":"2026-08-14T02:26:47.311416Z","submitted_at":"2026-06-10T14:18:48Z","title":"A Unified Zeroth-Order Approach for Decentralized Minimax Optimization","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-27T08:47:14.504056Z"},"links":{"cited_paper":"/paper/2006.09361","citing_paper":"/paper/2606.12124"},"observation_digest":"sha256:25ac0fb1954cf15bd3afaa85b86b552ca769114e655c8cc98e4ef9247103d541","observation_id":"be3d9ddd-6b48-46f5-a8a4-3136fa57617b","resolution":{"observed_at":"2026-07-03T12:48:11.268639Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2006.09361/citation-record","integrity":"/paper/2006.09361/integrity","json":"/paper/2006.09361/citation-record.json","paper":"/paper/2006.09361"},"outbound":[],"paper":{"arxiv_id":"2006.09361","last_updated":"2021-03-22T17:09:20Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T10:40:52.233950Z","submitted_at":"2020-06-16T17:55:46Z","title":"Gradient Free Minimax Optimization: Variance Reduction and Faster Convergence"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2006.09361."}