{"as_of":"2026-08-11T13:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f4100e0330b0ee7e7718fa8fb9c5a6e1176268cbc4f4049f08e6d89f579c0cfb","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-11T06:34:44.6726+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-09T07:03:58.289133Z","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:dd55f99b1e75acb534dea74d64e71e182d3beb758fb8a976d8ceebd6565d1f31","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:5135d021d6ed0c561e890bf4d9a8a43b5dfce3fdeb13ba3b53d7b10b196c85b7","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:a12a734b4caedd9e1388095d734ec1eecfcb09efcaa7313a1a556fe9620a545d","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:58647d6b86860072ad930d48762191d823f2e99b2c2a3edf0013514e300c5708","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-09T07:03:58.289133Z","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:a1c5bf702f92b064b8c26739aa634254151514b9ac8ab10051b6b31988933e28","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:ecedaf2ddf3b9391b1785cc2f7398f2fd2bf65b2ac94a81631cacb6ab9868d6c","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:58fd0d2fc5eb21c6b06acf94feaa3461109276281a7d73ae9275ed5f90a11830","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:6b6b2e349a1b73acc4c02ecce4c6f9f8627489c602001cbf5f00a38532f8a51b","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:3c3548ff73bfb053a8893f7284d88ff68d81d5279cb85841f748a0ceee6ff0a6","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:489f21bcb0c3aa8e6c88f66e7b7c8e3ea7d17ddfdbfd5495b63032676c28643e","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:54258cde63c4895e118e7f032756b799832532a532df2c043e66fa3f2398fa2e","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:91d9c8b900153df8450ac2c5ce9cc7c3e0bbf442c17af814f5651856b22fe89f","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:e40ffa78bbe83d53df5628faa398956c1696356a733d9b3fb1e3c4d320c92acd","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:e2b7778dca4a2a267c5dd9a853235a96f41ec710423b60de97be619d16fd7a32","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:e9df0ebbd6f42c9439c47ff918a9e81a4c739b17f40857b0999335ad29889e9f","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:cb44d0e1068768345b60f3de47e1397538532b6d418333dc06768ff79b74a9d7","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:b6da560c80d4e403cad5b9de063ac1b30cb600d237b82da54aa66ff6a6e0cdab","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:039553796c48cd724f94ac678b8621b9e7b0dc4b5fcdd56c4ccde4ef37a04ef1","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:26ba7df7c4e76a70d498fcdf3640f227e5017a67a49ed3fe85fd14508f577d7e","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:580b258440b337db48aa5043b8be5e2245628f7582a7a25eadd0e5f8dba2c38b","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-09T07:03:58.289133Z","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:28deb90335c8c1e691944cfcf810019b8304cbc01b8c3507c711d6fe9e5783c4","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:8645eb3c3eaca7084f44c8d043a404d91bae8ab8c1d030923c59f61a6e51ed08","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:9dee6b36ca5c839e4b2328d5fffaa02a53ba518c49e017bfe0e161b30b4e9739","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:65afee355f25ff2303ab9dc4061c7c0b6b3a06878c53828180035c267a94239b","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:e245827d31f39214ea54a5ce27662375775082008aeb9de0b706c89c6a09725a","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:c15c995267fc6e4ec0cc2c8ccb1628ee8a0dc45f54d5c6e54f6dd037a13f802b","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-09T07:03:58.289133Z","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:3918accc93676d22573a9c9a3200bcc4fc43f738b625b71f0053c843ae75f09f","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:c453f7a4f5909b47d173adaaccdf57ce34e1164923aedaeaf008d8b36fa0ed52","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:eb463fc8d71512a80d5a904eb17b2cffaa21dc507ad07974922d12a9786883df","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:7a6ab9c9d027eedfef03e1ba52b93aea45d03e14e707670a787c270dd4f560c0","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:aa54323009a3460e9a20444851a1663c1383b63940d92f0c4403b69210ea3a81","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:449a44f49237f3ca989e7e98b0869363848ff7aa16cc3fa5ec90df91f04c2431","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:1a62dc78bd98870469dbe5839d8e2be54c30a5933f4d1d7b76dd8b5f7f2b136c","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:af348d1f5b412beffbbd52d3ffb940d0674d9f958e06487c77a2154e5085fb1a","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:873594cc2aca165101b054d1bbbde72857d7a81fcb72e727c550ce64891d95df","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:f2c05f3d753397042029887df5a8a31894314c798d1ca594cb2a33f7b542c47b","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:fa8d30d0753712c0c4494e812505b8fc0361810f3a4438059fb4088b88ea9829","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:2b28f1a04b42167d455a6ccd8f5d8ad42f96cc6fd5538322b9f3e3e93d0dd904","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:f625d86795b21783c0d4ddb2540beb01903045743d4dd089f3032882c9d0eab2","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:ff59895e877d1726a3debebe6609f442da408089f6ccabf536e102de6c072967","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:33a416db8dc4d977595be285f6148ae4edb89f51642553fe327f0bd2c5634ee9","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-09T07:03:58.289133Z","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:518d6ad0040441f4b5fe24b7125a209e5a0e2866efe79d974a179d3bd20e7f0e","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:94126a783bd5c299485b9deb565b9bd942d55bc1a73ea664ee28caa2c6f394c2","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:9d765f9927e4c80c76e06bbc63f066cce236c448e2b1ca63c4f5b8eb03c45794","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:895d6c7f2ea81062871e44d45ee7fa53b45d07874513a270f743424f3822e8ac","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:1ee7cef8485444cd809dc8be3100a94679a47511f1c340f9f83a54ae4bfd57a3","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:6d645a93ad43e54eaf2cf709ec0eca572416a8153f40441c3bb49362a2698370","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:bb627c53a4481104553795a7ef7ac165a97a81728d5e069d5e84eb8d4f43d01a","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:64f83d3d85cb5a3a6c66586b7b157f9ced6e60abdc8afbc37a891793135f5d56","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:e6d1e41e2fe62dfdd850def6e301c91f78b05b69d1babe02fb3383d1d9b08761","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:c250c1fc78ae6461119149707e470cf084a4051b642a1c41b70a5678a1660134","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:c761eebd0718916dfc6047a3c73c0bf561905d9dc7c7bf913a3a483ea22a4389","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-09T07:03:58.289133Z","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:2c399255d444492e2a4aaa814d9fe4c7ff0cf641c28923f5d1995214f17f46d7","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:2f068aafbfc866ee9a76a3e03dbb1fc476ac93e56a8047035c46fdf1213a8859","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:c279b8e2d63349f23df031abd42e76c9e6acf66e85db02c8d00332c501dc21c7","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:cba7a7e51db49bfca9ac4a0c682b755c49bf71f6c8c55ba46689a13140a2e663","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:c1d4919680c57668b8a4440da17870126386959a2a3061a65e0ca6430f848c42","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T07:03:58.289133Z","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:4417e6a11df006d071e4477752fd188231a7d4f7bed5e3585d372bfb1fbd3c2a","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-09T07:03:58.289133Z","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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 58 of 58 outbound references and 0 inbound Pith citation observations for arXiv:2505.23176."}