{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T06:58:20Z","timestamp":1765609100428,"version":"3.46.0"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2024,4,3]],"date-time":"2024-04-03T00:00:00Z","timestamp":1712102400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,3]],"date-time":"2024-04-03T00:00:00Z","timestamp":1712102400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s10994-024-06536-9","type":"journal-article","created":{"date-parts":[[2024,4,3]],"date-time":"2024-04-03T14:02:14Z","timestamp":1712152934000},"page":"3929-3959","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Generalization bounds for learning under graph-dependence: a survey"],"prefix":"10.1007","volume":"113","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0748-7398","authenticated-orcid":false,"given":"Rui-Ray","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Massih-Reza","family":"Amini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,3]]},"reference":[{"issue":"16","key":"6536_CR1","first-page":"441","volume":"10","author":"S Agarwal","year":"2009","unstructured":"Agarwal, S., & Niyogi, P. (2009). Generalization bounds for ranking algorithms via algorithmic stability. Journal of Machine Learning Research, 10(16), 441\u2013474.","journal-title":"Journal of Machine Learning Research"},{"key":"6536_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-15726-9","volume-title":"Learning with partially labeled and interdependent data","author":"MR Amini","year":"2015","unstructured":"Amini, M. R., & Usunier, N. (2015). Learning with partially labeled and interdependent data. Springer."},{"key":"6536_CR3","volume-title":"Spatial econometrics: Methods and models","author":"L Anselin","year":"2013","unstructured":"Anselin, L. (2013). Spatial econometrics: Methods and models (Vol. 4). Springer."},{"issue":"4","key":"6536_CR4","doi-asserted-by":"publisher","first-page":"1646","DOI":"10.1214\/aop\/1176991178","volume":"17","author":"P Baldi","year":"1989","unstructured":"Baldi, P., & Rinott, Y. (1989). On normal approximations of distributions in terms of dependency graphs. The Annals of Probability, 17(4), 1646\u20131650.","journal-title":"The Annals of Probability"},{"key":"6536_CR5","first-page":"463","volume":"3","author":"PL Bartlett","year":"2002","unstructured":"Bartlett, P. L., & Mendelson, S. (2002). Rademacher and Gaussian complexities: Risk bounds and structural results. Journal of Machine Learning Research, 3, 463\u2013482.","journal-title":"Journal of Machine Learning Research"},{"key":"6536_CR6","doi-asserted-by":"crossref","unstructured":"Betlei, A., Diemert, E., & Amini, M. (2021). Uplift modeling with generalization guarantees. In 27th ACM SIGKDD conference on knowledge discovery and data mining (pp. 55\u201365).","DOI":"10.1145\/3447548.3467395"},{"key":"6536_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern graph theory","author":"B Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s, B. (1998). Modern graph theory (Vol. 184). Springer."},{"key":"6536_CR8","doi-asserted-by":"crossref","unstructured":"Boser, B., Guyon, I., & Vapnik, V. (1992). A training algorithm for optimal margin classifiers. In Proceedings of the 5th annual workshop on computational learning theory (COLT\u201992) (pp. 144\u2013152).","DOI":"10.1145\/130385.130401"},{"key":"6536_CR9","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001","volume-title":"Concentration inequalities: A nonasymptotic theory of independence","author":"S Boucheron","year":"2013","unstructured":"Boucheron, S., Lugosi, G., & Massart, P. (2013). Concentration inequalities: A nonasymptotic theory of independence. Oxford University Press."},{"key":"6536_CR11","first-page":"499","volume":"2","author":"O Bousquet","year":"2002","unstructured":"Bousquet, O., & Elisseeff, A. (2002). Stability and generalization. Journal of Machine Learning Research, 2, 499\u2013526.","journal-title":"Journal of Machine Learning Research"},{"key":"6536_CR12","unstructured":"Bousquet, O., Klochkov, Y., & Zhivotovskiy, N. (2020). Sharper bounds for uniformly stable algorithms. In Conference on learning theory (pp. 610\u2013626). PMLR."},{"key":"6536_CR13","doi-asserted-by":"crossref","unstructured":"Chen, L. H. (1975). Poisson approximation for dependent trials. The Annals of Probability, 534\u2013545","DOI":"10.1214\/aop\/1176996359"},{"issue":"3","key":"6536_CR14","first-page":"223","volume":"43","author":"LH Chen","year":"1978","unstructured":"Chen, L. H. (1978). Two central limit problems for dependent random variables. Probability Theory and Related Fields, 43(3), 223\u2013243.","journal-title":"Probability Theory and Related Fields"},{"key":"6536_CR15","unstructured":"Cortes, C., & Mohri, M. (2004). AUC optimization vs. error rate minimization. In Advances in neural information processing systems."},{"key":"6536_CR16","doi-asserted-by":"crossref","unstructured":"Dehling, H., & Philipp, W. (2002). Empirical process techniques for dependent data. In Empirical process techniques for dependent data (pp. 3\u2013113). Springer.","DOI":"10.1007\/978-1-4612-0099-4_1"},{"issue":"5","key":"6536_CR17","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1109\/TIT.1979.1056087","volume":"25","author":"L Devroye","year":"1979","unstructured":"Devroye, L., & Wagner, T. (1979). Distribution-free performance bounds for potential function rules. IEEE Transactions on Information Theory, 25(5), 601\u2013604.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"6536_CR18","first-page":"533","volume":"6","author":"J Dousse","year":"2019","unstructured":"Dousse, J., & F\u00e9ray, V. (2019). Weighted dependency graphs and the Ising model. Annales de l\u2019Institut Henri Poincar\u00e9 D, 6(4), 533\u2013571.","journal-title":"Annales de l\u2019Institut Henri Poincar\u00e9 D"},{"issue":"2","key":"6536_CR19","first-page":"609","volume":"10","author":"P Erd\u0151s","year":"1975","unstructured":"Erd\u0151s, P., & Lov\u00e1sz, L. (1975). Problems and results on 3-chromatic hypergraphs and some related questions. Infinite and Finite Sets, 10(2), 609\u2013627.","journal-title":"Infinite and Finite Sets"},{"key":"6536_CR20","unstructured":"Feldman, V., & Vondrak, J. (2019). High probability generalization bounds for uniformly stable algorithms with nearly optimal rate. In Conference on learning theory (pp. 1270\u20131279). PMLR."},{"key":"6536_CR21","doi-asserted-by":"crossref","unstructured":"F\u00e9ray, V. (2018). Weighted dependency graphs. Electronic Journal of Probability, 23.","DOI":"10.1214\/18-EJP222"},{"key":"6536_CR22","first-page":"933","volume":"4","author":"Y Freund","year":"2003","unstructured":"Freund, Y., Iyer, R. D., Schapire, R. E., et al. (2003). An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4, 933\u2013969.","journal-title":"Journal of Machine Learning Research"},{"issue":"1\u20133","key":"6536_CR23","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0012-365X(91)90436-6","volume":"97","author":"R Halin","year":"1991","unstructured":"Halin, R. (1991). Tree-partitions of infinite graphs. Discrete Mathematics, 97(1\u20133), 203\u2013217.","journal-title":"Discrete Mathematics"},{"key":"6536_CR24","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.jmva.2014.02.012","volume":"127","author":"H Hang","year":"2014","unstructured":"Hang, H., & Steinwart, I. (2014). Fast learning from $$\\alpha $$-mixing observations. Journal of Multivariate Analysis, 127, 184\u2013199.","journal-title":"Journal of Multivariate Analysis"},{"key":"6536_CR25","doi-asserted-by":"publisher","first-page":"1556","DOI":"10.1016\/j.neucom.2015.07.088","volume":"171","author":"F He","year":"2016","unstructured":"He, F., Zuo, L., & Chen, H. (2016). Stability analysis for ranking with stationary $$\\varphi $$-mixing samples. Neurocomputing, 171, 1556\u20131562.","journal-title":"Neurocomputing"},{"issue":"3","key":"6536_CR26","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1215\/S0012-7094-48-01568-3","volume":"15","author":"W Hoeffding","year":"1948","unstructured":"Hoeffding, W., & Robbins, H. (1948). The central limit theorem for dependent random variables. Duke Mathematical Journal, 15(3), 773\u2013780.","journal-title":"Duke Mathematical Journal"},{"issue":"4","key":"6536_CR27","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1137\/1107036","volume":"7","author":"IA Ibragimov","year":"1962","unstructured":"Ibragimov, I. A. (1962). Some limit theorems for stationary processes. Theory of Probability & its Applications, 7(4), 349\u2013382.","journal-title":"Theory of Probability & its Applications"},{"key":"6536_CR28","unstructured":"Isaev, M., Rodionov, I., & Zhang, R.R. et\u00a0al (2021). Extremal independence in discrete random systems. arXiv preprint arXiv:2105.04917"},{"issue":"1","key":"6536_CR29","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1214\/aop\/1176991903","volume":"16","author":"S Janson","year":"1988","unstructured":"Janson, S. (1988). Normal convergence by higher semiinvariants with applications to sums of dependent random variables and random graphs. The Annals of Probability, 16(1), 305\u2013312.","journal-title":"The Annals of Probability"},{"issue":"2","key":"6536_CR30","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/rsa.3240010209","volume":"1","author":"S Janson","year":"1990","unstructured":"Janson, S. (1990). Poisson approximation for large deviations. Random Structures & Algorithms, 1(2), 221\u2013229.","journal-title":"Random Structures & Algorithms"},{"issue":"3","key":"6536_CR31","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1002\/rsa.20008","volume":"24","author":"S Janson","year":"2004","unstructured":"Janson, S. (2004). Large deviations for sums of partly dependent random variables. Random Structures & Algorithms, 24(3), 234\u2013248.","journal-title":"Random Structures & Algorithms"},{"key":"6536_CR32","unstructured":"Janson, S., \u0141uczak, T., & Rucinski, A. (1988). An exponential bound for the probability of nonexistence of a specified subgraph in a random graph. Institute for Mathematics and its Applications (USA)"},{"issue":"6","key":"6536_CR33","doi-asserted-by":"publisher","first-page":"1427","DOI":"10.1162\/089976699300016304","volume":"11","author":"M Kearns","year":"1999","unstructured":"Kearns, M., & Ron, D. (1999). Algorithmic stability and sanity-check bounds for leave-one-out cross-validation. Neural Computation, 11(6), 1427\u20131453.","journal-title":"Neural Computation"},{"issue":"1","key":"6536_CR34","first-page":"2909","volume":"16","author":"A Kirichenko","year":"2015","unstructured":"Kirichenko, A., & Van Zanten, H. (2015). Optimality of Poisson processes intensity learning with Gaussian processes. The Journal of Machine Learning Research, 16(1), 2909\u20132919.","journal-title":"The Journal of Machine Learning Research"},{"key":"6536_CR35","unstructured":"Kontorovich, L. (2007). Measure concentration of strongly mixing processes with applications. Carnegie Mellon University."},{"issue":"6","key":"6536_CR36","doi-asserted-by":"publisher","first-page":"2126","DOI":"10.1214\/07-AOP384","volume":"36","author":"LA Kontorovich","year":"2008","unstructured":"Kontorovich, L. A., & Ramanan, K. (2008). Concentration inequalities for dependent random variables via the martingale method. The Annals of Probability, 36(6), 2126\u20132158.","journal-title":"The Annals of Probability"},{"key":"6536_CR37","unstructured":"Kutin, S., & Niyogi, P. (2002). Almost-everywhere algorithmic stability and generalization error. In Proceedings of the eighteenth conference on uncertainty in artificial intelligence (pp. 275\u2013282). Morgan Kaufmann Publishers Inc."},{"issue":"1","key":"6536_CR38","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s10994-016-5588-2","volume":"106","author":"V Kuznetsov","year":"2017","unstructured":"Kuznetsov, V., & Mohri, M. (2017). Generalization bounds for non-stationary mixing processes. Machine Learning, 106(1), 93\u2013117.","journal-title":"Machine Learning"},{"key":"6536_CR39","unstructured":"Lampert, C.H., Ralaivola, L., & Zimin, A. (2018). Dependency-dependent bounds for sums of dependent random variables. arXiv preprint arXiv:1811.01404"},{"key":"6536_CR40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20212-4","volume-title":"Probability in Banach spaces: Isoperimetry and processes","author":"M Ledoux","year":"1991","unstructured":"Ledoux, M., & Talagrand, M. (1991). Probability in Banach spaces: Isoperimetry and processes. Springer."},{"key":"6536_CR41","unstructured":"Linderman, S., & Adams, R. (2014). Discovering latent network structure in point process data. In International conference on machine learning (pp. 1413\u20131421)."},{"key":"6536_CR42","unstructured":"Lozano, A. C., Kulkarni, S. R., & Schapire, R. E. (2006). Convergence and consistency of regularized boosting algorithms with stationary $$\\beta $$-mixing observations. In: Advances in neural information processing systems (pp. 819\u2013826)."},{"issue":"1","key":"6536_CR43","first-page":"148","volume":"141","author":"C McDiarmid","year":"1989","unstructured":"McDiarmid, C. (1989). On the method of bounded differences. Surveys in Combinatorics, 141(1), 148\u2013188.","journal-title":"Surveys in Combinatorics"},{"issue":"1","key":"6536_CR44","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1007602715810","volume":"39","author":"R Meir","year":"2000","unstructured":"Meir, R. (2000). Nonparametric time series prediction through adaptive model selection. Machine Learning, 39(1), 5\u201334.","journal-title":"Machine Learning"},{"key":"6536_CR45","unstructured":"Mohri, M., & Rostamizadeh, A. (2008). Stability bounds for non-i.i.d. processes. In Advances in neural information processing systems (pp. 1025\u20131032)."},{"key":"6536_CR46","unstructured":"Mohri, M., & Rostamizadeh, A. (2009). Rademacher complexity bounds for non-i.i.d. processes. In Advances in neural information processing systems (pp. 1097\u20131104)."},{"key":"6536_CR47","first-page":"789","volume":"11","author":"M Mohri","year":"2010","unstructured":"Mohri, M., & Rostamizadeh, A. (2010). Stability bounds for stationary $$\\varphi $$-mixing and $$\\beta $$-mixing processes. Journal of Machine Learning Research, 11, 789\u2013814.","journal-title":"Journal of Machine Learning Research"},{"key":"6536_CR48","volume-title":"Foundations of machine learning","author":"M Mohri","year":"2018","unstructured":"Mohri, M., Rostamizadeh, A., & Talwalkar, A. (2018). Foundations of machine learning. MIT press."},{"key":"6536_CR49","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0537-1","volume-title":"Decoupling: From dependence to independence","author":"VH Pe\u00f1a","year":"1999","unstructured":"Pe\u00f1a, V. H., & Gin\u00e9, E. (1999). Decoupling: From dependence to independence. Springer."},{"key":"6536_CR50","unstructured":"Ralaivola, L., & Amini, M. R. (2015). Entropy-based concentration inequalities for dependent variables. In International conference on machine learning (pp. 2436\u20132444)."},{"key":"6536_CR51","first-page":"1927","volume":"11","author":"L Ralaivola","year":"2010","unstructured":"Ralaivola, L., Szafranski, M., & Stempfel, G. (2010). Chromatic PAC-Bayes bounds for non-iid data: Applications to ranking and stationary $$\\beta $$-mixing processes. Journal of Machine Learning Research, 11, 1927\u20131956.","journal-title":"Journal of Machine Learning Research"},{"key":"6536_CR52","doi-asserted-by":"crossref","unstructured":"Rogers, W. H., & Wagner, T. J. (1978). A finite sample distribution-free performance bound for local discrimination rules. The Annals of Statistics, 506\u2013514.","DOI":"10.1214\/aos\/1176344196"},{"issue":"1","key":"6536_CR53","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1073\/pnas.42.1.43","volume":"42","author":"M Rosenblatt","year":"1956","unstructured":"Rosenblatt, M. (1956). A central limit theorem and a strong mixing condition. Proceedings of the National Academy of Sciences of the United States of America, 42(1), 43.","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"issue":"3","key":"6536_CR54","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1023\/A:1007614523901","volume":"37","author":"RE Schapire","year":"1999","unstructured":"Schapire, R. E., & Singer, Y. (1999). Improved boosting algorithms using confidence-rated predictions. Machine Learning, 37(3), 297\u2013336.","journal-title":"Machine Learning"},{"key":"6536_CR55","doi-asserted-by":"crossref","unstructured":"Seese, D. (1985). Tree-partite graphs and the complexity of algorithms. In International conference on fundamentals of computation theory (pp.412\u2013421) Springer.","DOI":"10.1007\/BFb0028825"},{"issue":"2","key":"6536_CR56","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/s10618-020-00730-8","volume":"35","author":"S Sidana","year":"2021","unstructured":"Sidana, S., Trofimov, M., Horodnytskyi, O., et al. (2021). User preference and embedding learning with implicit feedback for recommender systems. Data Mining Knowledge Discovery, 35(2), 568\u2013592.","journal-title":"Data Mining Knowledge Discovery"},{"key":"6536_CR57","doi-asserted-by":"crossref","unstructured":"Stein, C. (1972). A bound for the error in the normal approximation to the distribution of a sum of dependent random variables. In Proceedings of the sixth Berkeley symposium on mathematical statistics and probability, volume 2: Probability theory. The Regents of the University of California.","DOI":"10.1525\/9780520423671-036"},{"key":"6536_CR58","unstructured":"Steinwart, I., & Christmann, A. (2009). Fast learning from non-i.i.d. observations. In Advances in neural information processing systems (pp. 1768\u20131776)."},{"key":"6536_CR59","first-page":"1369","volume":"18","author":"N Usunier","year":"2005","unstructured":"Usunier, N., Amini, M. R., & Gallinari, P. (2005). Generalization error bounds for classifiers trained with interdependent data. Advances in Neural Information Processing Systems, 18, 1369\u20131376.","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"2","key":"6536_CR60","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/1104015","volume":"4","author":"V Volkonskii","year":"1959","unstructured":"Volkonskii, V., & Rozanov, Y. A. (1959). Some limit theorems for random functions. I. Theory of Probability & its Applications, 4(2), 178\u2013197.","journal-title":"Theory of Probability & its Applications"},{"key":"6536_CR61","unstructured":"Weston, J., & Watkins, C. (1998). Multi-class support vector machines."},{"issue":"5","key":"6536_CR62","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/j.ejc.2008.11.010","volume":"30","author":"DR Wood","year":"2009","unstructured":"Wood, D. R. (2009). On tree-partition-width. European Journal of Combinatorics, 30(5), 1245\u20131253.","journal-title":"European Journal of Combinatorics"},{"key":"6536_CR63","doi-asserted-by":"crossref","unstructured":"Yu, B. (1994). Rates of convergence for empirical processes of stationary mixing sequences. The Annals of Probability, 94\u2013116.","DOI":"10.1214\/aop\/1176988849"},{"issue":"109","key":"6536_CR64","first-page":"272","volume":"181","author":"RR Zhang","year":"2022","unstructured":"Zhang, R. R. (2022). When Janson meets McDiarmid: Bounded difference inequalities under graph-dependence. Statistics & Probability Letters, 181(109), 272.","journal-title":"Statistics & Probability Letters"},{"key":"6536_CR65","first-page":"10890","volume":"32","author":"RR Zhang","year":"2019","unstructured":"Zhang, R. R., Liu, X., Wang, Y., & Wang, L. (2019). McDiarmid-type inequalities for graph-dependent variables and stability bounds. Advances in Neural Information Processing Systems, 32, 10890\u201310901.","journal-title":"Advances in Neural Information Processing Systems"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-024-06536-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-024-06536-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-024-06536-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T18:07:16Z","timestamp":1764266836000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-024-06536-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,3]]},"references-count":64,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["6536"],"URL":"https:\/\/doi.org\/10.1007\/s10994-024-06536-9","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2024,4,3]]},"assertion":[{"value":"18 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2024","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 declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"All authors participated in this study give the publisher the permission to publish this work.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}