{"as_of":"2026-08-14T11:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d167377f0a5cec599095777e412faa078d66f56c0a13279d51139f7790db7ae0","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T14:05:56.401374Z","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-21T19:10:30.822022Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2001.07819","last_updated":"2022-04-04T23:36:08Z","snapshot_observed_at":"2026-08-14T08:02:43.367129Z","submitted_at":"2020-01-22T00:05:14Z","title":"Zeroth-Order Algorithms for Nonconvex Minimax Problems with Improved Complexities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.07819","snapshot_observed_at":"2026-08-12T14:05:56.401374Z","title":null,"venue":null,"work_id":null,"year":2001},"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":54,"source":"pdf_text","source_observed_at":"2026-08-12T14:05:56.401374Z"},"links":{"cited_paper":"/paper/2001.07819","citing_paper":"/paper/2411.15769"},"observation_digest":"sha256:8f7638d1f41e6043381431388ab5f3c3e5bfd91f28fdc5daefdc2211bedb2763","observation_id":"214bf8aa-7620-4ca2-9a23-211a1755520b","resolution":{"observed_at":"2026-08-12T14:05:56.401374Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.07819","last_updated":"2022-04-04T23:36:08Z","snapshot_observed_at":"2026-08-14T08:02:43.367129Z","submitted_at":"2020-01-22T00:05:14Z","title":"Zeroth-Order Algorithms for Nonconvex Minimax Problems with Improved Complexities","version":2},"cited_work":{"arxiv_id":"2001.07819","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2001.07819","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Zeroth- order algorithms for nonconvex minimax problems with improved complexities","venue":null,"work_id":"ba45e454-2964-4414-918f-2d31ce21c35e","year":2001},"citing_paper":{"arxiv_id":"2511.01126","last_updated":"2026-05-19T10:24:36Z","snapshot_observed_at":"2026-07-06T22:34:43.577332Z","submitted_at":"2025-11-03T00:29:36Z","title":"Stochastic Regret Guarantees for Online Zeroth- and First-Order Bilevel Optimization","version":3},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-05-21T19:07:11.343101Z"},"links":{"cited_paper":"/paper/2001.07819","citing_paper":"/paper/2511.01126"},"observation_digest":"sha256:bf0bb9b7253908db4f37bcfe85ac9d3b17b5c37b9e044261620436f7eaf9d5c0","observation_id":"648dcda9-3cc6-43ea-9bcd-39f1c3288b5e","resolution":{"observed_at":"2026-05-21T19:10:30.825203Z","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":"2001.07819","last_updated":"2022-04-04T23:36:08Z","snapshot_observed_at":"2026-08-14T08:02:43.367129Z","submitted_at":"2020-01-22T00:05:14Z","title":"Zeroth-Order Algorithms for Nonconvex Minimax Problems with Improved Complexities","version":2},"cited_work":{"arxiv_id":"2001.07819","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2001.07819","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Zeroth- order algorithms for nonconvex minimax problems with improved complexities","venue":null,"work_id":"ba45e454-2964-4414-918f-2d31ce21c35e","year":2001},"citing_paper":{"arxiv_id":"2604.25372","last_updated":"2026-05-01T04:44:42Z","snapshot_observed_at":"2026-08-13T18:13:14.219621Z","submitted_at":"2026-04-28T08:38:40Z","title":"From Cursed to Competitive: Closing the ZO-FO Gap via Input-to-State Stability","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-07T15:52:03.059563Z"},"links":{"cited_paper":"/paper/2001.07819","citing_paper":"/paper/2604.25372"},"observation_digest":"sha256:fcd5f6d1649778c6d61203d7da3246aa30db4e185af42325b7b091d25fda3360","observation_id":"74a2ff3f-956a-48c6-b7a0-52bb05b698a9","resolution":{"observed_at":"2026-05-12T00:06:15.339371Z","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":"2001.07819","last_updated":"2022-04-04T23:36:08Z","snapshot_observed_at":"2026-08-14T08:02:43.367129Z","submitted_at":"2020-01-22T00:05:14Z","title":"Zeroth-Order Algorithms for Nonconvex Minimax Problems with Improved Complexities","version":2},"cited_work":{"arxiv_id":"2001.07819","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2001.07819","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Zeroth- order algorithms for nonconvex minimax problems with improved complexities","venue":null,"work_id":"ba45e454-2964-4414-918f-2d31ce21c35e","year":2001},"citing_paper":{"arxiv_id":"2605.00650","last_updated":"2026-05-01T13:31:35Z","snapshot_observed_at":"2026-08-12T12:26:48.658869Z","submitted_at":"2026-05-01T13:31:35Z","title":"AdaMeZO: Adam-style Zeroth-Order Optimizer for LLM Fine-tuning Without Maintaining the Moments","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-05-09T19:50:50.653184Z"},"links":{"cited_paper":"/paper/2001.07819","citing_paper":"/paper/2605.00650"},"observation_digest":"sha256:896eb197b41563ab9351aca9ad2c299e48568ab91f4a6d5f576965905bafe2f5","observation_id":"b737c7a4-b5df-4487-b84b-fd89ef263817","resolution":{"observed_at":"2026-05-11T15:31:07.570838Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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/2001.07819/citation-record","integrity":"/paper/2001.07819/integrity","json":"/paper/2001.07819/citation-record.json","paper":"/paper/2001.07819"},"outbound":[],"paper":{"arxiv_id":"2001.07819","last_updated":"2022-04-04T23:36:08Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-14T08:02:43.367129Z","submitted_at":"2020-01-22T00:05:14Z","title":"Zeroth-Order Algorithms for Nonconvex Minimax Problems with Improved Complexities"},"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 4 inbound Pith citation observations for arXiv:2001.07819."}