{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:55:19Z","timestamp":1759146919603,"version":"3.37.3"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100011531","name":"University of Alabama","doi-asserted-by":"publisher","award":["RG14678","RG14838"],"award-info":[{"award-number":["RG14678","RG14838"]}],"id":[{"id":"10.13039\/100011531","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN Oper. Res. Forum"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s43069-020-00020-5","type":"journal-article","created":{"date-parts":[[2020,9,11]],"date-time":"2020-09-11T17:02:58Z","timestamp":1599843778000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Convex Optimization for the Densest Subgraph and Densest Submatrix Problems"],"prefix":"10.1007","volume":"1","author":[{"given":"Polina","family":"Bombina","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0810-7956","authenticated-orcid":false,"given":"Brendan","family":"Ames","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,11]]},"reference":[{"issue":"4","key":"20_CR1","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume":"40","author":"R Karp","year":"1972","unstructured":"Karp R (1972) Reducibility among combinatorial problems. Complexity of Computer Computations 40(4):85\u2013103","journal-title":"Complexity of Computer Computations"},{"key":"20_CR2","unstructured":"Alon N, Arora S, Manokaran R, Moshkovitz D, Weinstein O (2011) Inapproximability of densest \u03ba-subgraph from average case hardness. Unpublished manuscript 1"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Feige U (2002) Relations between average case complexity and approximation complexity. In: Proceedings of the thiry-fourth annual ACM symposium on theory of computing. ACM, pp 534\u2013543","DOI":"10.1145\/509907.509985"},{"issue":"4","key":"20_CR4","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1137\/S0097539705447037","volume":"36","author":"S Khot","year":"2006","unstructured":"Khot S (2006) Ruling out PTAS for graph min-bisection, dense k-subgraph, and bipartite clique. SIAM J Comput 36(4):1025\u20131071","journal-title":"SIAM J Comput"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Henzinger MR, Motwani R, Silverstein C (2002) Challenges in web search engines. In: ACM SIGIR forum, vol 36. ACM, pp 11\u201322","DOI":"10.1145\/792550.792553"},{"key":"20_CR6","unstructured":"Gibson D, Kumar R, Tomkins A (2005) Discovering large dense subgraphs in massive graphs. In: B\u00f6hm K, Jensen C S, Haas L M, Kersten M L, Larson P, Ooi BC (eds) Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30 - September 2, 2005. ACM, pp 721\u2013732"},{"issue":"6","key":"20_CR7","doi-asserted-by":"publisher","first-page":"574","DOI":"10.14778\/2168651.2168658","volume":"5","author":"A Angel","year":"2012","unstructured":"Angel A, Koudas N, Sarkas N, Srivastava D (2012) Dense subgraph maintenance under streaming edge weight updates for real-time story identification. Proc. VLDB Endow. 5(6):574\u2013585","journal-title":"Proc. VLDB Endow."},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Gajewar A, Das Sarma A (2012) Multi-skill collaborative teams based on densest subgraphs. In: Proceedings of the 2012 SIAM international conference on data mining. SIAM, pp 165\u2013176","DOI":"10.1137\/1.9781611972825.15"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Tsourakakis C (2015) The k-clique densest subgraph problem. In: Proceedings of the 24th international conference on world wide web. International World Wide Web Conferences Steering Committee, pp 1122\u20131132","DOI":"10.1145\/2736277.2741098"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Tsourakakis C, Bonchi F, Gionis A, Gullo F, Tsiarli M (2013) Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. In: Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 104\u2013112","DOI":"10.1145\/2487575.2487645"},{"issue":"1","key":"20_CR11","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1109\/TIT.2015.2490670","volume":"62","author":"E Abbe","year":"2016","unstructured":"Abbe E, Bandeira A, Hall G (2016) Exact recovery in the stochastic block model. IEEE Trans Inf Theory 62(1):471\u2013487","journal-title":"IEEE Trans Inf Theory"},{"key":"20_CR12","unstructured":"Ailon N, Chen Y, Xu H (2013) Breaking the small cluster barrier of graph clustering. In: International conference on machine learning, pp 995\u20131003"},{"issue":"1-2","key":"20_CR13","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10107-013-0733-1","volume":"143","author":"B Ames","year":"2014","unstructured":"Ames B, Vavasis S (2014) Convex optimization for the planted k-disjoint-clique problem. Math Program 143(1-2):299\u2013337","journal-title":"Math Program"},{"issue":"1-2","key":"20_CR14","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s10107-013-0729-x","volume":"147","author":"B Ames","year":"2014","unstructured":"Ames B (2014) Guaranteed clustering and biclustering via semidefinite programming. Math Program 147(1-2):429\u2013465","journal-title":"Math Program"},{"issue":"1","key":"20_CR15","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1214\/17-AOS1545","volume":"46","author":"A Amini","year":"2018","unstructured":"Amini A, Levina E (2018) On semidefinite relaxations for the block model. Ann Stat 46(1):149\u2013 179","journal-title":"Ann Stat"},{"issue":"3","key":"20_CR16","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1214\/14-AOS1290","volume":"43","author":"T Cai","year":"2015","unstructured":"Cai T, Li X (2015) Robust and computationally feasible community detection in the presence of arbitrary outlier nodes. Ann Stat 43(3):1027\u20131059","journal-title":"Ann Stat"},{"issue":"1","key":"20_CR17","first-page":"2213","volume":"15","author":"Y Chen","year":"2014","unstructured":"Chen Y, Jalali A, Sanghavi S, Xu H (2014) Clustering partially observed graphs via convex optimization. The Journal of Machine Learning Research 15(1):2213\u20132238","journal-title":"The Journal of Machine Learning Research"},{"issue":"10","key":"20_CR18","doi-asserted-by":"publisher","first-page":"6440","DOI":"10.1109\/TIT.2014.2346205","volume":"60","author":"Y Chen","year":"2014","unstructured":"Chen Y, Sanghavi S, Xu H (2014) Improved graph clustering. IEEE Trans Inf Theory 60(10):6440\u20136455","journal-title":"IEEE Trans Inf Theory"},{"key":"20_CR19","unstructured":"Chen Y, Xu J (2014) Statistical-computational phase transitions in planted models: the high-dimensional setting. In: International conference on machine learning, pp 244\u2013252"},{"key":"20_CR20","unstructured":"Gu\u00e9don O, Vershynin R (2015) Community detection in sparse networks via Grothendieck\u2019s inequality. Probab Theory Relat Fields, pp 1\u201325"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Hajek B, Wu Y, Xu J (2015) Achieving exact cluster recovery threshold via semidefinite programming. In: IEEE international symposium on information theory. IEEE, pp 1442\u20131446","DOI":"10.1109\/ISIT.2015.7282694"},{"issue":"1","key":"20_CR22","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1214\/14-AOS1274","volume":"43","author":"J Lei","year":"2015","unstructured":"Lei J, Rinaldo A (2015) Consistency of spectral clustering in stochastic block models. Ann Stat 43(1):215\u2013237","journal-title":"Ann Stat"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Mathieu C, Schudy W (2010) Correlation clustering with noisy input. In: ACM-SIAM symposium on discrete algorithms. Society for Industrial and Applied Mathematics, pp 712\u2013728","DOI":"10.1137\/1.9781611973075.58"},{"key":"20_CR24","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.ic.2015.09.002","volume":"245","author":"A Nellore","year":"2015","unstructured":"Nellore A, Ward R (2015) Recovery guarantees for exemplar-based clustering. Inf Comput 245:165\u2013180","journal-title":"Inf Comput"},{"key":"20_CR25","unstructured":"Oymak S, Hassibi B (2011) Finding dense clusters via \u201clow rank + sparse\u201d decomposition. arXiv:1104.5186"},{"issue":"4","key":"20_CR26","doi-asserted-by":"publisher","first-page":"1878","DOI":"10.1214\/11-AOS887","volume":"39","author":"K Rohe","year":"2011","unstructured":"Rohe K, Chatterjee S, Yu B (2011) Spectral clustering and the high-dimensional stochastic blockmodel. Ann Stat 39(4):1878\u20131915","journal-title":"Ann Stat"},{"key":"20_CR27","unstructured":"Qin T, Rohe K (2013) Regularized spectral clustering under the degree-corrected stochastic blockmodel. In: Advances in neural information processing systems, pp 3120\u20133128"},{"key":"20_CR28","doi-asserted-by":"crossref","unstructured":"Vinayak R, Oymak S, Hassibi B (2014) Sharp performance bounds for graph clustering via convex optimization. In: IEEE international conference on acoustics, speech and signal processing (ICASSP). IEEE, pp 8297\u20138301","DOI":"10.1109\/ICASSP.2014.6855219"},{"issue":"2","key":"20_CR29","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0378-8733(83)90021-7","volume":"5","author":"PW Holland","year":"1983","unstructured":"Holland PW, Laskey KB, Leinhardt S (1983) Stochastic blockmodels: first steps. Social networks 5(2):109\u2013137","journal-title":"Social networks"},{"key":"20_CR30","unstructured":"Li X, Chen Y, Xu J (2018) Convex relaxation methods for community detection. arXiv:1810.00315"},{"issue":"1","key":"20_CR31","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10107-011-0459-x","volume":"129","author":"B Ames","year":"2011","unstructured":"Ames B, Vavasis SA (2011) Nuclear norm minimization for the planted clique and biclique problems. Mathematical Programming 129(1):69\u201389","journal-title":"Mathematical Programming"},{"issue":"2","key":"20_CR32","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/s10957-015-0777-x","volume":"167","author":"B Ames","year":"2015","unstructured":"Ames B (2015) Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation. J Optim Theory Appl 167(2):653\u2013675","journal-title":"J Optim Theory Appl"},{"key":"20_CR33","doi-asserted-by":"crossref","unstructured":"Bomze IM, Budinich M, Pardalos PM, Pelillo M (1999) The maximum clique problem. In: Handbook of combinatorial optimization. Springer, pp 1\u201374","DOI":"10.1007\/978-1-4757-3023-4_1"},{"issue":"3","key":"20_CR34","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01098364","volume":"4","author":"PM Pardalos","year":"1994","unstructured":"Pardalos PM, Xue J (1994) The maximum clique problem. Journal of global Optimization 4(3):301\u2013328","journal-title":"Journal of global Optimization"},{"issue":"4","key":"20_CR35","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1007\/s10208-014-9215-y","volume":"15","author":"Y Deshpande","year":"2015","unstructured":"Deshpande Y, Montanari A (2015) Finding hidden cliques of size $\\sqrt {N\/e}$ in nearly linear time. Found Comput Math 15(4):1069\u20131128","journal-title":"Found Comput Math"},{"issue":"2","key":"20_CR36","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10955-015-1338-2","volume":"161","author":"A Montanari","year":"2015","unstructured":"Montanari A (2015) Finding one community in a sparse graph. J Stat Phys 161(2):273\u2013299","journal-title":"J Stat Phys"},{"issue":"8","key":"20_CR37","doi-asserted-by":"publisher","first-page":"4729","DOI":"10.1109\/TIT.2017.2653804","volume":"63","author":"B Hajek","year":"2017","unstructured":"Hajek B, Wu Y, Xu J (2017) Information limits for recovering a hidden community. IEEE Trans Inf Theory 63(8):4729\u20134745","journal-title":"IEEE Trans Inf Theory"},{"key":"20_CR38","unstructured":"Hajek B, Wu Y, Xu J (2016) Semidefinite programs for exact recovery of a hidden community. In: Conference on learning theory, pp 1051\u20131095"},{"key":"20_CR39","doi-asserted-by":"crossref","unstructured":"Saad H, Nosratinia A (2018) Belief propagation with side information for recovering a single community. In: 2018 IEEE international symposium on information theory (ISIT). IEEE, pp 1271\u20131275","DOI":"10.1109\/ISIT.2018.8437840"},{"issue":"2","key":"20_CR40","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1017\/jpr.2018.22","volume":"55","author":"B Hajek","year":"2018","unstructured":"Hajek B, Wu Y, Xu J (2018) Recovering a hidden community beyond the Kesten\u2013Stigum threshold in O(|E|log\u2217|V |) time. J Appl Probab 55(2):325\u2013352. https:\/\/doi.org\/10.1017\/jpr.2018.22. ISSN:0021-9002, 62H12 (60C05) 3832891 https:\/\/doi.org\/10.1017\/jpr.2018.22","journal-title":"J Appl Probab"},{"issue":"1","key":"20_CR41","first-page":"6817","volume":"18","author":"B Hajek","year":"2017","unstructured":"Hajek B, Wu Y, Xu J (2017) Submatrix localization via message passing. J Machine Learn Res 18(1):6817\u20136868","journal-title":"J Machine Learn Res"},{"key":"20_CR42","doi-asserted-by":"crossref","unstructured":"Banks J, Moore C, Vershynin R, Verzelen N, Xu J (2018) Information-theoretic bounds and phase transitions in clustering, sparse PCA, and submatrix localization. IEEE Trans Inform Theory","DOI":"10.1109\/ISIT.2017.8006706"},{"key":"20_CR43","unstructured":"Brennan M, Bresler G, Huleihel W (2019) Universality of computational lower bounds for submatrix detection. arXiv:1902.06916"},{"key":"20_CR44","unstructured":"Chen Y, Sanghavi S, Xu H (2012) Clustering sparse graphs. In: Advances in neural information processing systems, pp 2204\u20132212"},{"issue":"3","key":"20_CR45","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht B, Fazel M, Parrilo PA (2010) Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev 52 (3):471\u2013501","journal-title":"SIAM Rev"},{"issue":"3-4","key":"20_CR46","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<457::AID-RSA14>3.0.CO;2-W","volume":"13","author":"N Alon","year":"1998","unstructured":"Alon N, Krivelevich M, Sudakov B (1998) Finding a large hidden clique in a random graph. Random Structures and Algorithms 13(3-4):457\u2013466","journal-title":"Random Structures and Algorithms"},{"key":"20_CR47","doi-asserted-by":"crossref","unstructured":"Feige U, Ron D (2010) Finding hidden cliques in linear time. In: 21st international meeting on probabilistic, combinatorial, and asymptotic methods in the analysis of algorithms (AofA\u201910). Discrete Mathematics and Theoretical Computer Science, pp 189\u2013204","DOI":"10.46298\/dmtcs.2802"},{"issue":"1","key":"20_CR48","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1017\/S096354831300045X","volume":"23","author":"Y Dekel","year":"2014","unstructured":"Dekel Y, Gurel-Gurevich O, Peres Y (2014) Finding hidden cliques in linear time with high probability. Comb Probab Comput 23(1):29\u201349","journal-title":"Comb Probab Comput"},{"issue":"3","key":"20_CR49","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1023\/A:1008374125234","volume":"20","author":"A Juels","year":"2000","unstructured":"Juels A, Peinado M (2000) Hiding cliques for cryptographic security. Des Codes Crypt 20(3):269\u2013280","journal-title":"Des Codes Crypt"},{"key":"20_CR50","unstructured":"Golub G, Van Loan C (1996) Matrix computations. Johns Hopkins University Press"},{"key":"20_CR51","doi-asserted-by":"crossref","unstructured":"Boucheron S, Lugosi G, Massart P (2013) Concentration inequalities: a nonasymptotic theory of independence. Oxford University Press","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"key":"20_CR52","unstructured":"Bandeira AS, van Handel R (2014) Sharp nonasymptotic bounds on the norm of random matrices with independent entries. Annals of Probability to appear"},{"issue":"1","key":"20_CR53","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd S, Parikh N, Chu E, Peleato B, Eckstein J, et al. (2011) Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends\u00ae;, in Machine learning 3(1):1\u2013122","journal-title":"Foundations and Trends\u00ae;, in Machine learning"},{"key":"20_CR54","doi-asserted-by":"crossref","unstructured":"Bader DA, Meyerhenke H, Sanders P, Wagner D (2012) Graph partitioning and graph clustering. In: 10th DIMACS implementation challenge workshop","DOI":"10.1090\/conm\/588"},{"key":"20_CR55","doi-asserted-by":"crossref","unstructured":"Bader DA, Meyerhenke H, Sanders P, Schulz C, Kappes A, Wagner D (2014) Benchmarking for graph clustering and partitioning. Encyclopedia of Social Network Analysis and Mining, pp 73\u201382","DOI":"10.1007\/978-1-4614-6170-8_23"},{"issue":"4","key":"20_CR56","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1142\/S0219525903001067","volume":"6","author":"P Gleiser","year":"2003","unstructured":"Gleiser P, Danoni L (2003) Community structure in jazz. Advances in Complex Systems 6(4):565\u2013573","journal-title":"Advances in Complex Systems"},{"key":"20_CR57","doi-asserted-by":"crossref","unstructured":"Bastian M, Heymann S, Jacomy M (2009) Gephi: an open source software for exploring and manipulating networks. In: Third international AAAI conference on weblogs and social media","DOI":"10.1609\/icwsm.v3i1.13937"},{"issue":"6","key":"20_CR58","doi-asserted-by":"publisher","first-page":"e98,679","DOI":"10.1371\/journal.pone.0098679","volume":"9","author":"M Jacomy","year":"2014","unstructured":"Jacomy M, Venturini T, Heymann S, Bastian M (2014) ForceAtlas2, a continuous graph layout algorithm for handy network visualization designed for the Gephi software. PloS one 9(6):e98,679","journal-title":"PloS one"},{"key":"20_CR59","doi-asserted-by":"crossref","unstructured":"Tsourakakis C, Bonch F (2013) Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. KDD \u201913 Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 104\u2013112","DOI":"10.1145\/2487575.2487645"},{"key":"20_CR60","doi-asserted-by":"crossref","unstructured":"Sotirov R (2019) On solving the densest k-subgraph problem on large graphs. arXiv:1901.06344","DOI":"10.1080\/10556788.2019.1595620"},{"issue":"1-2","key":"20_CR61","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000048","volume":"8","author":"JA Tropp","year":"2015","unstructured":"Tropp JA, et al. (2015) An introduction to matrix concentration inequalities. Foundations and Trends\u00ae;, in Machine Learning 8(1-2):1\u2013230","journal-title":"Foundations and Trends\u00ae;, in Machine Learning"},{"issue":"4","key":"20_CR62","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10208-011-9099-z","volume":"12","author":"JA Tropp","year":"2012","unstructured":"Tropp JA (2012) User-friendly tail bounds for sums of random matrices. Foundations of Computational Mathematics 12(4):389\u2013434","journal-title":"Foundations of Computational Mathematics"}],"container-title":["SN Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-020-00020-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-020-00020-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-020-00020-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T23:43:40Z","timestamp":1668728620000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-020-00020-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9]]},"references-count":62,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["20"],"URL":"https:\/\/doi.org\/10.1007\/s43069-020-00020-5","relation":{},"ISSN":["2662-2556"],"issn-type":[{"type":"electronic","value":"2662-2556"}],"subject":[],"published":{"date-parts":[[2020,9]]},"assertion":[{"value":"12 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interest"}}],"article-number":"23"}}