{"as_of":"2026-08-16T14:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:876f66078df5cb7be751eeb532bf47d6c8d62b96483e8a5bf6493c3a0a01bd11","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T22:56:50.252245Z","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-23T19:03:21.930561Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.06412","last_updated":"2024-11-02T18:54:03Z","snapshot_observed_at":"2026-08-16T14:19:53.568422Z","submitted_at":"2024-02-09T13:58:33Z","title":"Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity","version":2},"cited_work":{"arxiv_id":"2402.06412","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.06412","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Improving the worst-case bidirectional communication complexity for nonconvex distributed optimization under function similarity","venue":null,"work_id":"f89e2563-36a0-41de-bc22-0c442f84f10e","year":2024},"citing_paper":{"arxiv_id":"2410.15368","last_updated":"2026-04-18T10:06:33Z","snapshot_observed_at":"2026-08-13T23:17:23.005963Z","submitted_at":"2024-10-20T11:53:25Z","title":"Tighter Performance Theory of FedExProx","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-23T18:58:32.168274Z"},"links":{"cited_paper":"/paper/2402.06412","citing_paper":"/paper/2410.15368"},"observation_digest":"sha256:47e918495f1ae817e968f5dd55766a2ae0fe3c2bca91378ba72e2f734fef794c","observation_id":"faa73b77-e17d-451c-9ebb-713abb605761","resolution":{"observed_at":"2026-05-23T19:03:21.933823Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.06412","last_updated":"2024-11-02T18:54:03Z","snapshot_observed_at":"2026-08-16T14:19:53.568422Z","submitted_at":"2024-02-09T13:58:33Z","title":"Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.06412","snapshot_observed_at":"2026-08-10T15:45:44.687003Z","title":"Improving the worst- case bidirectional communication complexity for nonconvex distributed optimization under function similarity,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13784","last_updated":"2025-01-23T16:01:41Z","snapshot_observed_at":"2026-08-12T23:39:00.972504Z","submitted_at":"2025-01-23T16:01:41Z","title":"Rate-Distortion Region for Distributed Indirect Source Coding with Decoder Side Information","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:44.687003Z"},"links":{"cited_paper":"/paper/2402.06412","citing_paper":"/paper/2501.13784"},"observation_digest":"sha256:30201729b9dfb05373f9f100eb6282b502bd99226df3dc71f18152457a3bb42d","observation_id":"052a88be-930b-4706-932f-515c0a564610","resolution":{"observed_at":"2026-08-10T15:45:44.687003Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.06412","last_updated":"2024-11-02T18:54:03Z","snapshot_observed_at":"2026-08-16T14:19:53.568422Z","submitted_at":"2024-02-09T13:58:33Z","title":"Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.06412","snapshot_observed_at":"2026-08-09T19:54:41.570533Z","title":"Improving the worst-case bidirectional communication complexity for nonconvex distributed optimization under function similarity","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.570533Z"},"links":{"cited_paper":"/paper/2402.06412","citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:16af97f1782e341063a8536c3702d810af9b1aecf7de6e00770a9756a4cb5f3f","observation_id":"d642548d-837f-453f-8cae-b46953b186fd","resolution":{"observed_at":"2026-08-09T19:54:41.570533Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.06412","last_updated":"2024-11-02T18:54:03Z","snapshot_observed_at":"2026-08-16T14:19:53.568422Z","submitted_at":"2024-02-09T13:58:33Z","title":"Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.06412","snapshot_observed_at":"2026-08-15T22:56:50.252245Z","title":"High-probability convergence for com- posite and distributed stochastic minimization and variational inequalities with heavy-tailed noise","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.06053","last_updated":"2025-05-09T13:49:05Z","snapshot_observed_at":"2026-08-15T22:47:04.855470Z","submitted_at":"2025-05-09T13:49:05Z","title":"Safe-EF: Error Feedback for Nonsmooth Constrained Optimization","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-15T22:56:50.252245Z"},"links":{"cited_paper":"/paper/2402.06412","citing_paper":"/paper/2505.06053"},"observation_digest":"sha256:80ce75f4b7dd1ec749dd01599a23f9bffd92f207c6910d69aec8dbc652af8f62","observation_id":"ea2fbeca-6d45-489a-b3d5-b2d276389c19","resolution":{"observed_at":"2026-08-15T22:56:50.252245Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2402.06412/citation-record","integrity":"/paper/2402.06412/integrity","json":"/paper/2402.06412/citation-record.json","paper":"/paper/2402.06412"},"outbound":[],"paper":{"arxiv_id":"2402.06412","last_updated":"2024-11-02T18:54:03Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T14:19:53.568422Z","submitted_at":"2024-02-09T13:58:33Z","title":"Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2402.06412."}