{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T09:02:33Z","timestamp":1765357353397,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":56,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T00:00:00Z","timestamp":1682812800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["2107089"],"award-info":[{"award-number":["2107089"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,4,30]]},"DOI":"10.1145\/3543873.3587698","type":"proceedings-article","created":{"date-parts":[[2023,4,28]],"date-time":"2023-04-28T11:36:14Z","timestamp":1682681774000},"page":"1339-1347","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["On Cohesively Polarized Communities in Signed Networks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5103-1072","authenticated-orcid":false,"given":"Jason","family":"Niu","sequence":"first","affiliation":[{"name":"University at Buffalo, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4945-6821","authenticated-orcid":false,"given":"A. Erdem","family":"Sar\u0131y\u00fcce","sequence":"additional","affiliation":[{"name":"University at Buffalo, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,4,30]]},"reference":[{"volume-title":"Center for Computational Research","key":"e_1_3_2_1_1_1","unstructured":"2021. Center for Computational Research, University at Buffalo. http:\/\/hdl.handle.net\/10477\/79221."},{"key":"e_1_3_2_1_2_1","unstructured":"J.\u00a0Ignacio Alvarez-Hamelin Alain Barrat and Alessandro Vespignani. 2006. Large scale networks fingerprinting and visualization using the k-core decomposition. In NIPS. 41\u201350."},{"key":"e_1_3_2_1_3_1","volume-title":"Dense subgraph maintenance under streaming edge weight updates for real-time story identification. arXiv preprint arXiv:1203.0060","author":"Angel Albert","year":"2012","unstructured":"Albert Angel, Nick Koudas, Nikos Sarkas, and Divesh Srivastava. 2012. Dense subgraph maintenance under streaming edge weight updates for real-time story identification. arXiv preprint arXiv:1203.0060 (2012)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-020-71838-6"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnx044"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1177\/000312240707200507"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:MACH.0000033116.57574.95"},{"volume-title":"Introduction to mathematical sociology","author":"Bonacich Phillip","key":"e_1_3_2_1_8_1","unstructured":"Phillip Bonacich and Philip Lu. 2012. Introduction to mathematical sociology. Princeton University Press."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357977"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1460-2466.2010.01509.x"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0016"},{"key":"e_1_3_2_1_12_1","volume-title":"Structural balance: a generalization of Heider\u2019s theory.Psychological review 63, 5","author":"Cartwright Dorwin","year":"1956","unstructured":"Dorwin Cartwright and Frank Harary. 1956. Structural balance: a generalization of Heider\u2019s theory.Psychological review 63, 5 (1956), 277."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/646688.702972"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380119"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939855"},{"key":"e_1_3_2_1_16_1","unstructured":"Jonathan Cohen. 2008. Trusses: Cohesive subgraphs for social network analysis. National Security Agency Technical Report 16 3.1 (2008)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87744-8_26"},{"key":"e_1_3_2_1_18_1","article-title":"Structural balance and signed international relations","volume":"16","author":"Doreian Patrick","year":"2019","unstructured":"Patrick Doreian and Andrej Mrvar. 2019. Structural balance and signed international relations. Journal of Social Structure 16, 1 (2019).","journal-title":"Journal of Social Structure"},{"key":"e_1_3_2_1_19_1","volume-title":"On the measurement of polarization. Econometrica: Journal of the Econometric Society","author":"Esteban Joan-Maria","year":"1994","unstructured":"Joan-Maria Esteban and Debraj Ray. 1994. On the measurement of polarization. Econometrica: Journal of the Econometric Society (1994), 819\u2013851."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342645"},{"key":"e_1_3_2_1_21_1","volume-title":"An improved Branch-and-cut code for the maximum balanced subgraph of a signed graph. arXiv preprint arXiv:1312.4345","author":"Figueiredo Rosa","year":"2013","unstructured":"Rosa Figueiredo and Yuri Frota. 2013. An improved Branch-and-cut code for the maximum balanced subgraph of a signed graph. arXiv preprint arXiv:1312.4345 (2013)."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.12.036"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl243"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3463014"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018703"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3140565"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1083592.1083676"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Aristides Gionis and Charalampos\u00a0E. Tsourakakis. 2015. Dense Subgraph Discovery: Tutorial. In KDD. 2313\u20132314.","DOI":"10.1145\/2783258.2789987"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988727"},{"key":"e_1_3_2_1_30_1","volume-title":"On the notion of balance of a signed graph.Michigan Mathematical Journal 2, 2","author":"Harary Frank","year":"1953","unstructured":"Frank Harary. 1953. On the notion of balance of a signed graph.Michigan Mathematical Journal 2, 2 (1953), 143\u2013146."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1080\/00223980.1946.9917275"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Xin Huang Hong Cheng Lu Qin Wentao Tian and Jeffrey\u00a0Xu Yu. 2014. Querying K-truss Community in Large and Dynamic Graphs. In SIGMOD. 1311\u20131322.","DOI":"10.1145\/2588555.2610495"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Xin Huang Wei Lu and Laks\u00a0V.S. Lakshmanan. 2016. Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms. In SIGMOD. 77\u201390.","DOI":"10.1145\/2882903.2882913"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.99.012320"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186141"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91947-8_2"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"V.\u00a0E. Lee N. Ruan R. Jin and C. Aggarwal. 2010. A Survey of Algorithms for Dense Subgraph Discovery. In Managing and Mining Graph Data. Vol.\u00a040.","DOI":"10.1007\/978-1-4419-6045-0_10"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1753326.1753532"},{"key":"e_1_3_2_1_40_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_1_41_1","volume-title":"Signed Clique Search in Signed Networks: Concepts and Algorithms","author":"Li Ronghua","year":"2019","unstructured":"Ronghua Li, Qiangqiang Dai, Lu Qin, Guoren Wang, Xiaokui Xiao, Jeffrey\u00a0Xu Yu, and Shaojie Qiao. 2019. Signed Clique Search in Signed Networks: Concepts and Algorithms. IEEE Transactions on Knowledge and Data Engineering (2019)."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2531602.2531711"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2556288.2557240"},{"key":"e_1_3_2_1_44_1","volume-title":"Controversy and sentiment in online news. arXiv preprint arXiv:1409.8152","author":"Mejova Yelena","year":"2014","unstructured":"Yelena Mejova, Amy\u00a0X Zhang, Nicholas Diakopoulos, and Carlos Castillo. 2014. Controversy and sentiment in online news. arXiv preprint arXiv:1409.8152 (2014)."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.4913758"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380212"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450055"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021927"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"crossref","unstructured":"A.\u00a0Erdem Sar\u0131y\u00fcce C. Seshadhri A. P\u0131nar and \u00dc.\u00a0V. \u00c7ataly\u00fcrek. 2015. Finding the Hierarchy of Dense Subgraphs Using Nucleus Decompositions. In WWW (Florence Italy). 927\u2013937.","DOI":"10.1145\/2736277.2741640"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-59416-9_43"},{"key":"e_1_3_2_1_51_1","volume-title":"Densest Subgraph: Extracting Optimal Quasi-cliques with Quality Guarantees(KDD \u201913).","author":"Tsourakakis C.","year":"2013","unstructured":"C. Tsourakakis, F. Bonchi, A. Gionis, F. Gullo, and M. Tsiarli. 2013. Denser Than the Densest Subgraph: Extracting Optimal Quasi-cliques with Quality Guarantees(KDD \u201913)."},{"key":"e_1_3_2_1_52_1","volume-title":"Discovering conflicting groups in signed networks. Advances in Neural Information Processing Systems 33","author":"Tzeng Ruo-Chun","year":"2020","unstructured":"Ruo-Chun Tzeng, Bruno Ordozgoiti, and Aristides Gionis. 2020. Discovering conflicting groups in signed networks. Advances in Neural Information Processing Systems 33 (2020)."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.23274"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3417457"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380121"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412117"}],"event":{"name":"WWW '23: The ACM Web Conference 2023","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Austin TX USA","acronym":"WWW '23"},"container-title":["Companion Proceedings of the ACM Web Conference 2023"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543873.3587698","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543873.3587698","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543873.3587698","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T23:37:00Z","timestamp":1755819420000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543873.3587698"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,30]]},"references-count":56,"alternative-id":["10.1145\/3543873.3587698","10.1145\/3543873"],"URL":"https:\/\/doi.org\/10.1145\/3543873.3587698","relation":{},"subject":[],"published":{"date-parts":[[2023,4,30]]},"assertion":[{"value":"2023-04-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}