{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T12:42:05Z","timestamp":1762087325607,"version":"build-2065373602"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["62072278","62122042","62272256"],"award-info":[{"award-number":["62072278","62122042","62272256"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Shandong Provincial Natural Science Foundation","doi-asserted-by":"publisher","award":["ZR2022LZH010","ZR2022ZD02"],"award-info":[{"award-number":["ZR2022LZH010","ZR2022ZD02"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1109\/tnet.2023.3273501","type":"journal-article","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T19:50:41Z","timestamp":1684266641000},"page":"3222-3237","source":"Crossref","is-referenced-by-count":4,"title":["Collaborative Learning in General Graphs With Limited Memorization: Complexity, Learnability, and Reliability"],"prefix":"10.1109","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3746-2132","authenticated-orcid":false,"given":"Feng","family":"Li","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Shandong University, Qingdao, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuyang","family":"Yuan","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Shandong University, Qingdao, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lina","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Shandong University, Qingdao, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5810-0248","authenticated-orcid":false,"given":"Huan","family":"Yang","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Qingdao University, Qingdao, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6835-5981","authenticated-orcid":false,"given":"Dongxiao","family":"Yu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Shandong University, Qingdao, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weifeng","family":"Lyu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Beihang University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5912-4647","authenticated-orcid":false,"given":"Xiuzhen","family":"Cheng","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Shandong University, Qingdao, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"974","article-title":"Portfolio choices with orthogonal bandit learning","volume-title":"Proc. 24th IJCAI","author":"Shen"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32650-9_10"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s002650050536"},{"issue":"2","key":"ref4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1023\/A:1013689704352","article-title":"Finite-time analysis of the multiarmed bandit problem","volume":"47","author":"Auer","year":"2002","journal-title":"Mach. Learn."},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2016.2635380"},{"key":"ref7","first-page":"4120","article-title":"Optimal algorithms for multiplayer multi-armed bandits","volume-title":"Proc. 23rd AISTATS","author":"Wang"},{"key":"ref8","first-page":"961","article-title":"Non-stochastic multi-player multi-armed bandits: Optimal rate with collision information, sublinear without","volume-title":"Proc. 33rd Conf. Learn. Theory","volume":"125","author":"Bubeck"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.86.5632"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.anbehav.2005.01.022"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.evolhumbehav.2014.04.001"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1111\/tops.12150"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087820"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3322205.3311082"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2706192"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2852361"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3366701"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.42.12.920"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1970.1054427"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3466772.3467045"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1561\/2200000068"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref23","first-page":"41","article-title":"Best arm identification in multi-armed bandits","volume-title":"Proc. 23rd COLT","author":"Audibert"},{"issue":"1","key":"ref24","first-page":"1","article-title":"On the complexity of best-arm identification in multi-armed bandit models","volume":"17","author":"Kaufmann","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00017"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/11564096_42"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/24"},{"key":"ref28","first-page":"19","article-title":"Gossip-based distributed stochastic bandit algorithms","volume-title":"Proc. 30th ICML","author":"Szorenyi"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(68)90382-3"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188918"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-018-5758-5"},{"key":"ref32","first-page":"1562","article-title":"Better algorithms for stochastic bandits with adversarial corruptions","volume-title":"Proc. 32rd COLT","author":"Gupta"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33651-5_10"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2432622.2432624"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772"},{"key":"ref36","first-page":"41","article-title":"Lower bounds for subgraph detection in the CONGEST model","volume-title":"Proc. 21st OPODIS","author":"Gonen"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-018-0324-8"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3350755.3400256"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451089"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933097"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1090\/mbk\/107"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511581274"},{"volume-title":"MovieLens 25M Dataset","year":"2019","key":"ref43"},{"key":"ref44","first-page":"3367","article-title":"Matrix completion and low-rank SVD via fast alternating least squares","volume":"16","author":"Hastie","year":"2015","journal-title":"J. Mach. Learn. Res."}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/10365667\/10124936.pdf?arnumber=10124936","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T02:23:51Z","timestamp":1705026231000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10124936\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12]]},"references-count":44,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2023.3273501","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"type":"print","value":"1063-6692"},{"type":"electronic","value":"1558-2566"}],"subject":[],"published":{"date-parts":[[2023,12]]}}}