{"as_of":"2026-08-10T05:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:55f276d01133f367c0213cb58631ca05723edaf893e41b563a5dd28c1239d30e","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-09T06:31:02.800959+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-06T03:42:24.250183Z","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-08T04:42:10.219522Z","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:4e6d1b10a8499a0f1b1efc8267ad8828420bf7a4215dc552cc9e3c887be5ab68","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T04:42:10.219522Z","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:99accfd5727de65eb02df822aa945832a0b4c9a81f47b1fe416fac50448042bc","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-08T04:42:10.219522Z","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:7f5004ba142263bf5369f1f326767c47bd1317915402f342f14bdd87af442c1f","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-07-06T08:47:45.187408Z","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-08T04:42:10.219522Z","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:b16b71027b43312fc60d55e5b3309d65947e69b05bef2d5f5892f8e635a40758","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T04:42:10.219522Z","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:089c2b9f36c1e08f9ca03a9ed4836424b6aa3e6607d86b5484ad9172da7d67f6","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-08T04:42:10.219522Z","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:11a62f3b4710bf95d1368b8172b3b136e243c2f12412fb6d37c13dd5fa07fa10","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-09T06:21:20.528587Z","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-08T04:42:10.219522Z","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:6bfd5d4583f70a44cfbd88ff14b5ef9339bc1122b366c7a2687f195d17dfd885","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T04:51:20.050366Z","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-08T04:42:10.219522Z","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:e480dd09cf291822c6f47a63f6cfd84acb9856911477caab695a817df9e4aefc","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T04:42:10.219522Z","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:2d2bda801ee9f53ecce9c445b6c44c8a1d1ef8ccf2c07beb28ccad2509128796","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-08T04:42:10.219522Z","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:5c026ab567c89daea843f4a489584bc280bd749ecbf8326bd5bd55a777557fc2","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-08T04:42:10.219522Z","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:2c7f91e59dc33e9a3900ee47154e25e1629d08fa7f824403bd66606adcaf7a10","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-08T04:42:10.219522Z","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:967c43bbb0ab9cde840b5abfdac39b01aefce051ce73e52153bf1d16404830dc","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-08T04:42:10.219522Z","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:fa51395452502d08c1159f9697d201a8b34302c843b1d395eac65d123ee2f36d","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-08T04:42:10.219522Z","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:cd51d1de00a412b9547f99ae1afabf2342ee78a07a408ed286d58050bcc448fc","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-07-06T11:17:31.238458Z","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-08T04:42:10.219522Z","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:c17a80e078fa983f676f18deeca13b9307b056098c68416c003d0f4cc7267c02","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T08:44:46.439860Z","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-08T04:42:10.219522Z","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:656286e11401fe0efcad34e3b6c5e8a1a4af1f9bbec7e4253bf5ef60109843f0","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T04:42:10.219522Z","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:6ffc7d3fc0068af7a80f06d8dfa8ef016383ef4daef52d25dd852304491fd38e","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-08T04:42:10.219522Z","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:b469b00940b9c7475df8c9c70dd07cffdd792a2fd3bda19a6444541aad4b073d","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-08T04:42:10.219522Z","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:b0f3370cf9996b7849569bb9ab597e943686a961d31f50aa44a220cf78af6bdb","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-08T04:42:10.219522Z","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:bc90a57d60e08335c7f2e332de8ecdbb1c3cae3c08e34df1c7bacd1bfe9d77eb","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-08T04:42:10.219522Z","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:9ed47df0a19bc70e19f631f713407bd243a78bc077011dde4a5d9c4f779d3e6f","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-09T08:48:47.097379Z","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-08T04:42:10.219522Z","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:534ce1b63c800447349dd2c0c6b64797f05c0b26467f249b759d753aebbaabc8","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T04:42:10.219522Z","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:9f4f3e2cb14352739d0c7f7bd2ddb425e74635556be6bc1d4a02a4e47439287f","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-08T04:42:10.219522Z","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:39de1f5230ee6f28f2a6669f61b7d85fa6b054a5939826f4ea9d2e06dc827ac7","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-08T04:42:10.219522Z","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:22d2e98f0aa3e09b9ea285c6f5e9a5b211f277249606a8645c74704c1499c8f9","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-08T04:42:10.219522Z","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:affdbbbb7eb4c40f3ddfd335f156c31e30967ad1ec58557df87f17e7560d5731","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-08T04:42:10.219522Z","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:abb55779accb7bbaa742731ab1f29ac4ef98a0cba387a640fc54db0b1a754aa7","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-08T04:42:10.219522Z","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:7afa814ce4184cdd8a6c13225325e37f5934ade9ff1841fbdc67da60a2e039e1","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-07-06T16:01:03.635085Z","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-08T04:42:10.219522Z","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:565e806498b12e3870a314b6199075076616ebd180093626a879b1a6ad32c6fc","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T04:42:10.219522Z","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:95d4c2da3ffca2412950cfd32d74e4ba741620dd7e4f80a5661f80047081e485","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-08T04:42:10.219522Z","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:12eddb00ecc090a834d849f1be96513cd6be0d32968f2fe047649d3ea496f2a2","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-08T04:42:10.219522Z","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:6b6bce39e3c3bc07df8349451775f708aa041a682afe09b4d2a9604e1adee2c2","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-08T04:42:10.219522Z","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:7dfc179a87bc0c5f619915fe9e7b11d11c59d2eba8a47370fe8c206ddf84987a","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-08T04:42:10.219522Z","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:e98969638d9dffea721fc043396606bff9dd5ccea6d26b502c7194b05e9e2c7a","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-07-06T20:02:26.756229Z","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-08T04:42:10.219522Z","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:9d4fdb4b388232218965e4afa418120ad8ef3f8020150226fe5d11f5bfd2ac9a","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T04:42:10.219522Z","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:6da3baa3777ffa821bdef9565628fd0feb6b1bac548a02936341ca5987a0bbd0","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T04:42:10.219522Z","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:dc7f86eda2b44162f0c36bd056461a115a9f409ac00448982ea3e141a1cc70d6","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T04:42:10.219522Z","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:4e1460c353d3c06b46f09ef18582e473d1bd880ce841bbb4d976b112ad55585f","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-08T04:42:10.219522Z","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:a450b81043604580d5ca3a8751491eea37bfe6cf7c0c42cfc491923347d82f15","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-08T04:42:10.219522Z","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:a38ca00f1cd9b98d7015ae1a588412c525a76989844e926a8e7c01db79b90db3","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-08T04:42:10.219522Z","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:3185ed0a08c36e6833487b85a7ea3f553efd72cb6ff65317beb31961a15457de","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-08T04:42:10.219522Z","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:461341d004138e5cb11570b14ec4f009c839ecab9e846937c7464cb26bdbb47d","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-08T04:42:10.219522Z","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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 0 inbound Pith citation observations for arXiv:2605.27831."}