{"as_of":"2026-08-14T22:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b399732e0cfe20767c60e642c5bfe45a2d7514a9eb04fd5a83a7f4b1bf3ff9fb","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T11:20:06.010196Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.03846/citation-record","integrity":"/paper/2608.03846/integrity","json":"/paper/2608.03846/citation-record.json","paper":"/paper/2608.03846"},"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-05T11:20:10.576479Z","title":"Forty-second International Conference on Machine Learning , year =","venue":null,"work_id":"9548d488-4af2-49ab-aec6-9844c960edd5","year":null},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:03.376633Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:7729cef33885bc0382233303359429158f2c945f008b11a3a7297405101d3c54","observation_id":"5b8dbc51-3561-4482-a8d2-4fa0f55b0852","resolution":{"observed_at":"2026-08-05T11:20:10.581079Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:10.560926Z","title":"international conference on machine learning , pages =","venue":null,"work_id":"985ec01f-877b-4514-8ea3-67aa85f8c5e8","year":2017},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:03.445577Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:04beb5c350ce1c0eefb2deda307d76c9cb0f5681d96b488263217efad43cdb10","observation_id":"e7ca92a1-c2af-41d1-a518-031352b5b7ac","resolution":{"observed_at":"2026-08-05T11:20:10.565353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:10.544986Z","title":"Mathematical Programming , volume =","venue":null,"work_id":"25cc7405-fbb2-4b5f-b290-88106b9594dc","year":2020},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:03.527169Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:38b34d86308cbc8027f8e291df8fcb8692ba851b877346d537db995d19420ff2","observation_id":"27c48abf-31eb-4539-9bb1-0c775d884b6b","resolution":{"observed_at":"2026-08-05T11:20:10.550089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:10.529539Z","title":"Advances in Neural Information Processing Systems , volume =","venue":null,"work_id":"deffa7db-f06a-42cb-ba92-3e2fe5a56f32","year":null},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:03.566394Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:3c0f296e05ba34345154824578a84d835d876ad9e6108cd93fe5bfe91aec6b80","observation_id":"e78aab01-7e0d-4758-9cb0-b411c3a58681","resolution":{"observed_at":"2026-08-05T11:20:10.534394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:10.514803Z","title":"Matecon , volume =","venue":null,"work_id":"cc72c63f-8c86-43be-b5a6-37bf013895bd","year":null},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:03.667561Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:67f95eaf6a4b320dc8ec5aafe866916066f508038615c46df3b9d867b0639318","observation_id":"279ec846-5215-4e4f-b2a9-f7138bdd814b","resolution":{"observed_at":"2026-08-05T11:20:10.519737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:10.495980Z","title":"SIAM Journal on Optimization , volume =","venue":null,"work_id":"11b27366-d876-4674-9953-71e0974793b1","year":2004},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:03.768985Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:7bdb9fa00048cd3e836317d7659299ea5c1d4985f26dc2eb61cb61054ed4e23b","observation_id":"492cfeb1-8478-497b-a683-e5b031618140","resolution":{"observed_at":"2026-08-05T11:20:10.501044Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:10.479470Z","title":"Journal of Optimization Theory and Applications , volume =","venue":null,"work_id":"b6b1b980-a70f-45f5-bcc5-59c38306ac98","year":2022},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:03.848815Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:b182f589e2d0f3de9d99cabde6ce6c0a58a41565256f45bb32deaedeaa43b968","observation_id":"24e46ae5-8ebd-45d3-b178-edae2b1bc204","resolution":{"observed_at":"2026-08-05T11:20:10.485018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:10.465211Z","title":"Journal of mathematical imaging and vision , volume =","venue":null,"work_id":"a75cdd6c-572f-4181-83d2-a75dd3ed62d7","year":2011},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:03.916762Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:ebcaf7cf6eb37b9cacba2684d4778567149a7869f1e1e8ea71d034ffd12e3d2e","observation_id":"1d2bd6d8-f6fa-4ce4-b41d-60517a8920dc","resolution":{"observed_at":"2026-08-05T11:20:10.469629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:10.225866Z","title":"submitted to SIAM Journal on Optimization , volume =","venue":null,"work_id":"613c4616-7b17-486c-af8f-c723464fb5f4","year":null},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:04.023313Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:5eee5f06d1c2f47ca2394e09a78e294dbdc4d572e52f1eb1a91d212587fc7685","observation_id":"650600a1-a898-49a9-9c88-0fe111201efc","resolution":{"observed_at":"2026-08-05T11:20:10.368433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:10.066600Z","title":"Mathematical Programming , volume =","venue":null,"work_id":"a7651b57-b0d1-4ea9-a5f1-a1f563bf0e5f","year":2022},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:04.118958Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:07c92387939fe6e82d9c5338d71d7e24f5b0ea3e0c4122f776ad6cc0d4095108","observation_id":"33c47b1d-baed-4b53-9379-575e4a80b05e","resolution":{"observed_at":"2026-08-05T11:20:10.136765Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:09.934224Z","title":"International conference on machine learning , pages =","venue":null,"work_id":"079e5d93-86da-453d-8fa8-1e9245538d6e","year":2020},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:04.195606Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:8daccd79242ddab9e913d940af3b4cb28955836f4ce97aa185eb710b7ec8a887","observation_id":"4a67df9f-2c0b-488a-96ff-d682be2ea745","resolution":{"observed_at":"2026-08-05T11:20:09.999758Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:09.737463Z","title":"The 22nd International Conference on Artificial Intelligence and Statistics , pages =","venue":null,"work_id":"6effe5b7-dc48-4597-b5c0-0513b53ff9bb","year":2019},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:04.274377Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:e8ce9ecf847999c6a6a18b920cbc5ebf986cd6ca38cc26782b58bf80e0701efb","observation_id":"8d9d797f-d9af-4afe-bed8-a59777d6c0a7","resolution":{"observed_at":"2026-08-05T11:20:09.848289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:09.567660Z","title":"2003 , publisher =","venue":null,"work_id":"de19c67e-3e22-438b-8ec9-e50f89f94171","year":2003},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:04.373933Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:4927321e196ac16cb2ac7f9463d28c4a4e3aabe42ecab3455042dda5940c56f8","observation_id":"b520871c-ad37-40f6-afbb-0271fe520c23","resolution":{"observed_at":"2026-08-05T11:20:09.655422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:09.376219Z","title":"Mathematical Programming , volume =","venue":null,"work_id":"9f26ce65-dd4c-4944-bb73-4907dbb2fd75","year":2007},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:04.436040Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:4639ed8b62053f70aa93decf7f15876ac5624352e8d74c510a263de2cc86b485","observation_id":"bc2b93bf-cd12-4592-9ff0-33f2fc93fb43","resolution":{"observed_at":"2026-08-05T11:20:09.466017Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:09.152743Z","title":"Mathematical Programming , volume =","venue":null,"work_id":"252edb44-f5f5-4150-a5fe-1f5a0fd5e2f1","year":2016},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:04.522274Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:3439b2fbd2ef82ed5321e7ed8fdce0e8d915f7927b22c068770eefc69bd22ab2","observation_id":"7373d4a8-7675-4952-9115-d9c2a3ffa004","resolution":{"observed_at":"2026-08-05T11:20:09.257429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:08.990973Z","title":"Mathematical Programming , volume =","venue":null,"work_id":"7632e718-f2af-48b4-93cf-dc36b29e4feb","year":2017},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:04.599513Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:96c00cfee60513baadf743fe551e1bb1eff4ae836a34404555eb8c75e0104567","observation_id":"56567ff7-e7d9-4b35-9193-24fdcbf216dc","resolution":{"observed_at":"2026-08-05T11:20:09.060847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:08.799749Z","title":"Mathematical Programming , volume =","venue":null,"work_id":"adab5034-c023-4e44-8f03-b9df7e5e1d7f","year":2016},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:04.653422Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:7e266c25298f348c01d3f47a14b03f12f4d9012b40c8d572f765449e335dd02d","observation_id":"93dffab8-6fc2-48bf-81bf-009ec504771b","resolution":{"observed_at":"2026-08-05T11:20:08.874933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:08.654769Z","title":"Computational Optimization and Applications , volume =","venue":null,"work_id":"ba1c657a-8fc7-47b6-8eef-759780961a58","year":2022},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:04.715403Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:a319e508456f412a6e6979bc6d7bfa4719bb1a18259cfd09b8ba7d487615eae0","observation_id":"6aea1767-ef29-425d-82e7-da109ea76691","resolution":{"observed_at":"2026-08-05T11:20:08.726339Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:08.489078Z","title":"Mathematical programming , volume =","venue":null,"work_id":"e638cba2-4afe-4086-a37e-9f66fa00502c","year":2018},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:04.791530Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:bb22dbc9c390fb34b8e91f5f168faa6e38c14d2c72204c3500d0294b1906f7a0","observation_id":"6b04c118-7c28-4191-831f-1afdfeb51ddc","resolution":{"observed_at":"2026-08-05T11:20:08.567308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:08.275958Z","title":"Journal of Inverse and Ill-posed Problems , volume =","venue":null,"work_id":"422c2bce-bdeb-4976-8346-f809fa61fb84","year":null},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:04.856108Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:88c1632211fd8c8dc40f79e918fa3235e25655799cd421a90acc0acc563a4244","observation_id":"0b2a0c2b-41d2-4545-a112-8d2a142af1e0","resolution":{"observed_at":"2026-08-05T11:20:08.423525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:08.057482Z","title":"Advances in Neural Information Processing Systems , volume =","venue":null,"work_id":"eed76add-ccb6-4ef6-b6a7-4c70ae60558b","year":null},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:04.905802Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:b434a585eede9464b3dbdb994f0f1ec2f59c79f8f474a5fbc72e4018db07b9a2","observation_id":"8e5fca8b-f4e9-4bf5-aa73-4b46d306fa8d","resolution":{"observed_at":"2026-08-05T11:20:08.149421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:07.778941Z","title":"Mathematical Programming , volume =","venue":null,"work_id":"1c0cce47-3604-4bca-8799-2e53a5af05ca","year":2015},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:04.979277Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:6e3ba836bf9149628a4f1a0ac8750ccaeffcb6fcda6fbc5ba500f58e8d6fc573","observation_id":"34b92ca6-3ecc-4ca2-86f7-94be52827787","resolution":{"observed_at":"2026-08-05T11:20:07.898775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:07.496066Z","title":"Mathematical programming , volume =","venue":null,"work_id":"416367b1-4446-40c2-8e72-0fff43440aca","year":2005},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:05.092036Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:6b08f7915f1db3320a762d60684bb2e5d8574566f647f11949911f01f47b1e35","observation_id":"32103ad5-6905-456d-b451-4981f0470ae5","resolution":{"observed_at":"2026-08-05T11:20:07.646784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:07.304951Z","title":"Advances in Neural Information Processing Systems , volume =","venue":null,"work_id":"af9afce9-d693-45a5-911b-a0442e4f0390","year":null},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:05.153892Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:a74cdda93de3e4271d40a943f594fb6664f998ff9a3463e3bb2e7b7d2a810902","observation_id":"9fb79368-6985-4561-a4ab-d2a9db0d52a9","resolution":{"observed_at":"2026-08-05T11:20:07.410748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:07.120829Z","title":"Journal of Optimization Theory and Applications , volume=","venue":null,"work_id":"221e9d17-6129-4dbe-82e5-15ae59fbe0a2","year":2024},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:05.218712Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:53417d36d3791fed4a6a42493517ee7ddff70abf7d8e906b979a0327db014e22","observation_id":"1cb48cf8-6760-49e1-8ca8-30cff2072935","resolution":{"observed_at":"2026-08-05T11:20:07.224167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2603.23492","last_updated":"2026-05-16T02:51:45Z","snapshot_observed_at":"2026-08-13T19:02:29.138052Z","submitted_at":"2026-03-24T17:57:36Z","title":"Universal and Parameter-free Gradient Sliding for Composite Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2603.23492","snapshot_observed_at":"2026-08-05T11:20:05.292107Z","title":"arXiv preprint arXiv:2603.23492 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:05.292107Z"},"links":{"cited_paper":"/paper/2603.23492","citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:0a14c5e676b02f2b6b9dfda50e32fc3855f1fb284bc76c18a1444199835c8bda","observation_id":"c221f20c-5cf9-4640-917e-56a857f1df52","resolution":{"observed_at":"2026-08-05T11:20:05.292107Z","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-05T11:20:06.978913Z","title":"Mathematical Programming , volume =","venue":null,"work_id":"f496fce1-d2e3-4cee-a723-540c69d3486c","year":2014},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:05.373764Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:1f9b032f864ee63062a91bfd0211ce1591993455cd9c4a939960dd01fb606e39","observation_id":"1763878e-880b-47d5-b3ff-a89548361733","resolution":{"observed_at":"2026-08-05T11:20:07.020618Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:06.823825Z","title":"Computational Mathematics and Mathematical Physics , volume =","venue":null,"work_id":"3060eaac-eaee-4347-b693-501866bf297f","year":2018},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:05.446571Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:0e0f4ad5646a4b88d0538d0a7b70adf7181dbe04f939de33783b74c67909cb7e","observation_id":"78ac2980-320e-4f80-a36a-a3459ac3fc9a","resolution":{"observed_at":"2026-08-05T11:20:06.899750Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:06.707823Z","title":"International conference on machine learning , pages =","venue":null,"work_id":"396dd36c-6727-4d83-b8fb-b57a29aab32f","year":2018},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:05.547639Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:0ec451a536c36f01d54b3d3ff96f9ceed5046a1a02d9fc9068016e629656d104","observation_id":"9cf8da46-8fcf-456f-8414-bd5992d56d12","resolution":{"observed_at":"2026-08-05T11:20:06.758591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:06.589128Z","title":"1983 , publisher =","venue":null,"work_id":"5d462bb5-8113-4212-8169-de12e14184b5","year":1983},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:05.631338Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:bd4f0ef1ff12a2f0a73878a3a3beb546a48f0eeb3b87668f0f097e3285c0d244","observation_id":"97606d80-b2c7-49a4-9753-3b29612f2a64","resolution":{"observed_at":"2026-08-05T11:20:06.653332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:06.486359Z","title":"2013 , publisher =","venue":null,"work_id":"bff36207-737d-4e38-b17b-586728227fbd","year":2013},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:05.735638Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:d97bba47c0eaf807c4a622d152dece4990b5179ca8834337c88628553b350d52","observation_id":"30b5f947-8e89-4672-b288-01f050da48fd","resolution":{"observed_at":"2026-08-05T11:20:06.497437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.00996","last_updated":"2021-11-01T14:59:08Z","snapshot_observed_at":"2026-08-13T17:42:15.066146Z","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":"2111.00996","doi":null,"metadata_source":"pith","pith_arxiv_id":"2111.00996","snapshot_observed_at":"2026-08-05T11:20:06.134186Z","title":"Mirror-prox sliding methods for solving a class of monotone variational inequalities","venue":"math.OC","work_id":"83b6bec5-17fc-4d3d-9511-71d3c7ec8e08","year":2021},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:05.796375Z"},"links":{"cited_paper":"/paper/2111.00996","citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:774799d1082cb11fc7f89148e45a49b3b17b223ef69f83b43063aa9094a57124","observation_id":"e0ebfec7-03b6-461a-b0f9-878cfee567a0","resolution":{"observed_at":"2026-08-05T11:20:06.222785Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"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-05T11:20:05.857290Z","title":"Stochastic Systems , volume=","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:05.857290Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:7cf75d216d82e7fb6a7940a53de3460de694a53bceba8f4c9cb95732b3ab2768","observation_id":"4a702ec0-84e0-4b0a-bce1-dfdf965ceaf8","resolution":{"observed_at":"2026-08-05T11:20:05.857290Z","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-05T11:20:06.324138Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":"e1a2e514-5060-4e0f-b165-ccfb9051ab6e","year":null},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:05.948352Z"},"links":{"citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:919c6b4611ad963ae5e75a33f885337bb503264a91c34e561d03142789546882","observation_id":"10250925-5789-47c1-bab7-db7d8b3e0427","resolution":{"observed_at":"2026-08-05T11:20:06.396249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.09344","last_updated":"2021-06-14T13:21:13Z","snapshot_observed_at":"2026-08-14T11:06:56.117645Z","submitted_at":"2021-03-16T22:08:09Z","title":"On Accelerated Methods for Saddle-Point Problems with Composite Structure","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.09344","snapshot_observed_at":"2026-08-05T11:20:06.010196Z","title":"arXiv preprint arXiv:2103.09344 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-05T11:20:06.010196Z"},"links":{"cited_paper":"/paper/2103.09344","citing_paper":"/paper/2608.03846"},"observation_digest":"sha256:7aebb593eb4a8d8c4fff758ee9061a06e24737880d3221af9cbe79ff9de6d214","observation_id":"400118fc-41c9-4dca-a698-c5c415762e50","resolution":{"observed_at":"2026-08-05T11:20:06.010196Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.03846","last_updated":"2026-08-04T15:50:37Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T23:12:33.561122Z","submitted_at":"2026-08-04T15:50:37Z","title":"Sliding Methods for H\\\"older-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":31},"total_outbound_references":35},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:2608.03846."}