{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T01:55:58Z","timestamp":1785549358111,"version":"3.56.0"},"publisher-location":"New York, NY, USA","reference-count":26,"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"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,4,30]]},"DOI":"10.1145\/3543873.3587544","type":"proceedings-article","created":{"date-parts":[[2023,4,28]],"date-time":"2023-04-28T11:36:14Z","timestamp":1682681774000},"page":"594-597","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Identifying Stable States of Large Signed Graphs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-7227-1865","authenticated-orcid":false,"given":"Muhieddine","family":"Shebaro","sequence":"first","affiliation":[{"name":"Department of Computer Science, Texas State University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9972-9760","authenticated-orcid":false,"given":"Jelena","family":"Te\u0161i\u0107","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Texas State University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,4,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3458817.3476153"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physd.2006.09.028"},{"key":"e_1_3_2_1_3_1","volume-title":"An exact method for computing the frustration index in signed networks using binary programming. CoRR abs\/1611.09030","author":"Aref Samin","year":"2016","unstructured":"Samin Aref, Andrew\u00a0J. Mason, and Mark\u00a0C. Wilson. 2016. An exact method for computing the frustration index in signed networks using binary programming. CoRR abs\/1611.09030 (2016). http:\/\/arxiv.org\/abs\/1611.09030"},{"key":"e_1_3_2_1_4_1","unstructured":"Martin Burtscher. 2021. graphB+: Balancing Algorithm for Large Graphs. https:\/\/userweb.cs.txstate.edu\/\u00a0burtscher\/research\/graphB\/."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1037\/h0046049"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9196697"},{"key":"e_1_3_2_1_7_1","volume-title":"Introduction to algorithms","author":"Cormen H.","unstructured":"Thomas\u00a0H. Cormen. 2009. Introduction to algorithms.MIT Press. https:\/\/libproxy.txstate.edu\/login?url=https:\/\/search.ebscohost.com\/login.aspx?direct=true&db=cat00022a&AN=txi.b5115051&site=eds-live&scope=site"},{"key":"e_1_3_2_1_8_1","first-page":"1","article-title":"Regularized spectral methods for clustering signed networks","volume":"22","author":"Cucuringu Mihai","year":"2021","unstructured":"Mihai Cucuringu, Apoorv\u00a0Vikram Singh, D\u00e9borah Sulem, and Hemant Tyagi. 2021. Regularized spectral methods for clustering signed networks. Journal of Machine Learning Research 22, 264 (2021), 1\u201379.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-020-0630-6"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Aric Hagberg Pieter Swart and Daniel S\u00a0Chult. 2008. Exploring network structure dynamics and function using networkx. https:\/\/networkx.github.io\/documentation\/stable\/reference\/algorithms\/index.html.","DOI":"10.25080\/TCWV9851"},{"key":"e_1_3_2_1_11_1","volume-title":"On the Coloring of Signed Graphs.Elemente der Mathematik 23","author":"Harary Frank","year":"1968","unstructured":"Frank Harary and Dorwin Cartwright. 1968. On the Coloring of Signed Graphs.Elemente der Mathematik 23 (1968), 85\u201389. http:\/\/eudml.org\/doc\/140892"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1080\/00223980.1946.9917275"},{"key":"e_1_3_2_1_13_1","volume-title":"A reverse Aldous-Broder algorithm.ANNALES DE L INSTITUT HENRI POINCARE-PROBABILITES ET STATISTIQUES 57, 2","author":"Hu Yiping","year":"2021","unstructured":"Yiping Hu, Russell Lyons, and Pengfei Tang. 2021. A reverse Aldous-Broder algorithm.ANNALES DE L INSTITUT HENRI POINCARE-PROBABILITES ET STATISTIQUES 57, 2 (2021), 890 \u2013 900. https:\/\/libproxy.txstate.edu\/login?url=https:\/\/search.ebscohost.com\/login.aspx?direct=true&db=edswsc&AN=000677592900014&site=eds-live&scope=site"},{"key":"e_1_3_2_1_14_1","volume-title":"Network polarization, filter bubbles, and echo chambers: An annotated review of measures, models, and case studies. arXiv preprint arXiv:2207.13799","author":"Interian Ruben","year":"2022","unstructured":"Ruben Interian, Ruslan\u00a0G Marzo, Isela Mendoza, and Celso\u00a0C Ribeiro. 2022. Network polarization, filter bubbles, and echo chambers: An annotated review of measures, models, and case studies. arXiv preprint arXiv:2207.13799 (2022)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","unstructured":"Mark Jerrum. 2021. Fundamentals of Partial Rejection Sampling. https:\/\/doi.org\/10.48550\/ARXIV.2106.07744","DOI":"10.48550\/ARXIV.2106.07744"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772756"},{"key":"e_1_3_2_1_17_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_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/RBME.2021.3122522"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-021-02296-4"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2021.3058803"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1086\/soutjanth.10.1.3629074"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-021-00795-z"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-021-81767-7"},{"key":"e_1_3_2_1_24_1","unstructured":"S. Sampson. 1968. A novitiate in a period of change: An experimental and case study of relationships. Ph.D. thesis Cornell University."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnac013"},{"key":"e_1_3_2_1_26_1","unstructured":"David\u00a0Bruce Wilson and James\u00a0Gary Propp. 1996. How to get an exact sample from a generic Markov chain and sample a random spanning tree from a directed graph both within the cover time.Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms (1996) 448 \u2013 457. https:\/\/libproxy.txstate.edu\/login?url=https:\/\/search.ebscohost.com\/login.aspx?direct=true&db=edscma&AN=edscma.314102&site=eds-live&scope=site"}],"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":["Companion Proceedings of the ACM Web Conference 2023"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543873.3587544","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543873.3587544","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T23:36:07Z","timestamp":1755819367000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543873.3587544"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,30]]},"references-count":26,"alternative-id":["10.1145\/3543873.3587544","10.1145\/3543873"],"URL":"https:\/\/doi.org\/10.1145\/3543873.3587544","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"}}]}}