{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:39Z","timestamp":1740122439457,"version":"3.37.3"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T00:00:00Z","timestamp":1676505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T00:00:00Z","timestamp":1676505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Agorantic FR 3621"},{"DOI":"10.13039\/501100007493","name":"Fondation Math\u00e9matique Jacques Hadamard","doi-asserted-by":"publisher","award":["PGMO"],"award-info":[{"award-number":["PGMO"]}],"id":[{"id":"10.13039\/501100007493","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s10898-023-01270-3","type":"journal-article","created":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T03:03:56Z","timestamp":1676516636000},"page":"355-391","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient enumeration of the optimal solutions to the correlation clustering problem"],"prefix":"10.1007","volume":"86","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5080-4320","authenticated-orcid":false,"given":"Nejat","family":"Ar\u0131n\u0131k","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0344-2686","authenticated-orcid":false,"given":"Rosa","family":"Figueiredo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2619-2835","authenticated-orcid":false,"given":"Vincent","family":"Labatut","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,16]]},"reference":[{"issue":"1\u20133","key":"1270_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/s0166-218x(01)00338-9","volume":"123","author":"RK Ahuja","year":"2002","unstructured":"Ahuja, R.K., Ergun, O., Orlin, J.B., Punnen, A.P.: A survey of very large-scale neighborhood search techniques. Discret. Appl. Math. 123(1\u20133), 75\u2013102 (2002). https:\/\/doi.org\/10.1016\/s0166-218x(01)00338-9","journal-title":"Discret. Appl. Math."},{"key":"1270_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2016.04.002","volume":"211","author":"Z Ales","year":"2016","unstructured":"Ales, Z., Knippel, A., Pauchet, A.: Polyhedral combinatorics of the k-partitioning problem with representative variables. Discret. Appl. Math. 211, 1\u201314 (2016). https:\/\/doi.org\/10.1016\/j.dam.2016.04.002","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"1270_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1093\/comnet\/cny015","volume":"7","author":"S Aref","year":"2018","unstructured":"Aref, S., Wilson, M.C.: Balance and frustration in signed networks. J. Complex Netw. 7(2), 163\u2013189 (2018). https:\/\/doi.org\/10.1093\/comnet\/cny015","journal-title":"J. Complex Netw."},{"unstructured":"Ar\u0131n\u0131k, N., Figueiredo, R., Labatut, V.: Signed graph analysis for the interpretation of voting behavior. In: International Conference on Knowledge Technologies and Data-driven Business - International Workshop on Social Network Analysis and Digital Humanities (2017)","key":"1270_CR4"},{"key":"1270_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.socnet.2019.02.001","volume":"60","author":"N Ar\u0131n\u0131k","year":"2020","unstructured":"Ar\u0131n\u0131k, N., Figueiredo, R., Labatut, V.: Multiple partitioning of multiplex signed networks: application to European parliament votes. Soc. Netw. 60, 83\u2013102 (2020). https:\/\/doi.org\/10.1016\/j.socnet.2019.02.001","journal-title":"Soc. Netw."},{"key":"1270_CR6","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnaa025","author":"N Ar\u0131n\u0131k","year":"2020","unstructured":"Ar\u0131n\u0131k, N., Figueiredo, R., Labatut, V.: Multiplicity and diversity: analyzing the optimal solution space of the correlation clustering problem on complete signed graphs. J. Complex Netw. (2020). https:\/\/doi.org\/10.1093\/comnet\/cnaa025","journal-title":"J. Complex Netw."},{"issue":"2","key":"1270_CR7","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1023\/a:1018570311399","volume":"4","author":"JL Arthur","year":"1997","unstructured":"Arthur, J.L., Hachey, M., Sahr, K., Huso, M., Kiester, A.R.: Finding all optimal solutions to the reserve site selection problem. Environ. Ecol. Stat. 4(2), 153\u2013165 (1997). https:\/\/doi.org\/10.1023\/a:1018570311399","journal-title":"Environ. Ecol. Stat."},{"doi-asserted-by":"publisher","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. In: 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 238\u2013247 (2002). https:\/\/doi.org\/10.1109\/SFCS.2002.1181947","key":"1270_CR8","DOI":"10.1109\/SFCS.2002.1181947"},{"issue":"3","key":"1270_CR9","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum, C., Roli, A.: Metaheuristics in combinatorial optimization. ACM Comput. Surv. 35(3), 268\u2013308 (2003). https:\/\/doi.org\/10.1145\/937503.937505","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"1270_CR10","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1037\/a0017738","volume":"15","author":"M Brusco","year":"2010","unstructured":"Brusco, M., Steinley, D.: K-balance partitioning: An exact method with applications to generalized structural balance and other psychological contexts. Psychol. Methods 15(2), 145\u2013157 (2010). https:\/\/doi.org\/10.1037\/a0017738","journal-title":"Psychol. Methods"},{"issue":"3","key":"1270_CR11","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0006-3207(95)00132-8","volume":"78","author":"JD Camm","year":"1996","unstructured":"Camm, J.D., Polasky, S., Solow, A., Csuti, B.: A note on optimal algorithms for reserve site selection. Biol. Cons. 78(3), 353\u2013355 (1996). https:\/\/doi.org\/10.1016\/0006-3207(95)00132-8","journal-title":"Biol. Cons."},{"key":"1270_CR12","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1037\/h0046049","volume":"63","author":"D Cartwright","year":"1956","unstructured":"Cartwright, D., Harary, F.: Structural balance: a generalization of Heider\u2019s theory. Psychol. Rev. 63, 277\u2013293 (1956). https:\/\/doi.org\/10.1037\/h0046049","journal-title":"Psychol. Rev."},{"doi-asserted-by":"publisher","unstructured":"Charikar, M., Gupta, N., Schwartz, R.: Local guarantees in graph cuts and clustering. In: Integer Programming and Combinatorial Optimization, pp. 136\u2013147. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-59250-3_12","key":"1270_CR13","DOI":"10.1007\/978-3-319-59250-3_12"},{"issue":"2","key":"1270_CR14","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s00224-008-9130-1","volume":"46","author":"P Damaschke","year":"2010","unstructured":"Damaschke, P.: Fixed-parameter enumerability of cluster editing and related problems. Theory Comput. Syst. 46(2), 261\u2013283 (2010). https:\/\/doi.org\/10.1007\/s00224-008-9130-1","journal-title":"Theory Comput. Syst."},{"doi-asserted-by":"publisher","unstructured":"Danna, E., Fenelon, M., Gu, Z., Wunderling, R.: Generating multiple solutions for mixed integer programming problems. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 280\u2013294. Springer (2007). https:\/\/doi.org\/10.1007\/978-3-540-72792-7_22","key":"1270_CR15","DOI":"10.1007\/978-3-540-72792-7_22"},{"issue":"1","key":"1270_CR16","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.biosystems.2006.08.001","volume":"9","author":"B DasGupta","year":"2007","unstructured":"DasGupta, B., Enciso, G.A., Sontag, E., Zhang, Y.: Algorithmic and complexity results for decompositions of biological networks into monotone subsystems. Biosystems 9(1), 161\u2013178 (2007). https:\/\/doi.org\/10.1016\/j.biosystems.2006.08.001","journal-title":"Biosystems"},{"issue":"2","key":"1270_CR17","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1177\/001872676702000207","volume":"20","author":"JA Davis","year":"1967","unstructured":"Davis, J.A.: Clustering and structural balance in graphs. Hum. Relat. 20(2), 181\u2013187 (1967). https:\/\/doi.org\/10.1177\/001872676702000207","journal-title":"Hum. Relat."},{"issue":"2\u20133","key":"1270_CR18","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.tcs.2006.05.008","volume":"361","author":"ED Demaine","year":"2006","unstructured":"Demaine, E.D., Emanuel, D., Fiat, A., Immorlica, N.: Correlation clustering in general weighted graphs. Theoret. Comput. Sci. 361(2\u20133), 172\u2013187 (2006). https:\/\/doi.org\/10.1016\/j.tcs.2006.05.008","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"1270_CR19","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.socnet.2012.01.002","volume":"35","author":"P Doreian","year":"2013","unstructured":"Doreian, P., Lloyd, P., Mrvar, A.: Partitioning large signed two-mode networks: problems and prospects. Soc. Netw. 35(2), 178\u2013203 (2013). https:\/\/doi.org\/10.1016\/j.socnet.2012.01.002","journal-title":"Soc. Netw."},{"issue":"2","key":"1270_CR20","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0378-8733(95)00259-6","volume":"18","author":"P Doreian","year":"1996","unstructured":"Doreian, P., Mrvar, A.: A partitioning approach to structural balance. Soc. Netw. 18(2), 149\u2013168 (1996). https:\/\/doi.org\/10.1016\/0378-8733(95)00259-6","journal-title":"Soc. Netw."},{"key":"1270_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.21307\/joss-2019-012","volume":"16","author":"P Doreian","year":"2015","unstructured":"Doreian, P., Mrvar, A.: Structural balance and signed international relations. J. Soc. Struct. 16, 1 (2015). https:\/\/doi.org\/10.21307\/joss-2019-012","journal-title":"J. Soc. Struct."},{"issue":"4","key":"1270_CR22","doi-asserted-by":"publisher","first-page":"1310","DOI":"10.1257\/aer.102.4.1310","volume":"102","author":"J Esteban","year":"2012","unstructured":"Esteban, J., Mayoral, L., Ray, D.: Ethnicity and conflict: an empirical study. Am. Econ. Rev. 102(4), 1310\u20131342 (2012). https:\/\/doi.org\/10.1257\/aer.102.4.1310","journal-title":"Am. Econ. Rev."},{"issue":"4","key":"1270_CR23","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1016\/j.socnet.2013.09.002","volume":"35","author":"R Figueiredo","year":"2013","unstructured":"Figueiredo, R., Moura, G.: Mixed integer programming formulations for clustering problems related to structural balance. Soc. Netw. 35(4), 639\u2013651 (2013). https:\/\/doi.org\/10.1016\/j.socnet.2013.09.002","journal-title":"Soc. Netw."},{"issue":"1","key":"1270_CR24","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-004-0570-3","volume":"104","author":"M Fischetti","year":"2005","unstructured":"Fischetti, M., Glover, F., Lodi, A.: The feasibility pump. Math. Program. 104(1), 91\u2013104 (2005). https:\/\/doi.org\/10.1007\/s10107-004-0570-3","journal-title":"Math. Program."},{"issue":"3","key":"1270_CR25","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3), 596\u2013615 (1987). https:\/\/doi.org\/10.1145\/28869.28874","journal-title":"J. ACM"},{"issue":"4","key":"1270_CR26","doi-asserted-by":"publisher","first-page":"046106","DOI":"10.1103\/physreve.81.046106","volume":"81","author":"BH Good","year":"2010","unstructured":"Good, B.H., de Montjoye, Y.A., Clauset, A.: Performance of modularity maximization in practical contexts. Phys. Rev. E 81(4), 046106 (2010). https:\/\/doi.org\/10.1103\/physreve.81.046106","journal-title":"Phys. Rev. E"},{"issue":"1\u20133","key":"1270_CR27","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/bf01589097","volume":"45","author":"M Gr\u00f6tschel","year":"1989","unstructured":"Gr\u00f6tschel, M., Wakabayashi, Y.: A cutting plane algorithm for a clustering problem. Math. Program. 45(1\u20133), 59\u201396 (1989). https:\/\/doi.org\/10.1007\/bf01589097","journal-title":"Math. Program."},{"issue":"1\u20133","key":"1270_CR28","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/bf01580870","volume":"47","author":"M Gr\u00f6tschel","year":"1990","unstructured":"Gr\u00f6tschel, M., Wakabayashi, Y.: Facets of the clique partitioning polytope. Math. Program. 47(1\u20133), 367\u2013387 (1990). https:\/\/doi.org\/10.1007\/bf01580870","journal-title":"Math. Program."},{"doi-asserted-by":"crossref","unstructured":"G\u00fcrsoy, F., Badur, B.: Extracting the signed backbone of intrinsically dense weighted networks. arXiv e-prints arXiv:2012.05216 (2020)","key":"1270_CR29","DOI":"10.1093\/comnet\/cnab019"},{"unstructured":"IBM: Ibm ilog cplex 12.8 user manual ibm corporation (2018)","key":"1270_CR30"},{"key":"1270_CR31","volume-title":"Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition","author":"D Jurafsky","year":"2000","unstructured":"Jurafsky, D., Martin, J.H.: Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition, 2nd edn. Prentice-Hall, Hoboken (2000)","edition":"2"},{"doi-asserted-by":"crossref","unstructured":"Keuper, M., Lukasik, J., Singh, M., Yarkony, J.: A benders decomposition approach to correlation clustering. In: The International Conference for High Performance Computing, Networking, Storage, and Analysis (2020)","key":"1270_CR32","DOI":"10.1109\/MLHPCAI4S51975.2020.00009"},{"doi-asserted-by":"publisher","unstructured":"Kosch\u00fctzki, D., Lehmann, K.A., Peeters, L., Richter, S., Tenfelde-Podehl, D., Zlotowski, O.: Centrality indices. In: Network Analysis: Methodological Foundations, Lecture Notes in Computer Science, vol. 3418, pp. 16\u201361 (2005). https:\/\/doi.org\/10.1007\/978-3-540-31955-9_3","key":"1270_CR33","DOI":"10.1007\/978-3-540-31955-9_3"},{"issue":"1\u20132","key":"1270_CR34","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Nav. Res. Logist. Q. 2(1\u20132), 83\u201397 (1955). https:\/\/doi.org\/10.1002\/nav.3800020109","journal-title":"Nav. Res. Logist. Q."},{"doi-asserted-by":"publisher","unstructured":"Kunegis, J., Lommatzsch, A., Bauckhage, C.: The slashdot zoo. In: Proceedings of the 18th International Conference on World Wide Web, pp. 741\u2013750. ACM Press (2009). https:\/\/doi.org\/10.1145\/1526709.1526809","key":"1270_CR35","DOI":"10.1145\/1526709.1526809"},{"key":"1270_CR36","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2019.2911943","author":"X Liu","year":"2019","unstructured":"Liu, X., Cheng, H.M., Zhang, Z.Y.: Evaluation of community detection methods. IEEE Trans. Knowl. Data Eng. (2019). https:\/\/doi.org\/10.1109\/tkde.2019.2911943","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"1270_CR37","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10479-016-2234-0","volume":"248","author":"F Ma","year":"2016","unstructured":"Ma, F., Hao, J.K.: A multiple search operator heuristic for the max-k-cut problem. Ann. Oper. Res. 248(1), 365\u2013403 (2016). https:\/\/doi.org\/10.1007\/s10479-016-2234-0","journal-title":"Ann. Oper. Res."},{"unstructured":"Massa, P., Avesani, P.: Controversial users demand local trust metrics: an experimental study on epinions.com community. In: Proceedings of the 20th National Conference on Artificial Intelligence, vol.\u00a01, pp. 121\u2013126 (2005)","key":"1270_CR38"},{"issue":"1","key":"1270_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/s0167-6377(98)00006-6","volume":"22","author":"A Mehrotra","year":"1998","unstructured":"Mehrotra, A., Trick, M.A.: Cliques and clustering: a combinatorial approach. Oper. Res. Lett. 22(1), 1\u201312 (1998). https:\/\/doi.org\/10.1016\/s0167-6377(98)00006-6","journal-title":"Oper. Res. Lett."},{"key":"1270_CR40","volume-title":"Integer and Combinatorial Optimization","author":"G Nemhauser","year":"1999","unstructured":"Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. Wiley, New York (1999)"},{"doi-asserted-by":"publisher","unstructured":"Nowozin, S., Jegelka, S.: Solution stability in linear programming relaxations. In: Proceedings of the 26th Annual International Conference on Machine Learning\u2014ICML. ACM Press (2009). https:\/\/doi.org\/10.1145\/1553374.1553473","key":"1270_CR41","DOI":"10.1145\/1553374.1553473"},{"issue":"4","key":"1270_CR42","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1002\/net.10004","volume":"38","author":"M Oosten","year":"2001","unstructured":"Oosten, M., Rutten, J.H.G.C., Spieksma, F.C.R.: The clique partitioning problem: facets and patching facets. Networks 38(4), 209\u2013226 (2001). https:\/\/doi.org\/10.1002\/net.10004","journal-title":"Networks"},{"issue":"2","key":"1270_CR43","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1080\/07388940490463933","volume":"21","author":"J Pevehouse","year":"2004","unstructured":"Pevehouse, J., Nordstrom, T., Warnke, K.: The correlates of war 2 international governmental organizations data version 2.0. Confl. Manag. Peace Sci. 21(2), 101\u2013119 (2004). https:\/\/doi.org\/10.1080\/07388940490463933","journal-title":"Confl. Manag. Peace Sci."},{"key":"1270_CR44","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-020-00989-7","author":"E Queiroga","year":"2021","unstructured":"Queiroga, E., Subramanian, A., Figueiredo, R., Frota, Y.: Integer programming formulations and efficient local search for relaxed correlation clustering. J. Global Optim. (2021). https:\/\/doi.org\/10.1007\/s10898-020-00989-7","journal-title":"J. Global Optim."},{"issue":"1","key":"1270_CR45","doi-asserted-by":"publisher","first-page":"22022","DOI":"10.1038\/srep22022","volume":"6","author":"S Tan","year":"2016","unstructured":"Tan, S., L\u00fc, J.: An evolutionary game approach for determination of the structural conflicts in signed networks. Sci. Rep. 6(1), 22022 (2016). https:\/\/doi.org\/10.1038\/srep22022","journal-title":"Sci. Rep."},{"issue":"1","key":"1270_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0095-8956(87)90026-8","volume":"43","author":"T Zaslavsky","year":"1987","unstructured":"Zaslavsky, T.: Balanced decompositions of a signed graph. J. Comb. Theory Ser. B 43(1), 1\u201313 (1987). https:\/\/doi.org\/10.1016\/0095-8956(87)90026-8","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-023-01270-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-023-01270-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-023-01270-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T05:10:19Z","timestamp":1684300219000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-023-01270-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,16]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["1270"],"URL":"https:\/\/doi.org\/10.1007\/s10898-023-01270-3","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2023,2,16]]},"assertion":[{"value":"10 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}