{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T22:27:02Z","timestamp":1769293622756,"version":"3.49.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T00:00:00Z","timestamp":1769126400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T00:00:00Z","timestamp":1769126400000},"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":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-025-04702-x","type":"journal-article","created":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T11:44:57Z","timestamp":1769168697000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fault-Tolerant Quantum Realization of Nikhilam Multiplier with Clifford+T-group"],"prefix":"10.1007","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0446-1731","authenticated-orcid":false,"given":"Laxmidhar","family":"Biswal","sequence":"first","affiliation":[]},{"given":"Anirban","family":"Bhattacharjee","sequence":"additional","affiliation":[]},{"given":"Chandan","family":"Bandyopadhyay","sequence":"additional","affiliation":[]},{"given":"Hafizur","family":"Rahaman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,23]]},"reference":[{"issue":"2","key":"4702_CR1","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","author":"PW Shor","year":"1999","unstructured":"Shor PW. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 1999;41(2):303\u201332.","journal-title":"SIAM Rev"},{"issue":"2","key":"4702_CR2","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1103\/PhysRevLett.79.325","volume":"79","author":"LK Grover","year":"1997","unstructured":"Grover LK. Quantum mechanics helps in searching for a needle in a haystack. Phys Rev Lett. 1997;79(2):325\u20138.","journal-title":"Phys Rev Lett"},{"issue":"6","key":"4702_CR3","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/BF01886518","volume":"16","author":"RP Feynman","year":"1986","unstructured":"Feynman RP. Quantum mechanical computers. Found Phys. 1986;16(6):507\u201332.","journal-title":"Found Phys"},{"key":"4702_CR4","doi-asserted-by":"crossref","unstructured":"DiVincenzo DP. Ibm. The physical implementation of quantum computation, vol\u00a048. onlinelibrary.wiley.com; 2000.","DOI":"10.1002\/1521-3978(200009)48:9\/11<771::AID-PROP771>3.0.CO;2-E"},{"issue":"3","key":"4702_CR5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.86.032324","volume":"86","author":"AG Fowler","year":"2012","unstructured":"Fowler AG, Mariantoni M, Martinis JM, Cleland AN. Surface codes: towards practical large-scale quantum computation. Phys Rev A. 2012;86(3):032324.","journal-title":"Phys Rev A"},{"key":"4702_CR6","doi-asserted-by":"crossref","unstructured":"Paetznick, A., & Reichardt, B. W. (2013). Universal Fault-Tolerant Quantum Computation with Only Transversal Gates and Error Correction. Phys. Rev. Lett., 111, 090505. https:\/\/link.aps.org\/doi\/10.1103\/PhysRevLett.111.090505","DOI":"10.1103\/PhysRevLett.111.090505"},{"key":"4702_CR7","doi-asserted-by":"publisher","unstructured":"L. Biswal, C. Bandyopadhyay, R. Wille, R. Drechsler and H. Rahaman, \"Improving the Realization of Multiple-Control Toffoli Gates Using the NCVW Quantum Gate Library,\" 2016 29th International Conference on VLSI Design and 2016 15th International Conference on Embedded Systems (VLSID), Kolkata, India, 2016, pp. 573-574. https:\/\/doi.org\/10.1109\/VLSID.2016.23","DOI":"10.1109\/VLSID.2016.23"},{"key":"4702_CR8","volume":"11","author":"MJ Gullans","year":"2021","unstructured":"Gullans MJ, Krastanov S, Huse DA, Jiang L, Flammia ST. Quantum coding with low-depth random circuits. Phys Rev X. 2021;11:031066.","journal-title":"Phys Rev X"},{"key":"4702_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TQE.2022.3180900","volume":"3","author":"D Maslov","year":"2022","unstructured":"Maslov D, Zindorf B. Depth optimization of cz, cnot, and clifford circuits. IEEE Trans Quantum Eng. 2022;3:1\u20138.","journal-title":"IEEE Trans Quantum Eng"},{"key":"4702_CR10","doi-asserted-by":"publisher","unstructured":"L. Biswal, R. Das, A. Bhattacharjee, S. Ghosh and H. Rahaman, \"Clifford+T-based quantum high speed multiplier,\" 2018 International Symposium on Devices, Circuits and Systems (ISDCS), Howrah, India, 2018, pp. 1-7. https:\/\/doi.org\/10.1109\/ISDCS.2018.8379682","DOI":"10.1109\/ISDCS.2018.8379682"},{"issue":"1","key":"4702_CR11","doi-asserted-by":"publisher","first-page":"8492","DOI":"10.1038\/s41598-024-58482-0","volume":"14","author":"V Thamizharasan","year":"2024","unstructured":"Thamizharasan V, Parthipan V. Design of efficient binary multiplier architecture using hybrid compressor with fpga implementation. Sci Rep. 2024;14(1):8492.","journal-title":"Sci Rep"},{"key":"4702_CR12","doi-asserted-by":"publisher","unstructured":"P. Mehta and D. Gawali, \"Conventional versus Vedic Mathematical Method for Hardware Implementation of a Multiplier,\" 2009 International Conference on Advances in Computing, Control, and Telecommunication Technologies, Bangalore, India, 2009, pp. 640-642. https:\/\/doi.org\/10.1109\/ACT.2009.162","DOI":"10.1109\/ACT.2009.162"},{"key":"4702_CR13","doi-asserted-by":"publisher","DOI":"10.1201\/9781003312017","volume-title":"Soft computing","author":"P Debnath","year":"2023","unstructured":"Debnath P, Castillo O, Kumam P. Soft computing. Boca Raton: CRC Press; 2023."},{"key":"4702_CR14","volume-title":"Soft computing","author":"D Pradip","year":"2024","unstructured":"Pradip D, Binod CT. Soft computing. Boca Raton: CRC Press; 2024."},{"issue":"3","key":"4702_CR15","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1080\/00207217.2013.780298","volume":"101","author":"M Pradhan","year":"2014","unstructured":"Pradhan M, Panda R. High speed multiplier using nikhilam sutra algorithm of vedic mathematics. Int J Electron. 2014;101(3):300\u20137.","journal-title":"Int J Electron"},{"issue":"5886","key":"4702_CR16","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1038\/299802a0","volume":"299","author":"WK Wootters","year":"1982","unstructured":"Wootters WK, Zurek WH. A single quantum cannot be cloned. Nature. 1982;299(5886):802\u20133.","journal-title":"Nature"},{"key":"4702_CR17","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-981-99-0055-8_4","volume-title":"Emerging electronic devices, circuits and systems","author":"L Biswal","year":"2023","unstructured":"Biswal L, Maity NP, Rahaman H. Quantum fault-tolerant implementation of a majority-based 4-bit bcd adder. In: Chandan G, Takahiro I, Hafizur R, Bhargab BB, editors. Emerging electronic devices, circuits and systems. Singapore: Springer Nature Singapore; 2023. p. 33\u201345."},{"issue":"8","key":"4702_CR18","doi-asserted-by":"publisher","first-page":"1160","DOI":"10.1049\/iet-cds.2019.0537","volume":"14","author":"SR Sahu","year":"2020","unstructured":"Sahu SR, Bhoi BK, Pradhan M. Fast signed multiplier using vedic nikhilam algorithm. IET Circuits Devices Syst. 2020;14(8):1160\u20136.","journal-title":"IET Circuits Devices Syst"},{"key":"4702_CR19","doi-asserted-by":"publisher","unstructured":"S. P. Dwivedi, \"An efficient multiplication algorithm using Nikhilam method,\" Fifth International Conference on Advances in Recent Technologies in Communication and Computing (ARTCom 2013), Bangalore, 2013, pp. 223-228. https:\/\/doi.org\/10.1049\/cp.2013.2209","DOI":"10.1049\/cp.2013.2209"},{"issue":"3","key":"4702_CR20","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1080\/00207217.2013.780298","volume":"101","author":"M Pradhan","year":"2014","unstructured":"Pradhan M, Panda R. High speed multiplier using nikhilam sutra algorithm of vedic mathematics. Int J Electron. 2014;101(3):300\u20137.","journal-title":"Int J Electron"},{"issue":"7","key":"4702_CR21","first-page":"1","volume":"112","author":"A Sridevi","year":"2024","unstructured":"Sridevi A, Sathiya A. Design of energy efficient n-bit vedic multiplier for low power hardware architecture. Int J Electron. 2024;112(7):1\u201321.","journal-title":"Int J Electron"},{"issue":"1","key":"4702_CR22","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/2332\/1\/012006","volume":"2332","author":"T Sharma","year":"2022","unstructured":"Sharma T, Khubnani R, Subramanyam C. Study of mathematics through Indian veda\u2019s: a review. J Phys Conf Ser. 2022;2332(1):012006.","journal-title":"J Phys Conf Ser"},{"issue":"17","key":"4702_CR23","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1049\/ell2.12552","volume":"58","author":"J Huang","year":"2022","unstructured":"Huang J, Lale S. A novel nano-scale architecture of vedic multiplier using majority logic in quantum-dot cellular automata technology. Electron Lett. 2022;58(17):660\u20132.","journal-title":"Electron Lett"},{"issue":"1","key":"4702_CR24","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/2603\/1\/012045","volume":"2603","author":"V Sharma","year":"2023","unstructured":"Sharma V, Chattopadhyay MK. Implementation of novel 2x2 vedic multiplier using qca technology. J Phys Conf Ser. 2023;2603(1):012045.","journal-title":"J Phys Conf Ser"},{"key":"4702_CR25","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.3.030345","volume":"3","author":"TE O\u2019Brien","year":"2022","unstructured":"O\u2019Brien TE, Ioffe LB, Yuan S, Fushman D, Neven H, Babbush R, et al. Quantum computation of molecular structure using data from challenging-to-classically-simulate nuclear magnetic resonance experiments. PRX Quantum. 2022;3:030345.","journal-title":"PRX Quantum"},{"key":"4702_CR26","doi-asserted-by":"publisher","unstructured":"Bruzewicz, C. D., Chiaverini, J., McConnell, R., & Sage, J. M. (05 2019). Trapped-ion quantum computing: Progress and challenges. Applied Physics Reviews, 6(2), 021314. https:\/\/doi.org\/10.1063\/1.5088164","DOI":"10.1063\/1.5088164"},{"key":"4702_CR27","doi-asserted-by":"publisher","unstructured":"L. Biswal, C. Bandyopadhyay, A. Chattopadhyay, R. Wille, R. Drechsler and H. Rahaman, \"Nearest-Neighbor and Fault-Tolerant Quantum Circuit Implementation,\" 2016 IEEE 46th International Symposium on Multiple-Valued Logic (ISMVL), Sapporo, Japan, 2016, pp. 156-161. https:\/\/doi.org\/10.1109\/ISMVL.2016.48","DOI":"10.1109\/ISMVL.2016.48"},{"key":"4702_CR28","doi-asserted-by":"publisher","unstructured":"N. Abdessaied, M. Amy, M. Soeken and R. Drechsler, \"Technology Mapping of Reversible Circuits to Clifford+T Quantum Circuits,\" 2016 IEEE 46th International Symposium on Multiple-Valued Logic (ISMVL), Sapporo, Japan, 2016, pp. 150-155. https:\/\/doi.org\/10.1109\/ISMVL.2016.33","DOI":"10.1109\/ISMVL.2016.33"},{"issue":"6","key":"4702_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-023-2492-3","volume":"18","author":"M Noorallahzadeh","year":"2023","unstructured":"Noorallahzadeh M, Mosleh M, Datta K. A new design of parity-preserving reversible multipliers based on multiple-control toffoli synthesis targeting emerging quantum circuits. Front Comput Sci. 2023;18(6):186908.","journal-title":"Front Comput Sci"},{"issue":"4","key":"4702_CR30","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s11128-023-03918-1","volume":"22","author":"M Noorallahzadeh","year":"2023","unstructured":"Noorallahzadeh M, Mosleh M, Misra NK, Mehranzadeh A. A novel design of reversible quantum multiplier based on multiple-control toffoli synthesis. Quantum Inf Process. 2023;22(4):167.","journal-title":"Quantum Inf Process"},{"key":"4702_CR31","unstructured":"Parent A, Roetteler M, Mosca M. Improved reversible and quantum circuits for karatsuba-based integer multiplication; 2017."},{"key":"4702_CR32","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.98.012311","volume":"98","author":"S Dutta","year":"2018","unstructured":"Dutta S, Bhattacharjee D, Chattopadhyay A. Quantum circuits for toom-cook multiplication. Phys Rev A. 2018;98:012311.","journal-title":"Phys Rev A"},{"issue":"5","key":"4702_CR33","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1109\/TC.2018.2882774","volume":"68","author":"E Mu\u00f1oz-Coreas","year":"2019","unstructured":"Mu\u00f1oz-Coreas E, Thapliyal H. Quantum circuit design of a t-count optimized integer multiplier. IEEE Trans Comput. 2019;68(5):729\u201339.","journal-title":"IEEE Trans Comput"},{"issue":"1","key":"4702_CR34","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1140\/epjqt\/s40507-025-00355-0","volume":"12","author":"P Fan","year":"2025","unstructured":"Fan P, Li H. The integer multiplier with two unchanged operands reducing t and cnot gates. EPJ Quantum Technol. 2025;12(1):49.","journal-title":"EPJ Quantum Technol"},{"issue":"1","key":"4702_CR35","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1140\/epjqt\/s40507-024-00222-4","volume":"11","author":"P Fan","year":"2024","unstructured":"Fan P, Li H-S. Designs of the divider and special multiplier optimizing t and cnot gates. EPJ Quantum Technol. 2024;11(1):13.","journal-title":"EPJ Quantum Technol"},{"issue":"8","key":"4702_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/s11433-020-1582-8","volume":"63","author":"H-S Li","year":"2020","unstructured":"Li H-S, Fan P, Xia H, Peng H, Long G-L. Efficient quantum arithmetic operation circuits for quantum image processing. Sci China Phys Mech Astron. 2020;63(8):280311.","journal-title":"Sci China Phys Mech Astron"},{"issue":"6","key":"4702_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/s11433-021-1874-2","volume":"65","author":"H-S Li","year":"2022","unstructured":"Li H-S, Fan P, Xia H, Long G-L. The circuit design and optimization of quantum multiplier and divider. Sci China Phys Mech Astron. 2022;65(6):260311.","journal-title":"Sci China Phys Mech Astron"},{"key":"4702_CR38","doi-asserted-by":"publisher","first-page":"21848","DOI":"10.1109\/ACCESS.2023.3252504","volume":"11","author":"DSC Putranto","year":"2023","unstructured":"Putranto DSC, Wardhani RW, Larasati HT, Kim H. Space and time-efficient quantum multiplier in post quantum cryptography era. IEEE Access. 2023;11:21848\u201362.","journal-title":"IEEE Access"},{"issue":"12","key":"4702_CR39","doi-asserted-by":"publisher","first-page":"4791","DOI":"10.1109\/TCAD.2023.3279300","volume":"42","author":"J Nie","year":"2023","unstructured":"Nie J, Zhu Q, Li M, Sun X. Quantum circuit design for integer multiplication based on sch\u00f6nhage\u2013strassen algorithm. IEEE Trans Comput Aided Des Integr Circuits Syst. 2023;42(12):4791\u2013802.","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"key":"4702_CR40","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.107.042621","volume":"107","author":"F Orts","year":"2023","unstructured":"Orts F, Filatovas E, Ortega G, SanJuan-Estrada JF, Garz\u00f3n EM. Improving the number of $$t$$ gates and their spread in integer multipliers on quantum computing. Phys Rev A. 2023;107:042621.","journal-title":"Phys Rev A"},{"key":"4702_CR41","doi-asserted-by":"publisher","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","volume":"52","author":"A Barenco","year":"1995","unstructured":"Barenco A, Bennett CH, Cleve R, DiVincenzo DP, Margolus N, Shor P, et al. Elementary gates for quantum computation. Phys Rev A. 1995;52:3457\u201367.","journal-title":"Phys Rev A"},{"key":"4702_CR42","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.87.042302","volume":"87","author":"P Selinger","year":"2013","unstructured":"Selinger P. Quantum circuits of $$t$$-depth one. Phys Rev A. 2013;87:042302.","journal-title":"Phys. Rev. A"},{"key":"4702_CR43","doi-asserted-by":"publisher","unstructured":"M. H. Moaiyeri, R. F. Mirzaee, K. Navi and T. Nikoubin, \"New high-performance majority function based full adders,\" 2009 14th International CSI Computer Conference, Tehran, Iran, 2009, pp. 100-104. https:\/\/doi.org\/10.1109\/CSICC.2009.5349351","DOI":"10.1109\/CSICC.2009.5349351"},{"key":"4702_CR44","doi-asserted-by":"publisher","unstructured":"A. Chattopadhyay, L. Amar\u00fa, M. Soeken, P. -E. Gaillardon and G. De Micheli, \"Notes on Majority Boolean Algebra,\" 2016 IEEE 46th International Symposium on Multiple-Valued Logic (ISMVL), Sapporo, Japan, 2016, pp. 50-55. https:\/\/doi.org\/10.1109\/ISMVL.2016.21","DOI":"10.1109\/ISMVL.2016.21"},{"issue":"2","key":"4702_CR45","first-page":"268","volume":"4","author":"P Saha","year":"2011","unstructured":"Saha P, Banerjee A, Dandapat A, Bhattacharyya P. Vedic mathematics based 32-bit multiplier design for high speed low power processors. Int J Smart Sens Intell Syst. 2011;4(2):268\u201384.","journal-title":"Int J Smart Sens Intell Syst"},{"key":"4702_CR46","first-page":"16","volume":"21","author":"M Pradhan","year":"2011","unstructured":"Pradhan M, Panda R. Speed comparison of 16x16 vedic multipliers. Int J Comput Appl. 2011;21:16\u20139.","journal-title":"Int J Comput Appl"},{"key":"4702_CR47","unstructured":"Cuccaro SA, Draper TG, Kutin SA, Moulton DP. A new quantum ripple-carry addition circuit. 2004."},{"key":"4702_CR48","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-981-16-6940-8_5","volume-title":"Artificial intelligence driven circuits and systems","author":"L Biswal","year":"2022","unstructured":"Biswal L, Mondal B, Chakraborty A, Rahaman H. Efficient quantum implementation of majority-based full adder circuit using clifford+t-group. In: Biswajit M, Jimson M, Priyadarsan P, editors. Artificial intelligence driven circuits and systems. Singapore: Springer; 2022. p. 53\u201363."},{"issue":"6","key":"4702_CR49","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1049\/el.2015.3834","volume":"52","author":"C Labrado","year":"2016","unstructured":"Labrado C, Thapliyal H. Design of adder and subtractor circuits in majority logic-based field-coupled qca nanocomputing. Electron Lett. 2016;52(6):464\u20136.","journal-title":"Electron Lett"},{"key":"4702_CR50","doi-asserted-by":"publisher","first-page":"74","DOI":"10.22331\/q-2018-06-18-74","volume":"2","author":"C Gidney","year":"2018","unstructured":"Gidney C. Halving the cost of quantum addition. Quantum. 2018;2:74.","journal-title":"Quantum"},{"issue":"1","key":"4702_CR51","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1103\/PhysRevA.54.147","volume":"54","author":"V Vedral","year":"1996","unstructured":"Vedral V, Barenco A, Ekert A. Quantum networks for elementary arithmetic operations. Phys Rev A. 1996;54(1):147\u201353.","journal-title":"Phys Rev A"},{"issue":"1","key":"4702_CR52","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1038\/scientificamerican0785-48","volume":"253","author":"CH Bennett","year":"1985","unstructured":"Bennett CH, Landauer R. Fundamental physical limits of computation. Sci Am. 1985;253(1):48\u201356.","journal-title":"Sci Am"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-025-04702-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-025-04702-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-025-04702-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T00:10:09Z","timestamp":1769213409000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-025-04702-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,23]]},"references-count":52,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2026,2]]}},"alternative-id":["4702"],"URL":"https:\/\/doi.org\/10.1007\/s42979-025-04702-x","relation":{},"ISSN":["2661-8907"],"issn-type":[{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,23]]},"assertion":[{"value":"8 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2026","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 that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Research involving human and\/or animals"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}],"article-number":"135"}}