{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T21:53:33Z","timestamp":1767995613974,"version":"3.49.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T00:00:00Z","timestamp":1757116800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T00:00:00Z","timestamp":1757116800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["310185\/2021-1"],"award-info":[{"award-number":["310185\/2021-1"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["304322\/2020-2"],"award-info":[{"award-number":["304322\/2020-2"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["305357\/2021-2"],"award-info":[{"award-number":["305357\/2021-2"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004901","name":"Funda\u00e7 de Amparo \u00e1 Pesquisa do Estado de Minas Gerais","doi-asserted-by":"publisher","award":["APQ-02932-24"],"award-info":[{"award-number":["APQ-02932-24"]}],"id":[{"id":"10.13039\/501100004901","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004901","name":"Funda\u00e7 de Amparo \u00e1 Pesquisa do Estado de Minas Gerais","doi-asserted-by":"publisher","award":["RED-00119-21"],"award-info":[{"award-number":["RED-00119-21"]}],"id":[{"id":"10.13039\/501100004901","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004586","name":"Funda\u00e7 Carlos Chagas Filho de Amparo \u00e1 Pesquisa do Estado do Rio de Janeiro","doi-asserted-by":"publisher","award":["E-26\/202.710\/2018"],"award-info":[{"award-number":["E-26\/202.710\/2018"]}],"id":[{"id":"10.13039\/501100004586","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s10589-025-00726-4","type":"journal-article","created":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T03:03:28Z","timestamp":1757127808000},"page":"397-433","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Formulations and algorithms for the simple cycle problem"],"prefix":"10.1007","volume":"93","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6627-7692","authenticated-orcid":false,"given":"Abilio","family":"Lucena","sequence":"first","affiliation":[]},{"given":"Luidi","family":"Simonetti","sequence":"additional","affiliation":[]},{"given":"Alexandre Salles da","family":"Cunha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,6]]},"reference":[{"key":"726_CR1","unstructured":"Salazar-Gonz\u00e1lez, J.J.: On the cycle polytope of an undirected graph. Working Paper, University of Laguna, April (1994)"},{"issue":"1","key":"726_CR2","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1590\/S0101-74382003000100012","volume":"23","author":"N Maculan","year":"2003","unstructured":"Maculan, N., Plateau, G., Lisser, A.: Integer models with a polynomial number of variables and constraints for some classical combinatorial optimization problems. Pesquisa Operacional 23(1), 161\u2013168 (2003)","journal-title":"Pesquisa Operacional"},{"key":"726_CR3","first-page":"865","volume-title":"The Traveling Salesman Problem and Its Variations","author":"M Fischetti","year":"2004","unstructured":"Fischetti, M., Salazar, J.J., Toth, P.: The generalized traveling salesman and orienteering problems. In: The Traveling Salesman Problem and Its Variations, pp. 865\u2013890. Kluwer Academic Publishers, New York (2004)"},{"issue":"1","key":"726_CR4","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1287\/moor.22.1.110","volume":"22","author":"P Bauer","year":"1997","unstructured":"Bauer, P.: The circuit polytope: facets. Math. Oper. Res. 22(1), 110\u2013145 (1997)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"726_CR5","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1002\/1097-0037(200008)36:1<34::AID-NET4>3.0.CO;2-2","volume":"36","author":"E Balas","year":"2000","unstructured":"Balas, E., Oosten, M.: On the cycle polytope of a directed graph. Networks 36(1), 34\u201346 (2000)","journal-title":"Networks"},{"issue":"1","key":"726_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1002\/net.20304","volume":"54","author":"E Balas","year":"2009","unstructured":"Balas, E., Stephan, R.: On the cycle polytope of a directed graph and its relaxations. Networks 54(1), 47\u201355 (2009)","journal-title":"Networks"},{"issue":"6","key":"726_CR7","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1145\/367766.368166","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97: Shortest path. Commun. ACM 5(6), 344\u2013345 (1962)","journal-title":"Commun. ACM"},{"issue":"115","key":"726_CR8","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1016\/0024-3795(89)90483-7","volume":"114","author":"CR Coullard","year":"1989","unstructured":"Coullard, C.R., Pulleyblank, W.R.: On cycle cones and polyhedra. Linear Algebra Appl. 114(115), 613\u2013640 (1989)","journal-title":"Linear Algebra Appl."},{"key":"726_CR9","volume-title":"The Traveling Salesman Problem and Its Variations","author":"G Gutin","year":"2004","unstructured":"Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations. Kluwer Academic Publishers, New York (2004)"},{"issue":"2","key":"726_CR10","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1002\/net.3230060206","volume":"6","author":"ET Dixon","year":"1976","unstructured":"Dixon, E.T., Goodman, S.E.: An algorithm for the longest cycle problem. Networks 6(2), 139\u2013149 (1976)","journal-title":"Networks"},{"key":"726_CR11","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.knosys.2017.03.022","volume":"125","author":"D Chalupa","year":"2017","unstructured":"Chalupa, D., Balaghan, P., Hawick, K.A., Gordon, N.A.: Computational methods for finding long simple cycles in complex networks. Knowl.-Based Syst. 125, 96\u2013107 (2017)","journal-title":"Knowl.-Based Syst."},{"issue":"6","key":"726_CR12","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E Balas","year":"1989","unstructured":"Balas, E.: The prize collecting traveling salesman problem. Networks 19(6), 621\u2013636 (1989)","journal-title":"Networks"},{"issue":"4","key":"726_CR13","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1002\/net.3230250406","volume":"25","author":"E Balas","year":"1995","unstructured":"Balas, E.: The prize collecting traveling salesman: II. problem polyhedral results. Networks 25(4), 199\u2013216 (1995)","journal-title":"Networks"},{"key":"726_CR14","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/BF01581256","volume":"59","author":"D Bienstock","year":"1993","unstructured":"Bienstock, D., Goemans, M., Simchi-Levi, D., Williamson, D.P.: A note on the prize collecting travelling salesman problem. Math. Program. 59, 413\u2013420 (1993)","journal-title":"Math. Program."},{"key":"726_CR15","first-page":"319","volume-title":"Vehicle Routing: Methods and Studies","author":"M Fischetti","year":"1988","unstructured":"Fischetti, M., Toth, P.: An additive approach for the optimal solution of the prize-collecting travelling salesman problem. In: Vehicle Routing: Methods and Studies, pp. 319\u2013343. North-Holland, New York (1988)"},{"key":"726_CR16","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1023\/A:1018961208614","volume":"81","author":"M Dell\u2019Amico","year":"1998","unstructured":"Dell\u2019Amico, M., Maffioli, F., Sciomachen, A.G.B.: A lagrangian heuristic for the prize collectingtravelling salesman problem. Ann. Oper. Res. 81, 289\u20134306 (1998)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"726_CR17","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1002\/net.20307","volume":"54","author":"J-F B\u00e9rub\u00e9","year":"2009","unstructured":"B\u00e9rub\u00e9, J.-F., Gendreau, M., Potvin, J.-Y.: A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem. Networks 54(1), 56\u201367 (2009)","journal-title":"Networks"},{"key":"726_CR18","doi-asserted-by":"crossref","unstructured":"Khodamoradi, K., Krishnamurti, R.: Prize collecting travelling salesman problem - fast heuristic separations. In Proceedings of 5th the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, pp. 380\u2013387. INSTICC, SciTePress (2016)","DOI":"10.5220\/0005758103800387"},{"key":"726_CR19","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1002\/net.3230260206","volume":"26","author":"M Fischetti","year":"1995","unstructured":"Fischetti, M., Salazar, J.J., Toth, P.: The symmetric generalized traveling salesman polytope. Networks 26, 113\u2013123 (1995)","journal-title":"Networks"},{"key":"726_CR20","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/opre.45.3.378","volume":"45","author":"M Fischetti","year":"1997","unstructured":"Fischetti, M., Salazar, J.J., Toth, P.: A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper. Res. 45, 378\u2013394 (1997)","journal-title":"Oper. Res."},{"key":"726_CR21","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1057\/jors.1984.162","volume":"35","author":"T Tsiligirides","year":"1984","unstructured":"Tsiligirides, T.: Heuristic methods applied to orienteering. J. Oper. Res. Soc. 35, 797\u2013809 (1984)","journal-title":"J. Oper. Res. Soc."},{"key":"726_CR22","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0166-218X(90)90100-Q","volume":"26","author":"G Laporte","year":"1990","unstructured":"Laporte, G., Martello, S.: The selective traveling salesman problem. Discrete Appl. Math. 26, 193\u2013207 (1990)","journal-title":"Discrete Appl. Math."},{"key":"726_CR23","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1287\/ijoc.10.2.133","volume":"10","author":"M Fischetti","year":"1998","unstructured":"Fischetti, M., Salazar, J.J., Toth, P.: Solving the orienteering problem through branch-and-cut. INFORMS J. Comput. 10, 133\u2013148 (1998)","journal-title":"INFORMS J. Comput."},{"issue":"5","key":"726_CR24","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF00995176","volume":"8","author":"A Proskurowski","year":"1979","unstructured":"Proskurowski, A.: Minimum dominating cycles in 2-trees. Int. J. Comput. Inf. Sci. 8(5), 405\u2013417 (1979)","journal-title":"Int. J. Comput. Inf. Sci."},{"issue":"2","key":"726_CR25","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF00977745","volume":"10","author":"A Proskurowski","year":"1981","unstructured":"Proskurowski, A., Syslo, M.: Minimum dominating cycles in outerplanar graphs. Int. J. Comput. Inf. Sci. 10(2), 127\u2013139 (1981)","journal-title":"Int. J. Comput. Inf. Sci."},{"issue":"1","key":"726_CR26","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0167-6377(85)90044-6","volume":"4","author":"CJ Colburn","year":"1985","unstructured":"Colburn, C.J., Keil, J.M., Stewart, L.K.: Finding minimum dominating cycles in permutation graphs. Oper. Res. Lett. 4(1), 13\u201317 (1985)","journal-title":"Oper. Res. Lett."},{"key":"726_CR27","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.endm.2013.05.121","volume":"41","author":"A Lucena","year":"2013","unstructured":"Lucena, A., Cunha, A.S., Simonetti, L.: Formulating and solving the minimum dominating cycle problem. Electronic Notes Discrete Math. 41, 423\u2013430 (2013)","journal-title":"Electronic Notes Discrete Math."},{"issue":"2","key":"726_CR28","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s101070100209","volume":"91","author":"P Bauer","year":"2002","unstructured":"Bauer, P., Linderoth, J.T., Savelsbergh, M.W.P.: A branch and cut approach to the cardinality constrained circuit problem. Math. Program. 91(2), 307\u2013348 (2002)","journal-title":"Math. Program."},{"issue":"3","key":"726_CR29","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1002\/net.10114","volume":"43","author":"M Labb\u00e9","year":"2004","unstructured":"Labb\u00e9, M., Laporte, G., Rodr\u00edguezMart\u00edn, I., SalazarGonz\u00e1lez, J.J.: The ring star problem: Polyhedral analysis and exact algorithm. Networks 43(3), 177\u2013189 (2004)","journal-title":"Networks"},{"issue":"6","key":"726_CR30","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1287\/opre.1070.0432","volume":"55","author":"R Baldacci","year":"2007","unstructured":"Baldacci, R., Dell\u2019Amico, M., Salazar Gonz\u00e1lez, J.J.: The capacitated m-ring-star problem. Oper. Res. 55(6), 1147\u20131162 (2007)","journal-title":"Oper. Res."},{"key":"726_CR31","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.endm.2009.11.018","volume":"35","author":"EA Hoshino","year":"2009","unstructured":"Hoshino, E.A., Souza, C.C.: A branch-and-cut-and-price approach for the capacitated m-ring-star problem. Electronic Notes Discrete Math. 35, 103\u2013108 (2009)","journal-title":"Electronic Notes Discrete Math."},{"issue":"3","key":"726_CR32","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1016\/j.ejor.2010.06.030","volume":"207","author":"ZN Azimi","year":"2010","unstructured":"Azimi, Z.N., Salari, M., Toth, P.: A heuristic procedure for the capacitated m-ring-star problem. Eur. J. Oper. Res. 207(3), 1227\u20131234 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"726_CR33","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1016\/j.cor.2009.09.004","volume":"37","author":"A Liefooghe","year":"2010","unstructured":"Liefooghe, A., Jourdan, L., Talbi, E.-G.: Metaheuristics and cooperative approaches for the bi-objective ring star problem. Comput. OR 37(6), 1033\u20131044 (2010)","journal-title":"Comput. OR"},{"issue":"16","key":"726_CR34","doi-asserted-by":"publisher","first-page":"1901","DOI":"10.1016\/j.dam.2011.01.015","volume":"159","author":"L Simonetti","year":"2011","unstructured":"Simonetti, L., Frota, Y., Souza, C.C.: The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm. Discret. Appl. Math. 159(16), 1901\u20131914 (2011)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"726_CR35","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ejor.2011.08.026","volume":"217","author":"ZN Azimi","year":"2012","unstructured":"Azimi, Z.N., Salari, M., Toth, P.: An integer linear programming based heuristic for the capacitated m-ring-star problem. Eur. J. Oper. Res. 217(1), 17\u201325 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"726_CR36","doi-asserted-by":"publisher","first-page":"1970","DOI":"10.1287\/ijoc.2022.1164","volume":"34","author":"DL Pereira","year":"2022","unstructured":"Pereira, D.L., Lucena, A., da Cunha, A.S., Simonetti, L.: Exact solution algorithms for the chordless cycle problem. INFORMS J. Comput. 34(4), 1970\u20131986 (2022)","journal-title":"INFORMS J. Comput."},{"issue":"5","key":"726_CR37","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.endm.2013.10.013","volume":"44","author":"A Lucena","year":"2013","unstructured":"Lucena, A., Salles da Cunha, A., Simmonetti, L.: A new formulation and computational results for the simple cycle problem. Electronic Notes Discrete Math. 44(5), 83\u201388 (2013)","journal-title":"Electronic Notes Discrete Math."},{"key":"726_CR38","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"MW Padberg","year":"1991","unstructured":"Padberg, M.W., Rinaldi, G.: A branch-and-cut algorithm for resolution of large scale of symmetric traveling salesman problem. SIAM Rev. 33, 60\u2013100 (1991)","journal-title":"SIAM Rev."},{"issue":"2","key":"726_CR39","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF01582064","volume":"63","author":"MX Goemans","year":"1994","unstructured":"Goemans, M.X.: The steiner tree polytope and related polyhedra. Math. Program. 63(2), 157\u2013182 (1994)","journal-title":"Math. Program."},{"issue":"3","key":"726_CR40","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1006\/jagm.1994.1043","volume":"17","author":"JX Hao","year":"1994","unstructured":"Hao, J.X., Orlin, J.B.: A faster algorithm for finding the minimum cut in a directed graph. J. Algor. 17(3), 424\u2013446 (1994)","journal-title":"J. Algor."},{"key":"726_CR41","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1007\/s10589-015-9788-7","volume":"63","author":"LH Bicalho","year":"2016","unstructured":"Bicalho, L.H., da Cunha, A.S., Lucena, A.: Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem. Comput. Optim. Appl. 63, 755\u2013792 (2016)","journal-title":"Comput. Optim. Appl."},{"key":"726_CR42","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0166-218X(03)00380-9","volume":"141","author":"A Lucena","year":"2004","unstructured":"Lucena, A., Resende, M.G.C.: Strong lower bounds for the prize-collecting steiner problem in graphs. Discret. Appl. Math. 141, 277\u2013294 (2004)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"726_CR43","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: Tsplib - a traveling salesman problem library. INFORMS J. Comput. 3(4), 376\u2013384 (1991)","journal-title":"INFORMS J. Comput."},{"key":"726_CR44","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"726_CR45","doi-asserted-by":"crossref","unstructured":"Gould, N., Scott, J.: A note on performance profiles for benchmarking software. ACM Trans. Math. Softw., 43, 2016","DOI":"10.1145\/2950048"},{"key":"726_CR46","doi-asserted-by":"publisher","first-page":"709","DOI":"10.19139\/soic-2310-5070-679","volume":"7","author":"R Hekmati","year":"2019","unstructured":"Hekmati, R., Mirhajianmoghadam, H.: Nested performance profiles for benchmarking software. Stat., Optim. Inf. Comput. 7, 709\u2013715 (2019)","journal-title":"Stat., Optim. Inf. Comput."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00726-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-025-00726-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00726-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T16:02:06Z","timestamp":1767974526000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-025-00726-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,6]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["726"],"URL":"https:\/\/doi.org\/10.1007\/s10589-025-00726-4","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,6]]},"assertion":[{"value":"10 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 September 2025","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 state that this manuscript poses no financial or non-financial Conflict of interest to any of them.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}