{"as_of":"2026-08-18T15:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:94c7082c27a8ee5c36c134207db7c1307360f9b9d5ce2adb983dbd25a2d98225","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-09T20:37:29.523862Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2607.07078/citation-record","integrity":"/paper/2607.07078/integrity","json":"/paper/2607.07078/citation-record.json","paper":"/paper/2607.07078"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.076958Z","title":"Equilibrium points in n-person games,","venue":null,"work_id":"e13d8048-87e6-44d9-88ea-390acbe40fea","year":1950},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:46868a9189c1d005d17c8c22fd809a9b2b36a1037921ba16979005eb29961e68","observation_id":"6cb62b7f-90e0-46ac-a4cd-850eaa730a66","resolution":{"observed_at":"2026-07-09T20:46:34.078151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.073372Z","title":"Theory of games and economic behavior: 60th anniversary commemorative edition,","venue":null,"work_id":"3729f372-9807-42a2-aad4-81887191ae2a","year":2007},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:dd6489688e4a67d06df77a726f9ab76850b3a0d836533019c04b1ae79bfe0c73","observation_id":"3f844282-770b-4d8b-b551-39f4421c1877","resolution":{"observed_at":"2026-07-09T20:46:34.074595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.071580Z","title":"Online convex programming and generalized infinitesimal gradient ascent,","venue":null,"work_id":"4681afe6-a872-4b8e-a225-c14840fb948a","year":2003},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:dc1d1e231aecdd17536687dcc22f0f452473c379f383954b6a98782ecf7895a2","observation_id":"f67a9e75-248f-4719-96a4-7c9119f74093","resolution":{"observed_at":"2026-07-09T20:46:34.072744Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.039742Z","title":"Logarithmic regret algorithms for online convex optimization,","venue":null,"work_id":"2f7f4bf0-c628-45e0-b940-075b17d7e6e8","year":2007},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:42a1e26f47254b30fba33f9ddf151d7fbb161b4032fe5d3a85176801eb6b34a9","observation_id":"a4179af7-7fbc-4dc4-a218-0a8948c71137","resolution":{"observed_at":"2026-07-09T20:46:34.040838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.044729Z","title":"Zur theorie der gesellschaftsspiele,","venue":null,"work_id":"5e6b670a-f02f-4997-9618-a4ec248a2cb7","year":1928},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:2a10d06c119705f123f6ea85f8c85393d866205977759c11319c984c439ccf29","observation_id":"4e71fe74-9a52-46ef-9587-7f05dd128102","resolution":{"observed_at":"2026-07-09T20:46:34.045766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.041307Z","title":"V on Neumann and O","venue":null,"work_id":"611f4287-9cdb-4848-a990-8e8d28500bed","year":2004},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:8457f26ca766192993fd44126f693509134d5ce8066ebb3f549bcceb289903a2","observation_id":"6a88e904-7b38-4337-9756-9b487f7fa469","resolution":{"observed_at":"2026-07-09T20:46:34.042358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.051203Z","title":"Ben-Tal, L","venue":null,"work_id":"50327fac-eb80-4b26-b532-624273bec2dd","year":2009},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:f2d58e6fb4cf4b8431cb5221f411b6f4c54a563607ce6e0873d5ef08092ed33b","observation_id":"7c76b658-2bf6-401e-98d9-8cb22350e3f7","resolution":{"observed_at":"2026-07-09T20:46:34.052411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.047999Z","title":"Game theory, online prediction and boosting,","venue":null,"work_id":"b95a6504-2613-4d4a-b58a-a24966d2d7ca","year":1996},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:b50dd0709c1f9d58f80a251b941fe4b4870a842c6ae1d3397b9970f35607b054","observation_id":"caac9eae-41b4-4f9a-9f3a-215c0d064314","resolution":{"observed_at":"2026-07-09T20:46:34.049046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.022109Z","title":"Generative adversarial nets,","venue":null,"work_id":"462eaf88-0958-421d-af71-dbe7edaca6a6","year":2014},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:5b124d02b39a5f7f8007163fcc030cc1abced4374f70038bf0628a0b52014d96","observation_id":"554cdfc2-fcdc-4928-aff2-c6de170675d5","resolution":{"observed_at":"2026-07-09T20:46:34.023194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.049575Z","title":"Heads-up limit hold’em poker is solved,","venue":null,"work_id":"e43e68c5-50bc-4830-990b-6c9e3e9b4a97","year":2015},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:66c07a0d37482b0d11d0dda8b0d752287147a6cfa800dcc96fb4e3124b5ddf67","observation_id":"45353e25-cd73-44a8-8d65-aec5e375fe4d","resolution":{"observed_at":"2026-07-09T20:46:34.050701Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.030962Z","title":"A generalization of brouwer’s fixed point theorem,","venue":null,"work_id":"a4da9248-2e16-4591-bb8e-8aa05fd1758a","year":1941},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:4202904a78dc9399a089c9b662ee27b3539295bf2c666d9191bdd3d39714e5eb","observation_id":"9b9ec9da-d8e3-4c9a-9ea3-416e46bfcce6","resolution":{"observed_at":"2026-07-09T20:46:34.032166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.066475Z","title":"Subgradient methods for saddle-point problems,","venue":null,"work_id":"429f3c87-32c3-4c7e-98b9-7ead6902708a","year":2009},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:395aed93f4e439c2da7424a44f6deefa2cf637c8183923ee67e5001c8c1380f0","observation_id":"02488b54-d02a-4f5a-adcb-d9cc9f2fb378","resolution":{"observed_at":"2026-07-09T20:46:34.067590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.038161Z","title":"The limit points of (optimistic) gradient descent in min-max optimization,","venue":null,"work_id":"ccdcce1c-0fe4-4486-adf0-64eee9a5a329","year":2018},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:579c17fdcb660ed65b636e22e23c9696a760868e42185f26b8f06fe27b5de33c","observation_id":"119a6cf2-60e0-42d1-a9e3-42a06bbb4f46","resolution":{"observed_at":"2026-07-09T20:46:34.039260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.071859Z","title":"Competitive gradient descent,","venue":null,"work_id":"0a749219-bf0a-4c79-806f-23dd43b540e8","year":2019},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:c0fd36568cad2eb9975c42cee0e19397345f3a3091779cd1e1c4d2187817598f","observation_id":"c4bb8dcc-dcf3-4ec0-b65c-1d84897d54fc","resolution":{"observed_at":"2026-07-09T20:46:34.072878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.075109Z","title":"Local saddle point optimization: A curvature exploitation approach,","venue":null,"work_id":"6bb53c21-69e1-45c5-a9d0-7e7b2d9b8623","year":2019},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:768ee9a6aaae8ba91cc293fb1260296b226b8c055cb89ba5b13253d69152a48c","observation_id":"df1c5f2c-2ea6-46de-9222-a1727849fed7","resolution":{"observed_at":"2026-07-09T20:46:34.076389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.078671Z","title":"A primal-dual algorithm with line search for general convex-concave saddle point problems,","venue":null,"work_id":"44ad3eeb-123d-40a5-9e6c-0e2d67aadd7a","year":2021},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:16c98c99421f7b036df7d014904b41193ce1b03c7c38021d12d07b1cc4fe307a","observation_id":"99152c8e-f71c-474e-968d-d14a4c1b232c","resolution":{"observed_at":"2026-07-09T20:46:34.080231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.068390Z","title":"On linear convergence of iterative methods for the variational inequality problem,","venue":null,"work_id":"c4ea9071-0ea4-4743-9809-1d91c169e804","year":1995},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:7a85bc80315c6cc53b7607a78645af4c38d036be744f4926bf13e8688f6435a5","observation_id":"f3232c15-4ceb-4b21-8c68-f70e6fd4f4e3","resolution":{"observed_at":"2026-07-09T20:46:34.069542Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.023794Z","title":"Interaction matters: a note on non-asymptotic local convergence of generative adversarial networks,","venue":null,"work_id":"90be1b60-c512-4616-a0b2-86a82f8762d5","year":2019},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:75d5a6dc8935dc1f067e7bac6e4a0326ad4630f8e330cfd88a9ba68405e1d470","observation_id":"3460ec2d-4089-42a4-aed8-89ea1b8ee2dd","resolution":{"observed_at":"2026-07-09T20:46:34.024944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.066794Z","title":"A unified analysis of extra-gradient and optimistic gradient methods for saddle point problems: proximal point approach,","venue":null,"work_id":"08fb3791-d48b-4c07-b625-c749b962c017","year":2020},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:2dd49d3cefbf4caa524e9b4e45fae4fe358aabffb627b5f03f3f737c339c28d1","observation_id":"db1d6323-18da-47f7-8fe3-f6d42892f484","resolution":{"observed_at":"2026-07-09T20:46:34.067901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.025433Z","title":"Convergence rate of o(1/k) for optimistic gradient and extragradient methods in smooth convex-concave saddle point problems,","venue":null,"work_id":"32dda7d1-6d1d-4960-80ed-d7fba71af63a","year":2020},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:c1822ca4d83e839ec448a3ac58c855080a928f94ee31cb05b6d0ab02441fdab5","observation_id":"92b0970a-a160-47cc-b26e-02d8d547ec49","resolution":{"observed_at":"2026-07-09T20:46:34.026572Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.027041Z","title":"Accelerated algorithms for smooth convex-concave minimax problems with o (1/kˆ 2) rate on squared gradient norm,","venue":null,"work_id":"0c5dc17f-c2a7-4df3-a698-06ec07c19bf5","year":2021},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:45d58e58a4687e15b202931393ed4363e130fe9377de58f9b14971939368660c","observation_id":"ab44dc07-bff2-4c4c-a29a-96a62039513a","resolution":{"observed_at":"2026-07-09T20:46:34.028108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.059735Z","title":"Linear last-iterate convergence in constrained saddle-point optimization,","venue":null,"work_id":"0cf03836-22ed-42fd-9b8a-c9349f6db6fe","year":2021},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:72f62244bfb9c3ad395e76bebde42b8fa99948ea18c5d10093061e82c81f6509","observation_id":"3b8fae68-9948-495e-ab8f-8c15c1e2b9ab","resolution":{"observed_at":"2026-07-09T20:46:34.060921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.063198Z","title":"Min-max optimization without gradients: Convergence and applications to black-box evasion and poisoning attacks,","venue":null,"work_id":"2400f367-7e94-497f-8952-c82d1c267677","year":2020},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:e6ca4225729ab18a7fed131bd042c262136a4eb3db4e784ae4f0944a1ba1ea6f","observation_id":"6ef59f55-0d21-40eb-ac2e-ce44251dc86a","resolution":{"observed_at":"2026-07-09T20:46:34.064433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.056053Z","title":"Zeroth-order algorithms for nonconvex-strongly-concave minimax problems with improved complexities,","venue":null,"work_id":"46d99a88-e618-4e2f-b11f-0c487cd0edca","year":2023},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:b7e4154909bc2c6630531bf7506ba3cd5e79f6999885bbb6cc8b0139f475a655","observation_id":"9c162b39-6b66-4d15-9f1a-931d22ae2cba","resolution":{"observed_at":"2026-07-09T20:46:34.057334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.080739Z","title":"Frank-wolfe algorithms for saddle point problems,","venue":null,"work_id":"41d5c0f4-1724-4161-bd63-2a38e443703b","year":2017},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:5011990d79efd3a2a43bf7a7c29833ad40e1e94bbc122797e775896197efbd1d","observation_id":"10a2682d-b075-4b62-bfaf-f8539d442be2","resolution":{"observed_at":"2026-07-09T20:46:34.081857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.069829Z","title":"On frank-wolfe and equilibrium computation,","venue":null,"work_id":"64f557c0-e6ad-4c06-8a1d-ec77c92a1cb4","year":2017},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:bdfe0d172e59e2c3354be4836cbe9409bcc43b0ee06287c14ed24be47dd5cec5","observation_id":"3cbb6594-f34e-4c2d-a4a8-4548c4a68dab","resolution":{"observed_at":"2026-07-09T20:46:34.071008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.061405Z","title":"Faster rates for convex-concave games,","venue":null,"work_id":"ada92551-c115-4b65-ba2b-bdb8fd392f05","year":2018},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:2379b8ef232678c7bfc80376b8e6d4aaaafe5a8d33ae1dccb7690677d0b2d35b","observation_id":"9982d2ee-ee96-486a-b60f-669dcb732b49","resolution":{"observed_at":"2026-07-09T20:46:34.062570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.086052Z","title":"Efficient regret minimization in non-convex games,","venue":null,"work_id":"6d5eebb4-f4cc-4bcf-90db-438e7aaca7ad","year":2017},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:9dbb1ea8c9e73e433d82941c561ebf704ff5f7327c085ba502f6b3092b365f73","observation_id":"b6edf189-28ee-45c2-a7eb-e5192e5a12af","resolution":{"observed_at":"2026-07-09T20:46:34.087300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.089448Z","title":"On gradient descent ascent for nonconvex-concave minimax problems,","venue":null,"work_id":"0679cc67-2846-4177-8dce-0b2a4b708a94","year":2020},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:facd0c527045c3e1f2a046240b57d838729fd617b1b8e846a9d21f38bda64064","observation_id":"b802acb2-4f09-4a8e-9993-e350cc8fa3ac","resolution":{"observed_at":"2026-07-09T20:46:34.090531Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.039967Z","title":"Online learning and online convex optimization,","venue":null,"work_id":"524e0a0e-59ce-43dc-a3d1-03987fac0ac2","year":2012},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:6c17ab11a3cb85855421c35b4dda4029225e59f3a9a81fd1bae40ed6a2724b9c","observation_id":"b56242d5-81ce-4e5a-a8fa-b529bfaacce9","resolution":{"observed_at":"2026-07-09T20:46:34.041063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.036451Z","title":"Online convex optimization in the bandit setting: gradient descent without a gradient,","venue":null,"work_id":"a5bdef9e-9e57-4b36-b257-e52c8c40a90f","year":2005},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:b922c7084340235d713eaf7eaf2a14207aa0c378ee1afd89f0897b2c4ddab605","observation_id":"d121dc16-dfb5-4844-aa44-4eaf628a7d5d","resolution":{"observed_at":"2026-07-09T20:46:34.037651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.046362Z","title":"Introduction to online convex optimization,","venue":null,"work_id":"044343ad-f529-40c9-87e4-6703969ea3ff","year":2016},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:8bbe2ab88718a36488626af33e8976e6467655644f1cd06185990d40ad11e0c4","observation_id":"419ac9ac-5ab2-4101-9efb-368482e5cbe6","resolution":{"observed_at":"2026-07-09T20:46:34.047542Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.087840Z","title":"Dynamic regret of strongly adaptive methods,","venue":null,"work_id":"0876b896-14ed-49e4-a6db-51defe8c3637","year":2018},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:38c1d3d118c6d0a45a66f521b16f361dfafb69e80db5eb491bdd610668b2b78b","observation_id":"6b658fd8-a194-4b1f-bbb0-1f5fc8ea9c32","resolution":{"observed_at":"2026-07-09T20:46:34.088962Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.091108Z","title":"An online optimization approach for multi-agent tracking of dynamic parameters in the presence of adversarial noise,","venue":null,"work_id":"ad2aabfb-6195-4d36-925a-3ec5b6d4693f","year":2017},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:5d9a0a4b993015696937d646f549614baa24a7f8e22e14d81d868b0da5d32f6b","observation_id":"cc215563-d0e8-43ad-b963-d826e53b0cd8","resolution":{"observed_at":"2026-07-09T20:46:34.092299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.082404Z","title":"The online saddle point problem and online convex optimization with knapsacks,","venue":null,"work_id":"22fe65ad-be6b-437d-934d-05f675c7b23d","year":2025},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:8ca4c30775b0ac1de2e18a28613e263f10dd0e966cb313c7fcf66cc0ca9122a6","observation_id":"8cc41aac-0ffb-41c1-9515-a96b88297f2e","resolution":{"observed_at":"2026-07-09T20:46:34.083546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.084218Z","title":"An online saddle point optimization algorithm with regularization,","venue":null,"work_id":"a13f3db8-c62d-4169-8543-fd9d9783f69f","year":2019},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:5e2a50957fb34ce3a4b17bca43d7a7bf68606ba1cac3128392359b32ec502e36","observation_id":"4c6f469a-be8b-4c57-8c6a-4105f186735d","resolution":{"observed_at":"2026-07-09T20:46:34.085435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.07723","last_updated":"2019-07-17T18:57:55Z","snapshot_observed_at":"2026-08-14T16:04:58.633479Z","submitted_at":"2019-07-17T18:57:55Z","title":"Competing Against Equilibria in Zero-Sum Games with Evolving Payoffs","version":1},"cited_work":{"arxiv_id":"1907.07723","doi":null,"metadata_source":"pith","pith_arxiv_id":"1907.07723","snapshot_observed_at":"2026-07-09T20:46:33.689920Z","title":"Competing Against Equilibria in Zero-Sum Games with Evolving Payoffs","venue":"cs.LG","work_id":"abb4921a-fc28-498c-a0e8-49faffb1cf32","year":2019},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"cited_paper":"/paper/1907.07723","citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:e85df5709b846bdef2ce2ed837e3aa7a4cc5999bb974bc11fe9fa519385819bd","observation_id":"a529f80b-6b50-44f7-91dc-e78b84b467c7","resolution":{"observed_at":"2026-07-09T20:46:33.691148Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.01698","last_updated":"2019-12-03T21:52:38Z","snapshot_observed_at":"2026-08-18T12:15:51.800780Z","submitted_at":"2019-12-03T21:52:38Z","title":"Online and Bandit Algorithms for Nonstationary Stochastic Saddle-Point Optimization","version":1},"cited_work":{"arxiv_id":"1912.01698","doi":null,"metadata_source":"pith","pith_arxiv_id":"1912.01698","snapshot_observed_at":"2026-07-09T20:46:33.692340Z","title":"Online and Bandit Algorithms for Nonstationary Stochastic Saddle-Point Optimization","venue":"math.OC","work_id":"e7deeec8-eefd-4c40-a148-c57bcce1b5ea","year":2019},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"cited_paper":"/paper/1912.01698","citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:54e83f17a76a2606316d62315a79814d416aced930a81e9c059953acf0688605","observation_id":"f46aeb6f-5868-4a84-9993-2b69eb34babb","resolution":{"observed_at":"2026-07-09T20:46:33.693661Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.070097Z","title":"No-regret learning in time-varying zero-sum games,","venue":null,"work_id":"8aa14966-7c5a-4260-8f23-4721529480d5","year":2022},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:e953a0ba9d810f03370dda9a1d518239b41cc6e79f68b8a10f941dba94611a7a","observation_id":"0057f699-bf83-408c-b188-7e5fbe96d577","resolution":{"observed_at":"2026-07-09T20:46:34.071389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.06957","last_updated":"2023-12-15T16:04:24Z","snapshot_observed_at":"2026-08-16T14:35:39.130328Z","submitted_at":"2023-12-12T03:34:09Z","title":"Online Saddle Point Problem and Online Convex-Concave Optimization","version":2},"cited_work":{"arxiv_id":"2312.06957","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.06957","snapshot_observed_at":"2026-07-09T20:46:33.687591Z","title":"Online Saddle Point Problem and Online Convex-Concave Optimization","venue":"cs.LG","work_id":"6839e89d-3e66-4bfd-b7b5-f0b2d773445a","year":2023},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"cited_paper":"/paper/2312.06957","citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:3b2c310b3008ae30dd1971360c20c84cd14be332458d243a88db3a03ee096b03","observation_id":"0739d860-98fe-41ee-9a72-e7e73c51ff97","resolution":{"observed_at":"2026-07-09T20:46:33.688834Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.052916Z","title":"Forgetting-factor regrets for online convex optimization,","venue":null,"work_id":"3088a30d-dd52-47db-874f-3b138d52c4de","year":2024},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:c6385cc5bdb14e7da95f999876edc7a979fb9faba355fb64a06f0b313009a5ff","observation_id":"2137e4ff-aada-4c57-b0d8-b200817d1936","resolution":{"observed_at":"2026-07-09T20:46:34.054098Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.054700Z","title":"Projection-free online learning,","venue":null,"work_id":"2f17da99-b833-458d-8b32-e7fe0bfa480e","year":2012},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:8707f6df7033c0e036a79bf2538f3ed26773e84e151e7bb8129c85728c442228","observation_id":"c8c0d506-450b-4ce4-a98f-47b172dc6732","resolution":{"observed_at":"2026-07-09T20:46:34.055807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.056380Z","title":"Distributed convergence to Nash equilibria in two-network zero-sum games,","venue":null,"work_id":"c7045817-553f-4540-ae82-6b48ef8535f8","year":2013},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:7ba94b7ee38444b07c0a6a576c501e9da8ff50df90cdd9aa770f85e8ff5d0e5c","observation_id":"a05819ed-a137-4f38-b255-26b423a1c4e3","resolution":{"observed_at":"2026-07-09T20:46:34.057497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T20:46:34.057956Z","title":"Distributed stochastic subgradient projection algorithms for convex optimization,","venue":null,"work_id":"8ec27074-528b-49a8-b97f-efce30977310","year":2010},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:45bb562fc27c98cfb49d7603b86b8dea254ad61685e2d57ecedff45c846ff81c","observation_id":"521efc67-e852-44ad-9b06-5cca440fbdee","resolution":{"observed_at":"2026-07-09T20:46:34.059139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":3,"verified_fuzzy":41},"total_outbound_references":44},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2607.07078."}