{"as_of":"2026-08-15T01:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c36b91368611b9b64272f160b8e75c0966c7c0ec7db698823ad8f3916faa0f50","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T11:54:16.657309Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-23T21:05:48.838136Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2010.13112","last_updated":"2025-04-25T08:07:28Z","snapshot_observed_at":"2026-08-13T21:13:58.150273Z","submitted_at":"2020-10-25T13:13:44Z","title":"Distributed Saddle-Point Problems: Lower Bounds, Near-Optimal and Robust Algorithms","version":9},"cited_work":{"arxiv_id":"2010.13112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2010.13112","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Distributed saddle-point problems: Lower bounds, near-optimal and robust algorithms","venue":null,"work_id":"547ccc5a-79b6-4963-aca9-ba3702e44a8f","year":2010},"citing_paper":{"arxiv_id":"2409.13428","last_updated":"2026-05-15T01:05:37Z","snapshot_observed_at":"2026-07-06T19:18:41.002837Z","submitted_at":"2024-09-20T11:49:02Z","title":"Methods for Solving Variational Inequalities with Markovian Stochasticity","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-23T21:05:29.555278Z"},"links":{"cited_paper":"/paper/2010.13112","citing_paper":"/paper/2409.13428"},"observation_digest":"sha256:989115fc71bcef2feedd840434b0176af253805b895577e2f46d6b0b2715a363","observation_id":"b3d45afd-698c-41d5-be75-4439e47b29d0","resolution":{"observed_at":"2026-05-23T21:05:48.841681Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.13112","last_updated":"2025-04-25T08:07:28Z","snapshot_observed_at":"2026-08-13T21:13:58.150273Z","submitted_at":"2020-10-25T13:13:44Z","title":"Distributed Saddle-Point Problems: Lower Bounds, Near-Optimal and Robust Algorithms","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.13112","snapshot_observed_at":"2026-08-11T11:54:16.657309Z","title":"Distributed saddle-point problems: Lower bounds, near-optimal and robust algorithms","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2412.14935","last_updated":"2024-12-19T15:11:52Z","snapshot_observed_at":"2026-08-12T16:06:33.603947Z","submitted_at":"2024-12-19T15:11:52Z","title":"Effective Method with Compression for Distributed and Federated Cocoercive Variational Inequalities","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T11:54:16.657309Z"},"links":{"cited_paper":"/paper/2010.13112","citing_paper":"/paper/2412.14935"},"observation_digest":"sha256:5d62e3dacab40470bad3666eb52c1c2641008359fb4f9a3fe4dae564a7b1c781","observation_id":"0fe88037-d193-4fa9-90da-0dcee593dfd7","resolution":{"observed_at":"2026-08-11T11:54:16.657309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.13112","last_updated":"2025-04-25T08:07:28Z","snapshot_observed_at":"2026-08-13T21:13:58.150273Z","submitted_at":"2020-10-25T13:13:44Z","title":"Distributed Saddle-Point Problems: Lower Bounds, Near-Optimal and Robust Algorithms","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.13112","snapshot_observed_at":"2026-08-10T22:56:12.904820Z","title":"Distributed saddle-point problems: Lower bounds, near-optimal and robust algorithms","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2501.00511","last_updated":"2024-12-31T15:49:25Z","snapshot_observed_at":"2026-08-11T12:29:24.709376Z","submitted_at":"2024-12-31T15:49:25Z","title":"Stochastic Extragradient with Flip-Flop Shuffling & Anchoring: Provable Improvements","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T22:56:12.904820Z"},"links":{"cited_paper":"/paper/2010.13112","citing_paper":"/paper/2501.00511"},"observation_digest":"sha256:46c02c435a90825e8f5df9c701039f13e5122a215669140315352fe64ad3a04c","observation_id":"9b401f3a-289a-4a8f-a322-0f42db94cc16","resolution":{"observed_at":"2026-08-10T22:56:12.904820Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.13112","last_updated":"2025-04-25T08:07:28Z","snapshot_observed_at":"2026-08-13T21:13:58.150273Z","submitted_at":"2020-10-25T13:13:44Z","title":"Distributed Saddle-Point Problems: Lower Bounds, Near-Optimal and Robust Algorithms","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.13112","snapshot_observed_at":"2026-08-05T14:28:37.091682Z","title":"Distribu ted saddle- point problems: Lower bounds, near-optimal and robust algo rithms,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2508.21431","last_updated":"2025-08-29T08:59:04Z","snapshot_observed_at":"2026-08-07T21:20:54.619121Z","submitted_at":"2025-08-29T08:59:04Z","title":"An Optimistic Gradient Tracking Method for Distributed Minimax Optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T14:28:37.091682Z"},"links":{"cited_paper":"/paper/2010.13112","citing_paper":"/paper/2508.21431"},"observation_digest":"sha256:c4e682ea9d642c1724cfa5eb481891c3e3f0ee39f12a6baa0d8ec72fd70aa0f0","observation_id":"4beb1588-ab4c-48f2-9d82-d7fb2013c468","resolution":{"observed_at":"2026-08-05T14:28:37.091682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.13112","last_updated":"2025-04-25T08:07:28Z","snapshot_observed_at":"2026-08-13T21:13:58.150273Z","submitted_at":"2020-10-25T13:13:44Z","title":"Distributed Saddle-Point Problems: Lower Bounds, Near-Optimal and Robust Algorithms","version":9},"cited_work":{"arxiv_id":"2010.13112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2010.13112","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Distributed saddle-point problems: Lower bounds, near-optimal and robust algorithms","venue":null,"work_id":"547ccc5a-79b6-4963-aca9-ba3702e44a8f","year":2010},"citing_paper":{"arxiv_id":"2605.22644","last_updated":"2026-05-21T15:50:40Z","snapshot_observed_at":"2026-08-12T12:23:14.587330Z","submitted_at":"2026-05-21T15:50:40Z","title":"Why SGD is not Brownian Motion: A New Perspective on Stochastic Dynamics","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-05-22T08:06:52.309619Z"},"links":{"cited_paper":"/paper/2010.13112","citing_paper":"/paper/2605.22644"},"observation_digest":"sha256:2ddc3a86e0432a25fdfa1d4f60de141c73ffdd119e55c63379d75be50864a307","observation_id":"c065dc6d-4bee-42d7-88bd-61ac3a9ccbad","resolution":{"observed_at":"2026-05-22T08:11:17.449221Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2010.13112/citation-record","integrity":"/paper/2010.13112/integrity","json":"/paper/2010.13112/citation-record.json","paper":"/paper/2010.13112"},"outbound":[],"paper":{"arxiv_id":"2010.13112","last_updated":"2025-04-25T08:07:28Z","latest_version":9,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T21:13:58.150273Z","submitted_at":"2020-10-25T13:13:44Z","title":"Distributed Saddle-Point Problems: Lower Bounds, Near-Optimal and Robust Algorithms"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2010.13112."}