{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,15]],"date-time":"2026-09-15T03:38:29Z","timestamp":1789443509411,"version":"build-2803163510"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T00:00:00Z","timestamp":1783728000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T00:00:00Z","timestamp":1787011200000},"content-version":"vor","delay-in-days":38,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Commun"],"DOI":"10.1038\/s41467-026-75119-0","type":"journal-article","created":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T10:23:50Z","timestamp":1783765430000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Precision meets speed through an FPGA-based natively\u00a0sparse Ising machine for combinatorial optimization"],"prefix":"10.1038","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-3816-9476","authenticated-orcid":false,"given":"Baijian","family":"Yao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2696-8354","authenticated-orcid":false,"given":"Daniel","family":"Ebler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xu","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juntao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2553-1804","authenticated-orcid":false,"given":"Jie","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,11]]},"reference":[{"key":"75119_CR1","unstructured":"Wolsey, L. A. & Nemhauser, G. L. Integer and combinatorial optimization. (John Wiley & Sons, 1999)."},{"key":"75119_CR2","unstructured":"Ausiello, G. et al. Complexity and Approximation: Combinatorial Optimization Problems and their Approximability Properties. (Springer Science & Business Media, 2012)."},{"key":"75119_CR3","doi-asserted-by":"publisher","first-page":"120388","DOI":"10.1109\/ACCESS.2020.3004964","volume":"8","author":"N Vesselinova","year":"2020","unstructured":"Vesselinova, N., Steinert, R., Perez-Ramirez, D. F. & Boman, M. Learning combinatorial optimization on graphs: a survey with applications to networking. IEEE Access 8, 120388\u2013120416 (2020).","journal-title":"IEEE Access"},{"key":"75119_CR4","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-020-16175-y","volume":"11","author":"G Naseri","year":"2020","unstructured":"Naseri, G. & Koffas, M. A. Application of combinatorial optimization strategies in synthetic biology. Nat. Commun. 11, 2446 (2020).","journal-title":"Nat. Commun."},{"key":"75119_CR5","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-022-33441-3","volume":"13","author":"F B\u00f6hm","year":"2022","unstructured":"B\u00f6hm, F., Alonso-Urquijo, D., Verschaffelt, G. & Van der Sande, G. Noise-injected analog ising machines enable ultrafast statistical sampling and machine learning. Nat. Commun. 13, 5847 (2022).","journal-title":"Nat. Commun."},{"key":"75119_CR6","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-024-73512-7","volume":"14","author":"Z Kaseb","year":"2024","unstructured":"Kaseb, Z., M\u00f6ller, M., Vergara, P. P. & Palensky, P. Power flow analysis using quantum and digital annealers: a discrete combinatorial optimization approach. Sci. Rep. 14, 23216 (2024).","journal-title":"Sci. Rep."},{"key":"75119_CR7","first-page":"1","volume":"2","author":"Z Bian","year":"2010","unstructured":"Bian, Z., Chudak, F., Macready, W. G. & Rose, G. The Ising model: teaching an old problem new tricks. D.-wave Syst. 2, 1\u201332 (2010).","journal-title":"D.-wave Syst."},{"key":"75119_CR8","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1038\/nphoton.2014.249","volume":"8","author":"A Marandi","year":"2014","unstructured":"Marandi, A., Wang, Z., Takata, K., Byer, R. L. & Yamamoto, Y. Network of time-multiplexed optical parametric oscillators as a coherent Ising machine. Nat. Photonics 8, 937\u2013942 (2014).","journal-title":"Nat. Photonics"},{"key":"75119_CR9","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1126\/science.aah4243","volume":"354","author":"T Inagaki","year":"2016","unstructured":"Inagaki, T. et al. A coherent ising machine for 2000-node optimization problems. Science 354, 603\u2013606 (2016).","journal-title":"Science"},{"key":"75119_CR10","doi-asserted-by":"publisher","first-page":"eaav2372","DOI":"10.1126\/sciadv.aav2372","volume":"5","author":"H Goto","year":"2019","unstructured":"Goto, H., Tatsumura, K. & Dixon, A. R. Combinatorial optimization by simulating adiabatic bifurcations in nonlinear hamiltonian systems. Sci. Adv. 5, eaav2372 (2019).","journal-title":"Sci. Adv."},{"key":"75119_CR11","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-019-11484-3","volume":"10","author":"F B\u00f6hm","year":"2019","unstructured":"B\u00f6hm, F., Verschaffelt, G. & Van der Sande, G. A poor man\u2019s coherent ising machine based on opto-electronic feedback systems for solving optimization problems. Nat. Commun. 10, 3538 (2019).","journal-title":"Nat. Commun."},{"key":"75119_CR12","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1038\/s42254-022-00440-8","volume":"4","author":"N Mohseni","year":"2022","unstructured":"Mohseni, N., McMahon, P. L. & Byrnes, T. Ising machines as hardware solvers of combinatorial optimization problems. Nat. Rev. Phys. 4, 363\u2013379 (2022).","journal-title":"Nat. Rev. Phys."},{"key":"75119_CR13","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-023-37695-3","volume":"14","author":"J Wang","year":"2023","unstructured":"Wang, J., Ebler, D., Wong, K. M., Hui, D. S. W. & Sun, J. Bifurcation behaviors shape how continuous physical dynamics solve discrete Ising optimization. Nat. Commun. 14, 2510 (2023).","journal-title":"Nat. Commun."},{"key":"75119_CR14","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-023-41214-9","volume":"14","author":"C Bybee","year":"2023","unstructured":"Bybee, C. et al. Efficient optimization with higher-order Ising machines. Nat. Commun. 14, 6033 (2023).","journal-title":"Nat. Commun."},{"key":"75119_CR15","doi-asserted-by":"publisher","first-page":"101173","DOI":"10.1016\/j.cossms.2024.101173","volume":"31","author":"VH Gonz\u00e1lez","year":"2024","unstructured":"Gonz\u00e1lez, V. H., Litvinenko, A., Kumar, A., Khymyn, R. & \u212bkerman, J. Spintronic devices as next-generation computation accelerators. Curr. Opin. Solid State Mater. Sci. 31, 101173 (2024).","journal-title":"Curr. Opin. Solid State Mater. Sci."},{"key":"75119_CR16","doi-asserted-by":"publisher","first-page":"1016","DOI":"10.3390\/mi13071016","volume":"13","author":"Y Zhang","year":"2022","unstructured":"Zhang, Y. et al. Oscillator-network-based Ising machine. micromachines 13, 1016 (2022).","journal-title":"micromachines"},{"key":"75119_CR17","doi-asserted-by":"crossref","unstructured":"Wang, T. & Roychowdhury, J. Oim: Oscillator-based Ising machines for solving combinatorial optimization problems. In International Conference on Unconventional Computation and Natural Computation. 232\u2013256 (Springer, 2019).","DOI":"10.1007\/978-3-030-19311-9_19"},{"key":"75119_CR18","doi-asserted-by":"publisher","first-page":"26639","DOI":"10.1073\/pnas.2015192117","volume":"117","author":"SK Vadlamani","year":"2020","unstructured":"Vadlamani, S. K., Xiao, T. P. & Yablonovitch, E. Physics successfully implements Lagrange multiplier optimization. Proc. Natl. Acad. Sci. 117, 26639\u201326650 (2020).","journal-title":"Proc. Natl. Acad. Sci."},{"key":"75119_CR19","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1038\/s43588-025-00782-0","volume":"5","author":"Z-S Shen","year":"2025","unstructured":"Shen, Z.-S. et al. Free-energy machine for combinatorial optimization. Nat. Comput. Sci. 5, 322\u2013332 (2025).","journal-title":"Nat. Comput. Sci."},{"key":"75119_CR20","doi-asserted-by":"crossref","unstructured":"Tatsumura, K., Dixon, A. R. & Goto, H. FPGA-based simulated bifurcation machine. In 2019, the 29th International Conference on Field Programmable Logic and Applications (FPL). 59\u201366 (IEEE, 2019).","DOI":"10.1109\/FPL.2019.00019"},{"key":"75119_CR21","doi-asserted-by":"crossref","unstructured":"Zou, Y. & Lin, M. Massively simulating adiabatic bifurcations with FPGA to solve combinatorial optimization. In Proceedings of the 2020 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays. 65\u201375 (2020).","DOI":"10.1145\/3373087.3375298"},{"key":"75119_CR22","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1038\/s41928-022-00774-2","volume":"5","author":"NA Aadit","year":"2022","unstructured":"Aadit, N. A. et al. Massively parallel probabilistic computing with sparse Ising machines. Nat. Electron. 5, 460\u2013468 (2022).","journal-title":"Nat. Electron."},{"key":"75119_CR23","doi-asserted-by":"crossref","unstructured":"Kashimata, T., Yamasaki, M., Hidaka, R. & Tatsumura, K. Efficient and scalable architecture for multiple-chip implementation of simulated bifurcation machines. IEEE Access 12, 36606\u201336621 (2024).","DOI":"10.1109\/ACCESS.2024.3374089"},{"key":"75119_CR24","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/2692916.2555255","volume":"49","author":"S Yan","year":"2014","unstructured":"Yan, S., Li, C., Zhang, Y. & Zhou, H. yaspmv: yet another spmv framework on gpus. Acm Sigplan Not. 49, 107\u2013118 (2014).","journal-title":"Acm Sigplan Not."},{"key":"75119_CR25","doi-asserted-by":"publisher","first-page":"040607","DOI":"10.1103\/PhysRevLett.122.040607","volume":"122","author":"T Leleu","year":"2019","unstructured":"Leleu, T., Yamamoto, Y., McMahon, P. L. & Aihara, K. Destabilization of local minima in analog spin systems by correction of amplitude heterogeneity. Phys. Rev. Lett. 122, 040607 (2019).","journal-title":"Phys. Rev. Lett."},{"key":"75119_CR26","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.vlsi.2019.07.003","volume":"69","author":"C Cook","year":"2019","unstructured":"Cook, C., Zhao, H., Sato, T., Hiromoto, M. & Tan, S. X.-D. GPU-based ising computing for solving max-cut combinatorial optimization problems. Integration 69, 335\u2013344 (2019).","journal-title":"Integration"},{"key":"75119_CR27","unstructured":"Nakayama, H., Koyama, J., Yoneoka, N. & Miyazawa, T. Third-generation digital annealer technology. (Fujitsu Limited, Tokyo, Japan, 2021)."},{"key":"75119_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-022-03476-y","volume":"21","author":"D Willsch","year":"2022","unstructured":"Willsch, D. et al. Benchmarking advantage and D-Wave 2000\u2009q quantum annealers with exact cover problems. Quantum Inf. Process. 21, 141 (2022).","journal-title":"Quantum Inf. Process."},{"key":"75119_CR29","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-022-10169-0","volume":"12","author":"C Carugno","year":"2022","unstructured":"Carugno, C., Ferrari Dacrema, M. & Cremonesi, P. Evaluating the job shop scheduling problem on a d-wave quantum annealer. Sci. Rep. 12, 6539 (2022).","journal-title":"Sci. Rep."},{"key":"75119_CR30","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-025-96220-2","volume":"15","author":"FA Quinton","year":"2025","unstructured":"Quinton, F. A., Myhr, P. A. S., Barani, M., Crespo del Granado, P. & Zhang, H. Quantum annealing applications, challenges and limitations for optimization problems compared to classical solvers. Sci. Rep. 15, 12733 (2025).","journal-title":"Sci. Rep."},{"key":"75119_CR31","unstructured":"Saad, Y. Sparskit: a basic toolkit for sparse matrix computations, version 2. https:\/\/www-users.cse.umn.edu\/~saad\/software\/SPARSKIT\/ (1994)."},{"key":"75119_CR32","unstructured":"Gset benchmark: https:\/\/web.stanford.edu\/~yyye\/yyye\/Gset\/ (2003)."},{"key":"75119_CR33","doi-asserted-by":"crossref","unstructured":"Liu, W. & Vinter, B. Csr5: An efficient storage format for cross-platform sparse matrix-vector multiplication. In Proceedings of the 29th ACM on International Conference on Supercomputing. 339\u2013350 (2015).","DOI":"10.1145\/2751205.2751209"},{"key":"75119_CR34","doi-asserted-by":"crossref","unstructured":"Sadi, F. et al. Efficient spmv operation for large and highly sparse matrices using scalable multi-way merge parallelization. In Proceedings of the 52nd Annual IEEE\/ACM International Symposium on Microarchitecture. 347\u2013358 (2019).","DOI":"10.1145\/3352460.3358330"},{"key":"75119_CR35","doi-asserted-by":"crossref","unstructured":"Jacob, B. et al. Quantization and training of neural networks for efficient integer-arithmetic-only inference. In Proceedings of the IEEE conference on computer vision and pattern recognition. 2704\u20132713 (2018).","DOI":"10.1109\/CVPR.2018.00286"},{"key":"75119_CR36","doi-asserted-by":"publisher","unstructured":"Wu, H., Judd, P., Zhang, X., Isaev, M. & Micikevicius, P. Integer quantization for deep learning inference: principles and empirical evaluation. Preprint at arXiv https:\/\/doi.org\/10.48550\/arXiv.2004.09602 (2020).","DOI":"10.48550\/arXiv.2004.09602"},{"key":"75119_CR37","doi-asserted-by":"crossref","unstructured":"Gholami, A. et al. A survey of quantization methods for efficient neural network inference. In Low-Power Computer Vision. 291\u2013326 (Chapman and Hall\/CRC, 2022).","DOI":"10.1201\/9781003162810-13"},{"key":"75119_CR38","doi-asserted-by":"publisher","unstructured":"Nagel, M. et al. A white paper on neural network quantization. Preprint at arXiv https:\/\/doi.org\/10.48550\/arXiv.2106.08295 (2021).","DOI":"10.48550\/arXiv.2106.08295"},{"key":"75119_CR39","doi-asserted-by":"crossref","unstructured":"Zhang, T. & Han, J. Quantized simulated bifurcation for the Ising model. In 2023 IEEE 23rd International Conference on Nanotechnology (NANO). 715\u2013720 (IEEE, 2023).","DOI":"10.1109\/NANO58406.2023.10231308"},{"key":"75119_CR40","doi-asserted-by":"publisher","first-page":"eabe7953","DOI":"10.1126\/sciadv.abe7953","volume":"7","author":"H Goto","year":"2021","unstructured":"Goto, H. et al. High-performance combinatorial optimization based on classical mechanics. Sci. Adv. 7, eabe7953 (2021).","journal-title":"Sci. Adv."},{"key":"75119_CR41","doi-asserted-by":"publisher","unstructured":"Zick, K. M. Performance report of heuristic algorithm that cracked the largest gset ising problems (g81 cut\u2009=\u200914060). preprint at https:\/\/doi.org\/10.48550\/arXiv.2505.18508 (2025).","DOI":"10.48550\/arXiv.2505.18508"},{"key":"75119_CR42","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s12532-018-0147-4","volume":"11","author":"F Furini","year":"2019","unstructured":"Furini, F. et al. Qplib: a library of quadratic programming instances. Math. Program. Comput. 11, 237\u2013265 (2019).","journal-title":"Math. Program. Comput."},{"key":"75119_CR43","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s10878-014-9734-0","volume":"28","author":"G Kochenberger","year":"2014","unstructured":"Kochenberger, G. et al. The unconstrained binary quadratic programming problem: a survey. J. Comb. Optim. 28, 58\u201381 (2014).","journal-title":"J. Comb. Optim."},{"key":"75119_CR44","doi-asserted-by":"publisher","first-page":"3241","DOI":"10.1088\/0305-4470\/15\/10\/028","volume":"15","author":"F Barahona","year":"1982","unstructured":"Barahona, F. On the computational complexity of Ising spin glass models. J. Phys. A: Math. Gen. 15, 3241 (1982).","journal-title":"J. Phys. A: Math. Gen."},{"key":"75119_CR45","doi-asserted-by":"crossref","unstructured":"Karp, R. M. Reducibility among combinatorial problems. In 50 Years of Integer Programming 1958-2008: from the Early Years to the State-of-the-Art. 219\u2013241 (Springer, 2009).","DOI":"10.1007\/978-3-540-68279-0_8"},{"key":"75119_CR46","doi-asserted-by":"crossref","unstructured":"Liu, J. & Moraglio, A. A framework for automatically setting multiple penalty weights in quadratic unconstrained binary optimization. In Proceedings of the Genetic and Evolutionary Computation Conference Companion. 575\u2013578 (2025).","DOI":"10.1145\/3712255.3726759"},{"key":"75119_CR47","doi-asserted-by":"crossref","unstructured":"Ayodele, M. Penalty weights in QUBO formulations: Permutation problems. In European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar). 159\u2013174 (Springer, 2022).","DOI":"10.1007\/978-3-031-04148-8_11"},{"key":"75119_CR48","doi-asserted-by":"publisher","first-page":"10288","DOI":"10.1364\/OE.27.010288","volume":"27","author":"ES Tiunov","year":"2019","unstructured":"Tiunov, E. S., Ulanov, A. E. & Lvovsky, A. Annealing by simulating the coherent Ising machine. Opt. Express 27, 10288\u201310295 (2019).","journal-title":"Opt. Express"},{"key":"75119_CR49","doi-asserted-by":"publisher","first-page":"21686","DOI":"10.1038\/srep21686","volume":"6","author":"H Goto","year":"2016","unstructured":"Goto, H. Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network. Sci. Rep. 6, 21686 (2016).","journal-title":"Sci. Rep."},{"key":"75119_CR50","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1038\/s41534-017-0048-9","volume":"3","author":"Y Yamamoto","year":"2017","unstructured":"Yamamoto, Y. et al. Coherent ising machines: optical neural networks operating at the quantum limit. npj Quantum Information 3, 49 (2017).","journal-title":"npj Quantum Information"},{"key":"75119_CR51","doi-asserted-by":"publisher","first-page":"14786","DOI":"10.1038\/s41598-019-49699-5","volume":"9","author":"J Chou","year":"2019","unstructured":"Chou, J., Bramhavar, S., Ghosh, S. & Herzog, W. Analog coupled oscillator-based weighted Ising machine. Sci. Rep. 9, 14786 (2019).","journal-title":"Sci. Rep."},{"key":"75119_CR52","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, 5355 (1998).","journal-title":"Phys. Rev. E"},{"key":"75119_CR53","unstructured":"Kyrola, A., Blelloch, G. & Guestrin, C. GraphChi: Large-scale graph computation on just a PC. In 10th USENIX symposium on operating systems design and implementation (OSDI 12). 31\u201346 (2012)."},{"key":"75119_CR54","unstructured":"Zhu, X., Han, W. & Chen, W. GridGraph: Large-scale graph processing on a single machine using 2-level hierarchical partitioning. In 2015 USENIX Annual Technical Conference (USENIX ATC 15). 375\u2013386 (2015)."},{"key":"75119_CR55","doi-asserted-by":"crossref","unstructured":"Takemoto, T. et al. 4.6 a 144kb annealing system composed of 9\u00a0\u00d7\u00a016\u2009kb annealing processor chips with scalable chip-to-chip connections for large-scale combinatorial optimization problems. In 2021 IEEE International Solid-State Circuits Conference (ISSCC), 64, 64\u201366 (IEEE, 2021).","DOI":"10.1109\/ISSCC42613.2021.9365748"}],"container-title":["Nature Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41467-026-75119-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41467-026-75119-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41467-026-75119-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T12:02:35Z","timestamp":1787054555000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41467-026-75119-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,11]]},"references-count":55,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["75119"],"URL":"https:\/\/doi.org\/10.1038\/s41467-026-75119-0","relation":{},"ISSN":["2041-1723"],"issn-type":[{"value":"2041-1723","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,11]]},"assertion":[{"value":"23 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no competing interests.","order":1,"name":"Ethics","label":"Competing interests","group":{"name":"EthicsHeading","label":"Ethics"}}],"article-number":"8549"}}