{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,6]],"date-time":"2026-08-06T06:55:00Z","timestamp":1785999300759,"version":"3.56.0"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T00:00:00Z","timestamp":1669766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T00:00:00Z","timestamp":1669766400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003816","name":"Huawei Technologies","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003816","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2023,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>For hypergraph clustering, various methods have been proposed to define hypergraph <jats:italic>p<\/jats:italic>-Laplacians in the literature. This work proposes a general framework for an abstract class of hypergraph <jats:italic>p<\/jats:italic>-Laplacians from a differential-geometric view. This class includes previously proposed hypergraph <jats:italic>p<\/jats:italic>-Laplacians and also includes previously unstudied novel generalizations. For this abstract class, we extend current spectral theory by providing an extension of nodal domain theory for the eigenvectors of our hypergraph <jats:italic>p<\/jats:italic>-Laplacian. We use this nodal domain theory to provide bounds on the eigenvalues via a higher-order Cheeger inequality. Following our extension of spectral theory, we propose a novel hypergraph partitioning algorithm for our generalized <jats:italic>p<\/jats:italic>-Laplacian. Our empirical study shows that our algorithm outperforms spectral methods based on existing <jats:italic>p<\/jats:italic>-Laplacians.<\/jats:p>","DOI":"10.1007\/s10994-022-06264-y","type":"journal-article","created":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T22:09:00Z","timestamp":1669846140000},"page":"241-280","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Generalizing p-Laplacian: spectral hypergraph theory and a partitioning algorithm"],"prefix":"10.1007","volume":"112","author":[{"given":"Shota","family":"Saito","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mark","family":"Herbster","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,11,30]]},"reference":[{"key":"6264_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, S., Branson, K., Belongie, S. (2006). Higher order learning with graphs. Proc. ICML (pp. 17\u201324).","DOI":"10.1145\/1143844.1143847"},{"key":"6264_CR2","unstructured":"Alamgir, M. , & Luxburg, U.V. (2011). Phase transition in the family of p-resistances. In: Proceedings NIPS (pp. 379\u2013387)."},{"issue":"2","key":"6264_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF02579166","volume":"6","author":"N Alon","year":"1986","unstructured":"Alon, N. (1986). Eigenvalues and expanders. Combinatorica, 6(2), 83\u201396.","journal-title":"Combinatorica"},{"issue":"1","key":"6264_CR4","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0095-8956(85)90092-9","volume":"38","author":"N Alon","year":"1985","unstructured":"Alon, N., & Milman, V. D. (1985). $$\\lambda$$1, isoperimetric inequalities for graphs and superconcentrators. J. Comb. Theory Series B., 38(1), 73\u201388.","journal-title":"J. Comb. Theory Series B."},{"issue":"2","key":"6264_CR5","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1162\/089976698300017746","volume":"10","author":"S-I Amari","year":"1998","unstructured":"Amari, S.-I. (1998). Natural gradient works efficiently in learning. Neural Comput, 10(2), 251\u2013276.","journal-title":"Neural Comput"},{"issue":"6","key":"6264_CR6","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.1162\/089976603321780317","volume":"15","author":"M Belkin","year":"2003","unstructured":"Belkin, M., & Niyogi, P. (2003). Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computer, 15(6), 1373\u20131396.","journal-title":"Neural Computer"},{"key":"6264_CR7","unstructured":"Benson, A.R. , Kleinberg, J. , Veldt, N. (2020). Augmented sparsifiers for generalized hypergraph cuts. arXiv preprint arXiv:2007.08075."},{"key":"6264_CR8","volume-title":"Hypergraphs: combinatorics of finite sets","author":"C Berge","year":"1984","unstructured":"Berge, C. (1984). Hypergraphs: combinatorics of finite sets (Vol. 45). Elsevier."},{"issue":"1","key":"6264_CR9","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.jde.2007.10.010","volume":"244","author":"PA Binding","year":"2008","unstructured":"Binding, P. A., & Rynne, B. P. (2008). Variational and non-variational eigenvalues of the p-Laplacian. Journal of Differential Equations, 244(1), 24\u201339.","journal-title":"Journal of Differential Equations"},{"issue":"1\u20133","key":"6264_CR10","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0012-365X(93)90322-K","volume":"117","author":"M Bolla","year":"1993","unstructured":"Bolla, M. (1993). Spectra, euclidean representations and clusterings of hypergraphs. Discrete Mathematics, 117(1\u20133), 19\u201339.","journal-title":"Discrete Mathematics"},{"issue":"2","key":"6264_CR11","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/s11263-008-0159-z","volume":"84","author":"S Bougleux","year":"2009","unstructured":"Bougleux, S., Elmoataz, A., & Melkemi, M. (2009). Local and nonlocal discrete regularization on weighted graphs for image and mesh processing. International Journal of Computer Vision, 84(2), 220\u2013236.","journal-title":"International Journal of Computer Vision"},{"issue":"1\u20137","key":"6264_CR12","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin, S., & Page, L. (1998). The anatomy of a large-scale hypertextual web search engine. Computer Network ISDN, 30(1\u20137), 107\u2013117.","journal-title":"Computer Network ISDN"},{"key":"6264_CR13","unstructured":"B\u00fchler, T. , & Hein, M. (2009). Spectral clustering based on the graph $$p$$-Laplacian. In: Proceedings of ICML pp\u00a081-88."},{"issue":"5","key":"6264_CR14","first-page":"31","volume":"6","author":"T-HH Chan","year":"2018","unstructured":"Chan, T.-H.H., Louis, A., Tang, Z. G., & Zhang, C. (2018). Spectral properties of hypergraph laplacian and approximation algorithms. Journal of the ACM, 6(5), 31\u201348.","journal-title":"Journal of the ACM"},{"issue":"3","key":"6264_CR15","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1137\/19M1291601","volume":"13","author":"J Chang","year":"2020","unstructured":"Chang, J., Chen, Y., Qi, L., & Yan, H. (2020). Hypergraph clustering using a new laplacian tensor with applications in image processing. SIAM Journal on Imaging Sciences, 13(3), 1157\u20131178.","journal-title":"SIAM Journal on Imaging Sciences"},{"issue":"2","key":"6264_CR16","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/jgt.21871","volume":"81","author":"KC Chang","year":"2016","unstructured":"Chang, K. C. (2016). Spectrum of the 1-Laplacian and cheeger\u2019s constant on graphs. Journal of Graph Theory, 81(2), 167\u2013207.","journal-title":"Journal of Graph Theory"},{"issue":"6","key":"6264_CR17","doi-asserted-by":"publisher","first-page":"A2508","DOI":"10.1137\/16M1094828","volume":"39","author":"Y Chen","year":"2017","unstructured":"Chen, Y., Qi, L., & Zhang, X. (2017). The fiedler vector of a laplacian tensor for hypergraph partitioning. SIAM Journal on Science Computer, 39(6), A2508\u2013A2537.","journal-title":"SIAM Journal on Science Computer"},{"key":"6264_CR18","unstructured":"Chung, F. (2007). Four proofs for the cheeger inequality and graph partition algorithms. In: Proceeding of ICCM (Vol.\u00a02, p.\u00a0751-772)."},{"issue":"9","key":"6264_CR19","doi-asserted-by":"publisher","first-page":"3268","DOI":"10.1016\/j.laa.2011.11.018","volume":"436","author":"J Cooper","year":"2012","unstructured":"Cooper, J., & Dutle, A. (2012). Spectra of uniform hypergraphs. Linear Algebra and its Applications, 436(9), 3268\u20133292.","journal-title":"Linear Algebra and its Applications"},{"key":"6264_CR20","volume-title":"Methods of mathematical physics","author":"R Courant","year":"1962","unstructured":"Courant, R., & Hilbert, D. (1962). Methods of mathematical physics. Interscience Publishers."},{"key":"6264_CR21","unstructured":"Dua, D. , & Graff, C. (2022). UCI machine learning repository. Retrieved from http:\/\/archive.ics.uci.edu\/ml"},{"issue":"2","key":"6264_CR22","doi-asserted-by":"publisher","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"23","author":"M Fiedler","year":"1973","unstructured":"Fiedler, M. (1973). Algebraic connectivity of graphs. Czechoslovak Mathematical Journal, 23(2), 298\u2013305.","journal-title":"Czechoslovak Mathematical Journal"},{"issue":"4","key":"6264_CR23","doi-asserted-by":"publisher","first-page":"619","DOI":"10.21136\/CMJ.1975.101357","volume":"25","author":"M Fiedler","year":"1975","unstructured":"Fiedler, M. (1975). A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslovak Mathematical Journal, 25(4), 619\u2013633.","journal-title":"Czechoslovak Mathematical Journal"},{"issue":"5","key":"6264_CR24","doi-asserted-by":"publisher","first-page":"102663","DOI":"10.1016\/j.ipm.2021.102663","volume":"58","author":"A Gharahighehi","year":"2021","unstructured":"Gharahighehi, A., Vens, C., & Pliakos, K. (2021). Fair multi-stakeholder news recommender system with hypergraph ranking. Information Processing & Management, 58(5), 102663.","journal-title":"Information Processing & Management"},{"issue":"1","key":"6264_CR25","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1214\/16-AOS1453","volume":"45","author":"D Ghoshdastidar","year":"2017","unstructured":"Ghoshdastidar, D., & Dukkipati, A. (2017). Consistency of spectral hypergraph partitioning under planted partition model. The Annals of Statistics, 45(1), 289\u2013315.","journal-title":"The Annals of Statistics"},{"issue":"1","key":"6264_CR26","first-page":"1638","volume":"18","author":"D Ghoshdastidar","year":"2017","unstructured":"Ghoshdastidar, D., & Dukkipati, A. (2017). Uniform hypergraph partitioning: Provable tensor methods and sampling techniques. The Journal of Machine Learning Research, 18(1), 1638\u20131678.","journal-title":"The Journal of Machine Learning Research"},{"issue":"3","key":"6264_CR27","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/s007780050005","volume":"8","author":"D Gibson","year":"2000","unstructured":"Gibson, D., Kleinberg, J., & Raghavan, P. (2000). Clustering categorical data: An approach based on dynamical systems. The VLDB Journal, 8(3), 222\u2013236.","journal-title":"The VLDB Journal"},{"issue":"11","key":"6264_CR28","doi-asserted-by":"publisher","first-page":"1768","DOI":"10.1109\/TPAMI.2006.233","volume":"28","author":"L Grady","year":"2006","unstructured":"Grady, L. (2006). Random walks for image segmentation. Transactions on Pattern Analysis and Machine Intelligence, 28(11), 1768\u20131783.","journal-title":"Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"9","key":"6264_CR29","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.1109\/43.159993","volume":"11","author":"L Hagen","year":"1992","unstructured":"Hagen, L., & Kahng, A. B. (1992). New spectral methods for ratio cut partitioning and clustering. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 11(9), 1074\u20131085.","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"6264_CR30","unstructured":"Hein, M. , Setzer, S., Jost, L., Rangapuram, S.S. (2013). The total variation on hypergraphs - learning on hypergraphs revisited. In:Procedings NIPS pp. 2427\u20132435."},{"key":"6264_CR31","unstructured":"Herbster, M., & Lever, G. (2009). Predicting the labelling of a graph via minimum$$p$$-seminorm interpolation. COLT: Proceedings."},{"issue":"4","key":"6264_CR32","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1007\/s10878-011-9407-1","volume":"24","author":"S Hu","year":"2012","unstructured":"Hu, S., & Qi, L. (2012). Algebraic connectivity of an even uniform hypergraph. Journal of Combinatorial Optimization, 24(4), 564\u2013579.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"2","key":"6264_CR33","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10878-013-9596-x","volume":"29","author":"S Hu","year":"2015","unstructured":"Hu, S., & Qi, L. (2015). The Laplacian of a uniform hypergraph. Journal of Combinatorial Optimization, 29(2), 331\u2013366.","journal-title":"Journal of Combinatorial Optimization"},{"key":"6264_CR34","doi-asserted-by":"crossref","unstructured":"Huang, Y. , Liu, Q. , Metaxas, D. (2009). Video object segmentation by hypergraph cut. In:Proceeding CVPR pp. 1738\u20131745.","DOI":"10.1109\/CVPR.2009.5206795"},{"issue":"5","key":"6264_CR35","doi-asserted-by":"publisher","first-page":"e1000385","DOI":"10.1371\/journal.pcbi.1000385","volume":"5","author":"S Klamt","year":"2009","unstructured":"Klamt, S., Haus, U.-U., & Theis, F. (2009). Hypergraphs and Cellular Networks. PLoS Computer Biology, 5(5), e1000385.","journal-title":"PLoS Computer Biology"},{"key":"6264_CR36","first-page":"1637","volume":"6","author":"JR Lee","year":"2014","unstructured":"Lee, J. R., Gharan, S. O., & Trevisan, L. (2014). Multiway spectral partitioning and higher-order cheeger inequalities. Journal of the ACM, 6, 1637.","journal-title":"Journal of the ACM"},{"key":"6264_CR37","unstructured":"Li, P. , & Milenkovic, O. (2017). Inhomogoenous hypergraph clustering with applications. In: Proceedings NIPS pp. 2305\u20132315."},{"key":"6264_CR38","unstructured":"Li, P. , & Milenkovic, O. (2018). Submodular hypergraphs: $$p$$-Laplacians, cheeger inequalities and spectral clustering. In: Proceedings ICML pp. 3020\u20133029."},{"issue":"5","key":"6264_CR39","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1006\/eujc.1996.0040","volume":"17","author":"W-CW Li","year":"1996","unstructured":"Li, W.-C.W., & Sol\u00e9, P. (1996). Spectra of regular graphs and hypergraphs and orthogonal polynomials. European Journal of Combinatorics, 17(5), 461\u2013477.","journal-title":"European Journal of Combinatorics"},{"key":"6264_CR40","doi-asserted-by":"crossref","unstructured":"Lindqvist, P. (2008). A nonlinear eigenvalue problem. Topics in mathematical analysis (pp\u00a0175-203). World Scientific.","DOI":"10.1142\/9789812811066_0005"},{"issue":"1","key":"6264_CR41","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10994-010-5201-z","volume":"81","author":"D Luo","year":"2010","unstructured":"Luo, D., Huang, H., Ding, C., & Nie, F. (2010). On the eigenvectors of $$p$$-Laplacian. Machine Learning, 81(1), 37\u201351.","journal-title":"Machine Learning"},{"issue":"8","key":"6264_CR42","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1145\/345124.345169","volume":"43","author":"B Mobasher","year":"2000","unstructured":"Mobasher, B., Cooley, R., & Srivastava, J. (2000). Automatic personalization based on web usage mining. Communication of ACM, 43(8), 142\u2013151.","journal-title":"Communication of ACM"},{"issue":"23","key":"6264_CR43","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"ME Newman","year":"2006","unstructured":"Newman, M. E. (2006). Modularity and community structure in networks. Proceedings of the National Academy of Sciences, 103(23), 8577\u20138582.","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"6264_CR44","doi-asserted-by":"crossref","unstructured":"Qi, L. (2013). $$h^{+}$$-eigenvalues of Laplacian and signless Laplacian tensors. arXiv preprint arXiv:1303.2186.","DOI":"10.4310\/CMS.2014.v12.n6.a3"},{"issue":"1","key":"6264_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/03081080290011692","volume":"50","author":"JA Rodriguez","year":"2002","unstructured":"Rodriguez, J. A. (2002). On the Laplacian eigenvalues and metric parameters of hypergraphs. Linear and Multilinear Algebra, 50(1), 1\u20134.","journal-title":"Linear and Multilinear Algebra"},{"key":"6264_CR46","doi-asserted-by":"crossref","unstructured":"Saito, S. (2022). Hypergraph modeling via spectral embedding connection: Hypergraph cut, weighted kernel$$k$$-means, and heat kernel. AAAI (to appear): Proceedings.","DOI":"10.1609\/aaai.v36i7.20787"},{"key":"6264_CR47","doi-asserted-by":"crossref","unstructured":"Saito, S. , Mandic, D.P. , Suzuki, H. (2018). Hypergraph $$p$$-Laplacian: A differential geometry view. Proceeding AAAI pp. 3984\u20133991.","DOI":"10.1609\/aaai.v32i1.11823"},{"key":"6264_CR48","first-page":"888","volume":"2","author":"J Shi","year":"1997","unstructured":"Shi, J., & Malik, J. (1997). Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2, 888\u2013905.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"3","key":"6264_CR49","doi-asserted-by":"publisher","first-page":"2085","DOI":"10.1137\/17M115222X","volume":"51","author":"D Slepcev","year":"2019","unstructured":"Slepcev, D., & Thorpe, M. (2019). Analysis of $$p$$-laplacian regularization in semisupervised learning. SIAM Journal on Mathematical Analysis, 51(3), 2085\u20132120.","journal-title":"SIAM Journal on Mathematical Analysis"},{"key":"6264_CR50","unstructured":"Struwe, M. (2000). Variational methods: Applications to nonlinear partial differential equations and hamiltonian systems, third edition. Springer."},{"key":"6264_CR51","unstructured":"Tudisco, F. , & Hein, M. (2016). A nodal domain theorem and a higher-order Cheeger inequality for the graph $$p$$-Laplacian. arXiv:1602.05567."},{"key":"6264_CR52","unstructured":"Veldt, N. , Benson, A.R. , Kleinberg, J. (2020). Hypergraph cuts with general splitting functions. arXiv preprint arXiv:2001.02817."},{"issue":"4","key":"6264_CR53","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U von Luxburg","year":"2007","unstructured":"von Luxburg, U. (2007). A tutorial on spectral clustering. Statistics and computing, 17(4), 395\u2013416.","journal-title":"Statistics and computing"},{"key":"6264_CR54","doi-asserted-by":"crossref","unstructured":"Yoshida, Y. (2019). Cheeger inequalities for submodular transformations. In: Proceedings SODA pp. 2582\u20132601.","DOI":"10.1137\/1.9781611975482.160"},{"key":"6264_CR55","unstructured":"Zhou, D. , Huang, J. , Sch\u00f6lkopf, B. (2006). Learning with hypergraphs: Clustering, classification, and embedding. In: Proceeding NIPS pp. 1601\u20131608."},{"key":"6264_CR56","doi-asserted-by":"crossref","unstructured":"Zhou, D. , & Sch\u00f6lkopf, B. (2005). Regularization on discrete spaces. Pattern recognition (pp. 361\u2013368). Springer.","DOI":"10.1007\/11550518_45"},{"issue":"9","key":"6264_CR57","first-page":"1389","volume":"18","author":"JY Zien","year":"1999","unstructured":"Zien, J. Y., Schlag, M. D. F., & Chan, P. K. (1999). Multilevel spectral hypergraph partitioning with arbitrary vertex sizes. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(9), 1389\u20131399.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-022-06264-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-022-06264-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-022-06264-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,22]],"date-time":"2023-01-22T01:08:12Z","timestamp":1674349692000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-022-06264-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,30]]},"references-count":57,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["6264"],"URL":"https:\/\/doi.org\/10.1007\/s10994-022-06264-y","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,30]]},"assertion":[{"value":"16 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 November 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have declared that no competing interests exist.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}