{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:56:20Z","timestamp":1772121380707,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T00:00:00Z","timestamp":1691107200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-sa\/4.0\/"}],"funder":[{"name":"EC H2020 RIA project SoBigData++","award":["871042"],"award-info":[{"award-number":["871042"]}]},{"name":"Academy of Finland project MLDB","award":["325117"],"award-info":[{"award-number":["325117"]}]},{"name":"ERC Advanced Grant REBOUND","award":["834862"],"award-info":[{"award-number":["834862"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,8,6]]},"DOI":"10.1145\/3580305.3599489","type":"proceedings-article","created":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T18:10:58Z","timestamp":1691172658000},"page":"323-334","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Reducing Exposure to Harmful Content via Graph Rewiring"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9151-2092","authenticated-orcid":false,"given":"Corinna","family":"Coupette","sequence":"first","affiliation":[{"name":"Max Planck Institute for Informatics, Saarbr\u00fccken, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3981-1500","authenticated-orcid":false,"given":"Stefan","family":"Neumann","sequence":"additional","affiliation":[{"name":"KTH Royal Institute of Technology, Stockholm, Sweden"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5211-112X","authenticated-orcid":false,"given":"Aristides","family":"Gionis","sequence":"additional","affiliation":[{"name":"KTH Royal Institute of Technology, Stockholm, Sweden"}]}],"member":"320","published-online":{"date-parts":[[2023,8,4]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Jon Kleinberg, Zhibin Liang, David Parkes, Mauro Sozio, and Charalampos E Tsourakakis.","author":"Abebe Rediet","year":"2021","unstructured":"Rediet Abebe , T-H Hubert Chan , Jon Kleinberg, Zhibin Liang, David Parkes, Mauro Sozio, and Charalampos E Tsourakakis. 2021 . Opinion dynamics optimization by varying susceptibility to persuasion via non-convex local search. ACM Transactions on Knowledge Discovery from Data , Vol. 16 , 2 (2021), 1--34. Rediet Abebe, T-H Hubert Chan, Jon Kleinberg, Zhibin Liang, David Parkes, Mauro Sozio, and Charalampos E Tsourakakis. 2021. Opinion dynamics optimization by varying susceptibility to persuasion via non-convex local search. ACM Transactions on Knowledge Discovery from Data, Vol. 16, 2 (2021), 1--34."},{"key":"e_1_3_2_2_2_1","volume-title":"Proceedings of the ACM International Conference on Knowledge Discovery and Data Mining (KDD). To appear.","author":"Adriaens Florian","year":"2023","unstructured":"Florian Adriaens , Honglian Wang , and Aristides Gionis . 2023 . Minimizing hitting time between disparate groups with shortcut edges . In Proceedings of the ACM International Conference on Knowledge Discovery and Data Mining (KDD). To appear. Florian Adriaens, Honglian Wang, and Aristides Gionis. 2023. Minimizing hitting time between disparate groups with shortcut edges. In Proceedings of the ACM International Conference on Knowledge Discovery and Data Mining (KDD). To appear."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330960"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3449148","article-title":"Problematic machine behavior: A systematic literature review of algorithm audits","volume":"5","author":"Bandy Jack","year":"2021","unstructured":"Jack Bandy . 2021 . Problematic machine behavior: A systematic literature review of algorithm audits . In Proceedings of the ACM on Human-Computer Interaction (CHI) , Vol. 5. 1 -- 34 . Jack Bandy. 2021. Problematic machine behavior: A systematic literature review of algorithm audits. In Proceedings of the ACM on Human-Computer Interaction (CHI), Vol. 5. 1--34.","journal-title":"Proceedings of the ACM on Human-Computer Interaction (CHI)"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-015-0447-5"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371825"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3531146.3533213"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2559896"},{"key":"e_1_3_2_2_9_1","first-page":"290","article-title":"On random graphs I","volume":"6","author":"Alfr\u00e9d R\u00e9nyi Paul","year":"1959","unstructured":"Paul ErdHo s and Alfr\u00e9d R\u00e9nyi . 1959 . On random graphs I . Publicationes Mathematicae , Vol. 6 , 1 (1959), 290 -- 297 . Paul ErdHo s and Alfr\u00e9d R\u00e9nyi. 1959. On random graphs I. Publicationes Mathematicae, Vol. 6, 1 (1959), 290--297.","journal-title":"Publicationes Mathematicae"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512143"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3501247.3531583"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018703"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3140565"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972832.43"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/234782.234783"},{"key":"e_1_3_2_2_17_1","unstructured":"Mauricio Gruppi Benjamin D. Horne and Sibel Adali. 2021. NELA-GT-2021: A large multi-labelled news dataset for the study of misinformation in news articles. arxiv: 2203.05659 [cs.CY]  Mauricio Gruppi Benjamin D. Horne and Sibel Adali. 2021. NELA-GT-2021: A large multi-labelled news dataset for the study of misinformation in news articles. arxiv: 2203.05659 [cs.CY]"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-022-00875-8"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2101967118"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.22"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3392854"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00366-8"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582418"},{"key":"e_1_3_2_2_24_1","volume-title":"Proceedings of the Annual ACM Symposium on Theory of Computing. 767--775","author":"Khot Subhash","year":"2002","unstructured":"Subhash Khot . 2002 . On the power of unique 2-prover 1-round games . In Proceedings of the Annual ACM Symposium on Theory of Computing. 767--775 . Subhash Khot. 2002. On the power of unique 2-prover 1-round games. In Proceedings of the Annual ACM Symposium on Theory of Computing. 767--775."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.06.019"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-93413-2_15"},{"key":"e_1_3_2_2_27_1","volume-title":"Algorithmic extremism: Examining YouTube's rabbit hole of radicalization. First Monday","author":"Ledwich Mark","year":"2020","unstructured":"Mark Ledwich and Anna Zaitsev . 2020. Algorithmic extremism: Examining YouTube's rabbit hole of radicalization. First Monday ( 2020 ). Mark Ledwich and Anna Zaitsev. 2020. Algorithmic extremism: Examining YouTube's rabbit hole of radicalization. First Monday (2020)."},{"key":"e_1_3_2_2_28_1","volume-title":"Radical bubbles on YouTube? Revisiting algorithmic extremism with personalised recommendations. First Monday","author":"Ledwich Mark","year":"2022","unstructured":"Mark Ledwich , Anna Zaitsev , and Anton Laukemper . 2022. Radical bubbles on YouTube? Revisiting algorithmic extremism with personalised recommendations. First Monday ( 2022 ). Mark Ledwich, Anna Zaitsev, and Anton Laukemper. 2022. Radical bubbles on YouTube? Revisiting algorithmic extremism with personalised recommendations. First Monday (2022)."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447535.3462504"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.103"},{"key":"e_1_3_2_2_31_1","volume-title":"Birds of a feather: Homophily in social networks. Annual Review of Sociology","author":"McPherson Miller","year":"2001","unstructured":"Miller McPherson , Lynn Smith-Lovin , and James M Cook . 2001. Birds of a feather: Homophily in social networks. Annual Review of Sociology ( 2001 ), 415--444. Miller McPherson, Lynn Smith-Lovin, and James M Cook. 2001. Birds of a feather: Homophily in social networks. Annual Review of Sociology (2001), 415--444."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975321.14"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557253"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512210"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1609\/icwsm.v16i1.19329"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974010.4"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449970"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-022-00488-6"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"crossref","unstructured":"Nils Reimers and Iryna Gurevych. 2019. Sentence-BERT: Sentence embeddings using siamese BERT-networks. 3982--3992.  Nils Reimers and Iryna Gurevych. 2019. Sentence-BERT: Sentence embeddings using siamese BERT-networks. 3982--3992.","DOI":"10.18653\/v1\/D19-1410"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3351095.3372879"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3274417"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729893"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3091478.3091483"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"crossref","unstructured":"Ivan Srba Robert Moro Matus Tomlein Branislav Pecher Jakub Simko Elena Stefancova Michal Kompan Andrea Hrckova Juraj Podrouzek Adrian Gavornik etal 2022. Auditing YouTube's recommendation algorithm for misinformation filter bubbles. ACM Transactions on Recommender Systems (2022).  Ivan Srba Robert Moro Matus Tomlein Branislav Pecher Jakub Simko Elena Stefancova Michal Kompan Andrea Hrckova Juraj Podrouzek Adrian Gavornik et al. 2022. Auditing YouTube's recommendation algorithm for misinformation filter bubbles. ACM Transactions on Recommender Systems (2022).","DOI":"10.1145\/3568392"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512249"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-21127-0_7"},{"key":"e_1_3_2_2_48_1","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence (AAAI). 2197--2204","author":"Tomasz Wka","year":"2019","unstructured":"Tomasz Wka s, Talal Rahwan , and Oskar Skibski . 2019 . Random walk decay centrality . In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI). 2197--2204 . Tomasz Wka s, Talal Rahwan, and Oskar Skibski. 2019. Random walk decay centrality. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI). 2197--2204."},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.14763\/2021.2.1565"},{"key":"e_1_3_2_2_50_1","first-page":"1","article-title":"Systematic review: YouTube recommendations and problematic content","volume":"11","author":"Yesilada Muhsin","year":"2022","unstructured":"Muhsin Yesilada and Stephan Lewandowsky . 2022 . Systematic review: YouTube recommendations and problematic content . Internet Policy Review , Vol. 11 , 1 (2022), 1 -- 22 . Muhsin Yesilada and Stephan Lewandowsky. 2022. Systematic review: YouTube recommendations and problematic content. Internet Policy Review, Vol. 11, 1 (2022), 1--22.","journal-title":"Internet Policy Review"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2010.27"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-022-00914-6"},{"key":"e_1_3_2_2_53_1","volume-title":"Advances in Neural Information Processing Systems","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 , 2072--2084. Liwang Zhu, Qi Bao, and Zhongzhi Zhang. 2021. Minimizing polarization and disagreement in social networks via link recommendation. Advances in Neural Information Processing Systems, 2072--2084."},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539469"}],"event":{"name":"KDD '23: The 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Long Beach CA USA","acronym":"KDD '23","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599489","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580305.3599489","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:37Z","timestamp":1750178257000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599489"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,4]]},"references-count":53,"alternative-id":["10.1145\/3580305.3599489","10.1145\/3580305"],"URL":"https:\/\/doi.org\/10.1145\/3580305.3599489","relation":{},"subject":[],"published":{"date-parts":[[2023,8,4]]},"assertion":[{"value":"2023-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}