{"as_of":"2026-08-08T15:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3cb0d0e6a5f5729fdd35b49617014a3332f2bee0929a41fa6ef15a8838733485","coverage":[{"denominator":51,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":51,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:31:55.668102Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2506.05747/citation-record","integrity":"/paper/2506.05747/integrity","json":"/paper/2506.05747/citation-record.json","paper":"/paper/2506.05747"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:31:57.858963Z","title":"Mutation-driven follow the regularized leader for last-iterate convergence in zero-sum games","venue":null,"work_id":"4bf507c9-167b-4768-b425-abe419f86783","year":2022},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.287526Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:542517d52f3c976414580d58bb50eb0fc0892c521601ddef40b9b1862aa1757c","observation_id":"7a948c95-66bf-440c-bb8a-8f36b1171356","resolution":{"observed_at":"2026-08-07T10:31:57.868047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:57.842369Z","title":"Last-iterate convergence with full and noisy feedback in two-player zero-sum games","venue":null,"work_id":"b6e25a4f-7cb0-496f-a81e-fd5c16089999","year":2023},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.294955Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:22da0fc39f3b203307c083a76f78b17911fbe2f74c380262d86cc6b40ee1ac2e","observation_id":"86898c64-ba97-4637-8c06-f5b971ba1145","resolution":{"observed_at":"2026-08-07T10:31:57.847709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:57.820595Z","title":"Adaptively perturbed mirror descent for learning in games","venue":null,"work_id":"7f8fa97b-560e-4a88-b970-e2b1988c155c","year":2024},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.306394Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:1dc57889eeb4f21d90e9dce2a9bb643dabf1d2f4ec609cd652fb283872457d16","observation_id":"b6a0695b-ab76-47e8-a977-65f1573ee092","resolution":{"observed_at":"2026-08-07T10:31:57.826879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:57.786169Z","title":"Multiplicative weights update in zero-sum games","venue":null,"work_id":"a68a16be-67c1-4500-bfbb-e8426b1b8efe","year":2018},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.314447Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:76cf742938b6783302088cccd7c85b52d8fbfd6f9e8251ddf94cfb203d63b572","observation_id":"5cc5d6c1-70da-457e-891b-62c3f8129e75","resolution":{"observed_at":"2026-08-07T10:31:57.798370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2208.08238","last_updated":"2022-08-17T11:35:39Z","snapshot_observed_at":"2026-07-06T13:42:40.131502Z","submitted_at":"2022-08-17T11:35:39Z","title":"Last-iterate Convergence to Trembling-hand Perfect Equilibria","version":1},"cited_work":{"arxiv_id":"2208.08238","doi":null,"metadata_source":"pith","pith_arxiv_id":"2208.08238","snapshot_observed_at":"2026-08-07T10:31:55.851118Z","title":"Last-iterate Convergence to Trembling-hand Perfect Equilibria","venue":"cs.GT","work_id":"48caa6f7-f5bd-4eca-8bc3-7146b58991a2","year":2022},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.320351Z"},"links":{"cited_paper":"/paper/2208.08238","citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:a74e17c1e5573b3bb210675ed149cad327d89322617ee0a735edd2d0a53b8296","observation_id":"8c7aa2d7-35fa-47ff-885f-e4d8a7d80321","resolution":{"observed_at":"2026-08-07T10:31:55.870526Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:31:55.326646Z","title":"Convex optimization","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.326646Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:49126cabe60b6cff724527488e14de73d49db7b0159d94bb27d7aa431224aabd","observation_id":"af6b9539-669f-4377-80e8-c907950d9708","resolution":{"observed_at":"2026-08-07T10:31:55.326646Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:31:57.745237Z","title":"Solving imperfect-information games via discounted regret minimization","venue":null,"work_id":"f36632de-43ef-45a6-b87d-b6a272f3cd26","year":2019},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.333615Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:ac2718d9d064b000c53f7cbaecb695810b65ea52d3688479e4879e20ef8562b4","observation_id":"7e6a2691-b949-4f91-88b8-8e3dc6d9b258","resolution":{"observed_at":"2026-08-07T10:31:57.752853Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:57.717153Z","title":"Uncoupled and convergent learning in two-player zero-sum markov games with bandit feedback","venue":null,"work_id":"c080da91-bc18-4ccf-9146-c5b5ac8a4ce4","year":2023},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.341211Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:d3ed37f7b309b5d737c90f602bde3212f1d952a0f1138d18a758ebf700c557d7","observation_id":"229a700a-a163-4159-ac57-7d2178639568","resolution":{"observed_at":"2026-08-07T10:31:57.726968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:57.683564Z","title":"Fast policy extragradient methods for competitive games with entropy regularization","venue":null,"work_id":"fd789a35-2144-477a-8098-6baa1c082a58","year":2021},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.348461Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:c4fde12a72e03b6ba639c0046bcad996e462e15e3f54c3ac781a2001c440cbc7","observation_id":"7e41603b-506e-47b2-a9d0-461fd910157e","resolution":{"observed_at":"2026-08-07T10:31:57.692137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:57.661221Z","title":"Faster last-iterate convergence of policy optimization in zero-sum Markov games","venue":null,"work_id":"e197ef81-64c2-4d89-9abd-6c045abdda4e","year":2023},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.358767Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:61118064b67fd3dd14665630e5848cc5dcf1f0265a70537c89636e30f21dbc57","observation_id":"fa4cadaa-cba8-4b4d-99c1-145d76b49919","resolution":{"observed_at":"2026-08-07T10:31:57.668404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:57.630780Z","title":"Vortices instead of equilibria in minmax optimization: Chaos and butterfly effects of online learning in zero-sum games","venue":null,"work_id":"af1d2c3a-6eae-4672-b046-09946d660c8e","year":2019},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.364957Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:279a5305688716ceb701ac043f2a3500a5c03cde1a76e93067cbd66422965b30","observation_id":"58561e92-7968-43f3-9376-5e5e3cd12e95","resolution":{"observed_at":"2026-08-07T10:31:57.641981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:57.607804Z","title":"Penalty-regulated dynamics and robust learning procedures in games","venue":null,"work_id":"d9ee55d3-c656-4eb9-b7c3-3e9d68a0ff43","year":2015},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.372430Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:118901216badfabded6ab4f4b7c30534f698195c462d6233899f0b5f0fcdb367","observation_id":"f4d12f58-c914-4820-a412-2ce3aade41a4","resolution":{"observed_at":"2026-08-07T10:31:57.614825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:57.580242Z","title":"Last-iterate convergence: Zero-sum games and constrained min-max optimization","venue":null,"work_id":"0a78ccb9-f637-4545-a4b7-230324b9f14a","year":2019},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.378360Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:d9cc32688d9c69d840daf1fc158b87f3cd77af6206b6c2925a47bb3b4490b759","observation_id":"4e944b21-c2ae-4892-b1ec-6c23f771eed6","resolution":{"observed_at":"2026-08-07T10:31:57.589620Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:57.551400Z","title":"Training GANs with optimism","venue":null,"work_id":"0a1f7677-a29d-48f0-bed3-b00b6d304645","year":2018},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.387418Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:692a57b555035a02325876af8a8d54cf1dbcb171b7dd20f3ebf1e4b42a40fd15","observation_id":"6ec2cd2f-f9f3-4ec7-811e-5d34892a7582","resolution":{"observed_at":"2026-08-07T10:31:57.559121Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2208.03085","last_updated":"2022-11-23T08:49:39Z","snapshot_observed_at":"2026-07-06T13:39:03.515752Z","submitted_at":"2022-08-05T10:42:26Z","title":"Optimistic Gradient Descent Ascent in Zero-Sum and General-Sum Bilinear Games","version":2},"cited_work":{"arxiv_id":"2208.03085","doi":null,"metadata_source":"pith","pith_arxiv_id":"2208.03085","snapshot_observed_at":"2026-08-07T10:31:55.798559Z","title":"Optimistic Gradient Descent Ascent in Zero-Sum and General-Sum Bilinear Games","venue":"math.OC","work_id":"15f3f350-c0d5-414c-9587-d9c929c79a25","year":2022},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.394359Z"},"links":{"cited_paper":"/paper/2208.03085","citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:6cdafb58eb0aa20d4338b3815b2727f8e5345f1e14e6544793dc553a7e33f385","observation_id":"674c6118-7ed3-4655-b6fb-d40c02b0d5bb","resolution":{"observed_at":"2026-08-07T10:31:55.810381Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:31:55.404632Z","title":"Finite-dimensional variational inequalities and complementarity problems","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.404632Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:13b30103d6b3d2a5a116c2efd60699173e4da94002babba3790be0156e2f0985","observation_id":"5b3f8831-bed6-4877-b1ce-6f81e4154478","resolution":{"observed_at":"2026-08-07T10:31:55.404632Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:31:57.494794Z","title":"A variational inequality perspective on generative adversarial networks","venue":null,"work_id":"c7202f74-c28f-4f66-9f93-612dc9ded311","year":2019},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.411656Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:c195784d101c04b218581fb238ad160276ca7829b01160756da63f85d36748b7","observation_id":"31a6c961-d972-43d7-ad8e-57292a9e70c1","resolution":{"observed_at":"2026-08-07T10:31:57.503710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:57.466031Z","title":"Last iterate is slower than averaged iterate in smooth convex-concave saddle point problems","venue":null,"work_id":"3bfd995e-4028-4d30-bb68-7fc80a78a1ac","year":2020},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.418443Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:0a76a28dd9bc275800b7ab476cfdfd3b4ad296f7bde49dede79e6b1e159c0d07","observation_id":"38834489-7a34-467a-86cf-f169c6e97dff","resolution":{"observed_at":"2026-08-07T10:31:57.472933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:57.432814Z","title":"Asymptotic convergence and performance of multi-agent q-learning dynamics","venue":null,"work_id":"77747e2a-5788-4da0-ab2b-87f71bbe3e87","year":2023},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.425605Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:1c6e257bc91d39483601eaaf4969a3a0355d19a58341d5215e9b609692e45964","observation_id":"55fdca66-45c4-43bc-a416-2cc69707f8d0","resolution":{"observed_at":"2026-08-07T10:31:57.441830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:57.412469Z","title":"Single timescale regularized stochastic approximation schemes for monotone nash games under uncertainty","venue":null,"work_id":"407cc8b1-87ae-4757-b826-d3acfa556b9d","year":2010},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.433637Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:1a359a24a05a722ec9cf2a3f316a83932ba50f3e1942b7d8f84335f227864dd5","observation_id":"527205b1-45c4-44c9-b61b-9ee3e54b9fc8","resolution":{"observed_at":"2026-08-07T10:31:57.418820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:57.389396Z","title":"Shanbhag","venue":null,"work_id":"0359f2b3-22df-48ba-bd00-8699c4aa5c8d","year":2013},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.442460Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:67f5c490f2c422b1e62fb00f28a58678779974853a5b72a2b58151e899f8e87f","observation_id":"5445cf2f-2728-427d-b05b-5f2a5bf1cdd0","resolution":{"observed_at":"2026-08-07T10:31:57.396128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.09453","last_updated":"2020-09-26T11:49:05Z","snapshot_observed_at":"2026-08-04T22:42:57.075441Z","submitted_at":"2019-08-26T03:31:35Z","title":"OpenSpiel: A Framework for Reinforcement Learning in Games","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.09453","snapshot_observed_at":"2026-08-07T10:31:55.452998Z","title":"Openspiel: A framework for reinforcement learning in games","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.452998Z"},"links":{"cited_paper":"/paper/1908.09453","citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:f49383b4285c5a8c529cf80c21935768b89322d6ccf6fa6c1b5ef1bd860051ce","observation_id":"851bbab0-8609-48b0-9a34-a96f48510395","resolution":{"observed_at":"2026-08-07T10:31:55.452998Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:31:57.150986Z","title":"Last-iterate convergence in extensive-form games","venue":null,"work_id":"f157651c-5027-4125-970a-2849045e3081","year":2021},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.463024Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:656f63abe222f3b50681fbb0238ad5d0b78317afb5d696430f43effa2fe5d3e1","observation_id":"b8c54ef7-5f82-4f28-9515-d83d1674e51e","resolution":{"observed_at":"2026-08-07T10:31:57.250284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:56.949218Z","title":"Fundamental benefit of alternating updates in minimax optimization","venue":null,"work_id":"41e0a5b8-e7f8-4473-adf3-b6d5757913e9","year":2024},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.468846Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:7284160dd7c2a0e332758767f9a0b2827602cb451bbcff67e2f0c888adb62a8d","observation_id":"3bc9f20f-700a-4726-a2b3-42476caf9ce7","resolution":{"observed_at":"2026-08-07T10:31:57.067552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:56.794807Z","title":"Last iterate convergence in no-regret learning: constrained min-max optimization for convex-concave landscapes","venue":null,"work_id":"d0003414-5248-4a1b-9e1e-aae7edff668f","year":2021},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.474604Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:8cf6376e1eb0fe66cd52bf1d8ae1ea5b62a4f8f36fc23d73421f5e74ddf5aac6","observation_id":"cc6f59c2-1fcc-403e-ad30-ad6cf0c08325","resolution":{"observed_at":"2026-08-07T10:31:56.877055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:56.647808Z","title":"Last iterate convergence in no-regret learning: constrained min-max optimization for convex-concave landscapes","venue":null,"work_id":"62201c93-7dab-4158-8657-a932346396f6","year":2021},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.480984Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:08491cc90bca6a0e1f30968ebb883b77c5085f7129e758209762b6f02f32fef7","observation_id":"08d95b5c-bed0-4aac-a1df-d0d7db52140d","resolution":{"observed_at":"2026-08-07T10:31:56.689829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:56.577718Z","title":"Individual q-learning in normal form games","venue":null,"work_id":"b745d4e7-5e5d-456c-982c-3891eb895a81","year":2005},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.487281Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:1da3f99d793818575d7479e0051e39c810a9e7ed3d3b4be4ebcc08775bff0e52","observation_id":"6221bcce-dbf7-49af-9a44-8c6ba99843e9","resolution":{"observed_at":"2026-08-07T10:31:56.591709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:56.538505Z","title":"Interaction matters: A note on non-asymptotic local convergence of generative adversarial networks","venue":null,"work_id":"34a64ec8-539a-4ad4-bf40-bcd91ea1a2fa","year":2019},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.492861Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:cc5a6acbdcf1a72fc219b3389b92aa6a6851514cfbd0e273ebf7ed4b1bc6680c","observation_id":"887f65b5-f547-41c2-bd77-214aebec5796","resolution":{"observed_at":"2026-08-07T10:31:56.551132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:56.500352Z","title":"The power of regularization in solving extensive-form games","venue":null,"work_id":"2617a028-56e4-48fc-bdba-02dabb7a9b9f","year":2023},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.497217Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:8eb8d8090757ac0dbda83b5661e7d5f4d35ed66b72b9cd7b338b27cd8097c5c9","observation_id":"d03536da-1658-476d-9cb0-5276977f5372","resolution":{"observed_at":"2026-08-07T10:31:56.514282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:31:55.504019Z","title":"Learning in games with continuous action sets and unknown payoff functions","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.504019Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:866538b984ff8fb45eeb454ef3d42e754951471252b1dd114c4293725a75b86a","observation_id":"8b423509-7d89-487d-bee7-6dc9d12b3052","resolution":{"observed_at":"2026-08-07T10:31:55.504019Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:31:56.451425Z","title":"Cycles in adversarial regularized learning","venue":null,"work_id":"980d0902-4086-40c6-b747-b209c4623a66","year":2018},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.509625Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:87e939773356adbcc8d7549f0d4f18520f71aa4b0217a931e1ae6d1f61908c34","observation_id":"9e19ee7e-16ae-4a9f-819e-03b8ed3640ce","resolution":{"observed_at":"2026-08-07T10:31:56.464172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:56.404663Z","title":"Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile","venue":null,"work_id":"8df13ff0-aeba-412c-b466-0b4583626ec7","year":2019},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.517039Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:4416fa41cf04183971661c4b926add8b6f39a2a49907d4b90ba7a78063034b6d","observation_id":"fd90de04-cc1a-41fb-b5f4-e21c7a593332","resolution":{"observed_at":"2026-08-07T10:31:56.421039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:56.379144Z","title":"A unified analysis of extra-gradient and optimistic gradient methods for saddle point problems: Proximal point approach","venue":null,"work_id":"a2d2052a-183e-49e9-bf48-1b899aa104f1","year":2020},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.525113Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:bcf9debfb060a863cee9a8ddd7ca0ed38866e3c8f985a3f03d74a73f5f051a26","observation_id":"42bdaf51-2835-47f4-b73f-0be155f9ddd0","resolution":{"observed_at":"2026-08-07T10:31:56.386150Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:56.343368Z","title":"Nash learning from human feedback","venue":null,"work_id":"47d59154-87ed-4914-babf-c9991e196f22","year":2024},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.531090Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:1022f66e25cace75b9846aedee378cba4e061137e5d8bfcbdb271d7d8dde2d24","observation_id":"1fa853f3-72d3-4ac1-a53b-8d0019c592fe","resolution":{"observed_at":"2026-08-07T10:31:56.358341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:56.316002Z","title":"Symmetric (optimistic) natural policy gradient for multi-agent learning with parameter convergence","venue":null,"work_id":"d49960b0-4067-4edf-b9a9-7f159dadd1f0","year":2023},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.540387Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:454c5443ee39d0a3291b96e43a1c9dea067e588997e853efe8fd5711185e6e05","observation_id":"44e77c58-1cc7-4b8b-ae6f-16bb12390bd3","resolution":{"observed_at":"2026-08-07T10:31:56.326950Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:56.288936Z","title":"From Poincar \\'e recurrence to convergence in imperfect information games: Finding equilibrium via regularization","venue":null,"work_id":"15ca2234-60fd-4544-9d47-9b14020e0acd","year":2021},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.545106Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:7013139089709f3a70474b5255b41efe07cfbe3ee4f31202c358d83ed1479b0a","observation_id":"a4622a34-92f6-4b58-be94-a2db279f98f1","resolution":{"observed_at":"2026-08-07T10:31:56.299101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:56.260402Z","title":"Connor, Neil Burch, Thomas Anthony, Stephen McAleer, Romuald Elie, Sarah H","venue":null,"work_id":"8939febe-b8b5-4a02-b142-000510c56f92","year":2022},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.550583Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:18ada47ca08652d4b114d03337c5f1e665b4579f8647e9f4ba34113ee4153970","observation_id":"6363a9c7-c280-45f2-95fe-af7df28099a7","resolution":{"observed_at":"2026-08-07T10:31:56.268573Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:56.227750Z","title":"Online learning with predictable sequences","venue":null,"work_id":"ed3defba-0b73-4cb5-b811-0639ceea59d0","year":2013},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.558353Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:c7a609064795c93595f3b240052848fed4674eee318e1ee627d6b6c4329aff05","observation_id":"0f81599e-6e95-410e-b70b-72b23419cd7c","resolution":{"observed_at":"2026-08-07T10:31:56.237276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:56.198408Z","title":"Optimization, learning, and games with predictable sequences","venue":null,"work_id":"edfb4224-d293-4ea2-896d-767aad606c5a","year":2013},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.565989Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:bd5a66ac5a82c803373b5ab87f93b9c0364f5a219308a1d9fa8f17eb35dcdcc3","observation_id":"739d5064-f0ae-4304-a0e0-c8b6bfa7c6eb","resolution":{"observed_at":"2026-08-07T10:31:56.206820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:31:55.573399Z","title":"Variational analysis, volume 317","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.573399Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:9dc72eb19a91bb75aa0ee12b2ab943cae83af5d5e97ff6074c20b851cce85670","observation_id":"2bcead3c-07e4-4caf-9391-00712f205e55","resolution":{"observed_at":"2026-08-07T10:31:55.573399Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:31:56.152463Z","title":"Online learning and online convex optimization","venue":null,"work_id":"7e721f68-3c0b-4da2-871a-b7e2478cd901","year":2011},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.580790Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:b27cbd20ea41aefd057cf2fbfce6994cd245c06028f5e14aace7a219af706bb4","observation_id":"8e17a0ff-89a3-4e13-979b-952553ca25eb","resolution":{"observed_at":"2026-08-07T10:31:56.160921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:56.120810Z","title":"A unified approach to reinforcement learning, quantal response equilibria, and two-player zero-sum games","venue":null,"work_id":"15eee495-5ed6-47fb-9755-4d31052a2565","year":2023},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.590402Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:82936a08c387921eb12f0d663eb10857e1a7d04dce322e887943c776d6d4d5cc","observation_id":"6cfca072-3ef6-408f-aea6-00a963ac752c","resolution":{"observed_at":"2026-08-07T10:31:56.132321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1407.5042","last_updated":"2014-07-18T15:41:28Z","snapshot_observed_at":"2026-07-06T03:49:27.130621Z","submitted_at":"2014-07-18T15:41:28Z","title":"Solving Large Imperfect Information Games Using CFR+","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1407.5042","snapshot_observed_at":"2026-08-07T10:31:55.596519Z","title":"Solving large imperfect information games using CFR+","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.596519Z"},"links":{"cited_paper":"/paper/1407.5042","citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:a4bfdbf2b22ecdf77edfefed9b17a6994dee430e51b455e0d5c3bdb1e42c20be","observation_id":"c1df6346-ef77-4fcb-937a-639bb5c2b14a","resolution":{"observed_at":"2026-08-07T10:31:55.596519Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:31:56.094885Z","title":"Learning Nash equilibria in monotone games","venue":null,"work_id":"d3204aef-2b7c-4f27-8bd8-580e1e3cc158","year":2019},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.604208Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:0dea1cc4cc588ae80d25ec62e83e1f918f41f1e3e13e662209f18c4c4dfa9c02","observation_id":"77d83346-2187-4c3e-b98a-8e40bcc47440","resolution":{"observed_at":"2026-08-07T10:31:56.103892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:56.051837Z","title":"An evolutionary dynamical analysis of multi-agent learning in iterated games","venue":null,"work_id":"e3dd3a85-ec0a-4626-9550-20e01fdd92a3","year":2006},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.614828Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:dbcbc02e86bb88f4c739dfe2b6f811ccf88558bdbe74baec27ee8c76faf86950","observation_id":"fc033ac1-43f5-4977-9252-d40d58aabf29","resolution":{"observed_at":"2026-08-07T10:31:56.061071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:31:55.620250Z","title":null,"venue":null,"work_id":null,"year":1928},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.620250Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:9e63451dcb7aeb18a64bc63d2df5dafcdcec7178c0763d0598c3a6db8153702f","observation_id":"7faa1f8f-080e-4c92-9dcd-077130bd3df7","resolution":{"observed_at":"2026-08-07T10:31:55.620250Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:31:55.626589Z","title":"Efficient computation of behavior strategies","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.626589Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:368a93e29bd5de1881917f1aa802702b5d7b8cf5c120b08e9384ca7a91afa349","observation_id":"d69cf9f1-d59e-46f0-a999-774d99c85ae4","resolution":{"observed_at":"2026-08-07T10:31:55.626589Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:31:55.972133Z","title":"Linear last-iterate convergence in constrained saddle-point optimization","venue":null,"work_id":"fcb14759-c17c-463e-9299-12a582ddb67b","year":2021},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.636246Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:5437e589370eb63460bbd44b0645393bbd25741f3a876e6b6d741ae79d13a21c","observation_id":"061db23e-45f6-4129-b479-789cefa79779","resolution":{"observed_at":"2026-08-07T10:31:55.980042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:55.940127Z","title":"On smoothing, regularization, and averaging in stochastic approximation methods for stochastic variational inequality problems","venue":null,"work_id":"a9e23826-b7ec-4c45-ae8c-182a0ac68971","year":2017},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.648330Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:9c593f8e126d6ffff48ba1c20ab310aec8df207b63989bf75a5b11c1dd140b66","observation_id":"b0083e7e-6248-4608-8031-56ef5db248a7","resolution":{"observed_at":"2026-08-07T10:31:55.949027Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:55.914159Z","title":"Near-optimal local convergence of alternating gradient descent-ascent for minimax optimization","venue":null,"work_id":"73e6a6d9-7f02-410b-ad67-0bcd6f0a9a10","year":2022},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.662586Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:df006ab06f9911ea7ac212d8ef02dea821f0ac7852429f06c8e368ac4455b636","observation_id":"9fe9fc4c-0f5f-4f88-bf90-48d804613c20","resolution":{"observed_at":"2026-08-07T10:31:55.921021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T10:31:55.884779Z","title":"Regret minimization in games with incomplete information","venue":null,"work_id":"79ccb2f4-e917-4df8-8d95-e5d5001832dd","year":2007},"citing_paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","version":4},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:55.668102Z"},"links":{"citing_paper":"/paper/2506.05747"},"observation_digest":"sha256:96d383ee66ab270a91317a40723f8219faa353cca973b222364edb08931ce10c","observation_id":"08bf693a-b292-4ab9-9759-ce62a5418de7","resolution":{"observed_at":"2026-08-07T10:31:55.890864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.05747","last_updated":"2026-06-04T04:57:09Z","latest_version":4,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T10:11:09.944807Z","submitted_at":"2025-06-06T05:18:28Z","title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization"},"reference_resolution":{"displayed":51,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":2,"verified_fuzzy":41},"total_outbound_references":51},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 51 of 51 outbound references and 0 inbound Pith citation observations for arXiv:2506.05747."}