{"as_of":"2026-08-14T15:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:318f70e2003ba5e60d7dc63acaf926e2a75b931b6b489df189ebed1d7f72c405","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T14:22:06.385512Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.09950/citation-record","integrity":"/paper/2607.09950/integrity","json":"/paper/2607.09950/citation-record.json","paper":"/paper/2607.09950"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T14:22:06.385512Z","title":"Arrow, Leonid Hurwicz, and Hirofumi Uzawa.Studies in Linear and Non-linear Programming","venue":null,"work_id":null,"year":1958},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:a58ebd15b398713fa5b52cf60ab0e26c182fca9dc9efb248462cb8e39cf7cdd0","observation_id":"63350702-4884-40a2-a96e-5ff66b400df2","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","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-07-14T14:22:06.385512Z","title":"Fast and furious learning in zero-sum games: Vanishing regret with non- vanishing step sizes.Advances in Neural Information Processing Systems, 32, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:1c0659cd3cfa54fd7fba61c48db9d09a5ce682f64d7d54373a49bf9ff2b7e30e","observation_id":"c1452d6a-9720-46a0-b82d-f1851d0b250a","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","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-07-14T14:22:06.385512Z","title":"O (1/T) time-average convergence in a generalization of network zero-sum games via alternating gradient descent.European Journal of Operational Research, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:00888009d136f07d530edd56ed1c43ad44ec5e4c492629b4b26ae76b37a978fb","observation_id":"0afd933c-85a3-4f83-b6b6-756a9a309994","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","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-07-14T14:22:06.385512Z","title":"On the uniqueness of nash equilibria in polymatrix games.Optimization Letters, pages 1–18, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:896696c409a20bd37f679d21c33f7b4d9deb5fc45c01bfa94b52ea89e6f1d1c6","observation_id":"0c7efe77-445c-4aa2-a269-3d979f3109ad","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","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-07-14T14:22:06.385512Z","title":"Bailey, Gauthier Gidel, and Georgios Piliouras","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:8548a7e6a7eaf8abca82d21876c147281318837f2c06ffc10c6718173701f982","observation_id":"5536d095-8c63-4ca2-838b-8aabd60192c3","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","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-07-14T14:22:06.385512Z","title":"Bailey and Georgios Piliouras","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:d76e7898a569c368be3e6d3078061125bde0ec1ca1f58d3bfd73b2b45d5945e6","observation_id":"91e26bd7-c9b3-45f3-a5dd-96f5039ba6f6","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","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-07-14T14:22:06.385512Z","title":"Bailey and Georgios Piliouras","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:62fb04033581afb26435a15c4b5a1d566a6c5d1b6fcf6629f27a6b8298c8f113","observation_id":"3354afb9-81e2-415e-8f6b-15f6878e672c","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","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-07-14T14:22:06.385512Z","title":null,"venue":null,"work_id":null,"year":1954},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:95f937879d9ab1db64886eebda82e3659279641ec197f99d5bd6653fe48a8424","observation_id":"4d0e148e-2cf3-4a5b-914c-a8ac363fe790","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","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-07-14T14:22:06.385512Z","title":"Cambridge university press, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:8b2a020147a85dd5c7154d2486b0b8f389406d2d76caf80ca250d75381384ff6","observation_id":"8735b19d-2a0c-440a-90c6-86369fcdd12e","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","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-07-14T14:22:06.385512Z","title":"Last-iterate convergence: Zero-sum games and constrained min-max opti- mization","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:270483803684920af5ac7a62ada703d97772a63ddd26909597955519f9d50d84","observation_id":"591433be-5607-428d-9821-e4f39bb96198","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","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-07-14T14:22:06.385512Z","title":"The limit points of (optimistic) gradient descent in min-max optimization.Advances in neural information processing systems, 31, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:6c69c8448e94a44670ba0c29b3fbc84688ad557f9b439fa982def3fc5ea12b4e","observation_id":"912fefd2-d1e1-4e33-a65c-0c6d5d9a2e55","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","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-07-14T14:22:06.385512Z","title":"Tabak, and Giulio Trigila","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:49c8d6b03382aefed59d35557bf0e676947c52c44677c8fd376089b12e0b3e5c","observation_id":"6efbcbf8-09b5-477c-a5f6-cd603ae2d2bb","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","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-07-14T14:22:06.385512Z","title":"MIT Press, 1991","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:d88073ecb45b82211b10d9aa10588da1e51c295767e6f6189ea3c5e498777836","observation_id":"22489178-ba74-40b4-9aca-c8af34d07380","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","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-07-14T14:22:06.385512Z","title":"JHU press, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:0ff7209b76b5ba275cb87792d8b1bf4dab4a5457d278ead0c33c12057ea1e1f7","observation_id":"5499a2ea-3f0d-41b6-96be-b4d8326fb7c4","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","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-07-14T14:22:06.385512Z","title":"MIT Press, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:50e3f567be1487bb737a2198cadba75ad77faa67eb42a62d968c3c96be78905e","observation_id":"1e1771cc-8844-43f8-958b-2e8b51a83d0a","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","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-07-14T14:22:06.385512Z","title":"Generative adversarial nets","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:fefbc33f36453c46078d6924c85f52805bb8c6b713bf3bc4c34b70ec1e8ee0e8","observation_id":"e86fecdd-6909-4b8d-9a22-1261fa265e4b","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","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-07-14T14:22:06.385512Z","title":"London Mathematical Society Lecture Note Series","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:70175888353b61a97cde75d52d0d7d3535365b9cfe9631be0f3282849d027e31","observation_id":"1876d7d6-4346-4800-ab59-06b9250c0bfd","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","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-07-14T14:22:06.385512Z","title":"Springer, 2 edition, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:1dee9ec75f1e146d644199bd4880899f19caf2c81b37253790f60e611e3d6acc","observation_id":"9e4ba263-0e1c-4d28-a90e-c3da481291a3","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","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-07-14T14:22:06.385512Z","title":"Wiley, 1965","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:ba9b19a4a0c0574e751da44a4c04890885aa11cc800e4139ef407b061d148bac","observation_id":"80771ae8-d208-4ecb-88fb-483e8e079dd5","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.11366","snapshot_observed_at":"2026-07-14T14:22:06.385512Z","title":"A parallelizable approach for characterizing ne in zero-sum games after a linear number of iterations of gradient descent.arXiv preprint arXiv:2507.11366, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"cited_paper":"/paper/2507.11366","citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:3063dcd459e65f824add39dea1c6d2cedc29966c759c48571b437296402d6602","observation_id":"336c6131-7247-498a-b84f-c6838339de97","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","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-07-14T14:22:06.385512Z","title":"Kuhn and Albert W","venue":null,"work_id":null,"year":1953},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:fe17dbebad44ecab98341a4ea8baf8f5d03d4f925f247ed58ae6ef258a2a64bd","observation_id":"50b4ff7a-4282-498a-ba7b-2bde3a613a44","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","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-07-14T14:22:06.385512Z","title":"Cycles in adversarial regularized learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:e60e58bdf0c7c8a701f5951a85478d76bcf23a13d4329d8924088ee6eb34cada","observation_id":"bbea15bc-3cb2-45b5-8dcb-ee7418d143b5","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","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-07-14T14:22:06.385512Z","title":"A unified analysis of extra-gradient and optimistic gradient methods for saddle point problems: Proximal point approach","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:0310b4e2536b7bc5dac145fd859f56e858709302f29e78151c845ef887f55845","observation_id":"3a053f45-5f9a-4dd2-a7b0-0fa43fce30ca","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","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-07-14T14:22:06.385512Z","title":"Convergence rate of O(1/k) for optimistic gradient and extragradient methods in smooth convex-concave saddle point problems.SIAM Journal on Optimization, 30(4):3230–3251, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:f345706c9c0189851340552c0437cc03aff014cc88293df781212448e385ab40","observation_id":"82004832-cba5-4fad-a60d-d792ecac6eed","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","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-07-14T14:22:06.385512Z","title":"On theO(1/T)convergence of alternating gradient descent-ascent in bilinear games.arXiv preprint arXiv:2510.03855, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:d9b5fef91c5ca17ae3eb189db0ab22c3303f586ccec82ad356f3188a5386b64f","observation_id":"22b13744-dc9c-4b3a-b0d1-5b1a5c4aeb43","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","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-07-14T14:22:06.385512Z","title":"Online learning meets optimization in the dual","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:1c2ac6c2f3b039b0d366ae1ef0c6151774f477f0fcf7ea78b5cb0ae6caf0de2e","observation_id":"d18e1b91-cd61-4445-8596-381a4d27964e","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","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-07-14T14:22:06.385512Z","title":"On the Theory of Games of Strategy","venue":null,"work_id":null,"year":1928},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:6fe08aaabad8f7b85e796588b3a99e7150014e23757c0ad8c11e0e386d8fa166","observation_id":"06bd0d69-baee-45ca-8057-1bab4c656394","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","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-07-14T14:22:06.385512Z","title":"Princeton University Press, 1944","venue":null,"work_id":null,"year":1944},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:63812f9b7ff4ee9d08dfb4598a7c9791faa544ccf21f57a7496b51479b3bcfcc","observation_id":"75d6b976-9833-4b34-af88-22d11b68c4ed","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":28,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":28},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 0 inbound Pith citation observations for arXiv:2607.09950."}