{"as_of":"2026-08-21T06:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a30a0a4c40d58f4fc2bb62742846e8ff3bba512571180dbd8e82eddc45a6276a","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T14:49:21.541948Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2605.27831/citation-record","integrity":"/paper/2605.27831/integrity","json":"/paper/2605.27831/citation-record.json","paper":"/paper/2605.27831"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1909.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-14T19:15:36.367708Z","submitted_at":"2019-09-07T19:06:23Z","title":"Introduction to Online Convex Optimization","version":3},"cited_work":{"arxiv_id":"1909.05207","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1909.05207","snapshot_observed_at":"2026-07-03T23:39:03.761139Z","title":"2019.Introduction to Online Convex Optimization","venue":null,"work_id":"ec24f210-ae1a-4fd2-9b3d-11c11a21bc68","year":2023},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"cited_paper":"/paper/1909.05207","citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:0672f5c0b5a3a3461e6ac4f1c7f5123264bf5d57954833e6fafaa5d46be98227","observation_id":"d88be3c0-63b1-4e54-8d3e-e0f7efd16f14","resolution":{"observed_at":"2026-06-29T14:53:31.216422Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T14:49:21.541948Z","title":"Online Learning and Online Convex Optimization,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:b2d8a76e3fdcc782e47e48d47b5134fdb2b093e481732469a7e1002d8d716714","observation_id":"d67457e0-0dc2-42cd-a5ef-895601dc217b","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","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-06-29T14:49:21.541948Z","title":"Icml 2020 tutorial on parameter-free online optimization,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:be7fd301eb821411d5ad95d8c421c27b0e3aa800e96334996c59fa0e97a28c10","observation_id":"1fa50149-e476-406d-ba99-c3f42aa6d4fb","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.13213","last_updated":"2026-06-21T08:13:27Z","snapshot_observed_at":"2026-08-15T05:32:55.984958Z","submitted_at":"2019-12-31T08:16:31Z","title":"Online Learning: A Modern Introduction Using Convex Optimization","version":10},"cited_work":{"arxiv_id":"1912.13213","doi":null,"metadata_source":"pith","pith_arxiv_id":"1912.13213","snapshot_observed_at":"2026-07-04T10:39:44.912057Z","title":"A Modern Introduction to Online Learning","venue":"cs.LG","work_id":"e1cb6c30-151b-4dc8-a662-2c547f07874f","year":2019},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"cited_paper":"/paper/1912.13213","citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:d2861702e56176e770e4252ed90f3b52004298bcfaa50a03f7bb7fe61bdc04f2","observation_id":"0c8d36b6-7ee6-4dcd-ade7-5967c2eb9236","resolution":{"observed_at":"2026-06-29T14:53:31.219395Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T14:49:21.541948Z","title":"No-Regret Algorithms for Unconstrained Online Convex Optimization,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:f7f3dfc24629f44f5d0414578f7484c6851809eae45222e9ed1c122a019339ae","observation_id":"eb2535a8-645d-4252-b82e-d68125f2539a","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","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-06-29T14:49:21.541948Z","title":"Unconstrained Online Linear Learning in Hilbert Spaces: Minimax Algorithms and Normal Approximations,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:f67822e9a4aa652d47d19f4680ef0d95d68fc42ef00b6cc1e6b2c7ef96b890aa","observation_id":"a1a0ddfb-e0e3-4244-bfd8-068214de83ef","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1602.04128","last_updated":"2016-11-04T01:30:29Z","snapshot_observed_at":"2026-08-18T03:33:32.941575Z","submitted_at":"2016-02-12T17:11:42Z","title":"Coin Betting and Parameter-Free Online Learning","version":4},"cited_work":{"arxiv_id":"1602.04128","doi":null,"metadata_source":"pith","pith_arxiv_id":"1602.04128","snapshot_observed_at":"2026-06-29T14:53:31.229045Z","title":"1, 2, 3 4","venue":"cs.LG","work_id":"ddb3e95e-03a2-4995-957e-911476729464","year":2016},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"cited_paper":"/paper/1602.04128","citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:7bea0618c9514f45727132d224f59c902fcb54a5caad5254c7b5f617ca4ea56a","observation_id":"e306f460-f190-4017-96c0-abe24c33ecfb","resolution":{"observed_at":"2026-06-29T14:53:31.230270Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1703.02622","last_updated":"2017-03-07T22:14:53Z","snapshot_observed_at":"2026-08-17T21:46:34.101212Z","submitted_at":"2017-03-07T22:14:53Z","title":"Online Convex Optimization with Unconstrained Domains and Losses","version":1},"cited_work":{"arxiv_id":"1703.02622","doi":null,"metadata_source":"pith","pith_arxiv_id":"1703.02622","snapshot_observed_at":"2026-06-29T14:53:31.223512Z","title":"Online Convex Optimization with Unconstrained Domains and Losses","venue":"cs.LG","work_id":"9ad00e43-ea34-45ff-a811-496e25518160","year":2017},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"cited_paper":"/paper/1703.02622","citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:6110f4bbf9e7d131d042b3fd5c83207e70bb0f69698f40f7a80f65871f769600","observation_id":"96359aee-2210-4aa4-be5b-198807cdb9b4","resolution":{"observed_at":"2026-06-29T14:53:31.224765Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T14:49:21.541948Z","title":"Comparator-adaptive convex bandits,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:b3e3e4f0de0f7781f8f028244c665ba0bc10a047fac22390e305d9c9db81d0ac","observation_id":"dcc1b40b-af11-4eb1-bf1f-6dacdbab73f2","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","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-06-29T14:49:21.541948Z","title":"Distributed optimization in sensor networks,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:7c91ffbb8c0589a399c86812bac21b53839cbcd55e82c0f80f25b64a79879757","observation_id":"414a0187-e642-4f6a-9f74-cb4238f4b5a5","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","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-06-29T14:49:21.541948Z","title":"A simple peer-to-peer algorithm for distributed optimization in sensor networks,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:37facaea9e2f02ba93fc45a929815048db4842c57bac11e0e39875c68a513b90","observation_id":"666d14e4-991d-4fc0-821c-b9a2b296dac7","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","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-06-29T14:49:21.541948Z","title":"On the rate of convergence of distributed subgradient methods for multi-agent optimization,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:2839d8bbb0a4afea88e5f35616bcfafd20e3e38cd36415b270586c6d75615552","observation_id":"30c08421-cbd9-4445-a9c4-99e12354dcd3","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","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-06-29T14:49:21.541948Z","title":"Distributed Optimization for Control,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:27906f5e5ca609250106255c71f722d57b924fd22e552690eb8bdd975ecad811","observation_id":"d7b933b8-4d25-42d5-b59c-2762fb56c414","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","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-06-29T14:49:21.541948Z","title":"Cooperative online learning: Keeping your neighbors updated,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:59cc8107ec7f7e0cf60273d5bc131884b2e90def3b909d27344cfb64abb85cc5","observation_id":"d4db4938-9f23-4abc-a00e-a11ab6ba8065","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.04982","last_updated":"2024-08-09T20:52:26Z","snapshot_observed_at":"2026-08-16T18:18:27.490948Z","submitted_at":"2021-06-09T11:01:55Z","title":"Cooperative Online Learning with Feedback Graphs","version":5},"cited_work":{"arxiv_id":"2106.04982","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2106.04982","snapshot_observed_at":"2026-06-29T14:53:31.231428Z","title":"Cooperative online learning with feedback graphs,","venue":null,"work_id":"b42f2e2a-67eb-496b-bcca-f228466da958","year":2021},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"cited_paper":"/paper/2106.04982","citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:ecff681c028a967fa54ab6bcf2746fce3363cc0bab970d266e83bae68ddbd7c6","observation_id":"4899db2c-9a2a-4fed-8f58-6d2f15ce3e75","resolution":{"observed_at":"2026-06-29T14:53:31.232905Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.16477","last_updated":"2024-11-25T15:20:01Z","snapshot_observed_at":"2026-08-17T23:29:08.923237Z","submitted_at":"2024-11-25T15:20:01Z","title":"Distributed Online Optimization with Stochastic Agent Availability","version":1},"cited_work":{"arxiv_id":"2411.16477","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.16477","snapshot_observed_at":"2026-06-29T14:53:31.207431Z","title":"Distributed Online Optimization with Stochastic Agent Availability,","venue":null,"work_id":"affb3b1b-3808-4b29-a29f-95e89269d2e9","year":2024},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"cited_paper":"/paper/2411.16477","citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:d5b0b1ccc31b4b40a51aa6388a4b973c742456495455863a6870745eca396e3c","observation_id":"7c983e24-1e81-4da7-9486-ee3eeab3fdde","resolution":{"observed_at":"2026-06-29T14:53:31.208909Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T14:49:21.541948Z","title":"Multi-agent online optimization with delays: asynchronicity, adaptivity, and optimism,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:418c53ce3d9ae5e0f9e0bf780cc6ba6e993484003fed58d72cb9a511f02f9fa0","observation_id":"a72f4712-2d2d-4d8f-aef4-55e59bae7c92","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","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-06-29T14:49:21.541948Z","title":"Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:02bb5d83652dd1e9682c50b5fa3434e0952ea27cf8fbeb14a3ef115ae9cd4d36","observation_id":"8651cc0e-5edd-45c6-93cb-e67aec937f6d","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","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-06-29T14:49:21.541948Z","title":"Decentralized online optimization with global objectives and local communication,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:81d6d5ca3cdf239c38356fa471c7333ef9a7ace42460bf077fc2d935dfb4e755","observation_id":"deda073c-4b51-4f04-8821-83f95a58fbe1","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","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-06-29T14:49:21.541948Z","title":"Network Topology and Communication-Computation Tradeoffs in Decentralized Optimization,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:a2b541158b08d83d9f6d03a5a13b6def40fb969974a19e0e0f540c41fa178b89","observation_id":"c476a8bb-0ce7-4c1b-b658-2582c8b63978","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","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-06-29T14:49:21.541948Z","title":"Online distributed optimization via dual averaging,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:c0299193c718a4c95ecc3863cd458d1eb2fbbc975e31116400dc8a58f6227c9a","observation_id":"f1320130-9129-4f63-bc49-cf0abfbccaaa","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.07521","last_updated":"2021-10-25T15:58:22Z","snapshot_observed_at":"2026-08-17T14:16:12.168672Z","submitted_at":"2021-02-15T12:48:33Z","title":"Distributed Online Learning for Joint Regret with Communication Constraints","version":2},"cited_work":{"arxiv_id":"2102.07521","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2102.07521","snapshot_observed_at":"2026-06-29T14:53:31.220524Z","title":"Distributed Online Learning for Joint Regret with Communication Constraints,","venue":null,"work_id":"4712a66a-a6b5-47d8-a91c-deb7804f0cc0","year":2021},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"cited_paper":"/paper/2102.07521","citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:4c5d9c3842dc8d7dec71a43c4f11f733cced6162d63b7b6f9b89b29a12f05648","observation_id":"4b75703b-13d2-40e0-91be-66829a145dc0","resolution":{"observed_at":"2026-06-29T14:53:31.222117Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T14:49:21.541948Z","title":"QSGD: Communication-efficient SGD via gradient quantization and encoding,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:fb694f94a48485b466fc626a9e95ef8422754f2ae2dbc279bd717fe009dec5c7","observation_id":"7493feb0-00bb-4097-82b4-fde92d15e699","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","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-06-29T14:49:21.541948Z","title":"Sparsified SGD with memory,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:892f3dd37e8f21bdad681d81c04f4b907931a61aff921910156de681cffcef58","observation_id":"8b0beafc-6570-47c7-b235-93f20a8a3027","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","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-06-29T14:49:21.541948Z","title":"Advances and open problems in federated learning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:128973d05986e218efaf465176cabfdaca5f47914a7b62411725fb9cc909ba98","observation_id":"f5ad2aac-554e-4142-9ba6-1636f1076e8d","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","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-06-29T14:49:21.541948Z","title":"Error feedback fixes signSGD and other gradient compression schemes,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:41cfd82130bdd5cf9f2a4f43f382ee3ef59b46f30b1b51c50d0ffd1625c82eee","observation_id":"f1696ac3-e078-4992-a31d-270c7b765d90","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","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-06-29T14:49:21.541948Z","title":"EF21: A new, simpler, theoretically better, and practically faster error feedback,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:777cc8fd01e265ae31e98850f37d5165f6df24d1872bda49dc23ba2546a581cd","observation_id":"5e7fc25d-eade-4f7a-900d-8cfbd04f9fe6","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","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-06-29T14:49:21.541948Z","title":"A better alternative to error feedback for communication-efficient distributed learning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:da4b0a12a17aaffb72a7b110a38e98a74bf9868a5f4276aafef5ab00cb4c3aa6","observation_id":"3c61c743-3325-4313-9d7c-b51e0ef7e40e","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.00263","last_updated":"2023-08-01T03:50:58Z","snapshot_observed_at":"2026-08-16T15:11:45.684083Z","submitted_at":"2023-08-01T03:50:58Z","title":"Asynchronous Federated Learning with Bidirectional Quantized Communications and Buffered Aggregation","version":1},"cited_work":{"arxiv_id":"2308.00263","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2308.00263","snapshot_observed_at":"2026-06-29T14:53:31.226139Z","title":"Asynchronous federated learning with bidirectional quantized communications and buffered aggregation,","venue":null,"work_id":"9fb80931-6062-47a6-a42b-8ffbde0b0c19","year":2023},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"cited_paper":"/paper/2308.00263","citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:d7ffd1eeddca988c18cedc58ed6c9c0d0488386aa2e56617b21c5392b9fb792b","observation_id":"dce33899-84ac-4405-8976-88479c9eb457","resolution":{"observed_at":"2026-06-29T14:53:31.227850Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T14:49:21.541948Z","title":"Quantized and asynchronous federated learning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:7b1b8396779b3f78e8b63b1c3bd2876936bd43fddf614600f02ccb79d16633a3","observation_id":"cb13bdc9-5876-484f-b266-8685fc6b766e","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","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-06-29T14:49:21.541948Z","title":"Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communication,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:266969b5fbbf27d62dfde7f7aeef29925449afe2598adb80f6ae01cc5773f972","observation_id":"c6445b04-5385-41b4-92ff-0c7a8d31debb","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","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-06-29T14:49:21.541948Z","title":"Decentralized Deep Learning with Arbitrary Communication Compression,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:2c443ca3b99678087d84580f561044b213142290e0b31ddd585da1b10d39ec9b","observation_id":"1fc873b5-6837-4181-95cc-fbf5ffb1cf76","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","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-06-29T14:49:21.541948Z","title":"Distributed and quantized online multi-kernel learning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:359b5bd18b4ceb95c346d382d43812894f4bd41801be251e90b2f5610e32ffb3","observation_id":"6c365fcd-fb43-4ecc-a4bd-b6f48f6356e0","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","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-06-29T14:49:21.541948Z","title":"Gossiped and quantized online multi-kernel learning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:0e859363967496a90582c105c6c3215f0b4aa974577e2c568f32a807d6f26904","observation_id":"5bdf6d5f-72c6-4820-af89-f585c5566c66","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates","version":2},"cited_work":{"arxiv_id":"2412.04538","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.04538","snapshot_observed_at":"2026-06-29T14:53:31.212543Z","title":"Communication compression for distributed learning without control variates,","venue":null,"work_id":"e3df3f2f-8785-47a7-97fc-e9ac9005add7","year":2024},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"cited_paper":"/paper/2412.04538","citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:d71cb048cf9d5666e0a4c8975ad5f42528969efa605f6cb8fc8221a231d80032","observation_id":"843a879b-1351-4129-9d25-ab345fb9489d","resolution":{"observed_at":"2026-06-29T14:53:31.214001Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2512.22623","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T14:53:31.210010Z","title":"Communication compression for distributed learning with aggregate and server-guided feedback,","venue":null,"work_id":"8fcde28e-03cd-44b9-aab4-461c4cac91fb","year":2025},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:665343f76580dad8064d50536c19afda8ec404afaf9194f2f19a8dcb2174ca3d","observation_id":"e1ef3a50-35d8-4aa5-ae12-e80995a620c2","resolution":{"observed_at":"2026-06-29T14:53:31.211460Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.15644","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T14:53:31.204905Z","title":"Decentralized parameter-free online learning,","venue":null,"work_id":"af24c13e-23e6-47a9-ad3b-12cab83b260b","year":2025},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:7e1022916482fc742db0fd87fd731091233025be38875cd11ee896ad5133fbab","observation_id":"1b3b2d89-827a-4380-934e-037dcdf5e1c7","resolution":{"observed_at":"2026-06-29T14:53:31.206323Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T14:49:21.541948Z","title":"Improved regret for decentralized online convex optimization with compressed communication,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:a59f1336810e612be90ad2e2779b9360c1670977f8d5b1e604e73145a141a2a8","observation_id":"6a5882f5-d53f-4393-b81c-aa37fcfb5bb4","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","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-06-29T14:49:21.541948Z","title":"Decentralized online convex optimization with compressed communications,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:73e3c5cc22b33b2fb294cae8920456065c74eb28c3b4fff42deaaf4632cede3e","observation_id":"2ef0458c-6ef7-4a0d-b12e-261dcc1bac65","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","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-06-29T14:49:21.541948Z","title":"Randomized gossip algorithms,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:9604767f99025d95a9f6f2ff120e335d8be51df008991eb5af07fbe749db8da7","observation_id":"62decc10-d47c-4370-9090-0029c6061888","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","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-06-29T14:49:21.541948Z","title":"PowerSGD: Practical low-rank gradient compression for distributed optimization,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:3dc9975f30133e2a6c0f39c0d89a10800815095ae6e5ae7744e506766f6607f7","observation_id":"03cacdb8-60d4-4097-a13c-16a5beb551ef","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","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-06-29T14:49:21.541948Z","title":"LIBSVM: A library for support vector machines,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:a06b4f1ebcc2c52bef3f05349bed912c77f37d96c4a45b569d0e4c3b0ff8821c","observation_id":"c6cdb550-389d-49c3-be2f-2134b21b506e","resolution":{"observed_at":"2026-06-29T14:49:21.541948Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":31,"verified_exact":10,"verified_fuzzy":0},"total_outbound_references":42},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 0 inbound Pith citation observations for arXiv:2605.27831."}