{"as_of":"2026-08-17T22:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4769d9409eb5daa0f7e3233343a1bc71f2f91eebdf75a70d752470112cbaa45f","coverage":[{"denominator":55,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":55,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:46:12.596513Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-15T14:17:22.211737Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-15T14:21:35.799593Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"cited_work":{"arxiv_id":"2505.09146","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.09146","snapshot_observed_at":"2026-07-15T14:21:35.799593Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","venue":"math.OC","work_id":"b5b78557-1b6b-467d-bbeb-53b56721d7f1","year":2025},"citing_paper":{"arxiv_id":"2603.05774","last_updated":"2026-07-13T15:28:06Z","snapshot_observed_at":"2026-08-14T21:35:26.388138Z","submitted_at":"2026-03-06T00:14:46Z","title":"First-Order Softmax Weighted Switching Gradient Method for Distributed Stochastic Minimax Optimization with Stochastic Constraints","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-15T14:17:22.211737Z"},"links":{"cited_paper":"/paper/2505.09146","citing_paper":"/paper/2603.05774"},"observation_digest":"sha256:ca2a74f330f097fe8837dbe2184d9c67d07b34c6daccc310a3789677c538515a","observation_id":"e8483404-7a86-472b-a2d2-60c00361e920","resolution":{"observed_at":"2026-07-15T14:21:35.801310Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.09146/citation-record","integrity":"/paper/2505.09146/integrity","json":"/paper/2505.09146/citation-record.json","paper":"/paper/2505.09146"},"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-15T21:46:13.387675Z","title":"Parallel and distributed methods for constrained nonconvex optimization—part i: Th eory,","venue":null,"work_id":"8270b36b-c6ab-46d0-93e7-78465f1e894f","year":1929},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.379431Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:3774e1310853631e17dd190f156d51f14702fff19328b07d2c34f894d431285f","observation_id":"15845be6-15e1-44cc-ad67-3439280cedef","resolution":{"observed_at":"2026-08-15T21:46:13.392162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.375150Z","title":"Penalty dual deco mposi- tion method for nonsmooth nonconvex optimization—Part II: Applica- tions,","venue":null,"work_id":"c8a5ee44-ccc6-4a0a-9d50-78f110ad1039","year":2020},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.384020Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:cf06d6c26b2110e43331a4846706964e24cfd76a9e3d3ce2d836f849dc1f7733","observation_id":"0c2537c8-3ecf-45e0-962b-7f8bd054a04a","resolution":{"observed_at":"2026-08-15T21:46:13.379500Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.362808Z","title":"Applied and computational optimal control,","venue":null,"work_id":"21cff5ec-f16f-4521-8145-7e6bb0610d1f","year":2021},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.388306Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:7a64b885c526f64ad6ac16d03ef9f7cd038bbb4a9c28717ae664ba21ddfff369","observation_id":"32efd1bc-eaa1-492e-88c4-20dcef515ed9","resolution":{"observed_at":"2026-08-15T21:46:13.366700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.349782Z","title":"Stable and fair classification,","venue":null,"work_id":"16d9ffdc-aecb-47f5-9069-5e1481fb2ec6","year":2019},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.392687Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:74f55ef8e1c84d760dc8372e0a9ea5fcda40edbc83cc068edf8d709a61083cf9","observation_id":"d6b3ea61-47d8-4f23-a311-fec0d3c07f95","resolution":{"observed_at":"2026-08-15T21:46:13.353722Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.338157Z","title":"Neyman-pearson classification , convexity and stochastic constraints,","venue":null,"work_id":"d7f844e5-82b7-4dde-ba16-bfcb88c57a2e","year":2011},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.396687Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:d43d45383078d97b0cb396584ec00608b3fe5cb1783f5610b718ada06f9c67bd","observation_id":"aaf52ae9-1758-4fa2-9a95-df1289df51ac","resolution":{"observed_at":"2026-08-15T21:46:13.341829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.327009Z","title":"Fairness constraints: A flexible approach for fair classifi cation,","venue":null,"work_id":"dc3d4ca6-3c18-44e4-a3e1-5b367a53c7da","year":2019},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.400598Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:9533f22b64b99d9a4a83dc2c81933a9bddf8b273d122a4bc3475fd83e90e65b8","observation_id":"ab69b6b5-2c7a-4ead-8711-5a4017be7da3","resolution":{"observed_at":"2026-08-15T21:46:13.331053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.315021Z","title":"Oracle complexity of single-loop sw itching sub- gradient methods for non-smooth weakly convex functional c onstrained optimization,","venue":null,"work_id":"8b17c2c1-e8b8-4219-a9ff-428bc7e48faa","year":2023},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.404681Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:612c44fb98da1388747b5fdcd3f5e4ab1861c2892d5f3b4a710fe0acd98e550d","observation_id":"12e9c7e1-7d33-4e44-b9b9-7f2565742e6c","resolution":{"observed_at":"2026-08-15T21:46:13.319187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:12.408829Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.408829Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:990385546d1ce1031a329c0f180538adbd619c158a2afc398f1a574eb602dc5a","observation_id":"5e8e759d-2c53-4149-9f93-583f8688bfcb","resolution":{"observed_at":"2026-08-15T21:46:12.408829Z","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-15T21:46:13.296555Z","title":"A first-order primal-dual algo rithm for convex problems with applications to imaging,","venue":null,"work_id":"16078d4f-e05b-4913-bf3f-10fd2a6ac828","year":2011},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.412403Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:4f6b3af3ca27b21ddca16c7d0efd9494f6ea05fb7996c17faf37d1a638ae0f3e","observation_id":"516c5356-3802-4c17-b60b-b5a26942884e","resolution":{"observed_at":"2026-08-15T21:46:13.300268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:12.416149Z","title":"Solving convex smooth function con strained optimization is almost as easy as unconstrained optimizati on,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.416149Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:26fd46d2d92e3d0e7125cc718f7e5b26bfa145c60a50b681f41abc69619b5426","observation_id":"ed8e9c0f-4e4a-4218-b964-905d9138dfdd","resolution":{"observed_at":"2026-08-15T21:46:12.416149Z","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-15T21:46:13.285836Z","title":"Stochastic first-order met hods for con- vex and nonconvex functional constrained optimization,","venue":null,"work_id":"2ad3ebd2-cb9b-46de-925e-c239c158e6e1","year":2022},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.419641Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:59ee1564af48b3a0d4e7c11aae38aff9ef37bb2e98e16c550d78ef2e4be6b13d","observation_id":"899c9bae-3b4d-43f9-a437-ff405c922107","resolution":{"observed_at":"2026-08-15T21:46:13.289622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2406.17107","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:46:12.713811Z","title":"A fast single-loop primal-dual algorithm for non-convex functional constrai ned optimiza- tion,","venue":null,"work_id":"8e3d2636-f9d4-4f88-832f-c4a1da1f6c0d","year":2024},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.423588Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:52c4165729d9fe35d062978dacf37fb79b01e21bd686a0ab3f7479f75f6daec0","observation_id":"9d877979-14a8-412b-944e-33a6b249f77b","resolution":{"observed_at":"2026-08-15T21:46:12.723121Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.275058Z","title":"Nesterov, Introductory Lectures on Convex Optimization: A Basic Course","venue":null,"work_id":"f0783246-5e89-4a1d-9fae-3f76aa0ef10f","year":2004},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.426986Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:7434c082e083ead2bb81f2f1982f9449d29fe11bf13dc63b98e32c55f53022ac","observation_id":"0d3ca736-b095-4b7d-8ea4-4c477fa2899b","resolution":{"observed_at":"2026-08-15T21:46:13.278717Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.264040Z","title":"Parallel and distributed methods for constrained noncon- vex optimization-Part II: Applications in communications and machine learning,","venue":null,"work_id":"c46eed87-f684-4702-b982-eab7e082e73e","year":1945},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.430322Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:87e557fcefe3e904ee5bd2b0ca19e507f8b5abfe066ba9df77c83fafce8dd227","observation_id":"4650ab1c-3c8e-4463-8bec-5965785c40db","resolution":{"observed_at":"2026-08-15T21:46:13.267957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.253219Z","title":null,"venue":null,"work_id":"209d98fb-c8f6-49a4-89f2-aa7c966226fc","year":2012},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.433860Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:f1fd3785caf32bcb10a732fbba330228c085b42c5338a60380c0dcef39c25be1","observation_id":"3b6df25c-c8df-4666-8fbb-2524dc5fa427","resolution":{"observed_at":"2026-08-15T21:46:13.256884Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.240379Z","title":"Complexity of problems an d effective- ness of methods of optimization(russian book),","venue":null,"work_id":"55b66f3c-967d-4760-a14e-e19dc27a79e8","year":1979},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.438131Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:93bf0ab9961a4c49bbb2cfcc8e61254e47fbaa0e17a267f63cc8d40f3993d2da","observation_id":"e77ce31d-d5b1-4b7d-8422-628221131387","resolution":{"observed_at":"2026-08-15T21:46:13.245678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.227647Z","title":"Algorithms for stochastic optimiza tion with func- tion or expectation constraints,","venue":null,"work_id":"70d509f9-1f13-4a4b-86ad-bd8658cdd87e","year":2020},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.442705Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:5b4adb6b3590079f50c738a469b44454925d1e0ad944b3110f22bc120e389f5c","observation_id":"8ed951ac-f7a8-4ef1-93cb-362c66be5cef","resolution":{"observed_at":"2026-08-15T21:46:13.231770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.216114Z","title":"Mirror descent and convex optimization problems with non- smooth inequality constraints,","venue":null,"work_id":"ccd72cf9-128a-4fd3-a87a-74975cea98fb","year":2018},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.447005Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:019d5dcd0fd053a1027656c9e9b39f150c85d1d0c7050a5d1270f3a0aba66b60","observation_id":"d874033c-6ed5-49d7-a388-74e9b11b9cfa","resolution":{"observed_at":"2026-08-15T21:46:13.220353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-16T06:50:29.085665Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.19214","snapshot_observed_at":"2026-08-15T21:46:12.450398Z","title":"A single-loop spider-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth o ptimiza- tion,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.450398Z"},"links":{"cited_paper":"/paper/2501.19214","citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:ab57f069fea4ecdc794a5b0eb31957c21e04b32fb43ac63e4b9019b1c9f8f251","observation_id":"ec39d7e9-44c9-4f07-ab2a-8b22860cc24b","resolution":{"observed_at":"2026-08-15T21:46:12.450398Z","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-15T21:46:13.204404Z","title":"Crpo: A new approach for safe rein- forcement learning with convergence guarantee,","venue":null,"work_id":"6a3d62ac-f581-4f60-abaf-85c41325c07a","year":2021},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.455652Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:03b7a8764d3e4bc36467449fe91019b9ddc4494c76fb049688a022b0173ad8f5","observation_id":"c3d3baa1-7835-41f6-84be-90dba6e02640","resolution":{"observed_at":"2026-08-15T21:46:13.208372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.192198Z","title":"Stochastic model-based minimization of weakly convex functions,","venue":null,"work_id":"5240fbc8-1827-40ef-a891-7eb3805c9180","year":2019},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.460726Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:6a5412bb738fa2c59042e1fa18bc3a6ded272647c495972cca265b0527f40425","observation_id":"40ee574e-9820-4bf1-ab89-6dfe379a59eb","resolution":{"observed_at":"2026-08-15T21:46:13.196341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.178530Z","title":"Introduction to optimization. optimiza tion software,","venue":null,"work_id":"eeb986cc-7ea9-4c89-95e2-225c58279af2","year":1987},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.464757Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:a76228b82decbbf7eb60fa7049b93876243bdca17a3f95dd5af1fb21d31afbde","observation_id":"ca42875b-e434-477e-91e0-ed7c5e034fc7","resolution":{"observed_at":"2026-08-15T21:46:13.182183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.168158Z","title":"Subgradient methods for huge-scale opti mization prob- lems,","venue":null,"work_id":"ffcc7fe0-e284-49ce-8aae-357952ec1c1a","year":2014},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.468605Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:15af0e7f5b92d90c494ce0906265bc66e2fab6c628018458240c6ca4b5fd4a3f","observation_id":"5996f73e-37df-4f2b-b0f7-70bfa9b6eb1b","resolution":{"observed_at":"2026-08-15T21:46:13.171700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.158077Z","title":"On modification of an adaptive stochasti c mirror de- scent algorithm for convex optimization problems with func tional con- straints,","venue":null,"work_id":"9e9d6604-498c-45cc-a772-a4afbabe1225","year":2020},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.472869Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:125ef951e5d9240ef55e53d91748f47f46017c660775934a89d59294f5fb3d76","observation_id":"b705d862-e04d-42ee-9a41-14515219538a","resolution":{"observed_at":"2026-08-15T21:46:13.161722Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.147455Z","title":"Adap- tive mirror descent algorithms for convex and strongly conv ex opti- mization problems with functional constraints,","venue":null,"work_id":"092b4be7-62c3-4cca-b0c1-0669a5739285","year":2019},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.477590Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:a97c5b6940d64ad24dc17bc77abbe27e03264e2d7def5d8bca7b60e162c11b2c","observation_id":"baee34e9-45d3-4d7d-9a20-6d547048b614","resolution":{"observed_at":"2026-08-15T21:46:13.151380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.136122Z","title":"On some methods for strongly convex optimization problems with one functional constraint,","venue":null,"work_id":"cd0bdd64-7a91-4bdf-9e68-5e87da8e06e1","year":2019},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.481549Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:e2264c72d2f021f88a34f6ab889861a8ddb368edd09ef9b8987c15e2dfa36117","observation_id":"96868f32-eb42-456d-b0c6-84076974989c","resolution":{"observed_at":"2026-08-15T21:46:13.140454Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.123653Z","title":"Mirror de- scent for constrained optimization problems with large sub gradient val- ues of functional constraints,","venue":null,"work_id":"cfe82fa1-e95a-49f0-bbf8-c07d9d5da545","year":2020},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.485261Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:fd670f1c76791c90cd6d8e8e27bccb1ea559887d6dd794906fa19c7fccf58977","observation_id":"c4d1c0ab-4d64-4a1e-aaa4-28e1e72672f3","resolution":{"observed_at":"2026-08-15T21:46:13.128258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.111114Z","title":"Analogues of switching subgradient schemes for relatively lipschitz-continuous convex programming problems,","venue":null,"work_id":"a7e45be8-a8ab-48cd-af9e-2ecf1c04f883","year":2020},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.489096Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:f22883500df9513442d3a9fad8d8820d7ab4bae7298176dadf9532b3e7422402","observation_id":"6b2f367a-ca44-4649-8215-e57e26fc9225","resolution":{"observed_at":"2026-08-15T21:46:13.115774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.099205Z","title":"Mirror descent and constrained online optimization probl ems,","venue":null,"work_id":"c002aa88-95e1-45ce-bf18-c2924eae3fc5","year":2018},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.493047Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:b668e807597449cce7120cb72c124aaa3c31e434cad1a0e239bf125c679874fe","observation_id":"f652cd62-6abf-4429-820b-8177fd741c8d","resolution":{"observed_at":"2026-08-15T21:46:13.103682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.087897Z","title":"Stochastic first-and zeroth-ord er methods for nonconvex stochastic programming,","venue":null,"work_id":"c303ef6b-8d83-40c5-8fab-b4229ec58bfb","year":2013},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.496904Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:fea36dc5ef440ea8418f2e3236ee57f666683927223d8ec3c5c2707d29dfc506","observation_id":"10514a28-0d03-4a40-84f7-f11a20e6b681","resolution":{"observed_at":"2026-08-15T21:46:13.091939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.076077Z","title":"A method for solving the convex programmi ng problem with convergence rate o (1/k2),","venue":null,"work_id":"454faadb-16fe-4794-8227-7251ad494ee7","year":1983},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.501100Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:fad300774ce6de25637598d6716eb7653203afc0c5d66fcd50a1bbabe67b38bb","observation_id":"5567d8d5-9309-4de5-933e-f6e29f5d9e68","resolution":{"observed_at":"2026-08-15T21:46:13.080154Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.064740Z","title":"Smooth minimization of non-smooth funct ions,","venue":null,"work_id":"9e76c778-add1-4858-ac2a-bcba9f653030","year":2005},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.505456Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:ac24d634c5e91ce10efd95c8abb3856cbcc060f596ffd32fc2b8e5318b4d4dc9","observation_id":"3f86f373-fd7d-489a-851e-6688fa1a0298","resolution":{"observed_at":"2026-08-15T21:46:13.068746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.053013Z","title":"Random gradient-free min imization of convex functions,","venue":null,"work_id":"412c0034-922d-4226-a22a-345ed81fe988","year":2017},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.509775Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:81f41a16e9b80084b26ce306c14251dc178a84e901d563ef53278aba9e7ec13a","observation_id":"8150dd53-44da-4372-aaa1-6169941b4053","resolution":{"observed_at":"2026-08-15T21:46:13.057628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.041764Z","title":"O’Regan, Existence theory for nonlinear ordinary differential equa- tions, vol","venue":null,"work_id":"cfe1865d-f8e7-4c70-81b9-134ea356f3b4","year":1997},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.513295Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:683082df2237edab07ab42f78532031984f5cb2216f5ec3704dac3ea213fd290","observation_id":"48fdcc55-8e74-44db-b5a5-6eefd3eedda1","resolution":{"observed_at":"2026-08-15T21:46:13.046054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.028992Z","title":"Optimization with mome ntum: Dy- namical, control-theoretic, and symplectic perspectives ,","venue":null,"work_id":"4df821a3-6074-4a2e-810a-ac817bc128a0","year":2021},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.516833Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:ab8c49ff6e92a59495561c304f1fb53d005c89060e1ddc73d5eddfc2ae1454bb","observation_id":"553706f9-c457-4450-8a55-2882858d1fa1","resolution":{"observed_at":"2026-08-15T21:46:13.033439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.017350Z","title":null,"venue":null,"work_id":"c8540a41-ed1b-489c-bced-908e53a90284","year":2016},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.520640Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:8a2dc44ed3d8c31fda42fd49df61acb4e265c651d8acc59ad0b4481e0ca72d84","observation_id":"d68c0897-a7d4-4ec3-beef-7a8b55c1b326","resolution":{"observed_at":"2026-08-15T21:46:13.021251Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:13.006071Z","title":"Monotone operators and the proxima l point al- gorithm,","venue":null,"work_id":"ce8438b8-dba8-454b-9c76-1c5eb2012d1e","year":1976},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.524328Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:374729cee711314dc3d2928ad84f94423e2aa8b40088eb77dadc61619e090ae0","observation_id":"a3cbc9c8-574c-43a6-bbe8-8d8faa27372f","resolution":{"observed_at":"2026-08-15T21:46:13.010159Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:12.993838Z","title":"Two remarks on the method of suc cessive ap- proximations,","venue":null,"work_id":"8c4ec0dd-b604-40ad-9665-7846581ec665","year":1955},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.528418Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:1976707dd384134f45987b8409afd14eb3fd27a5a7f383f60e1c3021a04d7ff4","observation_id":"964982f7-93d7-43c8-ae20-5abc2d5e41d9","resolution":{"observed_at":"2026-08-15T21:46:12.998362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:12.982389Z","title":"Mean value methods in iteration,","venue":null,"work_id":"3cf7ba55-959c-4a00-960f-0b0c131a4719","year":1953},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.532378Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:c718f1cdfe0fe07a0aa50a1d55812f6653d64d37272ffca95494a29b03164bd1","observation_id":"03d2c2ce-c58c-4a3a-87e9-4feb38dc2afd","resolution":{"observed_at":"2026-08-15T21:46:12.986224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:12.970959Z","title":"On the operations in abstract sets and their application to the equations,","venue":null,"work_id":"db552cb3-b804-4a10-b0ea-17f3995d4734","year":1922},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.536799Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:60a02ed7133fad64901bfedaa3ddf7768b355a7f3d36a2d83310fb308aa39bcf","observation_id":"6158eff0-0bb5-496e-97dd-8c56b18d9765","resolution":{"observed_at":"2026-08-15T21:46:12.975329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:12.958632Z","title":"Convergence rates w ith inexact non- expansive operators,","venue":null,"work_id":"85e44e7c-a7ef-4fb4-8d34-a2fa6111526b","year":2016},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.541498Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:e92b59277b196b5afc07a6ee6a6f3369de157b292412b6715c174c9dc4fb5e14","observation_id":"d55bbe10-72f0-4bb5-9f06-ed07c6af0c43","resolution":{"observed_at":"2026-08-15T21:46:12.962949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:12.947309Z","title":"A unified model for large-scale inexact fixe d-point iter- ation: A stochastic optimization perspective,","venue":null,"work_id":"b26cc75b-bf3f-4a59-a067-2fd95f586dd2","year":2024},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.545083Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:0aa0c09b5b2b56c7482d1d8273bd921173520b986d6f5310832537680e712e47","observation_id":"1d545743-9467-49c6-b250-c1f0f4457214","resolution":{"observed_at":"2026-08-15T21:46:12.951612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:12.934082Z","title":"Stochastic fixed-point iter ations for non- expansive maps: Convergence and error bounds,","venue":null,"work_id":"b6efd27c-f54d-4cde-a662-e6ef10c056c7","year":2024},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.548831Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:dbef9aab95624b8240e0ada87af77f5d4fa3c4681a975b76c8402d48e0f27347","observation_id":"8719f1e4-8c5d-4ec2-871a-7f1a13f42bc5","resolution":{"observed_at":"2026-08-15T21:46:12.938694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:12.921867Z","title":"Stochastic quasi-f ej´ er block- coordinate fixed point iterations with random sweeping,","venue":null,"work_id":"8e225fd5-cbd6-4a34-8ca0-43e0fb3b2ee6","year":2015},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.552527Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:8a0d677b4afad8ba4694b2c0d5be46066e5a607e3e4802f55c2c1ff70d6ef2c7","observation_id":"b68b8293-2a39-4994-8dd2-db54d7ddb31d","resolution":{"observed_at":"2026-08-15T21:46:12.925991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:12.909113Z","title":"Stochastic (approximate) proxi mal point meth- ods: Convergence, optimality, and adaptivity,","venue":null,"work_id":"7e426e8e-8b58-4f85-a880-310016761f2a","year":2019},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.556791Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:52ddf96dc1bd360ebdcf86a26ddc4d2752876ba3dd98fbe928535a65cf58c357","observation_id":"ae927f0d-e9b2-44c4-b076-08e0b3de42b8","resolution":{"observed_at":"2026-08-15T21:46:12.913354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:12.896443Z","title":"No- regret learning in dynamic stackelberg games,","venue":null,"work_id":"95b7a1af-fd8a-4941-b8e0-50301b1db946","year":2023},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.560481Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:2a6676f5a46ebec495be578ca1fc29da0993167b93f27d945a71e8539f2df543","observation_id":"2ec18d75-e520-4606-8afe-c9ef6b1de046","resolution":{"observed_at":"2026-08-15T21:46:12.900765Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:12.883592Z","title":"First-order al gorithms for nonlinear generalized nash equilibrium problems,","venue":null,"work_id":"79284b30-b208-4c24-90c9-0c0ca7fad7a5","year":2023},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.564099Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:33363403103ea6f656f6cce6cfcd7966ff90c7eb7b1bf7a2f0f3a7ec4390163c","observation_id":"97cf176a-47ef-4594-8789-7623a5c7e68d","resolution":{"observed_at":"2026-08-15T21:46:12.887467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:12.872295Z","title":"Independent learning in constrained markov potential games,","venue":null,"work_id":"ade8e65a-e9db-4bb8-8759-9e6371260624","year":2024},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.568449Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:394c23c76dff3706d4cf147ae994e153d673ffd78e5bda0a48129baa766e00ad","observation_id":"b3c56f36-acd6-47a5-9656-2b5136a09789","resolution":{"observed_at":"2026-08-15T21:46:12.876472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:12.860558Z","title":"Optimization, learning, and games with predictable sequences,","venue":null,"work_id":"e5d185d0-460f-473b-a4ec-6708be714110","year":2013},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.572352Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:0828d7d8d88392dd082794d96909a4fd63a3233d75caeca0ee28cb508e10ce21","observation_id":"f0f76588-af06-4652-bb17-737fb6df06dc","resolution":{"observed_at":"2026-08-15T21:46:12.864468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:12.848673Z","title":"Optimistic regret bounds for online learn- ing in adversarial markov decision processes,","venue":null,"work_id":"1ac0679e-9676-44b2-9ac3-4fbdc4e64af2","year":2024},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.576302Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:6d5691b3005044d798615f7b7f8e74edf96d9091200e4a79bfb1146a773a2ba6","observation_id":"345a2ad4-8393-4d70-992c-97ab6fbd91c6","resolution":{"observed_at":"2026-08-15T21:46:12.852572Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:12.837047Z","title":"Distributed subgradient met hods for multi- agent optimization,","venue":null,"work_id":"d687e382-6cec-44f0-9510-4f5118d93637","year":2009},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.580215Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:49f2f2e182b0e3536d4b4901ccfe53256672d56041fc8f3db21549c30c3b8fbd","observation_id":"27a2c30b-1ff4-494f-9b35-34000439a4b2","resolution":{"observed_at":"2026-08-15T21:46:12.840882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:12.823654Z","title":"Momentum-based variance r eduction in non-convex sgd,","venue":null,"work_id":"0bbea48e-ecd3-4654-9858-e9582d958d4d","year":2019},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.584694Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:92c0798e430a874f7debf002cad0a043af8c50b0461cb85b587ab06b4324eb74","observation_id":"218eb62e-710a-4fc1-9e02-7c179aa280fc","resolution":{"observed_at":"2026-08-15T21:46:12.827905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:46:12.811695Z","title":"A h ybrid stochastic optimization framework for composite nonconve x optimiza- tion,","venue":null,"work_id":"5b5c6cb4-d512-451c-975a-62b9fe4dd3a7","year":2022},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.588754Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:ec2e2222989545951e3bb57e8d99d14015f025d9978ae926b3880a59c2857efa","observation_id":"78c3cd80-0ce8-4558-b42d-312a67ff1d2d","resolution":{"observed_at":"2026-08-15T21:46:12.815766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2008.09055","last_updated":"2020-08-20T16:15:12Z","snapshot_observed_at":"2026-08-13T21:48:40.949242Z","submitted_at":"2020-08-20T16:15:12Z","title":"An Optimal Hybrid Variance-Reduced Algorithm for Stochastic Composite Nonconvex Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.09055","snapshot_observed_at":"2026-08-15T21:46:12.592496Z","title":"An optimal hybri d variance- reduced algorithm for stochastic composite nonconvex opti mization,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.592496Z"},"links":{"cited_paper":"/paper/2008.09055","citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:5cf08d128481d567b12689997a291615c0f09b7ebcf63aadb197dd5c265db3bd","observation_id":"ee6ce953-c2b4-4e71-a39d-16aac5e69899","resolution":{"observed_at":"2026-08-15T21:46:12.592496Z","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-15T21:46:12.799251Z","title":"Faster non-convex federated learning via global and lo- cal momentum,","venue":null,"work_id":"980bde47-3cf1-4ca5-8b72-0fcfd443d49f","year":2022},"citing_paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-15T21:46:12.596513Z"},"links":{"citing_paper":"/paper/2505.09146"},"observation_digest":"sha256:bcd6f7839d06373a805fff7843f6e2c03e921fa8c6e5fecfb75260063e833639","observation_id":"9e38411c-57d3-4e0f-b103-46eceed70679","resolution":{"observed_at":"2026-08-15T21:46:12.803703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.09146","last_updated":"2025-05-14T05:04:49Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-15T21:36:23.243306Z","submitted_at":"2025-05-14T05:04:49Z","title":"Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization"},"reference_resolution":{"displayed":55,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":1,"verified_fuzzy":48},"total_outbound_references":55},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 55 of 55 outbound references and 1 inbound Pith citation observation for arXiv:2505.09146."}