{"as_of":"2026-08-16T12:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6edd94631a38c1e523e4be73445695167b5e602d3471b97d53f242f5a5589961","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T16:41:53.158993Z","state":"measured"},{"denominator":52,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":52,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/2509.04426/citation-record","integrity":"/paper/2509.04426/integrity","json":"/paper/2509.04426/citation-record.json","paper":"/paper/2509.04426"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2205.06167","last_updated":"2022-05-31T04:37:34Z","snapshot_observed_at":"2026-08-13T15:45:03.621582Z","submitted_at":"2022-05-12T15:43:53Z","title":"Optimal Methods for Higher-Order Smooth Monotone Variational Inequalities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.06167","snapshot_observed_at":"2026-08-15T16:41:52.933704Z","title":"Optimal methods for higher- order smooth monotone variational inequalities","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:52.933704Z"},"links":{"cited_paper":"/paper/2205.06167","citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:4cb78e0a0eda0a18aacd508fb77751fab73ee2b795c59ef07f80fd9f9233bcd2","observation_id":"8185e5f9-3ba1-4068-acdb-59c4a76516a1","resolution":{"observed_at":"2026-08-15T16:41:52.933704Z","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-15T16:41:53.892682Z","title":"Stochastic bias-reduced gradi- ent methods","venue":null,"work_id":"6d6193f5-5f2f-4116-b4cd-c1055d529f9e","year":2021},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:52.938904Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:b60317208cb023257a90b19c918987ca6f7a463985c625bd9e8533bd19bf5acc","observation_id":"1cfec7b8-08fd-48a3-8b67-10d8f6ccbc6e","resolution":{"observed_at":"2026-08-15T16:41:53.897392Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.879680Z","title":"Bailey and Georgios Piliouras","venue":null,"work_id":"62a5abac-02b9-4951-9b89-17572c3d89ec","year":2018},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:52.943503Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:1c3f8240897095a651ceb9f3438324c797ead7662e01c58928151a806b9417e7","observation_id":"1b288868-11d2-4f41-8842-3e7f48c48671","resolution":{"observed_at":"2026-08-15T16:41:53.884076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.867359Z","title":"Low-rank approximation with matrix- vector products","venue":null,"work_id":"4fdb8cd4-89b2-42b2-95dc-12ccede45a86","year":2022},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:52.948450Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:f7e77b3579e4be80b7e142a67ed7a74d6689321d76e8b76b3cbe7992964e9669","observation_id":"d49617d7-e01e-4d2f-8db9-1d34b10d2b63","resolution":{"observed_at":"2026-08-15T16:41:53.871395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.854614Z","title":"The gradient complexity of linear regression","venue":null,"work_id":"99824e3b-98ae-4bde-b312-bf5c95779785","year":2020},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:52.952868Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:4657a54952a82e218065910af06199a3a007125817dc2509a804ce86010da089","observation_id":"e1c5bad0-8cb8-40d0-a170-cb5bc5528750","resolution":{"observed_at":"2026-08-15T16:41:53.858898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.841629Z","title":"Complexity of highly parallel non-smooth convex optimization","venue":null,"work_id":"d36e37e1-db03-42ec-a43b-e84b424f2546","year":2019},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:52.957168Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:1b80c82c0ff3a61b22a50e8cd45b01d9b43eb1f09e38bd65c138d86851228c2f","observation_id":"271ddd10-cef2-4dc0-87e7-0dbaf0f8e8b9","resolution":{"observed_at":"2026-08-15T16:41:53.846010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.828104Z","title":"Near-optimal method for highly smooth convex optimization","venue":null,"work_id":"3edbc99b-53c7-410f-8acb-16073da1e079","year":2019},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:52.961983Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:92ddf768705c533b88f65b0adfb95ebd355bfc498a8d8d2ea879a1b38b926720","observation_id":"88f12b61-4bed-4f29-be88-46042d934fdf","resolution":{"observed_at":"2026-08-15T16:41:53.832673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.13225","last_updated":"2022-03-24T17:31:43Z","snapshot_observed_at":"2026-08-15T04:15:53.907211Z","submitted_at":"2022-03-24T17:31:43Z","title":"Distributionally Robust Optimization via Ball Oracle Acceleration","version":1},"cited_work":{"arxiv_id":"2203.13225","doi":null,"metadata_source":"pith","pith_arxiv_id":"2203.13225","snapshot_observed_at":"2026-08-15T16:41:53.258163Z","title":"Distributionally Robust Optimization via Ball Oracle Acceleration","venue":"math.OC","work_id":"654c7d4c-64ba-4ff5-9938-5759feab4854","year":2022},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:52.966083Z"},"links":{"cited_paper":"/paper/2203.13225","citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:ebd1b0e19a48faaa22a417f1c34f1ab2e7b7c43f1fe7e7fd7fd6492beb111ebc","observation_id":"4fb91cd6-f053-44ae-8abd-433853120ee4","resolution":{"observed_at":"2026-08-15T16:41:53.262640Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.814801Z","title":"Convex until proven guilty: dimension- free acceleration of gradient descent on non-convex functions","venue":null,"work_id":"9dc9c053-7657-465c-9320-c82b216534fc","year":2017},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:52.970507Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:bef3fe5fb0948b0782235433faa4ebd3d26e61b78d1b7ececa1342acffe5eac0","observation_id":"cdfd7706-34da-4c2c-bb50-68089ab23ae2","resolution":{"observed_at":"2026-08-15T16:41:53.819312Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.800509Z","title":"Variance reduction for matrix games","venue":null,"work_id":"4944b25a-b679-448f-976c-52df7b080f29","year":2019},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:52.975099Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:0aa307ac8134f1b553ec836a2c9b7bffc07a56550293cb116ce9a94992150cb2","observation_id":"1498986f-d9ca-4600-ba25-5ab6eba43325","resolution":{"observed_at":"2026-08-15T16:41:53.805149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.787300Z","title":"Acceleration with a ball optimization oracle","venue":null,"work_id":"37cc3325-04ac-40fc-9f7b-d9d2d8384699","year":2020},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:52.979631Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:4cbb7fcb5914b0c636d827decdc4e3033ae897f61ea2ec1a316a7750374c519d","observation_id":"2b195ad0-c53e-4d64-9177-b5d227456c87","resolution":{"observed_at":"2026-08-15T16:41:53.791393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.773724Z","title":"Coordinate methods for matrix games","venue":null,"work_id":"afb6166e-427a-4bca-b376-92876f7c3bfd","year":2020},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:52.984655Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:762f638c7dae268d5faaa7e7f998137f3fe0842b2e5d61e83e847e04fd91000f","observation_id":"616ca0bf-6c71-4498-ada4-28baf51e8677","resolution":{"observed_at":"2026-08-15T16:41:53.778723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.759420Z","title":"Thinking inside the ball: Near-optimal minimization of the maximal loss","venue":null,"work_id":"7b2f551e-1b1d-458c-99f3-93d8c54df5b9","year":2021},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:52.989328Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:d9ad3100af2d6b3d6f97a14cbf7a223f35aadb8be0497972fd142eb4268c5c82","observation_id":"c09be62c-c4db-4758-ba04-1cc9f3d19849","resolution":{"observed_at":"2026-08-15T16:41:53.764351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.746351Z","title":"Optimal and adap- tive monteiro-svaiter acceleration","venue":null,"work_id":"64984335-63db-4cfe-bc60-711ff73013ba","year":2022},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:52.993628Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:81c0353aceb8088c6ff3b1d60860e090ffa388dd434e767536d89acc43969f7a","observation_id":"5cf855be-6c27-402c-9f7b-44ae6d21d016","resolution":{"observed_at":"2026-08-15T16:41:53.750540Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.733033Z","title":"Resqueing parallel and private stochastic convex optimization","venue":null,"work_id":"c45b9cb4-281d-42f5-b1c1-4e876fb0f17b","year":2023},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:52.998927Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:e5dc7a4b1dd850b944c946dd86aeba828ab65fb3b95106b6677db7c5cf7e7a72","observation_id":"387b12bc-fafa-4cab-8032-e8e6aaa6b20c","resolution":{"observed_at":"2026-08-15T16:41:53.737166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.719296Z","title":"A whole new ball game: A primal accelerated method for matrix games and minimizing the maximum of smooth functions","venue":null,"work_id":"49abaa38-8398-4ca1-9cff-968f7567bab7","year":2024},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.003448Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:2d956784fad55764e84453485c9052571b80b9d05530930714c2f1551f5dee77","observation_id":"debe3548-751e-481a-97e8-058ba90f7162","resolution":{"observed_at":"2026-08-15T16:41:53.724389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.706346Z","title":"Sublinear optimization for machine learning","venue":null,"work_id":"99879a33-fcff-457c-aa9a-d1922bd0e9eb","year":2012},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.007448Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:f110564703a124eab3017ff4d2aeae2a881dbd77aff6e516bfb96f13904b43e0","observation_id":"67ba49dc-a726-48e8-83f4-127cf96a18f2","resolution":{"observed_at":"2026-08-15T16:41:53.710415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.693151Z","title":"Relative lipschitzness in extragradient methods and a direct recipe for acceleration","venue":null,"work_id":"0e386d02-d56a-4e6d-ba33-f0f1ccb67807","year":2020},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.011190Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:1fc561e9daf2ea4be462e9c9c80699531d6a30b15cf3c7be20d829f43c901b16","observation_id":"0cbf91b3-a462-4ee8-ac3c-9c217f05d09f","resolution":{"observed_at":"2026-08-15T16:41:53.697515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.679675Z","title":"Near-optimal no-regret algorithms for zero-sum games","venue":null,"work_id":"7bb5b57b-46a1-494e-b24f-cb8f0966e387","year":2011},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.015144Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:8b221e6499ff635743b0c4ab45942dfa31de455d9097012cb84cb1a408f20d0d","observation_id":"c051648e-bd92-4e9e-89ad-09a9a39b53c6","resolution":{"observed_at":"2026-08-15T16:41:53.684199Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.666398Z","title":"Composite objective mirror descent","venue":null,"work_id":"5af97aee-d0c1-4e3c-8387-63489d74193c","year":2010},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.019787Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:25df2ed6ba277eb8ec043009384012fe043450cc3d81380d9e8e47e7b346205c","observation_id":"95d947ff-b67a-4d55-a507-e440033b089c","resolution":{"observed_at":"2026-08-15T16:41:53.670955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.653533Z","title":"Adaptive game playing using multiplicative weights","venue":null,"work_id":"8328f333-7e2a-4c6a-8852-45500d413e18","year":1999},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.023704Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:326a6069e7290147bd13846701b280cf5c4bd6aee0515035e8c758dfbffcaed2","observation_id":"1d58cd0f-73b7-4426-a619-9d1539e9e79d","resolution":{"observed_at":"2026-08-15T16:41:53.657896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.640245Z","title":"Generative adversarial nets","venue":null,"work_id":"3250f3f7-70bd-478a-a995-efea1c54e2ad","year":2014},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.027623Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:c18a6f03627523c96a7ff436a2b465b761826e7879f976b978a5c463013a2ff5","observation_id":"e09b317c-a577-4ca4-86dc-829a21ad1478","resolution":{"observed_at":"2026-08-15T16:41:53.644365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.626554Z","title":"A sublinear-time randomized approximation algorithm for matrix games","venue":null,"work_id":"54d49b49-74c9-49dd-8579-ea440b6d72bf","year":1995},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.031704Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:44a09b7426fa2253028cf6ce7d7a6eb004cfbaaf497247647c98068019e1d4cd","observation_id":"9699e90f-b920-4855-adab-9900f91bfe1e","resolution":{"observed_at":"2026-08-15T16:41:53.631212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.612928Z","title":"On lower complexity bounds for large-scale smooth convex optimization","venue":null,"work_id":"42fccda6-3f76-470d-a442-e1010258a938","year":2015},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.035884Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:df55895a4156e4b046886d8b14f6621d5e05ed637c710d85b836d33cc35f42a4","observation_id":"ab7a0fb6-ef03-4b1e-bbeb-edddab212a4d","resolution":{"observed_at":"2026-08-15T16:41:53.617438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.599420Z","title":"Towards characterizing the first-order query complexity of learning (approximate) nash equilibria in zero-sum matrix games","venue":null,"work_id":"33e34dc9-f0a8-4b02-9150-849cb245aab9","year":2024},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.040726Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:b2ae09dbd4bf22df5e6d16b049a18250e3aabe9d2596ee90669c2e4ee42a889f","observation_id":"47118b61-72e6-402a-8940-6584f4ec102d","resolution":{"observed_at":"2026-08-15T16:41:53.603909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.585594Z","title":"Mirror prox algorithm for multi-term composite minimization and semi-separable problems","venue":null,"work_id":"fc5f9f32-2eac-4291-9760-960430c602cd","year":2015},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.045277Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:99e2a64ad26b8bbef4f45e1598db7c5bece180f9dd8e9e2b98b1d9c1917394ab","observation_id":"624861d4-73bb-4290-bf94-5ad0c15a5735","resolution":{"observed_at":"2026-08-15T16:41:53.590036Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.571655Z","title":"Closing the computational-query depth gap in parallel stochastic convex optimization","venue":null,"work_id":"c970ee19-351e-4ada-b2ed-a32a58da9a5b","year":2024},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.049841Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:a0f9677b3aff014371077643e712db77dc9762d63998a3829e3b0be7f00af1f5","observation_id":"3a25ede7-eb2e-4eb2-94c8-66ceba0dbd48","resolution":{"observed_at":"2026-08-15T16:41:53.576158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.02526","last_updated":"2025-09-02T17:27:33Z","snapshot_observed_at":"2026-08-15T16:35:11.490132Z","submitted_at":"2025-09-02T17:27:33Z","title":"Reusing Samples in Variance Reduction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.02526","snapshot_observed_at":"2026-08-15T16:41:53.054736Z","title":"Reusing samples in variance reduction","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.054736Z"},"links":{"cited_paper":"/paper/2509.02526","citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:9eb3610e7b5a4c4ba0a604096225cc27b74ad860d4080f8eb764164ab6acfcf5","observation_id":"6cdca6a5-cad5-43e7-a776-0c2f64006cd6","resolution":{"observed_at":"2026-08-15T16:41:53.054736Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.00413","last_updated":"2018-06-01T15:58:54Z","snapshot_observed_at":"2026-08-14T19:08:29.177573Z","submitted_at":"2018-06-01T15:58:54Z","title":"Global linear convergence of Newton's method without strong-convexity or Lipschitz gradients","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.00413","snapshot_observed_at":"2026-08-15T16:41:53.059001Z","title":"Stich, and Martin Jaggi","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.059001Z"},"links":{"cited_paper":"/paper/1806.00413","citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:b8249748d46eb8e083adefc9c260f929ddcc1bf3d62cf29b2ce54d0869034613","observation_id":"f441c358-3f9a-4327-ae1a-63987d21374a","resolution":{"observed_at":"2026-08-15T16:41:53.059001Z","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-15T16:41:53.557221Z","title":"The oracle complexity of simplex-based matrix games: Linear separability and nash equilibria","venue":null,"work_id":"08e2bb0d-5ae7-4e43-a7af-77341b22d8de","year":2025},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.063326Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:cf96bb855f0358334dfafa16f804786cea1edf1a232b9438c87801522a108be2","observation_id":"4fe60f72-74da-4179-9c0a-abea1d30002a","resolution":{"observed_at":"2026-08-15T16:41:53.562067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.543206Z","title":null,"venue":null,"work_id":"0a0e2d4d-94b9-4138-9ae9-4f98e33de191","year":2025},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.067825Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:4662843ee4a8eb8a25d1b4c8e60e76677d1681a35490d4e2071b3f70ac13b594","observation_id":"80bb1762-a2f9-4e4f-9047-24e4bf7acbbe","resolution":{"observed_at":"2026-08-15T16:41:53.547463Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.528821Z","title":"The weighted majority algorithm","venue":null,"work_id":"5e61cf5d-fcd1-4517-acb0-8b0349e41526","year":1994},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.072520Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:5330e880a0023404e93113ab22038157edfeb10f1013adb6b9af559f58073d56","observation_id":"a4782438-104c-4e6a-b0b5-b53af2ce611c","resolution":{"observed_at":"2026-08-15T16:41:53.533355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.03218","last_updated":"2023-12-06T01:16:10Z","snapshot_observed_at":"2026-08-13T19:50:16.617210Z","submitted_at":"2023-12-06T01:16:10Z","title":"Accelerated Gradient Algorithms with Adaptive Subspace Search for Instance-Faster Optimization","version":1},"cited_work":{"arxiv_id":"2312.03218","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.03218","snapshot_observed_at":"2026-08-15T16:41:53.209456Z","title":"Accelerated Gradient Algorithms with Adaptive Subspace Search for Instance-Faster Optimization","venue":"cs.LG","work_id":"419fae3a-9115-4e71-ace5-50c333d23122","year":2023},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.077046Z"},"links":{"cited_paper":"/paper/2312.03218","citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:158e0fe6d117a5e245280fda085cf830e677994a2bbb379bdf0539640a4a2cb5","observation_id":"60b089f6-30ec-4297-a927-19dc892648d4","resolution":{"observed_at":"2026-08-15T16:41:53.215810Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.513801Z","title":"Towards deep learning models resistant to adversarial attacks","venue":null,"work_id":"7ae059a4-9b78-4b11-9500-85ae69906468","year":2017},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.081949Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:a92df4252f6a7136f0e945248aab42e45112f62da2d2998975f04b7c9f62ea7d","observation_id":"f523ef2f-60f3-4c0f-8b13-e11a8d24050d","resolution":{"observed_at":"2026-08-15T16:41:53.518673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.499934Z","title":"A study of local approximations in information theory","venue":null,"work_id":"cc784e6f-6b59-4a5c-901f-a8e0c99ac291","year":2015},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.086640Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:6e4d3f652be6a9c252b01c5a74a778ae2e984bd2202df5f7c43d29d885c6d88d","observation_id":"5e8b9c8b-18eb-4829-a8c1-bef43a3af37b","resolution":{"observed_at":"2026-08-15T16:41:53.504216Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.486117Z","title":"A logical calculus of the ideas immanent in nervous activity","venue":null,"work_id":"0264ef27-c82c-4234-93f9-124dcbcf0e46","year":1943},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.091820Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:6e3bab8c835d70d40ca40f7068d0c8aa085fd1658e805784e8036bf76dcfca97","observation_id":"d4f301de-9c0b-4c1b-9cb4-cc8f8cb6c25d","resolution":{"observed_at":"2026-08-15T16:41:53.490839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.472635Z","title":null,"venue":null,"work_id":"763933a8-ab56-46c8-bef6-1729601fb19b","year":2013},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.096123Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:1f019dba4880fe6686dcd286f591229eaa3e3dfa411bc4293c463be49f083feb","observation_id":"b7a84680-8a0e-40d0-ab7d-bd3d40e3bc10","resolution":{"observed_at":"2026-08-15T16:41:53.476833Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.458844Z","title":"Randomized block krylov methods for stronger and faster approximate singular value decomposition","venue":null,"work_id":"6dcda26e-365a-42fc-bf31-c7738504630d","year":2015},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.100464Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:93576ca5b458f589292e2de0c872951cc85b9b49195a1a3f1336ef04e823ecd9","observation_id":"5c3dcf46-88e2-4719-b8cc-0ee2a4fb05a3","resolution":{"observed_at":"2026-08-15T16:41:53.463282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.104932Z","title":"Prox-method with rate of convergence o(1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.104932Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:978fcd21ee478865b9491d73dc617026f18024cc2bbe20848bd89977adfc22e2","observation_id":"cf77161f-2798-4628-b477-5f402ad93f54","resolution":{"observed_at":"2026-08-15T16:41:53.104932Z","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-15T16:41:53.436598Z","title":"Problem complexity and method efficiency in optimization","venue":null,"work_id":"01983dcc-14c6-4106-9e8b-c5f2d451dbdc","year":1983},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.109434Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:04fa7cd52ccf1f57aef6009da5a62b786aed035a0446b41b01e244d646279df1","observation_id":"2cf37bb4-7ed4-48a2-8593-80bf9d8c061f","resolution":{"observed_at":"2026-08-15T16:41:53.440891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.422683Z","title":"Smooth minimization of non-smooth functions","venue":null,"work_id":"74f496dc-9173-4be0-8c3f-38a248352524","year":2005},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.114270Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:5a8cdd2989e2bdb98841852e9eb1e1620aeea1a1d7b7b684de316ae441ea0126","observation_id":"932acd40-eafb-48fa-a5f1-f9bc850cd78f","resolution":{"observed_at":"2026-08-15T16:41:53.427469Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.408154Z","title":"Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems","venue":null,"work_id":"4b8adf76-2c06-4050-9fd2-fb9034166dc5","year":2021},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.118502Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:8e741f9586f326f5711dda99eeebe484a92aa7dadeab20ebf0e8e0afde023254","observation_id":"229ef9a0-bd45-49a1-9def-fa7a3e590124","resolution":{"observed_at":"2026-08-15T16:41:53.412819Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.394590Z","title":"Stochastic variance reduction methods for saddle-point problems","venue":null,"work_id":"9d3a1968-4354-4d8c-b90f-e2a64a84060a","year":2016},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.122651Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:022cd8341c361762b8694cb5db1854ab4be403a104f7ef5f71443dd4f164d17b","observation_id":"fea293be-59f8-479d-9645-96571c6366fb","resolution":{"observed_at":"2026-08-15T16:41:53.399163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.127523Z","title":"Optimization, learning, and games with predictable sequences","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.127523Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:e0ca20c1eaa10d3ae9878f1c34da9408e4525fe1c850586307643a8a53fb1641","observation_id":"36df7897-f0da-4dd0-bf8f-4c1afc867b1c","resolution":{"observed_at":"2026-08-15T16:41:53.127523Z","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-15T16:41:53.371850Z","title":"Estimation of high-dimensional low-rank matrices","venue":null,"work_id":"68391f0b-8447-49f4-8b04-a5b0599043ab","year":2011},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.131197Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:f21a9d13d02502bd7b06feb09ca0670632244cf71fe26f8c6c02b5f396b5a2f7","observation_id":"218c16bf-dc8f-4267-969b-5e8e44bf122d","resolution":{"observed_at":"2026-08-15T16:41:53.376419Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.357246Z","title":"The perceptron: a probabilistic model for information storage and organization in the brain","venue":null,"work_id":"0d946f46-0ff7-4d4b-b3a5-8996051043c3","year":1958},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.134921Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:27b0bb1cef9aecb0a0bdee8593e92f78108c3c5b3972fff434e45f35ffcd0d79","observation_id":"d934c9a9-35b7-4c86-88d1-7c2189410999","resolution":{"observed_at":"2026-08-15T16:41:53.362309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.342158Z","title":"Online learning and online convex optimization","venue":null,"work_id":"b20bd380-b421-4c26-b6dd-36a2f355c050","year":2012},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.138672Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:7cac54a77d2fc05a00c1dc973fc6ec9ed42d5173f7fb95182d8c5cae1be78d15","observation_id":"d1354fa1-59dd-4cdc-948e-b822f8ec5b7e","resolution":{"observed_at":"2026-08-15T16:41:53.346938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.328497Z","title":"A smooth perceptron algorithm","venue":null,"work_id":"26d9fd7d-bba4-4932-b226-1c82d780c871","year":2012},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.142641Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:7c521ddcc0efcb2ef291a7d2674792f3430fefc92f2c12cbce2fb7f21ba445e1","observation_id":"0aa84e6d-cbd2-46d4-a6a2-668523adefe7","resolution":{"observed_at":"2026-08-15T16:41:53.332715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0903.2816","last_updated":"2009-03-16T18:04:31Z","snapshot_observed_at":"2026-08-15T05:52:49.093375Z","submitted_at":"2009-03-16T18:04:31Z","title":"A Note on Preconditioning by Low-Stretch Spanning Trees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0903.2816","snapshot_observed_at":"2026-08-15T16:41:53.146581Z","title":"A note on preconditioning by low-stretch spanning trees","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.146581Z"},"links":{"cited_paper":"/paper/0903.2816","citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:4ca03ca7f36838b36589d3ccbae70a647d63c7d11dc6bd848a1286d3baa6603e","observation_id":"f13e8017-5529-47fd-b5cc-83f540933ec7","resolution":{"observed_at":"2026-08-15T16:41:53.146581Z","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-15T16:41:53.314673Z","title":"Tight complexity bounds for optimizing composite objectives","venue":null,"work_id":"4882bf64-99f5-4802-86ed-1e3dd804a607","year":2016},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.150941Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:2a8a34eaa5f104cb38b761e56ba06ab1bedd10f09d6da15fde4f6a719874ae9a","observation_id":"0d8b8209-c1e6-4fc3-b3c7-8801f8fbf73c","resolution":{"observed_at":"2026-08-15T16:41:53.318975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.300055Z","title":"Saddle points and accelerated perceptron algorithms","venue":null,"work_id":"28ed3676-116b-46e5-8ed7-163c385a419a","year":2014},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.154761Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:942e39874b4c2fb32ed231382bced00e82fd77a3e275901df6993adcae597c4a","observation_id":"40950fd6-c7c7-464d-8e7e-ea524aba9535","resolution":{"observed_at":"2026-08-15T16:41:53.304398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:41:53.286560Z","title":"On lower iteration complexity bounds for the convex concave saddle point problems","venue":null,"work_id":"a6123e81-80e6-466a-aeb8-fab3e772e539","year":2022},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.158993Z"},"links":{"citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:a30b7da198befa5fc8d3901139d3b2b63f2fd5d2475bda9e9bae30884306a2fe","observation_id":"69f6784b-c54d-48a4-b1bc-27a30501ab04","resolution":{"observed_at":"2026-08-15T16:41:53.290935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":2,"verified_fuzzy":42},"total_outbound_references":52},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 0 inbound Pith citation observations for arXiv:2509.04426."}