{"as_of":"2026-08-18T03:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:54b057c818f8dbaed9ef4c9b10b9d2ffac9526b951b087e6f0d6442f375c0efc","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T21:19:41.034612Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/2508.09411/citation-record","integrity":"/paper/2508.09411/integrity","json":"/paper/2508.09411/citation-record.json","paper":"/paper/2508.09411"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:36.843129Z","title":"Online learning and online convex optimiza- tion,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:36.843129Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:d434d66c43162decbd59673960676875c276172428c57d12e01d7ddeb8f9213a","observation_id":"e0f47868-05a4-4353-aa0a-a17a2f7af17c","resolution":{"observed_at":"2026-08-05T21:19:36.843129Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:36.933558Z","title":"Introduction to online convex optimization,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:36.933558Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:93b4af97d2382bde4ba1d7c3962538640404aaf2bc29cb0dcc654be36d948588","observation_id":"c5588085-ab02-4e9a-a490-ee1fbbc2b63a","resolution":{"observed_at":"2026-08-05T21:19:36.933558Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:37.055943Z","title":"Multi-agent online optimization,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:37.055943Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:daf8980fdff8c1c603275019ecb844d50fa2ae13dc724688d0f5633cc8c1b62b","observation_id":"b3a1c5a8-a5a6-478d-b642-29fd60102e95","resolution":{"observed_at":"2026-08-05T21:19:37.055943Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:37.210447Z","title":"A survey on distributed online op timization and online games,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:37.210447Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:8ca48301c80ef4b408ef7cf7e77c3055aac60c89b87b5857d838cacec33fab82","observation_id":"59ad5c2a-f304-44a5-a385-37e322c81000","resolution":{"observed_at":"2026-08-05T21:19:37.210447Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:37.325459Z","title":"Online convex programming and generaliz ed infinitesi- mal gradient ascent,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:37.325459Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:3bf0e84ccc1a153fc2270bd417b4e921cd108e633653d75ae237303bdf81436f","observation_id":"6a77fa96-86a8-4c20-9aa5-5ee1dd39aa78","resolution":{"observed_at":"2026-08-05T21:19:37.325459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:37.440726Z","title":"Online convex optimization with tim e-varying constraints and bandit feedback,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:37.440726Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:3fca091505b5c79205ee8243237482f2cf53378dc00c17b5234029d79a5a4062","observation_id":"348767d3-27c0-4d2d-8a81-f327064581bf","resolution":{"observed_at":"2026-08-05T21:19:37.440726Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:37.570572Z","title":"Proximal online gradient is optimum for dynamic regret: A general lower boun d,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:37.570572Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:1d78344d761a44e352dd8ec9bf7409c7278a5fa475374d142842a1b610726039","observation_id":"982c07f6-3ed5-434f-b2ae-9a615fcc7615","resolution":{"observed_at":"2026-08-05T21:19:37.570572Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:37.729771Z","title":"Distributed mirror d escent for online composite optimization,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:37.729771Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:92ba373a7c2f0b44d5d142dbacb55750717ab3cce558141aee322fe9e7692ebf","observation_id":"6e865560-4b10-4e00-8230-3ed2f3dce8b1","resolution":{"observed_at":"2026-08-05T21:19:37.729771Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:37.816301Z","title":"Distributed bandit online convex optimization with time-varying coupl ed inequality constraints,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:37.816301Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:b5767da0cb768193c28c581dca72d75532b8b5fe5b5d5a2936283133cd6f894f","observation_id":"c50c58b4-e8b2-46db-b8df-559395608cb1","resolution":{"observed_at":"2026-08-05T21:19:37.816301Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:37.900567Z","title":"Distributed online op timization in time-varying unbalanced networks without explicit subgra dients,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:37.900567Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:7fcdf2c766163eb77cf46b2578f49c5098c4ab85c886becaefe2b9fa96500735","observation_id":"2eada9c8-2a55-4cc5-a493-b5d85a88c3fa","resolution":{"observed_at":"2026-08-05T21:19:37.900567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:38.032259Z","title":"Distributed constrained online c onvex optimiza- tion over multiple access fading channels,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:38.032259Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:5a3db5200378d33636ddda9fb6590b37c2f6eee9195a90861ac2d96448d7a801","observation_id":"c2b253d9-b5af-4e16-8f82-42b4c31a5b62","resolution":{"observed_at":"2026-08-05T21:19:38.032259Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:38.109306Z","title":"Dadam: A consensus- based distributed adaptive gradient method for online opti mization,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:38.109306Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:d77e4c3817674a5c8a648963fc06f3548a9358b44ad4e50b81e247da1a14477e","observation_id":"a41bd316-51ea-48fb-80dc-ca24bdeab5b2","resolution":{"observed_at":"2026-08-05T21:19:38.109306Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:38.168739Z","title":"Online learning ov er dynamic graphs via distributed proximal gradient algorithm,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:38.168739Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:ac526cb89f62d26cb24efc329f73708fed6cc00c90ea56aa6e809384495c157b","observation_id":"89e9261c-dcaf-4b20-9fb2-e9fd1b85db0d","resolution":{"observed_at":"2026-08-05T21:19:38.168739Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:38.235537Z","title":"Distributed online o ptimization in dynamic environments using mirror descent,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:38.235537Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:33ec73a72d9f16fa3f69e0d02046c5cfea65e2a916a6aa4f5f6f7a9ae8940526","observation_id":"9f412167-a44b-4f93-b6be-c0a3e6dd6f08","resolution":{"observed_at":"2026-08-05T21:19:38.235537Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:38.320279Z","title":"Distribu ted saddle-point problems: Lower bounds, near-optimal and robust algorithm s,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:38.320279Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:7ecb12756eb0b699db6b375df82e125f4ae7664135dd2154239688c624c2d844","observation_id":"21904bb6-ee26-4622-b8da-217be3674d38","resolution":{"observed_at":"2026-08-05T21:19:38.320279Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:38.410154Z","title":"Accelerat ed primal-dual gradient method for smooth and convex-concave saddle-poin t problems with bilinear coupling,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:38.410154Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:3f57f5af716665aac23b76834c07ddd78b15dee382990d1e8520cd7dfbadfe3b","observation_id":"f3a3ff17-c6e2-4d8a-96fe-6d7ef03bf39b","resolution":{"observed_at":"2026-08-05T21:19:38.410154Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:38.531847Z","title":"Saddle point opti mization with approximate minimization oracle and its application to rob ust berthing control,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:38.531847Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:d56061dbacd978edddefb512d4bab3ef4ebe4718024bb3108d43867e78cbfecd","observation_id":"145fa993-1269-4632-9d5b-0d1586d5af31","resolution":{"observed_at":"2026-08-05T21:19:38.531847Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:38.588276Z","title":"Convergence analysis of saddle point prob- lems in time varying wireless systems–Control theoretical approach,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:38.588276Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:59f4130e2f7e41371c26c97e5c2b011f0c1f9b36b6456670d90e31ba9e0dbf05","observation_id":"d949ab31-3d5e-4bda-a3c4-c21973e35a99","resolution":{"observed_at":"2026-08-05T21:19:38.588276Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:38.672545Z","title":"Adaptive exact penalty de sign for constrained distributed optimization,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:38.672545Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:0fd34451a9fbe13dca4cdd79cb038b8ae687a6b4616a7d1c67cb3366cebc8dbb","observation_id":"39a9fa9a-2615-4d95-b38f-48efb1f781df","resolution":{"observed_at":"2026-08-05T21:19:38.672545Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:38.746493Z","title":"Exploiting probl em structure in optimization under uncertainty via online convex optimiza tion,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:38.746493Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:c4505dfa8486de2ce5ca18283127f2551938a5c88d22fac12ae114a790d45b6f","observation_id":"82226850-afb5-4ebd-8841-24a9789e7c3b","resolution":{"observed_at":"2026-08-05T21:19:38.746493Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:38.817261Z","title":"The online saddle point pr oblem and online convex optimization with knapsacks,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:38.817261Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:7d274e37d70f2900ebe575686167988c3121a95ef7340f881aeed7bf2807ae7e","observation_id":"0e4fe208-7c31-4c85-94ab-ebfd981fa197","resolution":{"observed_at":"2026-08-05T21:19:38.817261Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:38.894174Z","title":"Online saddle point track ing with decision-dependent data,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:38.894174Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:f6d60ab45a7632b682ef79e31e3f1bc6a164ea75eed6deeb14932b9a5314d99a","observation_id":"85fe1196-94f3-4a38-a927-367be64f6c1a","resolution":{"observed_at":"2026-08-05T21:19:38.894174Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:38.977540Z","title":"Competi ng against Nash equilibria in adversarially changing zero-sum games,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:38.977540Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:8a9c250b564ebd3936222e4569ae39b20708eb5f06b46c2e7a296ef69e654abd","observation_id":"c2ba87fa-45cc-4d9c-b74a-ea363126a5cb","resolution":{"observed_at":"2026-08-05T21:19:38.977540Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.01698","last_updated":"2019-12-03T21:52:38Z","snapshot_observed_at":"2026-07-06T08:41:49.632205Z","submitted_at":"2019-12-03T21:52:38Z","title":"Online and Bandit Algorithms for Nonstationary Stochastic Saddle-Point Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.01698","snapshot_observed_at":"2026-08-05T21:19:39.044671Z","title":"Online and bandit algorithms for nonstationary stochastic saddle-po int optimiza- tion,","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:39.044671Z"},"links":{"cited_paper":"/paper/1912.01698","citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:fdc1022a341ba6c00d63a975f7f4c5ea21733de313a668cd1b4f7395fc26ea99","observation_id":"9c9eb0e8-c011-471c-bbcb-e9ff7e7f7168","resolution":{"observed_at":"2026-08-05T21:19:39.044671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:39.180120Z","title":"Dynamic re gret of distributed online saddle point problem,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:39.180120Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:2a9d5dd2f6375257698a1201795a2714a43761d4ba87aef58669b19b8fbf6513","observation_id":"ae3a4c22-b64e-4f24-b72e-9dd66b066baa","resolution":{"observed_at":"2026-08-05T21:19:39.180120Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:39.241835Z","title":"Non-stationary stocha stic optimiza- tion,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:39.241835Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:564805920b3f3db54824a9b9158cd7c41d26d404486b4f5281b23a5009afb871","observation_id":"8f63d01e-cfd4-46dd-b447-31ef90f32b8f","resolution":{"observed_at":"2026-08-05T21:19:39.241835Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:39.308327Z","title":"A d istributed online convex optimization algorithm with improved dynami c regret,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:39.308327Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:276ef7c65e9fa8e3a801893cf9186fbf046e4611eef9fc8dc17df9c1c80736d0","observation_id":"184e642b-7cdd-4120-9242-d756aa62bafd","resolution":{"observed_at":"2026-08-05T21:19:39.308327Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:39.376045Z","title":"An online saddle point optimization algorithm with regularization,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:39.376045Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:1b0689c015c03d33b675eb76953d48f4e6d7b49841ee9ab054c5728a379d2ce3","observation_id":"1ae240a3-4fbe-48e7-a829-dc3797a8103a","resolution":{"observed_at":"2026-08-05T21:19:39.376045Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:39.460902Z","title":"A survey of distributed optimiz ation,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:39.460902Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:36f07cf9bf89e6dfa8f5cd789e9c92589637bfd206c677af7fd19ea32704a679","observation_id":"cf602cfa-7382-4e9f-8f75-dc437e51df7b","resolution":{"observed_at":"2026-08-05T21:19:39.460902Z","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-05T21:19:47.740203Z","title":"Distributed optimization for con trol,","venue":null,"work_id":"f5fbd5f6-7398-4d26-9688-86f1ba4ef022","year":2018},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:39.554020Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:6aa1e7aac9750e3849af03d9c642219a8f23e6d423688894fb7f570b965a31e5","observation_id":"b61523b7-0a02-4814-9645-a71e3b5dfd9e","resolution":{"observed_at":"2026-08-05T21:19:47.867138Z","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-05T21:19:47.474456Z","title":"Distributed subgradient methods and quantization effects,","venue":null,"work_id":"7264ed27-fc71-4e55-a5ff-86e12c815faa","year":2008},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:39.641997Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:d1721a6761b55f0fdc56ed509997a0c4ffd9bdc2ded974def506db33de6253e3","observation_id":"8c808478-d878-412f-9bc9-8eea0213e0da","resolution":{"observed_at":"2026-08-05T21:19:47.597787Z","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-05T21:19:47.143636Z","title":"Distributed empiri cal risk minimization with differential privacy,","venue":null,"work_id":"4d3c511d-7d93-4af3-999c-90ff6b2ab792","year":2024},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:39.688861Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:e40d5748d9a7dfb08d0b2cbf1f7febb61e6c3d43a997582c4c81b66273eb26a4","observation_id":"b1371507-f599-43d2-9b30-5ecb1991b8b0","resolution":{"observed_at":"2026-08-05T21:19:47.311300Z","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-05T21:19:46.828933Z","title":"A dual inexact nonsmooth ne wton method for distributed optimization,","venue":null,"work_id":"54b9d25a-fa75-402f-9bbf-8d11335325d3","year":2025},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:39.774444Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:ccd77fd58c99d158208d90e56a97bbe454e186a3000c59515c7ab8387e94fc94","observation_id":"9f36ee89-5db8-49e1-90c6-df27424efff0","resolution":{"observed_at":"2026-08-05T21:19:46.996844Z","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-05T21:19:46.577172Z","title":"Differentially private dis tributed op- timization over time-varying unbalanced networks with lin ear conver- gence rates,","venue":null,"work_id":"bceffed7-2c00-4e2d-ab85-b4390f4f7010","year":2025},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:39.847379Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:5f3e1f9357446d492351946aaa4951d87db2bca164c070d2e8dcce3d943cef58","observation_id":"c4c67c4c-24ef-4c61-9669-c14e3c742611","resolution":{"observed_at":"2026-08-05T21:19:46.667687Z","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-05T21:19:46.401099Z","title":"Distributed algo rithms for composite optimization: Unified framework and convergence analysis,","venue":null,"work_id":"8ba56a17-7368-4a53-9ffb-d6b41f1577e4","year":2021},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:39.908805Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:100e06f9fa3d132f2e1d9d87dd639fc991dce8641abe9ad8dbac1c6a0121877f","observation_id":"50b594aa-e0a2-4dbb-ac9e-ced2dba0e674","resolution":{"observed_at":"2026-08-05T21:19:46.465020Z","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-05T21:19:46.170122Z","title":"Distributed dual gradient tracking for resource allocation in unbalanced networks,","venue":null,"work_id":"eb9b1e14-537e-480f-bd0f-9976f59c2639","year":2020},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:39.974851Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:9e9be3276da6ad58f450a5557cdf95cc998ce265dd8246ab56cfa09845cfac8b","observation_id":"e3621533-126c-4552-ae8c-ebda79de9475","resolution":{"observed_at":"2026-08-05T21:19:46.282744Z","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-05T21:19:45.912835Z","title":"Distributed saddle- point subgradient algorithms with Laplacian averaging,","venue":null,"work_id":"3ac1c5ae-c6df-4c23-a85d-0d8b5ddd8649","year":2016},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:40.012147Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:58077b075d535ee70dfa6d2097bfc431f4dff02074805ecf0f2c40cef5bcdbc3","observation_id":"521cc3e3-86e6-4ea2-9481-b1ae244f9fb3","resolution":{"observed_at":"2026-08-05T21:19:46.014041Z","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":"2102.07758","last_updated":"2024-04-09T13:45:06Z","snapshot_observed_at":"2026-08-16T18:45:25.058979Z","submitted_at":"2021-02-15T18:55:58Z","title":"Decentralized Distributed Optimization for Saddle Point Problems","version":7},"cited_work":{"arxiv_id":"2102.07758","doi":null,"metadata_source":"pith","pith_arxiv_id":"2102.07758","snapshot_observed_at":"2026-08-05T21:19:41.153555Z","title":"Decentralized Distributed Optimization for Saddle Point Problems","venue":"math.OC","work_id":"bd8602d4-8d0a-4422-b7a3-8fb9e468661d","year":2021},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:40.048187Z"},"links":{"cited_paper":"/paper/2102.07758","citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:1f34873924ac3bb91bf3d1ebd726d0aa872cc0007ba1d444fec2ec6ea48f0ebe","observation_id":"9bfda5e9-a2d9-45cb-bfe9-612baaced4f8","resolution":{"observed_at":"2026-08-05T21:19:41.207814Z","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:19:45.701567Z","title":"Distributed saddle-point problems under data similarity,","venue":null,"work_id":"068bff48-2d05-4f6a-bad1-67c23af058d6","year":2021},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:40.122369Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:5487dbc41eb44f194b1fa624fad1099ce3775571352aaf2e0e93abc0bedfa20e","observation_id":"aa671b3b-9254-4eb4-81d3-392cf1196c34","resolution":{"observed_at":"2026-08-05T21:19:45.799174Z","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-05T21:19:45.418037Z","title":"A distributed stochastic fi rst-order method for strongly concave-convex saddle point problems,","venue":null,"work_id":"8b05e5c5-41ce-4eaa-a237-29253afa92a0","year":2023},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:40.189275Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:0afb2b927618761fd9240a98cb687daf65e3a7f5dbd3c1f44464c5c44f1892e9","observation_id":"7914a031-a8a9-4b33-a9ae-c0850d2fcb3f","resolution":{"observed_at":"2026-08-05T21:19:45.556265Z","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-05T21:19:45.142828Z","title":null,"venue":null,"work_id":"f6d03eeb-70fc-4c24-abec-3deec611fdda","year":1987},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:40.256888Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:29da6ff6be3f9b656972b86465031edf1b14325860b14442e4f0d9e597a34ef2","observation_id":"c7bb11c1-ab2e-4c0b-897e-831203114c99","resolution":{"observed_at":"2026-08-05T21:19:45.282930Z","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-05T21:19:44.865871Z","title":"Distributed online optimiza tion over a heterogeneous network with any-batch mirror descent,","venue":null,"work_id":"68f8c692-4dfe-44fc-a6ea-c5adb8df1524","year":2020},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:40.334325Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:df3c3f8d59b844f4e7233bc7cd4868f4a65cbb0395f4a6d16166e74a6e03b62b","observation_id":"fb03830b-a0eb-4fd6-8dee-4b99a3b68981","resolution":{"observed_at":"2026-08-05T21:19:44.990721Z","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-05T21:19:44.011060Z","title":"Fast distrib uted gradient methods,","venue":null,"work_id":"663f4284-4db4-45f7-b723-2e11fb9c16cc","year":2014},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:40.391893Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:9d05b17ed63b6e0fa7d8bbb0fc5ae4dd893dc34cbb918980de0d62b52282aa05","observation_id":"d62b2227-3c0d-402b-98cd-75116ecb6066","resolution":{"observed_at":"2026-08-05T21:19:44.760905Z","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-05T21:19:43.629827Z","title":"On stochastic subgradient mirror- descent algo- rithm with weighted averaging,","venue":null,"work_id":"3d5379e2-cb07-4588-b494-55829239f3e0","year":2014},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:40.457410Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:d2559481906fa0c1180dc919dfe80b1735237828305e02bbc84fc1042dcd1bf4","observation_id":"c4eba08a-b0d8-40d4-8ec7-de14d1da3123","resolution":{"observed_at":"2026-08-05T21:19:43.736646Z","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-05T21:19:43.356888Z","title":"Event- triggered distributed stochastic mirror descent for convex optimiza tion,","venue":null,"work_id":"0e28060d-2e4c-4ed3-9dcf-8a72dd2e9fb7","year":2023},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:40.517287Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:8286b371cc505c717f7a16066fb6538344a221b7468ace88d44f3844793e0ddb","observation_id":"bd6c74a0-7d26-44a4-9dbc-dbdfd97ddbc2","resolution":{"observed_at":"2026-08-05T21:19:43.489949Z","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-05T21:19:43.097810Z","title":"Clustering with bregman divergences","venue":null,"work_id":"8b1cdf1c-a0e4-4b5b-a333-e8cff0d3aa70","year":2005},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:40.587343Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:0f781106bd3fc6f650c161047ac785fa26f9e597401989dcd355018401cc458e","observation_id":"47de33d6-b8ba-42af-a245-d0fffd7ab69a","resolution":{"observed_at":"2026-08-05T21:19:43.207725Z","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-05T21:19:42.847885Z","title":"Joint and separate con vexity of the bregman distance,","venue":null,"work_id":"c21a2db8-f0c4-4ec1-bd76-b6ce2d3d93af","year":2001},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:40.649219Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:9cc36b20a20fe0a253a993e945a396048df716ad23621e5cf6d6a083d720919b","observation_id":"a87e53b5-3313-4b30-b5c9-ca00b072d510","resolution":{"observed_at":"2026-08-05T21:19:42.960792Z","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-05T21:19:42.561111Z","title":"Matrix nearness problems with bregman divergences,","venue":null,"work_id":"e1acdbac-42c5-411f-a8c9-80a646b99444","year":2008},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:40.701714Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:887c2303a7fe72a404dd981fd50e0d71a06570d50243204eff99652d3ac74556","observation_id":"f833559d-8541-4481-bb18-eef2f76e06d1","resolution":{"observed_at":"2026-08-05T21:19:42.683197Z","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-05T21:19:42.220446Z","title":"Distributed on line convex optimization with time-varying coupled inequality constr aints,","venue":null,"work_id":"3efbb01b-c12b-4fd8-bbd1-019f42639b68","year":2020},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:40.771855Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:805c6af92dc0a936a8705a5c427293c6847b3d73c5f845389a661b8a58575827","observation_id":"f4b99897-3555-41e1-aaae-3cd518f9f3aa","resolution":{"observed_at":"2026-08-05T21:19:42.393706Z","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-05T21:19:41.892706Z","title":"Distributed online bandit learning in dynamic environments over unbalanced digraphs ,","venue":null,"work_id":"6df8c84d-6563-4348-88c8-c1c4863972b0","year":2021},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:40.822709Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:4e1645d5344dee83d17543d17ed67c606b8924b7c191a0551d799c367f771540","observation_id":"bb07dca5-c100-427b-a961-f6f59a795b57","resolution":{"observed_at":"2026-08-05T21:19:42.056780Z","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-05T21:19:41.602674Z","title":"Adaptive online learni ng in dynamic environments,","venue":null,"work_id":"1e285d4d-4c8a-40ee-8d82-95faabda35ef","year":2018},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:40.897992Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:66da052f827f66992bb1b079c7fc74038485383f436e672ddf29e2add1895be7","observation_id":"8ae4d77c-9881-47c6-8826-0c1804bd773e","resolution":{"observed_at":"2026-08-05T21:19:41.723504Z","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-05T21:19:41.438090Z","title":"Ben-Tal, L","venue":null,"work_id":"697a4169-6164-4fb5-9d6d-5d0c1baf74e8","year":2009},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:40.965971Z"},"links":{"citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:61ad99d8f8fd69c0e9c9d550ce36306759874de64967c560bb656c76132a31ca","observation_id":"00d6d545-41c3-43d4-8fb6-08d5aadb2919","resolution":{"observed_at":"2026-08-05T21:19:41.493524Z","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":"2306.05100","last_updated":"2024-06-03T00:32:53Z","snapshot_observed_at":"2026-08-17T15:15:25.748491Z","submitted_at":"2023-06-08T10:58:46Z","title":"Communication-Efficient Gradient Descent-Accent Methods for Distributed Variational Inequalities: Unified Analysis and Local Updates","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.05100","snapshot_observed_at":"2026-08-05T21:19:41.034612Z","title":"Comm unication- efficient gradient descent-accent methods for distributed variational inequalities: Unified analysis and local updates,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:41.034612Z"},"links":{"cited_paper":"/paper/2306.05100","citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:aad3c87b9069943ec983a07c98d17be5360120990639508cace42d0b72959842","observation_id":"b69aacd0-c102-4d82-a0cf-38f566ff496e","resolution":{"observed_at":"2026-08-05T21:19:41.034612Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":31,"verified_exact":1,"verified_fuzzy":21},"total_outbound_references":53},"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 18 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 0 inbound Pith citation observations for arXiv:2508.09411."}