{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T20:10:49Z","timestamp":1771877449721,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":39,"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:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,4,30]]},"DOI":"10.1145\/3543507.3583213","type":"proceedings-article","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T23:30:25Z","timestamp":1682551825000},"page":"49-59","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Testing Cluster Properties of Signed Graphs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7820-6883","authenticated-orcid":false,"given":"Florian","family":"Adriaens","sequence":"first","affiliation":[{"name":"University of Helsinki, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3823-6804","authenticated-orcid":false,"given":"Simon","family":"Apers","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Paris, CNRS, IRIF, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,4,30]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411509.1411513"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00008-4"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480199358655"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/050633445"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"G. Andersson and L. Engebretsen. 2002. Property testers for dense constraint satisfaction programs on finite domains. Random Structures & Algorithms (2002).","DOI":"10.1002\/rsa.10041"},{"key":"e_1_3_2_2_7_1","volume-title":"Correlation clustering. Machine learning 56, 1","author":"Bansal Nikhil","year":"2004","unstructured":"Nikhil Bansal, Avrim Blum, and Shuchi Chawla. 2004. Correlation clustering. Machine learning 56, 1 (2004), 89\u2013113."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181886"},{"key":"e_1_3_2_2_9_1","volume-title":"Discovering Polarized Communities in Signed Networks. In 28th ACM Conference on Information and Knowledge Management(CIKM \u201919)","author":"Bonchi Francesco","year":"2019","unstructured":"Francesco Bonchi, Edoardo Galimberti, Aristides Gionis, Bruno Ordozgoiti, and Giancarlo Ruffo. 2019. Discovering Polarized Communities in Signed Networks. In 28th ACM Conference on Information and Knowledge Management(CIKM \u201919). Association for Computing Machinery, New York, NY, USA."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"D. Cartwright and F. Harary. 1956. Structural balance: a generalization of Heider\u2019s theory. Psychological review 63 5 (1956) 277\u2013293.","DOI":"10.1037\/h0046049"},{"key":"e_1_3_2_2_11_1","volume-title":"Exploiting Longer Cycles for Link Prediction in Signed Networks. International Conference on Information and Knowledge Management, Proceedings, 1157\u20131162","author":"Chiang Kai-Yang","year":"2011","unstructured":"Kai-Yang Chiang, Nagarajan Natarajan, Ambuj Tewari, and Inderjit Dhillon. 2011. Exploiting Longer Cycles for Link Prediction in Signed Networks. International Conference on Information and Knowledge Management, Proceedings, 1157\u20131162."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20462"},{"key":"e_1_3_2_2_13_1","volume-title":"Clustering and structural balance in graphs. Human relations 20, 2","author":"Davis A","year":"1967","unstructured":"James\u00a0A Davis. 1967. Clustering and structural balance in graphs. Human relations 20, 2 (1967), 181\u2013187."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.05.008"},{"key":"e_1_3_2_2_15_1","volume-title":"Signed Network Modeling Based on Structural Balance Theory. In 27th ACM International Conference on Information and Knowledge Management","author":"Derr Tyler","year":"2018","unstructured":"Tyler Derr, Charu Aggarwal, and Jiliang Tang. 2018. Signed Network Modeling Based on Structural Balance Theory. In 27th ACM International Conference on Information and Knowledge Management (Torino, Italy) (CIKM \u201918). Association for Computing Machinery, New York, NY, USA, 557\u2013566."},{"key":"e_1_3_2_2_16_1","series-title":"SIAM J. Comput. 37","volume-title":"Testing versus estimation of graph properties","author":"Fischer Eldar","year":"2007","unstructured":"Eldar Fischer and Ilan Newman. 2007. Testing versus estimation of graph properties. SIAM J. Comput. 37 (2007)."},{"key":"e_1_3_2_2_17_1","volume-title":"A new proof of the graph removal lemma. Annals of Mathematics","author":"Fox Jacob","year":"2011","unstructured":"Jacob Fox. 2011. A new proof of the graph removal lemma. Annals of Mathematics (2011), 561\u2013579."},{"key":"e_1_3_2_2_18_1","volume-title":"Property testing","author":"Goldreich Oded","unstructured":"Oded Goldreich. 2010. Introduction to testing graph properties. In Property testing. Springer, 105\u2013141."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1017\/9781108135252.010"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285060"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930050060"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258627"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1307\/mmj"},{"key":"e_1_3_2_2_24_1","unstructured":"Jeong\u00a0Han Kim and Van\u00a0H Vu. 2003. Generating random regular graphs. In Thirty-fifth annual ACM symposium on Theory of computing."},{"key":"e_1_3_2_2_25_1","unstructured":"D. K\u00f6nig. 1936. Theorie der endlichen und unendlichen Graphen: Kombinatorische Topologie der Streckenkomplexe. Vol.\u00a016. Akademische Verlagsgesellschaft."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316330"},{"key":"e_1_3_2_2_27_1","series-title":"SIAM J. Comput. (2020)","volume-title":"Random Walks and Forbidden Minors I: An n1\/2 + o(1)-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs","author":"Kumar Akash","unstructured":"Akash Kumar, C Seshadhri, and Andrew Stolman. 2020. Random Walks and Forbidden Minors I: An n1\/2 + o(1)-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs. SIAM J. Comput. (2020)."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0033"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"e_1_3_2_2_30_1","volume-title":"Predicting Positive and Negative Links in Online Social Networks. In 19th International Conference on World Wide Web. Association for Computing Machinery, NY, USA.","author":"Leskovec J.","unstructured":"J. Leskovec, D. Huttenlocher, and J. Kleinberg. 2010. Predicting Positive and Negative Links in Online Social Networks. In 19th International Conference on World Wide Web. Association for Computing Machinery, NY, USA."},{"key":"e_1_3_2_2_31_1","volume-title":"SNAP: A General-Purpose Network Analysis and Graph-Mining Library. ACM (TIST)","author":"Leskovec J.","year":"2016","unstructured":"J. Leskovec and R. Sosi\u010d. 2016. SNAP: A General-Purpose Network Analysis and Graph-Mining Library. ACM (TIST) (2016)."},{"key":"e_1_3_2_2_32_1","volume-title":"CSNE: Conditional Signed Network Embedding. In 29th ACM International Conference on Information and Knowledge Management(CIKM \u201920)","author":"Mara A.","year":"2020","unstructured":"A. Mara, Y. Mashayekhi, J. Lijffijt, and T. de Bie. 2020. CSNE: Conditional Signed Network Embedding. In 29th ACM International Conference on Information and Knowledge Management(CIKM \u201920). ACM."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Michal Parnas Dana Ron and Ronitt Rubinfeld. 2006. Tolerant property testing and distance approximation. J. Comput. System Sci. (2006).","DOI":"10.1016\/j.jcss.2006.03.002"},{"key":"e_1_3_2_2_34_1","unstructured":"I. Ruzsa and E. Szemer\u00e9di. 1978. Triple systems with no six points carrying three triangles. Combinatorics Coll. Math. Soc. J. Bolyai (1978)."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.59"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"crossref","unstructured":"J. Tang Yi Chang C. Aggarwal and H. Liu. 2016. A survey of signed network mining in social media. ACM Computing Surveys (CSUR) 49 3 (2016).","DOI":"10.1145\/2956185"},{"key":"e_1_3_2_2_37_1","unstructured":"R.C. Tzeng B. Ordozgoiti and A. Gionis. 2020. Discovering conflicting groups in signed networks. Advances in Neural Information Processing Systems (2020)."},{"key":"e_1_3_2_2_38_1","volume-title":"International Conference on Machine Learning. PMLR, 22060\u201322083","author":"Veldt Nate","year":"2022","unstructured":"Nate Veldt. 2022. Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Bounds. In International Conference on Machine Learning. PMLR, 22060\u201322083."},{"key":"e_1_3_2_2_39_1","article-title":"Negative (and positive) circles in signed graphs: A problem collection","volume":"15","author":"Zaslavsky T.","year":"2018","unstructured":"T. Zaslavsky. 2018. Negative (and positive) circles in signed graphs: A problem collection. AKCE Journal of Graphs and Combinatorics 15, 1 (2018).","journal-title":"AKCE Journal of Graphs and Combinatorics"}],"event":{"name":"WWW '23: The ACM Web Conference 2023","location":"Austin TX USA","acronym":"WWW '23","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2023"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583213","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543507.3583213","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:09:18Z","timestamp":1750183758000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583213"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,30]]},"references-count":39,"alternative-id":["10.1145\/3543507.3583213","10.1145\/3543507"],"URL":"https:\/\/doi.org\/10.1145\/3543507.3583213","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"}}]}}