{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:14:26Z","timestamp":1775229266686,"version":"3.50.1"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission through the AI4Media and through the HELIOS","doi-asserted-by":"publisher","award":["H2020-951911"],"award-info":[{"award-number":["H2020-951911"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000780","name":"European Commission through the AI4Media and through the HELIOS","doi-asserted-by":"publisher","award":["H2020-825585"],"award-info":[{"award-number":["H2020-825585"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/access.2022.3159688","type":"journal-article","created":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T21:17:06Z","timestamp":1647292626000},"page":"34755-34765","source":"Crossref","is-referenced-by-count":11,"title":["p2pGNN: A Decentralized Graph Neural Network for Node Classification in Peer-to-Peer Networks"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3947-222X","authenticated-orcid":false,"given":"Emmanouil","family":"Krasanakis","sequence":"first","affiliation":[{"name":"Centre for Research and Technology Hellas, Information Technologies Institute, Thermi, Thessaloniki, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5441-7341","authenticated-orcid":false,"given":"Symeon","family":"Papadopoulos","sequence":"additional","affiliation":[{"name":"Centre for Research and Technology Hellas, Information Technologies Institute, Thermi, Thessaloniki, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6447-9020","authenticated-orcid":false,"given":"Ioannis","family":"Kompatsiaris","sequence":"additional","affiliation":[{"name":"Centre for Research and Technology Hellas, Information Technologies Institute, Thermi, Thessaloniki, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2018.00139"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2018.1700202"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2020.2986024"},{"key":"ref4","article-title":"GossipGraD: Scalable deep learning using gossip communication based asynchronous gradient descent","volume-title":"arXiv:1803.05880","author":"Daily","year":"2018"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1810931.1810939"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.soc.27.1.415"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.31235\/osf.io\/jgdtz","article-title":"Going beyond accuracy: Estimating homophily in social networks using predictions","volume-title":"arXiv:2001.11171","author":"Berry","year":"2020"},{"key":"ref8","first-page":"3478","article-title":"Decentralized stochastic optimization and gossip algorithms with compressed communication","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Koloskova"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref10","article-title":"Predict then propagate: Graph neural networks meet personalized PageRank","volume-title":"arXiv:1810.05997","author":"Klicpera","year":"2018"},{"key":"ref11","first-page":"1725","article-title":"Simple and deep graph convolutional networks","volume-title":"Proc. 37th Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref12","article-title":"Combining label propagation and simple models out-performs graph neural networks","volume-title":"arXiv:2010.13993","author":"Huang","year":"2020"},{"key":"ref13","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Artificial Intelligence and Statistics","author":"McMahan","year":"2017"},{"key":"ref14","first-page":"3043","article-title":"Asynchronous decentralized parallel stochastic gradient descent","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","author":"Lian"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3373376.3378499"},{"key":"ref16","article-title":"Communication-efficient decentralized machine learning over heterogeneous networks","volume-title":"arXiv:2009.05766","author":"Zhou","year":"2020"},{"key":"ref17","article-title":"Decentralized federated learning: A segmented gossip approach","volume-title":"arXiv:1908.07782","author":"Hu","year":"2019"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.2964162"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2020.10.006"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2018.00090"},{"key":"ref21","article-title":"The PageRank citation ranking: Bringing order to the web","author":"Page","year":"1999"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.70"},{"key":"ref23","first-page":"415","article-title":"Efficient and decentralized pagerank approximation in a peer-to-peer web search network","volume-title":"Proc. 32nd Int. Conf. Very Large Data Bases","author":"Parreira"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.4018\/IJWSR.2020010101"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.14778\/1929861.1929864"},{"key":"ref26","article-title":"Localized algorithm of community detection on large-scale decentralized social networks","volume-title":"arXiv:1212.6323","author":"Hu","year":"2012"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/4904.4801"},{"key":"ref28","article-title":"Pitfalls of graph neural network evaluation","volume-title":"arXiv:1811.05868","author":"Shchur","year":"2018"},{"key":"ref29","first-page":"1","article-title":"Query-driven active surveying for collective classification","volume-title":"Proc. 10th Int. Workshop Mining Learn. Graphs","volume":"8","author":"Namata"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref31","article-title":"Deep graph library: A graph-centric, highly-performant package for graph neural networks","volume-title":"arXiv:1909.01315","author":"Wang","year":"2019"},{"key":"ref32","article-title":"Adam: A method for stochastic optimization","volume-title":"arXiv:1412.6980","author":"Kingma","year":"2014"},{"key":"ref33","article-title":"An improvement of the convergence proof of the ADAM-optimizer","volume-title":"arXiv:1804.10587","author":"Bock","year":"2018"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403109"},{"key":"ref35","volume-title":"The Python Library Reference, Release 3.8.2","author":"Van Rossum","year":"2020"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9668973\/09734065.pdf?arnumber=9734065","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T23:30:54Z","timestamp":1705534254000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9734065\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/access.2022.3159688","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}