{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:05:39Z","timestamp":1750309539178,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T00:00:00Z","timestamp":1745280000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/100017052","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372112, 61872093"],"award-info":[{"award-number":["62372112, 61872093"]}],"id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/100017052","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,4,22]]},"DOI":"10.1145\/3696410.3714566","type":"proceedings-article","created":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T23:08:29Z","timestamp":1745363309000},"page":"1331-1341","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Scalable Algorithms for Forest-Based Centrality on Large Graphs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-8207-8122","authenticated-orcid":false,"given":"Yubo","family":"Sun","sequence":"first","affiliation":[{"name":"Fudan University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4626-2079","authenticated-orcid":false,"given":"Haoxin","family":"Sun","sequence":"additional","affiliation":[{"name":"Fudan University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1260-2079","authenticated-orcid":false,"given":"Zhongzhi","family":"Zhang","sequence":"additional","affiliation":[{"name":"Fudan University, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2025,4,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1002862312617"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2022.08.015"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75225-7_15"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10959-017-0771-3"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxab132"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2021.3069839"},{"key":"e_1_3_2_1_7_1","volume-title":"Estimating the inverse trace using random forests on graphs. arXiv preprint arXiv:1905.02086","author":"Barthelm\u00e9 Simon","year":"2019","unstructured":"Simon Barthelm\u00e9, Nicolas Tremblay, Alexandre Gaudilliere, Luca Avena, and Pierre-Olivier Amblard. 2019. Estimating the inverse trace using random forests on graphs. arXiv preprint arXiv:1905.02086 (2019)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0603033"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(02)00388-9"},{"key":"e_1_3_2_1_10_1","first-page":"1505","article-title":"The matrix-forest theorem and measuring relations in small social groups","volume":"58","author":"Chebotarev Pavel","year":"1997","unstructured":"Pavel Chebotarev and E.V. Shamis. 1997. The matrix-forest theorem and measuring relations in small social groups. Automation and Remote Control, Vol. 58, 9 (1997), 1505--1514.","journal-title":"Automation and Remote Control"},{"key":"e_1_3_2_1_11_1","first-page":"1443","article-title":"On proximity measures for graph vertices","volume":"59","author":"Chebotarev Pavel","year":"1998","unstructured":"Pavel Chebotarev and E.V. Shamis. 1998. On proximity measures for graph vertices. Automation and Remote Control, Vol. 59, 10 (1998), 1443--1459.","journal-title":"Automation and Remote Control"},{"key":"e_1_3_2_1_12_1","first-page":"1364","article-title":"The forest metrics of a graph and their properties","volume":"61","author":"Chebotarev Pavel","year":"2000","unstructured":"Pavel Chebotarev and E.V. Shamis. 2000. The forest metrics of a graph and their properties. Automation and Remote Control, Vol. 61, 8 (2000), 1364--1373.","journal-title":"Automation and Remote Control"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729330"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591833"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2010.260"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.71.056103"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.46"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(78)90021-7"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.1990.9990069"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"e_1_3_2_1_22_1","volume-title":"Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence","volume":"16","author":"Hayashi Takanori","year":"2016","unstructured":"Takanori Hayashi, Takuya Akiba, and Yuichi Yoshida. 2016. Efficient Algorithms for Spanning Tree Centrality. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, Vol. 16. AAAI Press, 3733--3739."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2019.00044"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"William Johnson and J. Lindenstrauss. 1984. Extensions of Lipschitz mappings into Hilbert space. Contemporary mathematics Vol. 26 (1984) 189--206.","DOI":"10.1090\/conm\/026\/737400"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-80-04741-9"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2898361"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12650-019-00582-5"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741125"},{"key":"e_1_3_2_1_31_1","first-page":"2","article-title":"Doubly stochastic graph matrices","volume":"45","author":"Merris Russell","year":"1998","unstructured":"Russell Merris. 1998. Doubly stochastic graph matrices, II. Linear and Multilinear Algebra, Vol. 45, 2--3 (1998), 275--285.","journal-title":"II. Linear and Multilinear Algebra"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313422"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9054497"},{"key":"e_1_3_2_1_34_1","volume-title":"Variance reduction for inverse trace estimation via random spanning forests. arXiv preprint arXiv:2206.07421","author":"Pilavci Yusuf Yigit","year":"2022","unstructured":"Yusuf Yigit Pilavci, Pierre-Olivier Amblard, Simon Barthelme, and Nicolas Tremblay. 2022. Variance reduction for inverse trace estimation via random spanning forests. arXiv preprint arXiv:2206.07421 (2022)."},{"key":"e_1_3_2_1_35_1","volume-title":"Ahmed","author":"Rossi Ryan A.","year":"2015","unstructured":"Ryan A. Rossi and Nesreen K. Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization. In Proceedings of the AAAI Conference on Artificial Intelligence. AAAI Press, 4292--4293."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.227"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2006.62"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/090771430"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i4.25585"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645578"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3671822"},{"key":"e_1_3_2_1_42_1","volume-title":"Workshop on Mining and Learning with Graphs","volume":"24","author":"Teixeira Andreia Sofia","year":"2013","unstructured":"Andreia Sofia Teixeira, Pedro T Monteiro, Jo ao A Carri\u00e7o, M\u00e1rio Ramirez, and Alexandre P Francisco. 2013. Spanning edge betweenness. In Workshop on Mining and Learning with Graphs, Vol. 24. Citeseer, 27--31."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976700.16"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237880"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599323"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20495"},{"key":"e_1_3_2_1_47_1","first-page":"2072","article-title":"Minimizing polarization and disagreement in social networks via link recommendation","volume":"34","author":"Zhu Liwang","year":"2021","unstructured":"Liwang Zhu, Qi Bao, and Zhongzhi Zhang. 2021. Minimizing polarization and disagreement in social networks via link recommendation. Advances in Neural Information Processing Systems, Vol. 34 (2021), 2072--2084.","journal-title":"Advances in Neural Information Processing Systems"}],"event":{"name":"WWW '25: The ACM Web Conference 2025","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Sydney NSW Australia","acronym":"WWW '25"},"container-title":["Proceedings of the ACM on Web Conference 2025"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3696410.3714566","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3696410.3714566","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:33Z","timestamp":1750295913000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3696410.3714566"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,22]]},"references-count":47,"alternative-id":["10.1145\/3696410.3714566","10.1145\/3696410"],"URL":"https:\/\/doi.org\/10.1145\/3696410.3714566","relation":{},"subject":[],"published":{"date-parts":[[2025,4,22]]},"assertion":[{"value":"2025-04-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}