{"as_of":"2026-08-13T16:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:678075221a7eb9f9d95963e459332e230aa6ac3d9d4b5635ae47fecaf25fb56c","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T15:18:42.202551Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T21:45:08.642109Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-22T08:11:17.426305Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.14601","snapshot_observed_at":"2026-08-06T21:45:08.642109Z","title":"and Borodich, E","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23803","last_updated":"2025-06-30T12:47:10Z","snapshot_observed_at":"2026-08-09T12:25:14.601906Z","submitted_at":"2025-06-30T12:47:10Z","title":"SGD with Adaptive Preconditioning: Unified Analysis and Momentum Acceleration","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T21:45:08.642109Z"},"links":{"cited_paper":"/paper/2411.14601","citing_paper":"/paper/2506.23803"},"observation_digest":"sha256:bde90ecdf95a14c12cd030b43127453e1cbe26bd67d7d9b1edf97848943e697f","observation_id":"df26c042-c11b-4139-9f0b-22c00883a741","resolution":{"observed_at":"2026-08-06T21:45:08.642109Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.14601","snapshot_observed_at":"2026-08-06T17:59:06.823782Z","title":"and Borodich, E","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-13T15:18:47.568049Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:06.823782Z"},"links":{"cited_paper":"/paper/2411.14601","citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:288557b9e568cc1d4e26d9f359ad0d6a219962f093646353e2604e2d3194fabf","observation_id":"f9b028b8-6163-4c25-959f-4464acada25d","resolution":{"observed_at":"2026-08-06T17:59:06.823782Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"cited_work":{"arxiv_id":"2411.14601","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.14601","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2411.14601 , year=","venue":null,"work_id":"efb8a32a-d61e-43e6-9ef2-e554dc648236","year":null},"citing_paper":{"arxiv_id":"2604.02505","last_updated":"2026-04-02T21:02:10Z","snapshot_observed_at":"2026-08-12T12:27:48.772037Z","submitted_at":"2026-04-02T21:02:10Z","title":"Optimal Projection-Free Adaptive SGD for Matrix Optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-13T20:56:41.466669Z"},"links":{"cited_paper":"/paper/2411.14601","citing_paper":"/paper/2604.02505"},"observation_digest":"sha256:950db4b62dd5f2fcb4c51997332786cfffce804b2bcc01ffaa94d1bcbf97fae8","observation_id":"0814005e-fb88-4157-91e9-099ce8e13f07","resolution":{"observed_at":"2026-05-13T20:58:15.721734Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"cited_work":{"arxiv_id":"2411.14601","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.14601","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2411.14601 , year=","venue":null,"work_id":"efb8a32a-d61e-43e6-9ef2-e554dc648236","year":null},"citing_paper":{"arxiv_id":"2605.22644","last_updated":"2026-05-21T15:50:40Z","snapshot_observed_at":"2026-08-12T12:23:14.587330Z","submitted_at":"2026-05-21T15:50:40Z","title":"Why SGD is not Brownian Motion: A New Perspective on Stochastic Dynamics","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-05-22T08:06:52.309619Z"},"links":{"cited_paper":"/paper/2411.14601","citing_paper":"/paper/2605.22644"},"observation_digest":"sha256:e2ba616efcc024d65f0de8938f785728b49b63d972d6157a853bfc8875aa7e0b","observation_id":"91d46fac-d12a-4b11-8e0a-c27661982f86","resolution":{"observed_at":"2026-05-22T08:11:17.429036Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2411.14601/citation-record","integrity":"/paper/2411.14601/integrity","json":"/paper/2411.14601/citation-record.json","paper":"/paper/2411.14601"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:18:43.083056Z","title":null,"venue":null,"work_id":"49f103e4-d3ca-4c2d-ae1f-93d217f56a93","year":2020},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:41.947715Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:39585c3a645adb866e0751c9609af4ab1b34d8a14b71bfde6cf31f2f3c39b374","observation_id":"5354a37f-edf4-4f50-ae45-dc9cce8d5687","resolution":{"observed_at":"2026-08-12T15:18:43.088637Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:43.065724Z","title":null,"venue":null,"work_id":"1a74eca8-78b4-4a89-96b6-d29442d8ae22","year":2000},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:41.953908Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:0a354dfd7ef9489f78a85823b7be03d3b4d8d3c1c98d483a63089a9a96684e29","observation_id":"4677278c-2e35-4de2-8b01-20212e972a30","resolution":{"observed_at":"2026-08-12T15:18:43.071116Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:43.043329Z","title":null,"venue":null,"work_id":"8a7c3a9c-6e7f-48e3-bbfd-b9f84fc33b0d","year":2020},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:41.959767Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:b246840af474450e2dabb571dafd14e91e73ad4fd1b6c00fcef9e3b0acdc2d2a","observation_id":"44f9685c-ec9a-405a-bfd4-a6b7867a9cad","resolution":{"observed_at":"2026-08-12T15:18:43.050517Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:41.966709Z","title":"and Nemirovski, A","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:41.966709Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:63b3102826a0dbe64a7482aa035a67ccd6cb5ed6ac3c557af4b0821a44c79e49","observation_id":"80d65694-8963-4fc7-9c4f-38b8dff78b7d","resolution":{"observed_at":"2026-08-12T15:18:41.966709Z","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-12T15:18:43.004646Z","title":null,"venue":null,"work_id":"f2302793-4126-4557-a517-2dacfa44694a","year":2013},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:41.972007Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:c33a7db63cea2049a2c3b916df665ef52c2a444ea9daedd0b10924744abff9cd","observation_id":"68c61787-eaae-4460-9979-13367c3dd7d6","resolution":{"observed_at":"2026-08-12T15:18:43.011011Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.12946","last_updated":"2023-07-24T17:18:35Z","snapshot_observed_at":"2026-08-13T10:48:56.314751Z","submitted_at":"2023-07-24T17:18:35Z","title":"Optimal Algorithm with Complexity Separation for Strongly Convex-Strongly Concave Composite Saddle Point Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.12946","snapshot_observed_at":"2026-08-12T15:18:41.976929Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:41.976929Z"},"links":{"cited_paper":"/paper/2307.12946","citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:4d181045b23cb7a7011b128c978e2da7eb9d6a19ac55e084cc9f5ad66dbe0b6e","observation_id":"d550c0f4-fc73-46c9-a848-fc68188fbe90","resolution":{"observed_at":"2026-08-12T15:18:41.976929Z","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-12T15:18:42.983563Z","title":"and Pock, T","venue":null,"work_id":"08035af3-b295-44c6-83f5-eef3be50cd35","year":2011},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:41.982632Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:ec0a37f79f15d69d2df08241cbaff0aab009b4589f5423db5fb351558f794339","observation_id":"e0680300-1afb-4eb8-9448-03f183703b99","resolution":{"observed_at":"2026-08-12T15:18:42.990031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:42.964754Z","title":"S., Chen, J., Li, L., Xiao, L., and Zhou, D","venue":null,"work_id":"2cabc759-af70-4ac7-9625-85f787953995","year":2017},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:41.987644Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:49a1c1473b9c91a6c5091869af3df4f46d5b8ecd1fd6559c961b71d7ea6ab07c","observation_id":"ec67e170-37e0-4195-b4e9-007fc1e3e09e","resolution":{"observed_at":"2026-08-12T15:18:42.970854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.08573","last_updated":"2022-08-12T00:33:57Z","snapshot_observed_at":"2026-08-13T15:22:16.541748Z","submitted_at":"2022-06-17T06:10:20Z","title":"Optimal Extragradient-Based Bilinearly-Coupled Saddle-Point Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.08573","snapshot_observed_at":"2026-08-12T15:18:41.993453Z","title":"S., Gidel, G., Jordan, M","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:41.993453Z"},"links":{"cited_paper":"/paper/2206.08573","citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:c0733daad58b91c6aaea594c6a4b02c081efa3d423697001a24746cd68517d21","observation_id":"30b37d9b-1b77-4d35-a2ae-4753afefda26","resolution":{"observed_at":"2026-08-12T15:18:41.993453Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1802.10551","last_updated":"2020-08-28T20:51:28Z","snapshot_observed_at":"2026-08-11T01:38:37.022636Z","submitted_at":"2018-02-28T17:40:05Z","title":"A Variational Inequality Perspective on Generative Adversarial Networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.10551","snapshot_observed_at":"2026-08-12T15:18:41.999593Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:41.999593Z"},"links":{"cited_paper":"/paper/1802.10551","citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:b3d294696dffed07ecc34abcf435f136e73f36a5bcdcd4d5fae29e2cc865c14e","observation_id":"724938ce-02e9-4b7b-a23e-c6bf202ca89b","resolution":{"observed_at":"2026-08-12T15:18:41.999593Z","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-12T15:18:42.944825Z","title":null,"venue":null,"work_id":"7ff28ed0-fd21-461d-b409-49c01c013915","year":2020},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.005945Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:63aeddff4b16e3ac5b1af62449029e9c7ecd48de295a74c7ecd7ae14e8e3b3b5","observation_id":"ce29489f-2e7d-4bea-8b49-1108ab95d0fb","resolution":{"observed_at":"2026-08-12T15:18:42.950576Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:42.925146Z","title":null,"venue":null,"work_id":"449c20f3-1c81-4fce-9f43-6342b84710ff","year":2022},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.012616Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:3dcea93c54d3d0cc0c5aa3ad70bf0427429ced2cb979cbdf5ceb1a9de6c74d80","observation_id":"dc3759d7-a334-4721-8a71-320154b7e9aa","resolution":{"observed_at":"2026-08-12T15:18:42.931043Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:42.904250Z","title":null,"venue":null,"work_id":"211e58bf-e6a8-4307-bb09-718cfd12b474","year":2016},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.018991Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:b85297ec451d189235911709fa3c6777371647a6cbd35a049d47efaed60e77e5","observation_id":"e5da1579-6db4-4a15-9f9c-0928afcc3f0c","resolution":{"observed_at":"2026-08-12T15:18:42.910288Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:42.883637Z","title":"and Stampacchia, G","venue":null,"work_id":"69be2fc9-c8f1-40ab-bad3-f0013f0f2ad1","year":2000},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.025124Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:38caaeb77b54b630205550f19d21288e0d52ba9fc15bf638ddfe1c6b5c6a4241","observation_id":"ea82f1f4-3e11-4ab7-8510-3a321dd49c83","resolution":{"observed_at":"2026-08-12T15:18:42.889390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:42.032133Z","title":null,"venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.032133Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:75e09c894e415a4ff73e1fd77eb8f3092e0e828c3400dcd8d30b28ac0476294c","observation_id":"4f7feebd-0215-43f9-aa3f-e5bfc09941c1","resolution":{"observed_at":"2026-08-12T15:18:42.032133Z","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-12T15:18:42.853998Z","title":null,"venue":null,"work_id":"b3d9012e-f630-412b-90de-7e49a380fcd3","year":2022},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.039221Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:fda6893b8b21ae1570be8e29c212200a9f05aa4730ad3f1e0f9e2f7195348c3e","observation_id":"704b6ca6-5422-402b-aa7c-c50735046b64","resolution":{"observed_at":"2026-08-12T15:18:42.859284Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.18031","last_updated":"2024-05-28T10:28:45Z","snapshot_observed_at":"2026-08-12T23:56:18.667809Z","submitted_at":"2024-05-28T10:28:45Z","title":"Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks","version":1},"cited_work":{"arxiv_id":"2405.18031","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.18031","snapshot_observed_at":"2026-08-12T15:18:42.327613Z","title":"Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks","venue":"math.OC","work_id":"d47dce6a-8785-4aea-b41f-3cb7207fd8a8","year":2024},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.044766Z"},"links":{"cited_paper":"/paper/2405.18031","citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:5b7a46dd53b987ed0fe385c2a27798b8973094c58588cd9588cb573cfa7f0e2a","observation_id":"e2d3ceb9-a95c-4a75-9779-cf886c6b8f67","resolution":{"observed_at":"2026-08-12T15:18:42.336360Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:42.838773Z","title":null,"venue":null,"work_id":"bc6f23e6-74c4-461c-8afe-ee7bb25f55c8","year":2021},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.051072Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:15db27dc33033b5f897c32c088bbc2895cfc06c6311d850e8330c544e37e9f12","observation_id":"824decfa-ffca-46e0-b51e-8fcfe193596f","resolution":{"observed_at":"2026-08-12T15:18:42.843610Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:42.819903Z","title":null,"venue":null,"work_id":"9f0dd8a6-0f31-417d-aec1-c5aa28a5525f","year":2022},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.057615Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:da8c071f7e0715dc8b7dc9ec2bc3cffcd0cd2e25e12bb42fa5a6898959f6ce46","observation_id":"ce1e95c7-ea95-4da4-b1aa-c074bd75d6ba","resolution":{"observed_at":"2026-08-12T15:18:42.825655Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:42.800141Z","title":null,"venue":null,"work_id":"7c86bf36-b2b1-475e-86ce-14a5e0c971e4","year":2020},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.062893Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:1a2c8978ad13c781281924e493f1ad2bcaee4edb54b6cb36bb30c4e4b258ab07","observation_id":"0ba6d639-86cd-4075-89dd-f5e7da5deb69","resolution":{"observed_at":"2026-08-12T15:18:42.806618Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:42.783578Z","title":null,"venue":null,"work_id":"8763bcba-5151-4b0b-8042-506677afff8c","year":2020},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.068792Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:b088155d42ee73c2057dcc5859af189a71ecbd0fba08b58cbfd7619c2625d400","observation_id":"696fbea1-236b-4202-a022-73f56d8fe830","resolution":{"observed_at":"2026-08-12T15:18:42.788643Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.04905","last_updated":"2016-09-16T03:48:45Z","snapshot_observed_at":"2026-08-01T18:11:55.381296Z","submitted_at":"2016-09-16T03:48:45Z","title":"Accelerated gradient sliding for structured convex optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.04905","snapshot_observed_at":"2026-08-12T15:18:42.074262Z","title":"and Ouyang, Y","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.074262Z"},"links":{"cited_paper":"/paper/1609.04905","citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:fce8e7068a5148882e12424fc858133c52c106f81601dce904eb9b51d6345749","observation_id":"e73b3f4c-54cf-4995-af08-a03050d5513b","resolution":{"observed_at":"2026-08-12T15:18:42.074262Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.00996","last_updated":"2021-11-01T14:59:08Z","snapshot_observed_at":"2026-07-06T12:04:13.318841Z","submitted_at":"2021-11-01T14:59:08Z","title":"Mirror-prox sliding methods for solving a class of monotone variational inequalities","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.00996","snapshot_observed_at":"2026-08-12T15:18:42.079966Z","title":"and Ouyang, Y","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.079966Z"},"links":{"cited_paper":"/paper/2111.00996","citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:0dee06d731d41174c87d3c8b335a0b49f80555e2c516da8200ebeb0620f77ea3","observation_id":"f23fbb1a-789b-4329-a000-df018e200f39","resolution":{"observed_at":"2026-08-12T15:18:42.079966Z","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-12T15:18:42.763518Z","title":"J., Yu, Y., Loizou, N., Gidel, G., Ma, Y., Le Roux, N., and Jordan, M","venue":null,"work_id":"4108fd24-7c30-41d6-9a74-1401470e4dbe","year":2022},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.086623Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:d31f5f631c31e8e243cb7b0d3deab88b87aa204065c529a257b8389f55d5b7be","observation_id":"207970a8-db40-45af-a079-24127ff00bd9","resolution":{"observed_at":"2026-08-12T15:18:42.769968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:42.740352Z","title":"J., Yuan, H., Gidel, G., Gu, Q., and Jordan, M","venue":null,"work_id":"c717e2e2-4acf-418a-b88f-ac54b2ffa106","year":2023},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.092009Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:f2ea5b05980c3f1ad689bb722fa003738ff261c2e6bc830f41348c4e28fa9aa7","observation_id":"f72fb383-92a3-4f5d-9c16-cfaf360da15d","resolution":{"observed_at":"2026-08-12T15:18:42.749802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:42.722503Z","title":null,"venue":null,"work_id":"f789cd1d-deb2-4613-ad9a-19c2a2e103e9","year":2017},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.097535Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:6ff9b48b2b715195a49782ba84b51ec6d92558fc5534d8322c2287b5f6c3d70f","observation_id":"0b1234cf-16fb-4878-ae85-166ae839452b","resolution":{"observed_at":"2026-08-12T15:18:42.727664Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:42.704561Z","title":null,"venue":null,"work_id":"a321e214-fade-4b3b-b8c0-27f1ba399f2e","year":2017},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.102252Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:361fb1fd214985ce2f4c592b510eab24fd0cc2d7a437104974e8d6603106cee1","observation_id":"86f2414a-1d6e-4cdd-bd64-b85361fef646","resolution":{"observed_at":"2026-08-12T15:18:42.710455Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:42.685871Z","title":"and Kolter, J","venue":null,"work_id":"2fc0450f-7c3b-48ae-8663-2a54ed0af02a","year":2017},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.108466Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:ffe798d55c3d3f43f8432d1872865a0de290d74cf448455eeed35790d362636f","observation_id":"617f9eea-5742-489d-a37f-8a13ee9588e7","resolution":{"observed_at":"2026-08-12T15:18:42.691311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:42.664311Z","title":null,"venue":null,"work_id":"c5aba996-4815-47ea-9f9b-e5988941f9e9","year":2007},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.113568Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:234b7dce7675188270d4053ce2d5a10135bb41269a2f7e329f97d4ca0ace5045","observation_id":"a9dc79c2-bc40-43ed-b738-a6ca8ada5433","resolution":{"observed_at":"2026-08-12T15:18:42.671889Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:42.119146Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.119146Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:c8889ecc453c63830b98dce2ed857409555d3677eaecf0f2a566626c333ac56c","observation_id":"d5ff9837-7500-4247-be53-6a1bd87fea50","resolution":{"observed_at":"2026-08-12T15:18:42.119146Z","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-12T15:18:42.629640Z","title":"and Xu, Y","venue":null,"work_id":"88f6b2fa-22de-4595-827d-a5a98ab2c955","year":2021},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.126084Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:a8679b3dabd14f9dd2d54ede5451f3a2ec7cb5e59354a531c0fcf66a7fdc1509","observation_id":"d63df504-5f77-4080-a6b3-6d1eef2a559b","resolution":{"observed_at":"2026-08-12T15:18:42.635532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:42.611632Z","title":null,"venue":null,"work_id":"2ed15d4c-2821-4e9c-8067-7ce979885345","year":2010},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.131832Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:acfb310328fc4027d33385fa51ccb554972bc180833dd1143e3cb59813c11f26","observation_id":"02716253-56c7-4610-9651-f863bf6dc877","resolution":{"observed_at":"2026-08-12T15:18:42.617113Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:42.591264Z","title":null,"venue":null,"work_id":"d2e6834d-8a66-41ef-b9b8-14c68726c64d","year":2022},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.138449Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:c8fa4bcde704f0a51cb0634c81798aa8087daf0dc70b473cd7f123824667981b","observation_id":"e0f13c5a-584f-41e3-a183-19997a6392a1","resolution":{"observed_at":"2026-08-12T15:18:42.598041Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:42.573269Z","title":null,"venue":null,"work_id":"17fa3e75-b8c8-4246-95a8-479e7f53f964","year":2022},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.143435Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:f8d81d4e7bd05680768b64bf9ee204aa469b08257bc9bef869cd356923ed7ca4","observation_id":"0a5f8fbc-2d0e-4807-abc4-b2d1847621d3","resolution":{"observed_at":"2026-08-12T15:18:42.579258Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:42.557001Z","title":"T., and Massouli \\'e , L","venue":null,"work_id":"1ba354b1-bf73-445b-b582-b6f40d1e0d6f","year":2017},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.149040Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:017ae833b4bac853978d04ffbc63c5133f9f8f10d90bf0595c688292726f068b","observation_id":"5f82d84b-68dc-48a9-a4f6-e53531498186","resolution":{"observed_at":"2026-08-12T15:18:42.562056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:42.539887Z","title":null,"venue":null,"work_id":"f48a1793-0146-4796-a479-1f0191513319","year":2018},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.154338Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:ce9cf91d66e8f19ccaea7f533183c2f227af343682619aaed306ca585d90e267","observation_id":"af509fb2-5a0a-4968-ba22-da196ff0580b","resolution":{"observed_at":"2026-08-12T15:18:42.545357Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:42.519741Z","title":"K., He, N., and Oh, S","venue":null,"work_id":"1c8b8681-88e5-471c-8a18-207b10d3d984","year":2022},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.159801Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:b71aecca7ee7fa13718fbb3ba70d01b053e5139c3ce5e00bc7127b41142fc6c1","observation_id":"a08344bc-6d25-4778-930b-19ff93317a5b","resolution":{"observed_at":"2026-08-12T15:18:42.526148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:42.498493Z","title":"and Morgenstern, O","venue":null,"work_id":"11cc1ee1-0a87-49ab-8c91-9b705a2bd5ad","year":1947},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.166243Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:a477f01f288b957fb17f54000488ee9d7166c45b36c70cfad7a1765447efc12d","observation_id":"c1322401-650b-422c-b404-d3a1336a21e7","resolution":{"observed_at":"2026-08-12T15:18:42.505495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:42.480401Z","title":"and Xiao, L","venue":null,"work_id":"8eb04133-b24e-4d5e-9669-7948d3b6a08c","year":2017},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.173242Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:b174bea1d9521c0d814d793610746931c308b7290042c55bd185cf3f20b5d691","observation_id":"73db2362-ccf9-4cf6-9c55-e1021615c096","resolution":{"observed_at":"2026-08-12T15:18:42.485727Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:42.461186Z","title":"W., Lin, Q., and Chen, W","venue":null,"work_id":"f3acce1a-236f-4dd6-a69b-b0b98012b2e0","year":2019},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.179867Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:333b731af679fae9cedeefadb4e0c8d11166d804cdfbb017e47ac1150a7a456c","observation_id":"8386ee59-01cd-40c9-98bb-9721e0b6fff5","resolution":{"observed_at":"2026-08-12T15:18:42.467292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.02020","last_updated":"2026-04-20T10:40:02Z","snapshot_observed_at":"2026-07-06T18:40:10.103133Z","submitted_at":"2024-07-02T07:41:30Z","title":"Decentralized Optimization with Coupled Constraints","version":4},"cited_work":{"arxiv_id":"2407.02020","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.02020","snapshot_observed_at":"2026-08-12T15:18:42.249023Z","title":"Decentralized Optimization with Coupled Constraints","venue":"math.OC","work_id":"d1a3177d-5c14-49f9-9f43-b274dc920619","year":2024},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.185375Z"},"links":{"cited_paper":"/paper/2407.02020","citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:8822a37a36d7528064748dd5710f5cdc37f0eb6988c7599feb0de35f04db1388","observation_id":"9c2f634c-1fe8-46f6-88d1-386fcdf8f14e","resolution":{"observed_at":"2026-08-12T15:18:42.258427Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:42.443683Z","title":null,"venue":null,"work_id":"1ce35063-656e-4e31-bf02-b9ddb8614c6b","year":2022},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.191133Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:753859b26cbad0266a52e2deb072cd15d5d900f78b75c003aaef8fed653b3f96","observation_id":"df62ea2e-9ad2-40a3-9676-7aadd03d9c97","resolution":{"observed_at":"2026-08-12T15:18:42.448325Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:42.427232Z","title":null,"venue":null,"work_id":"e37720e6-dc6a-41a6-9f32-b7dcee02a3b8","year":2022},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.196962Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:3a72583362d6a5cd67e3dcdbb28357d70b1d0d8380c50c7dafa73b8693c6c571","observation_id":"65213f78-9cc6-49e9-89df-9a4104caf549","resolution":{"observed_at":"2026-08-12T15:18:42.432339Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:42.202551Z","title":"and Xiao, L","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:42.202551Z"},"links":{"citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:6f7a57f62df2b8cbed4d83efd395744494503461a8f33e80c5fe2ccc4fe216d7","observation_id":"3eb2b245-f14e-41a2-aea9-ba283f9c4e85","resolution":{"observed_at":"2026-08-12T15:18:42.202551Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-12T15:04:38.523543Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":30,"verified_exact":2,"verified_fuzzy":12},"total_outbound_references":44},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 4 inbound Pith citation observations for arXiv:2411.14601."}