{"as_of":"2026-08-08T05:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9ec486899978da5e32b202c0eb6c00602d68c9112a5dc3fc4c57120befef2a05","coverage":[{"denominator":58,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":58,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:59:36.950520Z","state":"measured"},{"denominator":58,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":58,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2505.23176/citation-record","integrity":"/paper/2505.23176/integrity","json":"/paper/2505.23176/citation-record.json","paper":"/paper/2505.23176"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:45.629465Z","title":"Federated dynamic sparse training: Computing less, communicating less, yet learning better","venue":null,"work_id":"9e0906db-be70-4bfd-ac3a-eb597a397103","year":2022},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:30.940629Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:c24a04acfeb9d6869fef5df86d8fd8e64d8b83b4c77d6b110c0239dbb5b6d8ba","observation_id":"1188c8c5-b763-4c10-b7de-1a607db3ff13","resolution":{"observed_at":"2026-08-07T12:59:45.772292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:45.413871Z","title":"Large-scale machine learning with stochastic gradient descent","venue":null,"work_id":"5cbdc52a-2d2b-4cf1-9e29-25050acd351c","year":2010},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:31.014173Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:fb606759055df3a4a48a8880c2f10e06ff6979168873e3c9a09e115010a52ca6","observation_id":"4a88a252-556f-45e8-b1e8-9a659277f53f","resolution":{"observed_at":"2026-08-07T12:59:45.509734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:45.185957Z","title":"Adaptive federated dropout: Improving communication efficiency and generalization for federated learning","venue":null,"work_id":"37c97a86-4779-478b-a165-3d59bffd0f50","year":2021},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:31.103008Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:b29371600176de110c3a66d7c9db6b91084cbe979604df0ccd0ad7846f010829","observation_id":"71801e6f-0555-46f7-a5f0-cab9b514d8b6","resolution":{"observed_at":"2026-08-07T12:59:45.292484Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1812.07210","last_updated":"2019-01-08T16:01:46Z","snapshot_observed_at":"2026-08-07T23:08:05.957777Z","submitted_at":"2018-12-18T07:31:18Z","title":"Expanding the Reach of Federated Learning by Reducing Client Resource Requirements","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.07210","snapshot_observed_at":"2026-08-07T12:59:31.255598Z","title":"B., and Talwalkar, A","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:31.255598Z"},"links":{"cited_paper":"/paper/1812.07210","citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:f4e357405f8ed4dd127413ce9d527e708b9385b8a5432d8bb1d951f7b54c4a06","observation_id":"6ea8efb2-8aae-4f1a-bef3-7e629be6c175","resolution":{"observed_at":"2026-08-07T12:59:31.255598Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:44.922691Z","title":"On generalization bounds of a family of recurrent neural networks","venue":null,"work_id":"923a80cb-a9ac-4d21-b422-5f197b1ea81a","year":2020},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:31.350912Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:b7522afbd2cad428bd3a6f732180b9f3e25fdd39b9c52d7b2bed14adc6c42d7e","observation_id":"816bba5b-0ec4-421a-b7e3-e65e05f762ec","resolution":{"observed_at":"2026-08-07T12:59:45.034728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:44.739099Z","title":"U., and Yurtsever, A","venue":null,"work_id":"a01eb0d9-ee68-42cd-a088-274695241069","year":2024},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:31.458737Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:059aa7be004b5de8ce20dd4c11648218580970aa4ef301849b2796f17b1b698c","observation_id":"b737cf8d-b92f-4bc7-b301-ba540da92a49","resolution":{"observed_at":"2026-08-07T12:59:44.836204Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:44.527699Z","title":null,"venue":null,"work_id":"e701a8a6-1037-4463-8100-79eabca84621","year":2023},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:31.524550Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:9a8ab048d40b51ae3bf59742afa3abe56d1a9260b556f9d9ee6ebd9459c483d8","observation_id":"3521487c-1af7-4f96-9eca-a6914d08537e","resolution":{"observed_at":"2026-08-07T12:59:44.617130Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:44.365721Z","title":"S., Kobyzev, I., Nia, V","venue":null,"work_id":"25e21a60-13c1-41b2-a4f9-154a52a2c215","year":2023},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:31.621077Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:1a50c2110e0c6e6a59651098d719d23c7ac80fb0be585afe41b2233fe4c3dbc4","observation_id":"f650a152-ea90-4b5b-9262-11002dcc29e9","resolution":{"observed_at":"2026-08-07T12:59:44.445449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:44.265919Z","title":"Deep sparse rectifier neural networks","venue":null,"work_id":"66b4697e-ba69-44ec-9c6f-6485c589a394","year":2011},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:31.723793Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:9f1f0aab6acd0b39ff42146997d9e1df285ba5bb32279051866e7d399fdfd674","observation_id":"fd2fb8a4-00e2-4069-be15-eae0d09b551c","resolution":{"observed_at":"2026-08-07T12:59:44.301401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:44.190825Z","title":"EF21-P and friends: Improved theoretical communication complexity for distributed optimization with bidirectional compression","venue":null,"work_id":"10709a8a-49b1-4ead-b63d-184df4a757d9","year":2023},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:31.889621Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:dcb4aee5001282a1fe1c0e2ae9f2be73c0da42a29bbcdd9168b813ac6bd364b5","observation_id":"c18d2636-5c05-4831-820c-d1af809e98a6","resolution":{"observed_at":"2026-08-07T12:59:44.237923Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:44.107252Z","title":"Lora+: Efficient low rank adaptation of large models","venue":null,"work_id":"dbe0c5dd-f23c-4493-81e5-27994b7a1ca5","year":2024},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:32.016690Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:f9d7bc5814cef1c125c0ed289b7f3fa5f1c2bc4dd5d3686b09bba73a0d8d2175","observation_id":"2e46e3ab-047e-473d-8cf3-4a5f93f60f7d","resolution":{"observed_at":"2026-08-07T12:59:44.142010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:44.015809Z","title":"Deep residual learning for image recognition","venue":null,"work_id":"87eb06f6-13c4-44b3-b3a2-1a09f47c8f9b","year":2016},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:32.137524Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:691ecd9fa0019adbf120f32ef2082197bfdddc25d98e4393faaacf4986dcee84","observation_id":"f9842699-dab3-4361-bb08-daa6912e9724","resolution":{"observed_at":"2026-08-07T12:59:44.048949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:43.933220Z","title":null,"venue":null,"work_id":"b132c921-b522-4987-996d-abe2dbe46773","year":2022},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:32.309235Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:18798f7c568af3dd033e79a9b78ed34583d5e58bea9243faf9ce57e06a992d17","observation_id":"54be768d-91fe-47be-8d2c-6c767d86d5ee","resolution":{"observed_at":"2026-08-07T12:59:43.971235Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:43.834455Z","title":"J., Shen, Y., Wallis, P., Allen - Zhu, Z., Li, Y., Wang, S., Wang, L., and Chen, W","venue":null,"work_id":"637e9811-659c-4d8b-bf86-3be2aef9acf8","year":2022},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:32.448778Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:9e38bfa09c64a590c2b9f6c47f829f237e6032eeb21d78edeaf2ece87c8230b0","observation_id":"c6703888-407a-48f9-ace9-e9c785fabafe","resolution":{"observed_at":"2026-08-07T12:59:43.879021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:43.736450Z","title":"Fedpara: Low-rank hadamard product for communication-efficient federated learning","venue":null,"work_id":"c340a98e-c351-4287-9b16-2a502f4c5f8a","year":2022},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:32.569013Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:24a539b1fc4a445e7355b59e3118f81efe2b37d9098ec486cab607ea192c8712","observation_id":"52242101-0396-4b5b-8623-9fd8ea70e20a","resolution":{"observed_at":"2026-08-07T12:59:43.767509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:43.656326Z","title":"and Szegedy, C","venue":null,"work_id":"e97023e3-3051-4729-b56b-7b202b0cae68","year":2015},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:32.709425Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:0ec685e32172e8a9d9a07fe9d74912b689b0b8c39a10954e62b1b9924c6a5dbb","observation_id":"202486ce-743a-4698-986b-d9232541aeca","resolution":{"observed_at":"2026-08-07T12:59:43.689110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:43.565897Z","title":"Sparse random networks for communication-efficient federated learning","venue":null,"work_id":"bedb1367-e3ab-44bc-b12a-6f1927f616ff","year":2023},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:32.827483Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:77200b33aa285e46c977ad3b8b21188ddd8bd821619c7bcd884e30a0fa00742a","observation_id":"6af0a4f9-b8b2-44e0-b7c2-da02d795bf52","resolution":{"observed_at":"2026-08-07T12:59:43.605644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:43.485844Z","title":"P., Rebjock, Q., Stich, S","venue":null,"work_id":"56d9e7f7-128d-4c21-815e-43f20531b4b3","year":2019},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:32.971552Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:8af2241ef4d8994b4aeb809aaf729b7fb995d052caef62b8f45f62e7358b92e3","observation_id":"171376e3-6209-4a52-91d4-fa5292fae125","resolution":{"observed_at":"2026-08-07T12:59:43.521214Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:43.370111Z","title":"B., Yu, F","venue":null,"work_id":"a1260bc7-c2f8-4f57-85e6-976c838fc440","year":2016},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:33.118311Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:34b05ee62083c34dc47efa85d3976908d80c7f89e91506c08cb628c9e1cbbdd6","observation_id":"1dec8dfc-8e8d-480c-8128-476d3760928a","resolution":{"observed_at":"2026-08-07T12:59:43.444411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:33.269994Z","title":"and Hinton, G","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:33.269994Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:ee740da6c6649ad7e718a16be9db402a423f4174e0baabaf669fe1f421bc092a","observation_id":"26233bbc-2415-491a-b4d5-dadb96fb0094","resolution":{"observed_at":"2026-08-07T12:59:33.269994Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:43.266358Z","title":"and Yang, X","venue":null,"work_id":"f3e0922a-896d-4987-988e-9e7436ee71ef","year":2015},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:33.397145Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:38484139ff9fbffd854dc3abb68df328bdbb2676997de5fd9d0480a46cff86ee","observation_id":"16fb9f6e-9f13-41c3-bd49-debd997471cb","resolution":{"observed_at":"2026-08-07T12:59:43.310044Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:43.153995Z","title":"Federated learning on non-iid data silos: An experimental study","venue":null,"work_id":"2f7c8b27-09a5-41e5-b06d-9c9a4141c8b7","year":2022},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:33.551288Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:a0bafee825d2a523a659b81b70146343c2a1bb8f04d3eff5b824e98f7e1e51f2","observation_id":"6883764d-1fb3-435b-a819-9c071177a14f","resolution":{"observed_at":"2026-08-07T12:59:43.190963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:43.008888Z","title":"Adaptive low-precision training for embeddings in click-through rate prediction","venue":null,"work_id":"93e24de7-fdfd-4db1-86c9-fabd9a62d208","year":2023},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:33.634967Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:f785065c16d54d30ec5a644ca88e055a37e6d7a93e9b6f70ba91cf284b562e82","observation_id":"2d6f5c57-928b-4c2d-bf37-be618556f222","resolution":{"observed_at":"2026-08-07T12:59:43.086387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:42.798046Z","title":"Masked random noise for communication-efficient federated learning","venue":null,"work_id":"db8f6c8d-479e-43fa-bdb6-d82c8f6d775c","year":2024},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:33.691242Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:456ab02a79f529d4303f36fc7144f8c05e8eeaa394e51e055555bde79cb0c52b","observation_id":"6cbc252b-063b-473c-a294-b9df7cb2de0a","resolution":{"observed_at":"2026-08-07T12:59:42.895608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:42.596668Z","title":"Embedding compression in recommender systems: A survey","venue":null,"work_id":"c6e21715-e552-4516-b9fd-f849131d9c34","year":2024},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:33.780218Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:40df1f109667fe6374ab2578473a0dfd8ce4c9124c1e03158f0248f134c97416","observation_id":"760bec13-9d11-4543-abe8-cceeea124d36","resolution":{"observed_at":"2026-08-07T12:59:42.711327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.20305","last_updated":"2024-10-17T13:19:08Z","snapshot_observed_at":"2026-07-06T19:24:35.007698Z","submitted_at":"2024-09-30T14:04:27Z","title":"Mixed-Precision Embeddings for Large-Scale Recommendation Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.20305","snapshot_observed_at":"2026-08-07T12:59:33.865423Z","title":"Mixed-precision embeddings for large-scale recommendation models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:33.865423Z"},"links":{"cited_paper":"/paper/2409.20305","citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:f8763eae6c9b807accd6b7dba5ef06392379753acfb0def0d4ea6a553f977d41","observation_id":"ae1d083a-d426-42f9-8210-e2f1c1b9a29e","resolution":{"observed_at":"2026-08-07T12:59:33.865423Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:42.368558Z","title":"Fedbat: Communication-efficient federated learning via learnable binarization","venue":null,"work_id":"08cde266-5f4e-40db-bb9d-45127a6eb92f","year":2024},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:33.957713Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:88d2666aaa9a63b65f9c334740cc03985d23957da06133433b29c15fb65cf183","observation_id":"56ca60dd-fadc-48e5-8fc3-7f5593ca9e0d","resolution":{"observed_at":"2026-08-07T12:59:42.464994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:42.151347Z","title":"Beyond zero initialization: Investigating the impact of non-zero initialization on lora fine-tuning dynamics","venue":null,"work_id":"56bf0fdd-4ac8-46a5-9965-74823aee48de","year":2025},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:34.048909Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:f5d940d10a171e4d2e9fb20d70be555f0997081c19d94e1a6507873a59d4d04b","observation_id":"164dac78-20e0-4dc6-b52b-f8d15ba19759","resolution":{"observed_at":"2026-08-07T12:59:42.249110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:41.930683Z","title":"Bora: Towards more expressive low-rank adaptation with block diversity","venue":null,"work_id":"5b7916db-83cf-4ec3-80b5-c5da8c447ad4","year":2025},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:34.135334Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:c0410b8b4a5337f339c97b2a138b34261ec2b4cfcf5cd1567be4b92b1a75fa15","observation_id":"f4495d22-a5e1-4955-be49-63d38c9b9839","resolution":{"observed_at":"2026-08-07T12:59:42.045018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:41.718508Z","title":"On the convergence of fedavg on non-iid data","venue":null,"work_id":"72ca3885-fff1-4119-a9f1-930ea7ee94a7","year":2020},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:34.223003Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:5bbacb6adb2a07e82a86f17c7aec82e25937e53b559c2976ba18fc5800c12aad","observation_id":"f1069f33-8c00-4c96-8806-4c0f28739c3e","resolution":{"observed_at":"2026-08-07T12:59:41.820805Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:41.519354Z","title":"Relora: High-rank training through low-rank updates","venue":null,"work_id":"736ac75a-2586-4595-8ad8-0b8e702d8abf","year":2024},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:34.317460Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:9a50051093949d4bef3adf7cb927ec0cad56b496d892ea8fce1d1ef8a3239987","observation_id":"89eb1d25-a938-4ab2-8cf0-889f704c798b","resolution":{"observed_at":"2026-08-07T12:59:41.608030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:41.362075Z","title":null,"venue":null,"work_id":"1dadec8d-ebd5-42ab-88fa-f209ba228723","year":2024},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:34.444322Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:fd8035858c323c1e482e81ea2e1c8f64b89a430687b92b63376f7ec8e45a1b4c","observation_id":"54cf3391-739f-4733-81c5-5c5189dce5e4","resolution":{"observed_at":"2026-08-07T12:59:41.429919Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:41.145114Z","title":"Mgr: Multi-generator based rationalization","venue":null,"work_id":"8f5d9997-74c5-42a0-b929-50e0a8ec1282","year":2023},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:34.525254Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:a1b88db9ad7ddd45d92a4f3b8e5424c781d692c647dff04e6442660929249106","observation_id":"f172aa8f-473b-411d-a462-fb8c5f950b7b","resolution":{"observed_at":"2026-08-07T12:59:41.224114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:40.968808Z","title":"D-separation for causal self-explanation","venue":null,"work_id":"ce9d703c-9912-41db-a719-d656f1d6d757","year":2023},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:34.587167Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:1d952c72d1ea4ff2a5d76997df5dcbbeec8dda47ea62eeac3ba190d32278853f","observation_id":"03d2d073-b658-4401-aa40-0e44d25f74de","resolution":{"observed_at":"2026-08-07T12:59:41.064801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:40.722442Z","title":"Is the mmi criterion necessary for interpretability? degenerating non-causal features to plain noise for self-rationalization","venue":null,"work_id":"8db01da0-cbff-4f8a-a07d-d2acddd6b768","year":2024},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:34.654605Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:5acfad6c4df5f217ccb05b4bd645cc4abd2de60a6207b5c1d3f3584729218af4","observation_id":"5c4995bb-90ef-45f9-b0d4-54970e50391b","resolution":{"observed_at":"2026-08-07T12:59:40.822753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:40.551782Z","title":"Enhancing the rationale-input alignment for self-explaining rationalization","venue":null,"work_id":"f04118dd-dd53-44ab-8de2-90b8216d3e13","year":2024},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:34.784786Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:b43eb49604f431460557e0679219c20c386003ae07f96f272700b934172d14be","observation_id":"5fd880f8-0c1a-4b12-ab9b-7726069066aa","resolution":{"observed_at":"2026-08-07T12:59:40.631288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:40.386787Z","title":"Exploring practical gaps in using cross entropy to implement maximum mutual information criterion for rationalization","venue":null,"work_id":"5129fdaf-048b-4afd-99b1-53cc16414055","year":2025},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:34.926971Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:8cad94256a7ad4d857f42413fc99ab5200aab8a6a8acc9313b50c513d7b05ef9","observation_id":"636612de-5b93-416f-8b75-67517c4d7362","resolution":{"observed_at":"2026-08-07T12:59:40.470304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:40.163848Z","title":"Breaking free from mmi: A new frontier in rationalization by probing input utilization","venue":null,"work_id":"fb21bc06-af5f-42fe-a4c0-7da51d90d5b0","year":2025},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:35.052079Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:da84632c9372d6fdfa2b737f9f459db0497dbcd2bfdafc53b6184b56b5316141","observation_id":"12c7166d-abc1-4c7d-8d55-66daee43ab7a","resolution":{"observed_at":"2026-08-07T12:59:40.277001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:39.973255Z","title":null,"venue":null,"work_id":"6214a6f6-9095-49f8-85f9-4493768a70f2","year":2018},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:35.145831Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:bdb550aafc37854918720f32a7bc264413ac0da4b4b6bb8b7b6fcad80c704a75","observation_id":"eadd02ec-4659-47fd-b78e-7f06d9f92563","resolution":{"observed_at":"2026-08-07T12:59:40.059970Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:39.800650Z","title":"A survey on lora of large language models","venue":null,"work_id":"f7971f79-1d86-4315-ae12-6c20bd28599b","year":2024},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:35.221778Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:d970b658aeea83dedd1068511925d8fc1d5c5f7b733eb2bd49aedd4cc9bec54c","observation_id":"78df04c9-5c7a-4ae2-be4a-118edeae1f2a","resolution":{"observed_at":"2026-08-07T12:59:39.877870Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:35.350297Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:35.350297Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:8db8a749701be4faa270e960918f67f5e9e661301e40cb86400ca4c85bf5ecb0","observation_id":"8775ffac-cca9-42d1-9ba2-857de3820554","resolution":{"observed_at":"2026-08-07T12:59:35.350297Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:39.621164Z","title":"Resource-adaptive federated learning with all-in-one neural composition","venue":null,"work_id":"612ad335-7993-4ac1-859b-daf457b5000f","year":2022},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:35.453751Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:2127b23cce3944a31881e7d36fd346230cae8f4069d77ec6bd59bad843a77411","observation_id":"db64008f-2dfb-45cf-843a-1a3c956ad281","resolution":{"observed_at":"2026-08-07T12:59:39.709670Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:39.450798Z","title":null,"venue":null,"work_id":"d8ba91e6-b91d-4ede-87ef-a9f20c33cb99","year":2011},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:35.525508Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:27cdab9e5af2e3e21f9eb92c104e26ad476d237bfa6c7e8c5e73557c7bf67c00","observation_id":"4a6684fc-5c96-463e-ae3d-c1472f60fbcb","resolution":{"observed_at":"2026-08-07T12:59:39.523695Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:39.251821Z","title":null,"venue":null,"work_id":"113fe76b-5bbe-492c-8ca4-1bf9968a96e0","year":2018},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:35.667914Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:1a3217c57421499d3f2ab66a01b143ba57028a9fa9d71c8e9f8ecfda60e6dd3e","observation_id":"ab874529-1b66-4643-a80c-405f298911d3","resolution":{"observed_at":"2026-08-07T12:59:39.365008Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:39.110693Z","title":null,"venue":null,"work_id":"b2313649-f62c-4890-9b06-e3cecc5b4e04","year":2022},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:35.784173Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:acecb48a4afe5fb985e1d3107dc48c71d04784f7b09a64347fb38633b629beec","observation_id":"e3a4b659-69a4-4223-8993-d5b399a7c516","resolution":{"observed_at":"2026-08-07T12:59:39.162347Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:38.907227Z","title":"Fedpaq: A communication-efficient federated learning method with periodic averaging and quantization","venue":null,"work_id":"6ae39764-e287-4b2d-b34d-073effb9e73c","year":2020},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:35.898242Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:48f1f05cbe698a3f60306111f57992a531a0a5f08c842c82e2a1470902994efa","observation_id":"53965c88-111c-4367-934d-77aa6b9bea32","resolution":{"observed_at":"2026-08-07T12:59:38.955301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:38.686919Z","title":"N., Kingsbury, B., Sindhwani, V., Arisoy, E., and Ramabhadran, B","venue":null,"work_id":"24b2c08b-cabb-4d81-b8f5-235baacebdb0","year":2013},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:35.992050Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:f02720f7351e9ada1676d027e319eb1e1c62b988316e0cbfa070d5156f5d705f","observation_id":"6320fa69-3b1b-414b-8b9e-babd56d7315a","resolution":{"observed_at":"2026-08-07T12:59:38.777748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:38.448627Z","title":null,"venue":null,"work_id":"5119ca83-ecb4-4030-aa14-7acbc09ed935","year":2022},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:36.082024Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:d493ac6304ca04f11adaca8504ee85f2f268d07f49e56c02fff2dffa7b9b4f4d","observation_id":"f40d9880-b9d4-4a07-9f28-d6b6df000205","resolution":{"observed_at":"2026-08-07T12:59:38.583347Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:38.304335Z","title":"Improving lora in privacy-preserving federated learning","venue":null,"work_id":"e606be16-9877-408e-a4db-37742518c08f","year":2024},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:36.130103Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:878d67f37e63954a5ee25b01258079372a1999b9d4508f999657e909e3214092","observation_id":"5f78b847-c383-4495-ba2d-a7fc47ee0aa7","resolution":{"observed_at":"2026-08-07T12:59:38.337272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:38.180983Z","title":"Doublesqueeze: Parallel stochastic gradient descent with double-pass error-compensated compression","venue":null,"work_id":"322561ba-afdc-4094-af4b-97b27b0a046b","year":2019},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:36.197430Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:3f1eaff9ef4eae9014c63f05d7df60083fd2db63a6bcbe2dffafee4cc39ad8cd","observation_id":"e9d2fc8d-1dc0-4f0a-953d-b3115dd59888","resolution":{"observed_at":"2026-08-07T12:59:38.225687Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:38.050567Z","title":"Decoupling general and personalized knowledge in federated learning via additive and low-rank decomposition","venue":null,"work_id":"ef52be63-0fa7-46d0-8118-e1858d7e43c5","year":2024},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:36.275875Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:5f43fbbfde60344b21bfee151fa7e3b25aeb5db9d3a0bf90d9b464b6b538d858","observation_id":"71328d49-fcf3-43b5-94d1-450f2d98b816","resolution":{"observed_at":"2026-08-07T12:59:38.096713Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:36.336790Z","title":"Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:36.336790Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:c4514400e131bd52f10f8c2b9bd060655d6be60dbb4a301ee0184f77a1bd523b","observation_id":"949187dc-3082-4caa-87f3-6702317c7aa9","resolution":{"observed_at":"2026-08-07T12:59:36.336790Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:37.924383Z","title":"Communication-efficient federated learning with binary neural networks","venue":null,"work_id":"02440580-5d9a-40a3-9a6f-dc7bb9e94ce5","year":2021},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:36.409376Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:1cc7a8e29f2ccea3661b96765384d076e8aa5e61d5591c8981d493166f6ff4a4","observation_id":"52c28638-7dc0-45cd-bb60-97f530705ea4","resolution":{"observed_at":"2026-08-07T12:59:37.971708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:37.774752Z","title":"Fedhm: Efficient federated learning for heterogeneous models via low-rank factorization","venue":null,"work_id":"b505f0af-0dfa-40d2-b994-3f0306c21bd9","year":2021},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:36.533839Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:f05807f010f15fb80fef4aaa3981aadb09af2af70dc95dd07167da975b2994fa","observation_id":"b9cb03b2-28c5-442e-86e0-4d0e6a8d0bc6","resolution":{"observed_at":"2026-08-07T12:59:37.854603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:37.605061Z","title":"Parallel restarted SGD with faster convergence and less communication: Demystifying why model averaging works for deep learning","venue":null,"work_id":"0eb266e3-2a65-4bfe-801f-eccb5015b6d0","year":2019},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:36.625166Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:33e7e2377273aab36cf25b1d70d346e74ec962a524b76be74a8b7b1d5c8866ce","observation_id":"b605ee28-ee8f-428d-a9e6-fc553183e39d","resolution":{"observed_at":"2026-08-07T12:59:37.679532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:37.430260Z","title":"H., Hoang, T","venue":null,"work_id":"877725c5-4bec-4cf6-b862-1635522e4f26","year":2019},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:36.667589Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:b8eae4e495f266acf8ddfa71f20990bbd3854af229cf61f2e6d3bddb22c5003a","observation_id":"58132511-13ed-436d-90a9-36de9f1e2e19","resolution":{"observed_at":"2026-08-07T12:59:37.511730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:37.200292Z","title":"M., and Gu, Q","venue":null,"work_id":"ed1d6ac5-e11d-4edb-b299-6ef20742411f","year":2020},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:36.827120Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:bc5f69c6f5b1fc0dacceaba6f33879bbcb663683fd5c238cc6733a0f095c093f","observation_id":"473a39c1-9cc9-48b4-975b-2bae6fa9c986","resolution":{"observed_at":"2026-08-07T12:59:37.288634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:59:36.950520Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","version":2},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-07T12:59:36.950520Z"},"links":{"citing_paper":"/paper/2505.23176"},"observation_digest":"sha256:cb46a1d7e48409b5fbe00918c8a914b93b318be9bf5fbbc08801fd7b4708ef92","observation_id":"9eadfe3e-cbe1-480b-a4d4-2d1cb3e591b9","resolution":{"observed_at":"2026-08-07T12:59:36.950520Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.23176","last_updated":"2025-08-17T05:25:34Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T12:49:08.463596Z","submitted_at":"2025-05-29T07:14:32Z","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning"},"reference_resolution":{"displayed":58,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":0,"verified_fuzzy":44},"total_outbound_references":58},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 58 of 58 outbound references and 0 inbound Pith citation observations for arXiv:2505.23176."}