{"as_of":"2026-08-07T19:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0f0c1fe72f7114bbda9187418d8b8d3c7489cd40d8f7df0e099ce2ad54bab762","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T21:27:28.229511Z","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-20T08:43:10.159263Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2109.00534","last_updated":"2021-09-01T15:18:33Z","snapshot_observed_at":"2026-07-06T11:43:28.084184Z","submitted_at":"2021-09-01T15:18:33Z","title":"The Minimax Complexity of Distributed Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.00534","snapshot_observed_at":"2026-08-06T21:27:28.229511Z","title":"The minimax complexity of distributed optimization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.00195","last_updated":"2025-06-30T19:06:02Z","snapshot_observed_at":"2026-08-06T21:19:32.997766Z","submitted_at":"2025-06-30T19:06:02Z","title":"What Makes Local Updates Effective: The Role of Data Heterogeneity and Smoothness","version":1},"reference_index":152,"source":"pdf_text","source_observed_at":"2026-08-06T21:27:28.229511Z"},"links":{"cited_paper":"/paper/2109.00534","citing_paper":"/paper/2507.00195"},"observation_digest":"sha256:e188e79c04270133c42922c222424f050ae0c81c1bdacb7098568bdece803ba5","observation_id":"b4562521-59a2-4c1b-8821-4153b0b983d0","resolution":{"observed_at":"2026-08-06T21:27:28.229511Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.00534","last_updated":"2021-09-01T15:18:33Z","snapshot_observed_at":"2026-07-06T11:43:28.084184Z","submitted_at":"2021-09-01T15:18:33Z","title":"The Minimax Complexity of Distributed Optimization","version":1},"cited_work":{"arxiv_id":"2109.00534","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2109.00534","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2109.00534 , year=","venue":null,"work_id":"a04aff4e-a9b6-473e-98a9-d97f4e153f6b","year":null},"citing_paper":{"arxiv_id":"2605.18604","last_updated":"2026-05-18T16:14:04Z","snapshot_observed_at":"2026-07-06T23:29:29.105126Z","submitted_at":"2026-05-18T16:14:04Z","title":"Efficient Gradient Methods for Distributed Saddle Problems","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-20T08:39:37.686041Z"},"links":{"cited_paper":"/paper/2109.00534","citing_paper":"/paper/2605.18604"},"observation_digest":"sha256:e94cbc61267ff05e2de457d14bc61e0eee4176618f80308231b09d9f27d87354","observation_id":"a75a72de-458c-4aa5-8967-0a0ec3e75147","resolution":{"observed_at":"2026-05-20T08:43:10.160692Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.00534","last_updated":"2021-09-01T15:18:33Z","snapshot_observed_at":"2026-07-06T11:43:28.084184Z","submitted_at":"2021-09-01T15:18:33Z","title":"The Minimax Complexity of Distributed Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.00534","snapshot_observed_at":"2026-08-02T01:23:33.887318Z","title":"The minimax complexity of distributed optimization.arXiv preprint arXiv:2109.00534, 2021.(Cited on pages 3 and 34)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.14731","last_updated":"2026-07-16T08:56:45Z","snapshot_observed_at":"2026-08-03T18:32:12.673941Z","submitted_at":"2026-07-16T08:56:45Z","title":"What's in a Smoothness Constant? Tighter Rates for Local SGD with Bounded Second-order Heterogeneity","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-02T01:23:33.887318Z"},"links":{"cited_paper":"/paper/2109.00534","citing_paper":"/paper/2607.14731"},"observation_digest":"sha256:53b4c789377f2ebb820644829ef90f92a3ca17e136caea3dd6f7d7811f83d1ca","observation_id":"1045e958-2ddc-4e31-b309-b5cea591628d","resolution":{"observed_at":"2026-08-02T01:23:33.887318Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2109.00534/citation-record","integrity":"/paper/2109.00534/integrity","json":"/paper/2109.00534/citation-record.json","paper":"/paper/2109.00534"},"outbound":[],"paper":{"arxiv_id":"2109.00534","last_updated":"2021-09-01T15:18:33Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T11:43:28.084184Z","submitted_at":"2021-09-01T15:18:33Z","title":"The Minimax Complexity of Distributed Optimization"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2109.00534."}