{"as_of":"2026-08-05T09:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b3696c13adb6fd06b36649a3672f955fbe25134e3aeb7d61619b5f12103509aa","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T08:10:10.969901Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+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/2604.16087/citation-record","integrity":"/paper/2604.16087/integrity","json":"/paper/2604.16087/citation-record.json","paper":"/paper/2604.16087"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Last-iterate convergence with full and noisy feedback in two-player zero-sum games","venue":null,"work_id":"dfff472e-28dc-4485-b35c-8c38f548be48","year":2023},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:fe4eb70f6237bbec10bf7516ab1c7daff0fa0cc7f54a00ef918cdc9b8cda97cf","observation_id":"1273f655-5d7f-4487-8cd5-b412ac33443c","resolution":{"observed_at":"2026-05-21T11:24:09.252990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0097539701398375","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Com- put.32, 1 (2002), 48–77","venue":"SIAM Journal on Computing","work_id":"e7b98bf2-772c-41f9-b179-17e3627d13ea","year":2002},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:10161cd3872a0dd706b4ebfac063cf68c8215cc5d75df83f18c38afd4d141cf7","observation_id":"0610bd2e-16b2-4797-aa88-b749b1fad065","resolution":{"observed_at":"2026-05-10T08:12:25.685559Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-07-14T16:50:09.371811+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T16:50:09.371811+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"The last-iterate convergence rate of optimistic mirror descent in stochastic variational inequalities","venue":null,"work_id":"5b0840ad-6364-4340-891a-55e3d22fd44f","year":2021},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:f6951914927e384c32063fa91c5e0ce19440fb09fbe7d44e97f156c969d2614b","observation_id":"58762aa9-f9f8-471a-a62b-be9e410ead5c","resolution":{"observed_at":"2026-05-21T11:24:09.255152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2021.0445","doi":"10.1287/opre.2021.0445","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Doubly Optimal No - Regret Online Learning in Strongly Monotone Games with Bandit Feedback","venue":"Operations Research","work_id":"0dda784f-8fcc-4a8e-9757-892c1a30ab65","year":2025},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:778b8a50fbfdf58e4b88d2f1c19d070743a22c0500f903d6ae95b8d96247676a","observation_id":"c2708eac-7697-4116-82cd-a528e36f5d6a","resolution":{"observed_at":"2026-05-10T08:12:25.680955Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Théorie des opérations linéaires","venue":null,"work_id":"78027a4b-aec6-4707-9b35-c195dbb6a4fa","year":1932},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:a734637c83ddbdcb9b23944d962ca5e9f7889844fdd584b26d48e79bbacb1f7f","observation_id":"52d514ac-b8ce-4726-b4b5-99a02ea3a010","resolution":{"observed_at":"2026-05-21T11:24:09.261409Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Bandit Learning in Concave N - Person Games","venue":null,"work_id":"548c1783-aefa-40c7-ad34-a3bf081760e9","year":2018},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:78b42d3f65562a26aaac426556d79226c613532e6b39d1c2c0be90381b95ed36","observation_id":"acf1cedb-0a0d-4628-a481-5d35765fceea","resolution":{"observed_at":"2026-05-21T11:24:09.244594Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Uncoupled and convergent learning in two-player zero-sum markov games with bandit feedback","venue":null,"work_id":"edc337b6-cc64-4fcd-9a12-279ba84cd90b","year":2023},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:f03fe363da2503e83f86246f09c0a91c6fb0ba7ed03f61e77fe65662b1229fdd","observation_id":"354cff71-d792-4735-b103-d0eb81fe3443","resolution":{"observed_at":"2026-05-21T11:24:09.246643Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Fast Last - Iterate Convergence of Learning in Games Requires Forgetful Algorithms","venue":null,"work_id":"de781669-0180-469e-b237-28c69b8fadf8","year":2024},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:ddf9fe5730e62c92d60ab4e76ca50ba21f74e7926bfcce7ab624bdaf8c70dbb8","observation_id":"a8e93687-5021-44b3-a264-2b0dd5f90bc5","resolution":{"observed_at":"2026-05-21T11:24:09.248582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/cbo9780511546921","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Prediction, Learning, and Games","venue":"Cambridge University Press eBooks","work_id":"fb5bfc6a-7e7d-4906-bc50-2bb703b49883","year":2006},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:43e25a3445b71edec795f761f4251d5cf7dcc54fda194468bc38070a1c7b5636","observation_id":"ace67573-d648-44bb-82c7-8d1b46f44e67","resolution":{"observed_at":"2026-05-10T08:12:25.690929Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-07-12T18:49:23.584222+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T18:49:23.584222+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Online Optimization with Gradual Variations","venue":null,"work_id":"816d6cb0-be5f-410c-ae1a-9bf1318fd284","year":2012},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:4e4de11906e9e5049659ce3f8de1825bd129f7ab050724b355aace510c417e1c","observation_id":"faf85bfa-3c2d-4965-bc50-1c0e8a646e88","resolution":{"observed_at":"2026-05-21T11:24:09.250574Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.08395","last_updated":"2024-08-15T19:42:41Z","snapshot_observed_at":"2026-07-06T19:01:19.478722Z","submitted_at":"2024-08-15T19:42:41Z","title":"Uncoupled and Convergent Learning in Monotone Games under Bandit Feedback","version":1},"cited_work":{"arxiv_id":"2408.08395","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.08395","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2408.08395 , year=","venue":null,"work_id":"665597e2-e348-43b0-bfb6-bc9e69956e5f","year":2024},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"cited_paper":"/paper/2408.08395","citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:06e3a2e290359c590150641e109cfe74dace4956e05a8263277f3a9856d0e1f2","observation_id":"2a3c9acb-4210-4ba3-bb4b-092a1487d63e","resolution":{"observed_at":"2026-05-10T08:12:26.636704Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1059.2022","doi":"10.1109/cdc51059.2022.9992399","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: 2022 IEEE 61st Conference on Decision and Control (CDC)","venue":"2022 IEEE 61st Conference on Decision and Control (CDC)","work_id":"bf964e4d-f145-4b05-a127-46fc336aa556","year":2022},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:d44e3e249cf8c4e031bf5923d58119873dc97e7f8974be782a4658c6aed3d62c","observation_id":"4c9e3bf4-6b3c-4919-8eab-f5247e87616b","resolution":{"observed_at":"2026-05-10T08:12:25.688575Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/b97543","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Pang, J.-S","venue":null,"work_id":"b1d6a472-85e8-447d-992e-2f169257f2e0","year":2004},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:ade20e7720ac51265cc746df82f08c03a13649c41fe9151a055c6364b9e564df","observation_id":"8ad890a6-105c-4ad3-a70a-a29b0f538d98","resolution":{"observed_at":"2026-05-10T08:12:25.693019Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Fictitious self-play in extensive-form games","venue":null,"work_id":"7c6bb6ff-d32d-43a9-9845-cd78499d2516","year":2015},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:5385caaef4aab6926cf3098bfa1922e2cc211c3db1491aaf10fed92e6d22ec98","observation_id":"68c49bed-f726-487a-8678-1520d3c6e15d","resolution":{"observed_at":"2026-05-21T11:24:09.238375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-56468-0_5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Lemaréchal, C","venue":null,"work_id":"e2e6209a-ab38-4198-9efc-b3cd9db2eefd","year":2001},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:1218322569506b360353a0db3b94bb383a3c34c41244b2a76e5bcdb63a1d185c","observation_id":"b49d0381-f75e-4383-bade-b80f8ee7f677","resolution":{"observed_at":"2026-05-10T08:12:25.682948Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"On the Convergence of Single - Call Stochastic Extra - Gradient Methods","venue":null,"work_id":"bc75608a-6770-4ec4-9f21-e409d3d9b111","year":2019},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:af92b906098aafb922db19557d5315a71d0ee05ce9ef1a35396bfb23bd3e8ba9","observation_id":"195a72b8-774d-4574-81ca-80040dd693cd","resolution":{"observed_at":"2026-05-21T11:24:09.240436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2024.347987","doi":"10.1109/tac.2024.3479874","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Zeroth-order learning in continuous games via residual pseudogradient estimates","venue":"IEEE Transactions on Automatic Control","work_id":"ded8f2ef-1a0f-4dd0-9fb7-efb1d2d68761","year":2024},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:90e27c5df342bd4aecd20b950435cfe053ced2aefd927287434656c017c697e6","observation_id":"e61e41c4-5812-4375-8dae-2456db13fa3c","resolution":{"observed_at":"2026-05-10T08:12:25.659227Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1214/10-ssy011","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"B., Nemirovski, A","venue":"Stochastic Systems","work_id":"6744fe59-332d-4d51-a391-bb5c05db26e3","year":2011},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:ead0f2514f3b0c8f5126f1f61c1f804d7746c722142a9cd2797ea2eacb98f7ac","observation_id":"6e829cb5-dc6a-4de4-a0c9-91eef1c08bc6","resolution":{"observed_at":"2026-05-10T08:12:25.674722Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"A., Hsieh, Y.-P., Sahin, M","venue":null,"work_id":"7ff32e1a-ac8f-4f2e-8d3e-314297bef403","year":2018},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:de4abf94afc9191b02f61e3908a945638b3e27c37cb35cd8ed9a915e6421e8af","observation_id":"068dbcee-c68e-4465-a492-769a975b57ea","resolution":{"observed_at":"2026-05-21T11:24:09.221818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Efficient learning by implicit exploration in bandit problems with side observations","venue":null,"work_id":"d85af716-3fc6-4582-a73e-740625ce7775","year":2014},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:9ab8c52ba268aa5a587c161c6b59a8f879cd189a64c4a7269643904f7792e363","observation_id":"ea8dbfc8-dd4a-40b7-a75b-238dd36f7d41","resolution":{"observed_at":"2026-05-21T11:24:09.234850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"0cc9fcff-6bef-4fbc-8e12-f590fb50992c","year":1976},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:b4b2e9fedd129c1440cdd45e16f10d64703710397cab5204ad8cea038d6a6014","observation_id":"a051fbc5-1238-4123-865e-eb9f4a4a822c","resolution":{"observed_at":"2026-05-21T11:24:09.236533Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Model-free learning for two-player zero-sum partially observable Markov games with perfect recall","venue":null,"work_id":"e6f2805b-b4b8-4cff-a5cc-6f79340b1b49","year":2021},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:333bcb6f4172ae12ffea860628f4460e2c77c8ab4444922d2eb32a3c28aa6163","observation_id":"46281ba9-7164-45a2-a0e5-ed6aa88d79d4","resolution":{"observed_at":"2026-05-21T11:24:09.242467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"4468.276447","doi":"10.1145/2764468.2764476","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Dickerson and Nika Haghtalab and Ariel D","venue":null,"work_id":"bcb5bd24-3d15-45c5-8d88-8674ff26db39","year":2015},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:e626fc6ad53189428013a02378c25691ec3e3c7eea20ed94df0e2d9247fb4713","observation_id":"58069380-5e9b-4a43-bc56-c2db6bec9a70","resolution":{"observed_at":"2026-05-10T08:12:25.677749Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"1238856e-f4f3-47fe-a2b7-e028059a9801","year":1953},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:a379b5621691db26f4cea6352d3413068a8b982801466877cd38526babcb59b2","observation_id":"bebc6f6d-644f-495d-a36e-72c5d233554b","resolution":{"observed_at":"2026-05-21T11:24:09.232642Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf00932801","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Journal of Optimization Theory and Applications","work_id":"b9c2b44a-f363-4597-a56f-3d6662cb6a70","year":1972},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:2af58cdf1e8e2454b2cb0f571a7195512eab2eefade89c87fd381a51e77cbc88","observation_id":"200f8aff-b075-4518-87a2-5a90e0c90a9f","resolution":{"observed_at":"2026-05-10T08:12:25.672713Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1051/m2an/197004r301541","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Brève communication","venue":"Revue française d informatique et de recherche opérationnelle Série rouge","work_id":"e104386e-cb2a-4436-a95f-d6f24da32683","year":1970},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:5469e2c416bbbb89b409708952639e757a7564efb8b55d4dfcf90db459771c7a","observation_id":"74ad897e-c776-49d1-899e-63e721af28f1","resolution":{"observed_at":"2026-05-10T08:12:25.664123Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.04122","last_updated":"2022-10-11T04:37:07Z","snapshot_observed_at":"2026-07-06T13:18:48.620328Z","submitted_at":"2022-06-08T18:43:45Z","title":"ESCHER: Eschewing Importance Sampling in Games by Computing a History Value Function to Estimate Regret","version":2},"cited_work":{"arxiv_id":"2206.04122","doi":"10.48550/arxiv.2206.04122","metadata_source":"arxiv_reference","pith_arxiv_id":"2206.04122","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"ESCHER: E schewing importance sampling in games by computing a history value function to estimate regret","venue":"arXiv (Cornell University)","work_id":"f605463d-2d6e-4ffa-8e52-3a7bb00d05d5","year":2022},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"cited_paper":"/paper/2206.04122","citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:36369083c1e05b262afe522a9aa9ee99ba085098b28068b38b20787cd0e79b1c","observation_id":"ca7da896-12be-4dcd-b60a-097d8b9e9488","resolution":{"observed_at":"2026-05-10T08:12:25.667417Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"G., Rowland, M., Guo, Z","venue":null,"work_id":"11d1ad85-1eab-46ee-b5a8-7c337b004bcc","year":2023},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:66b5f8aa1c0fc36de021d0266c15302941a07fc0abdb2932df06f0ae2df4c0ee","observation_id":"1467ffe2-7a6c-4689-8534-04af4702fb87","resolution":{"observed_at":"2026-05-21T11:24:09.241253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2022.0016","doi":"10.1287/moor.2022.0016","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the Impossibility of Convergence of Mixed Strategies with Optimal No - Regret Learning","venue":"Mathematics of Operations Research","work_id":"ca87dda4-472a-4f0e-95d9-acb31eac2c69","year":2020},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:d3c046b462c175b1bf1866cae7a2b130a54dd7e9ed962bb2b015b62405cc194b","observation_id":"f78b46c8-b814-4c21-90bf-9292653d957c","resolution":{"observed_at":"2026-05-10T08:12:25.662256Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"d51ffbf0-3a8f-465d-9b69-624e7813f04c","year":1950},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:d60b58fdf170cc9e4c743151e557668c94a9c0b0a4d5b1b30360dbca0fd38470","observation_id":"0318a162-72ef-4bed-ba6e-02c46e383329","resolution":{"observed_at":"2026-05-21T11:24:09.257077Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems","venue":null,"work_id":"261e3cda-11b7-465a-900a-2ffce1eceedf","year":2004},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:19b6e4d1cf6c8c573cd3f01927dcc609a111f9ce9397d6d9f9a725e4969bf3ad","observation_id":"bf19085d-2442-4411-a22a-9eb463e68cc5","resolution":{"observed_at":"2026-05-21T11:24:09.225844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/070704277","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Juditsky, A","venue":"SIAM Journal on Optimization","work_id":"b5eb7dca-6883-4820-8fa0-98092f39f6ac","year":2009},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:cd8359e1c68c2c8763d41bef0260bcb916838b6017c103a8f7bd9be1638968c7","observation_id":"079be8d5-7f3b-44ef-a4ea-a51b4cfc4406","resolution":{"observed_at":"2026-05-10T08:12:25.670604Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-05-23T19:22:47.763274+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T19:22:47.763274+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"326c063b-dd98-4db4-9149-a7a5c87f3bd0","year":1983},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:42bc1e008f7c770357511c4a9ac803a9ed14d7086462821e04cce25e8e8415c7","observation_id":"64f2e9bd-c3c5-4ea2-a817-44b45b4de1d9","resolution":{"observed_at":"2026-05-21T11:24:09.230393Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Explore no more: improved high-probability regret bounds for non-stochastic bandits","venue":null,"work_id":"b7203bcd-61ba-4dce-ab32-486c36eb4881","year":2015},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:66434455470b6ddc8ebe041e40bcc0b89b9dfea81d3f6e399c9656f7340edb6a","observation_id":"23409493-11fb-49fe-b0cf-1729a3cea05e","resolution":{"observed_at":"2026-05-21T11:24:09.218996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Information and information stability of random variables and processes","venue":null,"work_id":"481b0ef4-24dd-4577-9339-94c5933fa5fc","year":1964},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:9198ecbb6f3c9a87ea4cd71439a5d8a2dd1527ebbbcd6ae33f4356fa55df15f4","observation_id":"3d9eba69-1449-4a44-a27d-c50eb151b706","resolution":{"observed_at":"2026-05-21T11:24:09.221207Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf01141092","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Mathematical Notes","work_id":"098da8c4-694d-4db6-a3bf-7048cb60fb6c","year":1980},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:17a1759b201dc3f6b72dc0a5e3810650dd85d1ea2f9a48351f65b9aeb787cd3a","observation_id":"070b91c2-8a88-448e-8f17-0279a42b1774","resolution":{"observed_at":"2026-05-10T08:12:25.652279Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-07-09T10:18:51.801334+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T10:18:51.801334+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"and Sridharan, K","venue":null,"work_id":"b14bf3e1-13c8-4310-9746-296d430beff3","year":2013},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:6fe98ffc42e698da43451530b97f9902b768c3502b00bf36e3fee7132abb83be","observation_id":"e1146918-de20-4f85-b947-133ab8caa0ed","resolution":{"observed_at":"2026-05-21T11:24:09.223459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Real and Complex Analysis","venue":null,"work_id":"43b8c9d2-02e9-4d10-a0f9-3b755822d5ff","year":2006},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:2ec12e9bd8141584347bb16ccc2557d285ca86ddc920e15f7882609a9e78f4b8","observation_id":"36e672b9-8492-45cb-8eb4-c5ab2e26e0f5","resolution":{"observed_at":"2026-05-21T11:24:09.244929Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.11147","last_updated":"2022-02-22T19:45:48Z","snapshot_observed_at":"2026-07-06T12:40:33.479618Z","submitted_at":"2022-02-22T19:45:48Z","title":"On the Rate of Convergence of Payoff-based Algorithms to Nash Equilibrium in Strongly Monotone Games","version":1},"cited_work":{"arxiv_id":"2202.11147","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.11147","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the rate of convergence of payoff-based algorithms to nash equilibrium in strongly monotone games","venue":null,"work_id":"76f0bd6c-8465-45c5-bc3e-b71bbbdabeec","year":2022},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"cited_paper":"/paper/2202.11147","citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:c154b2064a7fda085f287f0393ccb460ff4a9cd8f013c0ecac2837675d3d4aca","observation_id":"7bc21490-b3db-4179-99d7-5d525336dbd6","resolution":{"observed_at":"2026-05-10T08:12:26.633824Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0377-0427(94)00094-h","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On linear convergence of iterative methods for the variational inequality problem","venue":"Journal of Computational and Applied Mathematics","work_id":"4d996155-5f78-44a5-b51a-b23f40fee6e2","year":1995},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:ba3a1c094a0fa79d350a561a81c29f2297a1506c41a3e793b6331dceb13a8099","observation_id":"7c5355f6-4700-4e50-84bf-bbdbe1891c67","resolution":{"observed_at":"2026-05-10T08:12:25.650422Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0314056","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Monotone operators and the proximal point algo rithm","venue":"SIAM Journal on Control and Optimization","work_id":"90aa6288-b121-4cc9-947a-dd6392d3ed7c","year":1976},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:5ed50de72b844abac5302b1646449a7cecc782df258129bb821a6b1439630b02","observation_id":"2d23afaf-0ee5-4faf-b8dd-87cfb72a7ada","resolution":{"observed_at":"2026-05-10T08:12:25.654113Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf01448847","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: Logics in Artificial Intelligence , pp","venue":"Mathematische Annalen","work_id":"ea313c1a-19b8-4a94-a9bb-d06293c73807","year":2008},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:ab07815f18e8c2488f82955718083da5a51b79667252f761c26bc384dba3861c","observation_id":"1a8fc2a1-2973-4346-ae44-c6ae5495cbbc","resolution":{"observed_at":"2026-05-10T08:12:25.656389Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-02T15:08:12.428477+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-02T15:08:12.428477+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Last-iterate convergence of decentralized optimistic gradient descent/ascent in infinite-horizon competitive markov games","venue":null,"work_id":"4c079dfc-cd6e-41d6-863c-ea78e5a4ce01","year":2021},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:c03aea6a4d9f05165c4b4dca3f14d582cf4acd62f24c02aee90e8cf029b41d44","observation_id":"d9d91d98-1bab-412b-a025-199529f3056f","resolution":{"observed_at":"2026-05-21T11:24:09.259229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-09T08:36:07.226215Z","title":"write newline","venue":null,"work_id":"8481976a-f196-4822-833d-e487ae5a1e81","year":null},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:b842eafdb861491b23048a966946ec97522bbc08b5f25d415a57e6c22b6e281e","observation_id":"4d76bea0-e859-4ece-8238-1c291f7aa70c","resolution":{"observed_at":"2026-05-21T11:24:09.211380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"write newline","venue":null,"work_id":"286103af-66c5-427e-9099-4f0492c4b122","year":null},"citing_paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-05-10T08:10:10.969901Z"},"links":{"citing_paper":"/paper/2604.16087"},"observation_digest":"sha256:600b4f1dae2a995f3ae7010badac024ac5b1101e67344535da0b41c096df551b","observation_id":"97a42eb7-0bb4-4665-8bf8-746306d4b62f","resolution":{"observed_at":"2026-05-21T11:24:09.216535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.16087","last_updated":"2026-04-17T14:17:09Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T23:03:30.601598Z","submitted_at":"2026-04-17T14:17:09Z","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":0,"metadata_mismatch":4,"parse_uncertain":0,"unresolved":4,"verified_exact":16,"verified_fuzzy":21},"total_outbound_references":45},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 0 inbound Pith citation observations for arXiv:2604.16087."}