{"as_of":"2026-08-05T10:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:130c0d2ec3e14fb42e875388d86695207f8517869de3fcc5b09e72021e75b68e","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T10:56:28.962563Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-12T19:45:26.097645Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-05-12T06:56:31.620283Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2604.15242","last_updated":"2026-04-16T17:17:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-16T17:17:42Z","title":"Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.15242","snapshot_observed_at":"2026-07-12T19:45:26.097645Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2604.15243","last_updated":"2026-07-02T17:26:17Z","snapshot_observed_at":"2026-08-02T21:01:38.942775Z","submitted_at":"2026-04-16T17:18:47Z","title":"Classifying spaces for families of virtually abelian subgroups of surface braid groups","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-12T19:45:26.097645Z"},"links":{"cited_paper":"/paper/2604.15242","citing_paper":"/paper/2604.15243"},"observation_digest":"sha256:83fcf4b42fe9f44e5fece81119c987140c2a86eed0a41f7bfbd0512ecc8d4af7","observation_id":"d8abc8bb-34ae-4536-ae01-2fffd12ab864","resolution":{"observed_at":"2026-07-12T19:45:26.097645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.15242","last_updated":"2026-04-16T17:17:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-16T17:17:42Z","title":"Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier","version":1},"cited_work":{"arxiv_id":"2604.15242","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.15242","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier","venue":"cs.LG","work_id":"0f0b54e6-259d-4d22-b7b7-c3330c21d684","year":2026},"citing_paper":{"arxiv_id":"2605.09363","last_updated":"2026-05-10T06:23:19Z","snapshot_observed_at":"2026-08-03T01:34:15.771125Z","submitted_at":"2026-05-10T06:23:19Z","title":"Near-Optimal Last-Iterate Convergence for Zero-Sum Games with Bandit Feedback and Opponent Actions","version":1},"reference_index":236,"source":"arxiv_source","source_observed_at":"2026-05-12T03:46:35.908522Z"},"links":{"cited_paper":"/paper/2604.15242","citing_paper":"/paper/2605.09363"},"observation_digest":"sha256:cc3fd972afd2523665bb7b2c7980f082f6064c30d691231852081118ba338ea9","observation_id":"5ad06483-4617-4b14-ac35-d28b8ca838ae","resolution":{"observed_at":"2026-05-12T06:56:31.625974Z","resolver_source":"local_arxiv","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"}}],"links":{"evidence":"/evidence","html":"/paper/2604.15242/citation-record","integrity":"/paper/2604.15242/integrity","json":"/paper/2604.15242/citation-record.json","paper":"/paper/2604.15242"},"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":"Minimax policies for adversarial and stochastic bandits","venue":null,"work_id":"5defc5ad-44f9-4c5a-942d-bf1409d1bf35","year":2009},"citing_paper":{"arxiv_id":"2604.15242","last_updated":"2026-04-16T17:17:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-16T17:17:42Z","title":"Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-10T10:56:28.962563Z"},"links":{"citing_paper":"/paper/2604.15242"},"observation_digest":"sha256:21ad20c5f24b6064576c55b8be0333e15613c65385046ff670de8d5fe9082c54","observation_id":"0d1f4776-b34b-4c5e-a87c-4dff08415c90","resolution":{"observed_at":"2026-05-19T17:23:10.833260Z","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":"7a5308a2-6008-4f27-a0db-2e70474a5413","year":2023},"citing_paper":{"arxiv_id":"2604.15242","last_updated":"2026-04-16T17:17:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-16T17:17:42Z","title":"Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-10T10:56:28.962563Z"},"links":{"citing_paper":"/paper/2604.15242"},"observation_digest":"sha256:66a602f67ebf36967995ef72f054ba5748301f95ce8bcb0d1ff00960dae5c8ad","observation_id":"07b20e11-5a28-4b4d-a8e2-12050f3b2170","resolution":{"observed_at":"2026-05-19T17:23:10.849983Z","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":"The harder path: Last iterate convergence for uncoupled learning in zero-sum games with bandit feedback https://proceedings.mlr.press/v267/fiegel25a.html","venue":null,"work_id":"11917810-64ea-42de-b15c-418df5f6cab3","year":2025},"citing_paper":{"arxiv_id":"2604.15242","last_updated":"2026-04-16T17:17:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-16T17:17:42Z","title":"Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-10T10:56:28.962563Z"},"links":{"citing_paper":"/paper/2604.15242"},"observation_digest":"sha256:47539e3f953efea2456fdb7c10b081c1e25427aeb8cbf08f0852eef915b078c8","observation_id":"155e5937-64cb-4ec0-a051-24b1ba8afe60","resolution":{"observed_at":"2026-05-19T17:23:10.827027Z","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":"Fundamentals of Convex Analysis, pages 163--208","venue":null,"work_id":"6c414cb2-39cc-4815-94ec-f76686f3f8f7","year":2001},"citing_paper":{"arxiv_id":"2604.15242","last_updated":"2026-04-16T17:17:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-16T17:17:42Z","title":"Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-10T10:56:28.962563Z"},"links":{"citing_paper":"/paper/2604.15242"},"observation_digest":"sha256:c3c8618abe775105b04a4f5d73e97058fb31476201be89021e5b06d449c8166c","observation_id":"c28ad7a1-46a4-4969-9fcb-b76a38f97862","resolution":{"observed_at":"2026-05-19T17:23:10.840803Z","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":"Let's be honest: An optimal no-regret framework for zero-sum games https://proceedings.mlr.press/v80/kangarshahi18a.html","venue":null,"work_id":"b411effd-6cad-4a55-a71d-a44c151cdec4","year":2018},"citing_paper":{"arxiv_id":"2604.15242","last_updated":"2026-04-16T17:17:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-16T17:17:42Z","title":"Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-10T10:56:28.962563Z"},"links":{"citing_paper":"/paper/2604.15242"},"observation_digest":"sha256:671f81cfbada38ccc12095398040986b01990c9c08a0f2ab8cc9e3ebaaeb677c","observation_id":"b31a8675-a643-4103-94e7-a2993c5aa8dc","resolution":{"observed_at":"2026-05-19T17:23:10.847505Z","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":"Faster first-order methods for extensive-form game solving","venue":null,"work_id":"fc4cd891-2bae-46ee-86dc-4747e27264c4","year":2015},"citing_paper":{"arxiv_id":"2604.15242","last_updated":"2026-04-16T17:17:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-16T17:17:42Z","title":"Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-10T10:56:28.962563Z"},"links":{"citing_paper":"/paper/2604.15242"},"observation_digest":"sha256:03ba1d7c25ebab9e89110971e2e513229f6ff8b88a03003c6be4871e50369ad7","observation_id":"d2b03e2f-39db-4e59-b806-a6cb12de3042","resolution":{"observed_at":"2026-05-19T17:23:10.843971Z","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":"Martinet","venue":null,"work_id":"1457a71d-dba4-47bb-9884-6bef6ca86cd4","year":1970},"citing_paper":{"arxiv_id":"2604.15242","last_updated":"2026-04-16T17:17:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-16T17:17:42Z","title":"Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-10T10:56:28.962563Z"},"links":{"citing_paper":"/paper/2604.15242"},"observation_digest":"sha256:77e407ebbe7dc8f5578e6f6cbf5264e070d513c1f1e1ea4ddd8964b103923904","observation_id":"b71d6ffd-b696-42e0-b649-cb142a9b7f41","resolution":{"observed_at":"2026-05-19T17:23:10.852592Z","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.15242","last_updated":"2026-04-16T17:17:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-16T17:17:42Z","title":"Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-10T10:56:28.962563Z"},"links":{"citing_paper":"/paper/2604.15242"},"observation_digest":"sha256:0eff85b69a27fa563fa082be87d9221b34fd9d867309d22e2a0645637abdcd66","observation_id":"114d6881-f88d-4062-9b58-29aaba751ecf","resolution":{"observed_at":"2026-05-10T11:00:03.640820Z","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":"Optimization, learning, and games with predictable sequences","venue":null,"work_id":"525f4a23-855e-4545-8171-1a4ffe5d7c9c","year":2013},"citing_paper":{"arxiv_id":"2604.15242","last_updated":"2026-04-16T17:17:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-16T17:17:42Z","title":"Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-10T10:56:28.962563Z"},"links":{"citing_paper":"/paper/2604.15242"},"observation_digest":"sha256:83e29565a742653b03f8c20f7611bec8d9c159e32192acfb235838c5f099bc68","observation_id":"a47b0796-19ba-42a4-a31d-66cf257b5798","resolution":{"observed_at":"2026-05-19T17:23:10.860491Z","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":"Formes bilin \\'e aires coercitives sur les ensembles convexes","venue":null,"work_id":"464d942d-1378-4a1f-bfd1-7bff2b00ceb5","year":1964},"citing_paper":{"arxiv_id":"2604.15242","last_updated":"2026-04-16T17:17:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-16T17:17:42Z","title":"Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-10T10:56:28.962563Z"},"links":{"citing_paper":"/paper/2604.15242"},"observation_digest":"sha256:765fde38facc37069b165b0ef52d54434fd36990a620d066d7c0b44d2e7662dc","observation_id":"e1773db9-5f23-4508-943d-a3d44c2ce8d0","resolution":{"observed_at":"2026-05-19T17:23:10.868948Z","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/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.15242","last_updated":"2026-04-16T17:17:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-16T17:17:42Z","title":"Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-10T10:56:28.962563Z"},"links":{"citing_paper":"/paper/2604.15242"},"observation_digest":"sha256:cdbe6e921890be09a4fba7dcd56123fbe13f1aec36e32dc13e2aca9fd4a0aea0","observation_id":"1a35e6a8-08a1-4341-bf4d-0b5093e5c5d8","resolution":{"observed_at":"2026-05-10T11:00:03.642896Z","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.15242","last_updated":"2026-04-16T17:17:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-16T17:17:42Z","title":"Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-10T10:56:28.962563Z"},"links":{"citing_paper":"/paper/2604.15242"},"observation_digest":"sha256:b9d5cdb35557cf1da753acb52bc28ce77e98724a810c437a065a27738b79177d","observation_id":"2d23a15a-59e4-417c-816d-584f86e821f1","resolution":{"observed_at":"2026-05-10T11:00:03.644995Z","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":"Efficient computation of behavior strategies","venue":null,"work_id":"156c3a02-713d-4c26-b2da-1355c45afb1c","year":1996},"citing_paper":{"arxiv_id":"2604.15242","last_updated":"2026-04-16T17:17:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-16T17:17:42Z","title":"Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-10T10:56:28.962563Z"},"links":{"citing_paper":"/paper/2604.15242"},"observation_digest":"sha256:46e1d6bd471a39b83dc81d718c7c0bb3c1fd9de4d0216df5162337dce466b2cc","observation_id":"3814c4a2-7731-4008-8643-330323e9c3c4","resolution":{"observed_at":"2026-05-19T17:23:10.829902Z","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":"Last-iterate convergence of decentralized optimistic gradient descent/ascent in infinite-horizon competitive markov games http://proceedings.mlr.press/v134/wei21a.html","venue":null,"work_id":"2085b4cd-b18f-4e30-8296-81fd805edd3b","year":2021},"citing_paper":{"arxiv_id":"2604.15242","last_updated":"2026-04-16T17:17:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-16T17:17:42Z","title":"Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-10T10:56:28.962563Z"},"links":{"citing_paper":"/paper/2604.15242"},"observation_digest":"sha256:4a3e837468fb6e9b62fafe864220503a19e3d6dde89a2924ab06a4135fde3bcb","observation_id":"b292d8cf-d7ea-4b2d-a92d-c8262783f5e0","resolution":{"observed_at":"2026-05-19T17:23:10.862921Z","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":"An optimal algorithm for stochastic and adversarial bandits http://proceedings.mlr.press/v89/zimmert19a.html","venue":null,"work_id":"7d7f5b86-31d5-4f45-9f16-c26f13c1cd41","year":2019},"citing_paper":{"arxiv_id":"2604.15242","last_updated":"2026-04-16T17:17:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-16T17:17:42Z","title":"Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-10T10:56:28.962563Z"},"links":{"citing_paper":"/paper/2604.15242"},"observation_digest":"sha256:325c4757bd58e1c3f4f29e57485b76a6c7b7bc46bf8ac51f68fb6e281da7fc44","observation_id":"cb94fd2e-a5a9-4d1d-9e9f-1af6a5896753","resolution":{"observed_at":"2026-05-19T17:23:10.836196Z","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.15242","last_updated":"2026-04-16T17:17:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-16T17:17:42Z","title":"Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-10T10:56:28.962563Z"},"links":{"citing_paper":"/paper/2604.15242"},"observation_digest":"sha256:1c6799959eb3246f89acd75cf2319c035432b2d43ff8a0520b533fa1f28b138b","observation_id":"5fd422aa-82cb-4c21-a55e-de689b93faf2","resolution":{"observed_at":"2026-05-19T17:23:10.858033Z","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.15242","last_updated":"2026-04-16T17:17:42Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-16T17:17:42Z","title":"Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":3,"verified_fuzzy":13},"total_outbound_references":16},"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 16 of 16 outbound references and 2 inbound Pith citation observations for arXiv:2604.15242."}