{"as_of":"2026-08-08T03:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bcc5e02a596bccf97c4bcf43e954790c9e735171aa96b87aacc6c9621867c565","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T13:26:10.229141Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2510.01168/citation-record","integrity":"/paper/2510.01168/integrity","json":"/paper/2510.01168/citation-record.json","paper":"/paper/2510.01168"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:26:07.170061Z","title":"Arjovsky, S","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:07.170061Z"},"links":{"citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:cdc09a43a59b5c5c5fd0f890d9f496964caa0dcef2b1678fa0530d3fe1cd24b2","observation_id":"b4fa03ef-fe98-4d39-b38b-4ed170189382","resolution":{"observed_at":"2026-08-04T13:26:07.170061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:26:07.265879Z","title":"Attouch, J","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:07.265879Z"},"links":{"citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:cad1bdb7c5832fb99ba2fdbd02bc23f92a42fe676854a8224ba7d516e0ef6136","observation_id":"1774f75a-d93a-405e-9e45-99898f3d1221","resolution":{"observed_at":"2026-08-04T13:26:07.265879Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:26:07.376344Z","title":"Bertsimas, D","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:07.376344Z"},"links":{"citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:749c7aa1f7d97cda2fda16b5e95040fd3f02a14a8958adf08ad53468832e5f66","observation_id":"4c915650-9bd0-459e-b0a3-486564f35f81","resolution":{"observed_at":"2026-08-04T13:26:07.376344Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:26:07.513713Z","title":"Blanchet, J","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:07.513713Z"},"links":{"citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:a940fefc0dd6164c33230a4821ed2588f065f7561cf63021f688f31f1071d7fd","observation_id":"76258957-05f0-49fb-941f-7295f2ea1fc0","resolution":{"observed_at":"2026-08-04T13:26:07.513713Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.12247","last_updated":"2023-06-19T09:33:19Z","snapshot_observed_at":"2026-08-07T15:05:39.118797Z","submitted_at":"2022-01-28T17:01:26Z","title":"Solving Nonconvex-Nonconcave Min-Max Problems exhibiting Weak Minty Solutions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.12247","snapshot_observed_at":"2026-08-04T13:26:07.673930Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:07.673930Z"},"links":{"cited_paper":"/paper/2201.12247","citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:a2d772f2495aa6cd7a463f2f69dc7fc72051e8b310d5e4d695b9d93a409bf740","observation_id":"80e2e3b3-cd36-4b1f-a8c7-cb7a11de1b6e","resolution":{"observed_at":"2026-08-04T13:26:07.673930Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:26:07.753776Z","title":"Bolte, A","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:07.753776Z"},"links":{"citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:2ab524e3a694d68fd72830b3770b3392a933e113dd425a49234c2b1df4818065","observation_id":"10f687b0-2050-4ad4-9585-5e9399c0d2f4","resolution":{"observed_at":"2026-08-04T13:26:07.753776Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:26:07.838389Z","title":"Bolte, A","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:07.838389Z"},"links":{"citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:4eab8ee17680fcffda95731e2ecd1148fcc9eb35d8cead2d18674502a419bf7d","observation_id":"a1117bfc-8c93-4ab2-9975-15f01a5cb2e1","resolution":{"observed_at":"2026-08-04T13:26:07.838389Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.03096","last_updated":"2023-05-14T20:11:20Z","snapshot_observed_at":"2026-07-06T14:01:25.012788Z","submitted_at":"2022-10-06T17:50:42Z","title":"Accelerated Single-Call Methods for Constrained Min-Max Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.03096","snapshot_observed_at":"2026-08-04T13:26:07.963777Z","title":"Cai and W","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:07.963777Z"},"links":{"cited_paper":"/paper/2210.03096","citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:744fa29adf288cd8c3e942c4d16b37999671cfb313a0c14470f9108fc05ab9c2","observation_id":"35ed705f-ef39-4ddb-9608-512e95f8b488","resolution":{"observed_at":"2026-08-04T13:26:07.963777Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:26:08.045858Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:08.045858Z"},"links":{"citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:02a27ba3da4d7fe03a1bb72eede10df8b040aee09ad8783382bbe5c5996f6670","observation_id":"cb59cf60-00bf-44ff-b57d-e968fbfb7c8d","resolution":{"observed_at":"2026-08-04T13:26:08.045858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:26:08.200846Z","title":"Drusvyatskiy, A","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:08.200846Z"},"links":{"citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:f1f47c052dd8e78407876cef030a98d048f7abe848a6c3eaa6916aae1f9f07b5","observation_id":"dd7f7156-1f8a-415a-8b59-6c384ef18a5f","resolution":{"observed_at":"2026-08-04T13:26:08.200846Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:26:08.338985Z","title":"Drusvyatskiy, A","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:08.338985Z"},"links":{"citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:a343d4f91127e3caeb03fb1a4f621695b0d8ce707849a8d0a3251fc99562e126","observation_id":"f06d0de1-744d-493b-a7cc-c64e65f06935","resolution":{"observed_at":"2026-08-04T13:26:08.338985Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:26:08.441956Z","title":"Goodfellow, J","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:08.441956Z"},"links":{"citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:0735a732838e181c9bd7737962c27cd982983502651df5e52d645d9861328c2a","observation_id":"87cf051e-5ded-4e0f-acee-48882a8a2d4d","resolution":{"observed_at":"2026-08-04T13:26:08.441956Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.03984","last_updated":"2025-04-22T02:00:36Z","snapshot_observed_at":"2026-07-06T14:59:46.707335Z","submitted_at":"2023-03-07T15:33:12Z","title":"Enhanced Adaptive Gradient Algorithms for Nonconvex-PL Minimax Optimization","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.03984","snapshot_observed_at":"2026-08-04T13:26:08.534478Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:08.534478Z"},"links":{"cited_paper":"/paper/2303.03984","citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:fbd84ccc059323b86d8c4289af49384c6c9c53b99b3f250777c8a2405926ead5","observation_id":"bdc8d22e-5709-4dbf-b0d4-9e7faceeaa6d","resolution":{"observed_at":"2026-08-04T13:26:08.534478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:26:08.651812Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:08.651812Z"},"links":{"citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:b0ffc26256a348cab3f083158f76fca8cbfc0932dadca2e1677a38388f402595","observation_id":"7f4619dd-db19-4832-87eb-733ffef64bcf","resolution":{"observed_at":"2026-08-04T13:26:08.651812Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:26:08.730614Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:08.730614Z"},"links":{"citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:a272514422dc7153a78193bac410688099e1370aba6079508ead6cd4f921f3c5","observation_id":"41c69d94-fdae-4e82-ba1a-d33c02976690","resolution":{"observed_at":"2026-08-04T13:26:08.730614Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1210.3039","last_updated":"2022-06-17T22:48:04Z","snapshot_observed_at":"2026-08-06T04:14:45.743065Z","submitted_at":"2012-10-10T20:01:29Z","title":"Sequential Convex Programming Methods for A Class of Structured Nonlinear Programming","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1210.3039","snapshot_observed_at":"2026-08-04T13:26:08.805869Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:08.805869Z"},"links":{"cited_paper":"/paper/1210.3039","citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:63ad2abc8792834ab18ca0e451703f0f93fd40187f84afb53ddeee1885dcc3b1","observation_id":"79fa2521-2463-4582-b856-4cdb3feca835","resolution":{"observed_at":"2026-08-04T13:26:08.805869Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.01932","last_updated":"2026-05-19T17:55:59Z","snapshot_observed_at":"2026-08-05T15:15:45.522924Z","submitted_at":"2025-07-02T17:45:10Z","title":"A first-order method for nonconvex-nonconcave minimax problems under a local Kurdyka-Lojasiewicz condition","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.01932","snapshot_observed_at":"2026-08-04T13:26:08.907745Z","title":"Lu and X","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:08.907745Z"},"links":{"cited_paper":"/paper/2507.01932","citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:7b2ff28211bcbf23a33921c5e82f8255a27a8bf0a004c315f28b5b8e36fae254","observation_id":"466bf22f-aff2-4efc-a030-3338430453c8","resolution":{"observed_at":"2026-08-04T13:26:08.907745Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.06083","last_updated":"2019-09-04T18:53:10Z","snapshot_observed_at":"2026-08-07T14:27:46.872660Z","submitted_at":"2017-06-19T17:53:11Z","title":"Towards Deep Learning Models Resistant to Adversarial Attacks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.06083","snapshot_observed_at":"2026-08-04T13:26:09.079073Z","title":"Madry, A","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:09.079073Z"},"links":{"cited_paper":"/paper/1706.06083","citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:74ac81972747206716da071386ed8896d3e9421222bb86abb1e290535876e60c","observation_id":"1f2fd63e-a84e-4393-8312-25d0dc554473","resolution":{"observed_at":"2026-08-04T13:26:09.079073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:26:09.144294Z","title":"Nesterov","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:09.144294Z"},"links":{"citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:47106bd6560f0a57bb8d263b5b515d3b2e03a993cd26b56f7d5f76793531f413","observation_id":"8ce18404-72c9-458f-b5d6-4aebf2a548e7","resolution":{"observed_at":"2026-08-04T13:26:09.144294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:26:09.222555Z","title":"Nouiehed, M","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:09.222555Z"},"links":{"citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:fa149d3061ff6fe7609a88b4de43b6d5208b0552ba5c810e7671746922b79edf","observation_id":"c4e40e85-16bb-47dc-850f-5fbd04b7b2c2","resolution":{"observed_at":"2026-08-04T13:26:09.222555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:26:09.301303Z","title":"Omidshafiei, J","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:09.301303Z"},"links":{"citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:17c923c1aa237b703f35ecb1c02b642ed4a6463224897b49f2ae50835ca9851d","observation_id":"954d2476-bc10-4aae-915a-6c2390714d31","resolution":{"observed_at":"2026-08-04T13:26:09.301303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.09831","last_updated":"2023-02-20T08:37:08Z","snapshot_observed_at":"2026-08-07T08:00:08.559716Z","submitted_at":"2023-02-20T08:37:08Z","title":"Escaping limit cycles: Global convergence for constrained nonconvex-nonconcave minimax problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.09831","snapshot_observed_at":"2026-08-04T13:26:09.429538Z","title":"Pethick, P","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:09.429538Z"},"links":{"cited_paper":"/paper/2302.09831","citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:b5ed24009ea137b8899e94b2a608c5dc7dfccd1bb2c1d14a9c1e637f0baf4b03","observation_id":"3de701d5-4876-4526-b232-e158bc05b335","resolution":{"observed_at":"2026-08-04T13:26:09.429538Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:26:09.565385Z","title":"Rahimian and S","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:09.565385Z"},"links":{"citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:d21172efa9b3663187e4f12524012ccb1b66b63fc5a16d110c49e2be51251db2","observation_id":"8459e9ce-1a39-4388-8efc-2349504add26","resolution":{"observed_at":"2026-08-04T13:26:09.565385Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:26:09.720909Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:09.720909Z"},"links":{"citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:6a1f5967fe41beb5098b94a067f6dc0b80be3988a9ee1c535027327708cc6b55","observation_id":"02303816-9090-442c-a4af-be802ab3005a","resolution":{"observed_at":"2026-08-04T13:26:09.720909Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:26:09.785873Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:09.785873Z"},"links":{"citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:cf1287fd54cda534281312a949d76954bd58306df6f9ecb5e4ce556f09f9e933","observation_id":"d41de526-813d-43bb-88f3-bfdf714e702d","resolution":{"observed_at":"2026-08-04T13:26:09.785873Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1710.10571","last_updated":"2020-05-01T07:29:34Z","snapshot_observed_at":"2026-08-07T21:20:40.257232Z","submitted_at":"2017-10-29T07:27:57Z","title":"Certifying Some Distributional Robustness with Principled Adversarial Training","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.10571","snapshot_observed_at":"2026-08-04T13:26:09.882829Z","title":"Sinha, H","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:09.882829Z"},"links":{"cited_paper":"/paper/1710.10571","citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:85e429774d38f7168d1d60729533682b5f537ef820c432543b44ddb0b8a9b1b6","observation_id":"1fc03eca-7269-429b-920c-8873d4713db3","resolution":{"observed_at":"2026-08-04T13:26:09.882829Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:26:09.969870Z","title":"Xu, Z.-Q","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:09.969870Z"},"links":{"citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:160e5dd11b26fa4f8e0b8fdb320d5a5ac0564780980b3d599501a7ebf42e17c1","observation_id":"4fdd2a05-d7dd-4b00-b53e-998b88cfa5df","resolution":{"observed_at":"2026-08-04T13:26:09.969870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:26:10.054584Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:10.054584Z"},"links":{"citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:05ebd1fee0baade8adf339acca90371e6751b3d0d3b524168a3aed8d87f4d7cf","observation_id":"b94f0568-0ed3-4abe-97e1-2643bbc44d25","resolution":{"observed_at":"2026-08-04T13:26:10.054584Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:26:10.121249Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:10.121249Z"},"links":{"citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:6d0a6d678f044812edddd6f9f09afb81e5c7d7e692fdbba36869cf2e2363d48f","observation_id":"b96a7b9a-743c-4483-b602-95382bac5050","resolution":{"observed_at":"2026-08-04T13:26:10.121249Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.07397","last_updated":"2025-06-09T03:39:21Z","snapshot_observed_at":"2026-08-07T05:32:36.448884Z","submitted_at":"2025-06-09T03:39:21Z","title":"Doubly Smoothed Optimistic Gradients: A Universal Approach for Smooth Minimax Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.07397","snapshot_observed_at":"2026-08-04T13:26:10.160510Z","title":"Zheng, A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:10.160510Z"},"links":{"cited_paper":"/paper/2506.07397","citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:eef7f26dee6400df938809d0d45e32db422efb4c1f74a8c6a914e1e7b2c3bbe5","observation_id":"3c025f5c-85b7-4b98-bfd3-9427ed298f5b","resolution":{"observed_at":"2026-08-04T13:26:10.160510Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:26:10.229141Z","title":"Zheng, L","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:10.229141Z"},"links":{"citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:7f78023a1c3a49bbdadb95227f393c5898f946025576bb37818a0867e22d1820","observation_id":"bcd65f55-d8d6-4183-bf0e-a97e892c3e71","resolution":{"observed_at":"2026-08-04T13:26:10.229141Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":31,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":31},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2510.01168."}