{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T08:03:05Z","timestamp":1767772985026,"version":"3.37.3"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:00:00Z","timestamp":1729641600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:00:00Z","timestamp":1729641600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["22H01484","22H01484"],"award-info":[{"award-number":["22H01484","22H01484"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011722","name":"Yokohama National University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100011722","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A binary constant weight code is a type of error-correcting code with a wide range of applications. The problem of finding a binary constant weight code has long been studied as a combinatorial optimization problem in coding theory. In this paper, we propose a quantum search algorithm for binary constant weight codes. Specifically, the search problem is formulated as a polynomial binary optimization problem and Grover adaptive search is used for providing the quadratic speedup. Focusing on the inherent structure of the problem, we derive an upper bound on the minimum of the objective function value and a lower bound on the exact number of solutions. By exploiting these two bounds, we successfully reduced the constant overhead of the algorithm, although the overall query complexity remains exponential due to the NP-complete nature of the problem. In our algebraic analysis, it was found that this proposed algorithm is capable of reducing the number of required qubits, thus enhancing the feasibility. Additionally, our simulations demonstrated that it reduces the average number of classical iterations by 63% as well as the average number of total Grover rotations by 31%. The proposed approach may be useful for other quantum search algorithms and optimization problems.<\/jats:p>","DOI":"10.1007\/s11128-024-04573-w","type":"journal-article","created":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T09:03:40Z","timestamp":1729674220000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Quantum search algorithm for binary constant weight codes"],"prefix":"10.1007","volume":"23","author":[{"given":"Kein","family":"Yukiyoshi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naoki","family":"Ishikawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,23]]},"reference":[{"issue":"6","key":"4573_CR1","doi-asserted-by":"publisher","first-page":"1334","DOI":"10.1109\/18.59932","volume":"36","author":"AE Brouwer","year":"1990","unstructured":"Brouwer, A.E., Shearer, J.B., Sloane, N.J.A., Smith, W.D.: A new table of constant weight codes. IEEE Trans. Inf. Theory 36(6), 1334\u20131380 (1990)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"4573_CR2","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1109\/12.677239","volume":"47","author":"LG Tallini","year":"1998","unstructured":"Tallini, L.G., Bose, B.: Design of balanced and constant weight codes for VLSI systems. IEEE Trans. Comput. 47(5), 556\u2013572 (1998)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"4573_CR3","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1109\/TVT.2005.844659","volume":"54","author":"JNJ Moon","year":"2005","unstructured":"Moon, J.N.J., Hughes, L.A., Smith, D.H.: Assignment of frequency lists in frequency hopping networks. IEEE Trans. Veh. Technol. 54(3), 1147\u20131159 (2005)","journal-title":"IEEE Trans. Veh. Technol."},{"issue":"3","key":"4573_CR4","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1109\/18.30982","volume":"35","author":"FRK Chung","year":"1989","unstructured":"Chung, F.R.K., Salehi, J.A., Wei, V.K.: Optical orthogonal codes: design, analysis and applications. IEEE Trans. Inf. Theory 35(3), 595\u2013604 (1989)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"4573_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y Dodis","year":"2008","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38(1), 97\u2013139 (2008)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"4573_CR6","doi-asserted-by":"publisher","first-page":"1886","DOI":"10.1109\/TCOMM.2017.2669028","volume":"65","author":"H Yassine","year":"2017","unstructured":"Yassine, H., Coon, J.P., Simmons, D.E.: Index programming for flash memory. IEEE Trans. Commun. 65(5), 1886\u20131898 (2017)","journal-title":"IEEE Trans. Commun."},{"key":"4573_CR7","doi-asserted-by":"crossref","unstructured":"Dela\u00a0Cruz, B.P., Lampos, J.M., Palines, H., Sison, V.: A new construction of anticode-optimal grassmannian codes. J. Algebra Comb. Discrete Struct. Appl. 8(1) (2021)","DOI":"10.13069\/jacodesmath.858732"},{"issue":"3","key":"4573_CR8","doi-asserted-by":"publisher","first-page":"1905","DOI":"10.1109\/COMST.2018.2815642","volume":"20","author":"N Ishikawa","year":"2018","unstructured":"Ishikawa, N., Sugiura, S., Hanzo, L.: 50 years of permutation, spatial and index modulation: From classic RF to visible light communications and data storage. IEEE Commun. Surv. Tutor. 20(3), 1905\u20131938 (2018)","journal-title":"IEEE Commun. Surv. Tutor."},{"issue":"3","key":"4573_CR9","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1109\/LCOMM.2019.2961312","volume":"24","author":"A Fazeli","year":"2020","unstructured":"Fazeli, A., Nguyen, H.H.: Code design for non-coherent index modulation. IEEE Commun. Lett. 24(3), 477\u2013481 (2020)","journal-title":"IEEE Commun. Lett."},{"issue":"22","key":"4573_CR10","doi-asserted-by":"publisher","first-page":"5536","DOI":"10.1109\/TSP.2013.2279771","volume":"61","author":"E Ba\u015far","year":"2013","unstructured":"Ba\u015far, E., Ayg\u00f6l\u00fc, \u00dc., Panay\u0131rc\u0131, E., Poor, H.V.: Orthogonal frequency division multiplexing with index modulation. IEEE Trans. Signal Process. 61(22), 5536\u20135549 (2013)","journal-title":"IEEE Trans. Signal Process."},{"issue":"12","key":"4573_CR11","doi-asserted-by":"publisher","first-page":"2386","DOI":"10.1109\/LCOMM.2016.2608350","volume":"20","author":"M Wen","year":"2016","unstructured":"Wen, M., Zhang, Y., Li, J., Basar, E., Chen, F.: Equiprobable subcarrier activation method for OFDM with index modulation. IEEE Commun. Lett. 20(12), 2386\u20132389 (2016)","journal-title":"IEEE Commun. Lett."},{"issue":"12","key":"4573_CR12","doi-asserted-by":"publisher","first-page":"8373","DOI":"10.1109\/TWC.2018.2876821","volume":"17","author":"S Dang","year":"2018","unstructured":"Dang, S., Chen, G., Coon, J.P.: Lexicographic codebook design for OFDM with index modulation. IEEE Trans. Wirel. Commun. 17(12), 8373\u20138387 (2018)","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"4573_CR13","doi-asserted-by":"publisher","first-page":"93830","DOI":"10.1109\/ACCESS.2019.2928033","volume":"7","author":"N Ishikawa","year":"2019","unstructured":"Ishikawa, N.: IMToolkit: an open-source index modulation toolkit for reproducible research based on massively parallel algorithms. IEEE Access 7, 93830\u201393846 (2019)","journal-title":"IEEE Access"},{"key":"4573_CR14","doi-asserted-by":"publisher","first-page":"111114","DOI":"10.1109\/ACCESS.2021.3103207","volume":"9","author":"N Ishikawa","year":"2021","unstructured":"Ishikawa, N.: Quantum speedup for index modulation. IEEE Access 9, 111114\u2013111124 (2021)","journal-title":"IEEE Access"},{"issue":"12","key":"4573_CR15","doi-asserted-by":"publisher","first-page":"2158","DOI":"10.1109\/LWC.2023.3310586","volume":"12","author":"K Yukiyoshi","year":"2023","unstructured":"Yukiyoshi, K., Ishikawa, N.: On the capacity of generalized quadrature spatial modulation. IEEE Wirel. Commun. Lett. 12(12), 2158\u20132162 (2023)","journal-title":"IEEE Wirel. Commun. Lett."},{"issue":"3","key":"4573_CR16","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TIT.1962.1057714","volume":"8","author":"S Johnson","year":"1962","unstructured":"Johnson, S.: A new upper bound for error-correcting codes. IRE Trans. Inf. Theory 8(3), 203\u2013207 (1962)","journal-title":"IRE Trans. Inf. Theory"},{"issue":"3","key":"4573_CR17","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1109\/TIT.1980.1056191","volume":"26","author":"A Brouwer","year":"1980","unstructured":"Brouwer, A.: A few new constant weight codes. IEEE Trans. Inf. Theory 26(3), 366\u2013366 (1980)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"4573_CR18","doi-asserted-by":"publisher","first-page":"1623","DOI":"10.1109\/18.623163","volume":"43","author":"KJ Nurmela","year":"1997","unstructured":"Nurmela, K.J., Kaikkonen, M.K., Ostergard, P.R.J.: New constant weight codes from linear permutation groups. IEEE Trans. Inf. Theory 43(5), 1623\u20131630 (1997)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4573_CR19","doi-asserted-by":"crossref","unstructured":"Smith, D.H., Hughes, L.A., Perkins, S.: A new table of constant weight codes of length greater than 28. Electron. J. Combin. 13(1) (2006)","DOI":"10.37236\/1162"},{"key":"4573_CR20","unstructured":"Etzion, T., Vardy, A.: A new construction for constant weight codes. In: 2014 International Symposium on Information Theory and Its Applications, pp. 338\u2013342 (2014)"},{"key":"4573_CR21","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. Complexity of Computer Computations, 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"1","key":"4573_CR22","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/TIT.1987.1057277","volume":"33","author":"AE Gamal","year":"1987","unstructured":"Gamal, A.E., Hemachandra, L., Shperling, I., Wei, V.: Using simulated annealing to design good codes. IEEE Trans. Inf. Theory 33(1), 116\u2013123 (1987)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"4573_CR23","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1016\/S0307-904X(97)00019-X","volume":"21","author":"JA Bland","year":"1997","unstructured":"Bland, J.A., Baylis, D.J.: Modelling constant weight codes using tabu search. Appl. Math. Model. 21(11), 667\u2013672 (1997)","journal-title":"Appl. Math. Model."},{"issue":"10","key":"4573_CR24","doi-asserted-by":"publisher","first-page":"4651","DOI":"10.1109\/TIT.2009.2027491","volume":"55","author":"R Montemanni","year":"2009","unstructured":"Montemanni, R., Smith, D.H.: Heuristic algorithms for constructing binary constant weight codes. IEEE Trans. Inf. Theory 55(10), 4651\u20134656 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4573_CR25","unstructured":"Moore, G.E.: Cramming more components onto integrated circuits. Electronics 38(8) (1965)"},{"key":"4573_CR26","unstructured":"Choi, S., Moses, W.S., Thompson, N.: The quantum tortoise and the classical hare: a simple framework for understanding which problems quantum computing will accelerate (and which it will not). arXiv:2310.15505 (2023)"},{"issue":"5","key":"4573_CR27","doi-asserted-by":"publisher","first-page":"5355","DOI":"10.1103\/PhysRevE.58.5355","volume":"58","author":"T Kadowaki","year":"1998","unstructured":"Kadowaki, T., Nishimori, H.: Quantum annealing in the transverse ising model. Phys. Rev. E 58(5), 5355\u20135363 (1998)","journal-title":"Phys. Rev. E"},{"key":"4573_CR28","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algorithm. arXiv:1411.4028 (2014)"},{"issue":"11","key":"4573_CR29","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1038\/s41567-021-01356-3","volume":"17","author":"D Stilck Fran\u00e7a","year":"2021","unstructured":"Stilck Fran\u00e7a, D., Garc\u00eda-Patr\u00f3n, R.: Limitations of optimization algorithms on noisy quantum devices. Nat. Phys. 17(11), 1221\u20131227 (2021)","journal-title":"Nat. Phys."},{"issue":"1","key":"4573_CR30","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.3.010345","volume":"3","author":"Y Suzuki","year":"2022","unstructured":"Suzuki, Y., Endo, S., Fujii, K., Tokunaga, Y.: Quantum error mitigation as a universal error reduction technique: applications from the NISQ to the fault-tolerant quantum computing eras. PRX Quantum 3(1), 010345 (2022)","journal-title":"PRX Quantum"},{"key":"4573_CR31","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: dscrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134 (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"key":"4573_CR32","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of ACM Symposium on Theory of Computing, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"issue":"4\u20135","key":"4573_CR33","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","volume":"46","author":"M Boyer","year":"1998","unstructured":"Boyer, M., Brassard, G., H\u00f8yer, P., Tapp, A.: Tight bounds on quantum searching. Fortschritte der Physik 46(4\u20135), 493\u2013505 (1998)","journal-title":"Fortschritte der Physik"},{"key":"4573_CR34","unstructured":"Durr, C., Hoyer, P.: A quantum algorithm for finding the minimum. arXiv:quant-ph\/9607014 (1999)"},{"issue":"3","key":"4573_CR35","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1023\/A:1023061218864","volume":"116","author":"D Bulger","year":"2003","unstructured":"Bulger, D., Baritompa, W.P., Wood, G.R.: Implementing pure adaptive search with Grover\u2019s quantum algorithm. J. Optim. Theory Appl. 116(3), 517\u2013529 (2003)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"4573_CR36","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1137\/040605072","volume":"15","author":"WP Baritompa","year":"2005","unstructured":"Baritompa, W.P., Bulger, D.W., Wood, G.R.: Grover\u2019s quantum algorithm applied to global optimization. SIAM J. Optim. 15(4), 1170\u20131184 (2005)","journal-title":"SIAM J. Optim."},{"key":"4573_CR37","doi-asserted-by":"publisher","first-page":"428","DOI":"10.22331\/q-2021-04-08-428","volume":"5","author":"A Gilliam","year":"2021","unstructured":"Gilliam, A., Woerner, S., Gonciulea, C.: Grover adaptive search for constrained polynomial binary optimization. Quantum 5, 428 (2021)","journal-title":"Quantum"},{"issue":"4","key":"4573_CR38","doi-asserted-by":"publisher","first-page":"1926","DOI":"10.1109\/TCOMM.2023.3244924","volume":"71","author":"M Norimoto","year":"2023","unstructured":"Norimoto, M., Mori, R., Ishikawa, N.: Quantum algorithm for higher-order unconstrained binary optimization and MIMO maximum likelihood detection. IEEE Trans. Commun. 71(4), 1926\u20131939 (2023)","journal-title":"IEEE Trans. Commun."},{"key":"4573_CR39","doi-asserted-by":"publisher","first-page":"83810","DOI":"10.1109\/ACCESS.2024.3413084","volume":"12","author":"M Norimoto","year":"2024","unstructured":"Norimoto, M., Mikuriya, T., Ishikawa, N.: Quantum speedup for multiuser detection with optimized parameters in Grover adaptive search. IEEE Access 12, 83810\u201383821 (2024)","journal-title":"IEEE Access"},{"key":"4573_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TQE.2023.3293452","volume":"4","author":"Y Sano","year":"2023","unstructured":"Sano, Y., Norimoto, M., Ishikawa, N.: Qubit reduction and quantum speedup for wireless channel assignment problem. IEEE Trans. Quantum Eng. 4, 1\u201312 (2023)","journal-title":"IEEE Trans. Quantum Eng."},{"key":"4573_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TQE.2024.3393437","volume":"5","author":"Y Sano","year":"2024","unstructured":"Sano, Y., Mitarai, K., Yamamoto, N., Ishikawa, N.: Accelerating Grover adaptive search: qubit and gate count reduction strategies with higher order formulations. IEEE Trans. Quantum Eng. 5, 1\u201312 (2024)","journal-title":"IEEE Trans. Quantum Eng."},{"key":"4573_CR42","doi-asserted-by":"crossref","unstructured":"Giuffrida, L., Volpe, D., Cirillo, G.A., Zamboni, M., Turvani, G.: Engineering grover adaptive search: Exploring the degrees of freedom for efficient QUBO solving. IEEE J. Emerg. Sel. Top. Circuits Syst. 12(3), 614\u2013623 (2022)","DOI":"10.1109\/JETCAS.2022.3202566"},{"issue":"5","key":"4573_CR43","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1137\/S0097539796300933","volume":"26","author":"CH Bennett","year":"1997","unstructured":"Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. SIAM J. Comput. 26(5), 1510\u20131523 (1997)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"4573_CR44","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1109\/26.764929","volume":"47","author":"PK Frenger","year":"1999","unstructured":"Frenger, P.K., Svensson, N.A.B.: Parallel combinatory OFDM signaling. IEEE Trans. Commun. 47(4), 558\u2013567 (1999)","journal-title":"IEEE Trans. Commun."},{"key":"4573_CR45","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1090\/conm\/305\/05215","volume":"305","author":"G Brassard","year":"2002","unstructured":"Brassard, G., Hoyer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. AMS Contemporary Math. 305, 53\u201374 (2002)","journal-title":"AMS Contemporary Math."},{"issue":"5","key":"4573_CR46","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"4573_CR47","unstructured":"Anis, M.S., Abby-Mitchell, Abraham, H., et al.: Qiskit: an open-source framework for quantum computing (2021)"},{"key":"4573_CR48","unstructured":"Burden, R.L., Faires, J.D.: Numerical Analysis, 4th edn (1989)"},{"issue":"1","key":"4573_CR49","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0377-0427(00)00435-0","volume":"124","author":"A Gal\u00e1ntai","year":"2000","unstructured":"Gal\u00e1ntai, A.: The theory of Newton\u2019s method. J. Comput. Appl. Math. 124(1), 25\u201344 (2000)","journal-title":"J. Comput. Appl. Math."},{"issue":"3","key":"4573_CR50","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1109\/TCOMM.2014.012514.130615","volume":"62","author":"P Botsinis","year":"2014","unstructured":"Botsinis, P., Ng, S.X., Hanzo, L.: Fixed-complexity quantum-assisted multi-user detection for CDMA and SDMA. IEEE Trans. Commun. 62(3), 990\u20131000 (2014)","journal-title":"IEEE Trans. Commun."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-024-04573-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-024-04573-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-024-04573-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,2]],"date-time":"2024-11-02T10:16:27Z","timestamp":1730542587000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-024-04573-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,23]]},"references-count":50,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2024,10]]}},"alternative-id":["4573"],"URL":"https:\/\/doi.org\/10.1007\/s11128-024-04573-w","relation":{},"ISSN":["1573-1332"],"issn-type":[{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2024,10,23]]},"assertion":[{"value":"25 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 October 2024","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 no conflict of interest in any other work or publication.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"360"}}