{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T06:17:59Z","timestamp":1763705879309,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,8,17]],"date-time":"2020-08-17T00:00:00Z","timestamp":1597622400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100006502","name":"Defense Sciences Office, DARPA","doi-asserted-by":"publisher","award":["HR0011-17-3-0004"],"award-info":[{"award-number":["HR0011-17-3-0004"]}],"id":[{"id":"10.13039\/100006502","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,8,17]]},"DOI":"10.1145\/3404397.3404455","type":"proceedings-article","created":{"date-parts":[[2020,8,9]],"date-time":"2020-08-09T03:54:26Z","timestamp":1596945266000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Prune the Unnecessary: Parallel Pull-Push Louvain Algorithms with Automatic Edge Pruning"],"prefix":"10.1145","author":[{"given":"Jesmin Jahan","family":"Tithi","sequence":"first","affiliation":[{"name":"Intel Labs, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Stasiak","sequence":"additional","affiliation":[{"name":"Intel Data Center Group"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sriram","family":"Aananthakrishnan","sequence":"additional","affiliation":[{"name":"Intel Data Center Group"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrizio","family":"Petrini","sequence":"additional","affiliation":[{"name":"Intel Labs, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,8,17]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[n.d.]. https:\/\/scikit-learn.org\/stable\/modules\/generated\/sklearn.metrics.normalized_mutual_info_score.html.  [n.d.]. https:\/\/scikit-learn.org\/stable\/modules\/generated\/sklearn.metrics.normalized_mutual_info_score.html."},{"volume-title":"Dynamics On and Of Complex Networks","author":"Bhowmick Sanjukta","key":"e_1_3_2_1_2_1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_3_2_1_4_1","unstructured":"Ulrik Brandes Daniel Delling Marco Gaertler Robert G\u00f6rke Martin Hoefer Zoran Nikoloski and Dorothea Wagner. 2006. Maximizing modularity is hard. arXiv preprint physics\/0608255(2006).  Ulrik Brandes Daniel Delling Marco Gaertler Robert G\u00f6rke Martin Hoefer Zoran Nikoloski and Dorothea Wagner. 2006. Maximizing modularity is hard. arXiv preprint physics\/0608255(2006)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl370"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242635"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3061639.3062194"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Santo Fortunato. 2010. Community detection in graphs. Physics reports 486(2010).  Santo Fortunato. 2010. Community detection in graphs. Physics reports 486(2010).","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2018.00098"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2015.03.003"},{"volume-title":"Fast algorithm for detecting community structure in networks. Physical review E 69, 6","year":"2004","author":"Newman EJ","key":"e_1_3_2_1_11_1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.17706\/IJCEE.2016.8.3.207-218"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2017.00013"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2015.59"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0237338100"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.92.032801"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1177\/009430610803700308"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER.2018.00044"},{"volume-title":"Self-adaptive Louvain algorithm: Fast and stable community detection algorithm based on the principle of small probability event. Physica A: Statistical Mechanics and its Applications 506","year":"2018","author":"Zhang Ziqiao","key":"e_1_3_2_1_19_1"}],"event":{"name":"ICPP '20: 49th International Conference on Parallel Processing","acronym":"ICPP '20","location":"Edmonton AB Canada"},"container-title":["49th International Conference on Parallel Processing - ICPP"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3404397.3404455","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3404397.3404455","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:31:43Z","timestamp":1750195903000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3404397.3404455"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,17]]},"references-count":19,"alternative-id":["10.1145\/3404397.3404455","10.1145\/3404397"],"URL":"https:\/\/doi.org\/10.1145\/3404397.3404455","relation":{},"subject":[],"published":{"date-parts":[[2020,8,17]]},"assertion":[{"value":"2020-08-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}