{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T07:37:17Z","timestamp":1777707437525,"version":"3.51.4"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"8086","license":[{"start":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T00:00:00Z","timestamp":1761091200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T00:00:00Z","timestamp":1761091200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nature"],"published-print":{"date-parts":[[2025,10,23]]},"DOI":"10.1038\/s41586-025-09527-5","type":"journal-article","created":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T15:02:31Z","timestamp":1761145351000},"page":"831-836","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Optimization by decoded quantum interferometry"],"prefix":"10.1038","volume":"646","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1035-1827","authenticated-orcid":false,"given":"Stephen P.","family":"Jordan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6035-2812","authenticated-orcid":false,"given":"Noah","family":"Shutty","sequence":"additional","affiliation":[]},{"given":"Mary","family":"Wootters","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2585-2424","authenticated-orcid":false,"given":"Adam","family":"Zalcman","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Schmidhuber","sequence":"additional","affiliation":[]},{"given":"Robbie","family":"King","sequence":"additional","affiliation":[]},{"given":"Sergei V.","family":"Isakov","sequence":"additional","affiliation":[]},{"given":"Tanuj","family":"Khattar","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6979-9533","authenticated-orcid":false,"given":"Ryan","family":"Babbush","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,22]]},"reference":[{"key":"9527_CR1","unstructured":"Abbas, A. et al. Challenges and opportunities in quantum optimization. Nat. Rev. Phys. 6, 718\u2013735 (2024)."},{"key":"9527_CR2","doi-asserted-by":"crossref","unstructured":"Gallager, R. G. Low-Density Parity-Check Codes (MIT, 1963).","DOI":"10.7551\/mitpress\/4347.001.0001"},{"key":"9527_CR3","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/18.910577","volume":"47","author":"TJ Richardson","year":"2001","unstructured":"Richardson, T. J. & Urbanke, R. L. The capacity of low-density parity-check codes under message-passing decoding. IEEE Trans. Inf. Theory 47, 599\u2013618 (2001).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9527_CR4","doi-asserted-by":"crossref","unstructured":"Trevisan, L. in Paradigms of Combinatorial Optimization: Problems and New Approaches 2nd edn (ed. Paschos, V. Th.) Ch. 13 (Wiley, 2014).","DOI":"10.1002\/9781119005353.ch13"},{"key":"9527_CR5","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Kumar, R. & Sivakumar, D. A sieve algorithm for the shortest lattice vector problem. In Proc. 33rd Annual ACM Symposium on Theory of Computing 601\u2013610 (ACM, 2001).","DOI":"10.1145\/380752.380857"},{"key":"9527_CR6","doi-asserted-by":"publisher","first-page":"221","DOI":"10.4086\/toc.2015.v011a007","volume":"11","author":"D Moshkovitz","year":"2015","unstructured":"Moshkovitz, D. The projection games conjecture and the NP-hardness of ln n-approximating set-cover. Theory Comput. 11, 221\u2013235 (2015).","journal-title":"Theory Comput."},{"key":"9527_CR7","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1126\/science.1057726","volume":"292","author":"E Farhi","year":"2001","unstructured":"Farhi, E. et al. A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem. Science 292, 472\u2013475 (2001).","journal-title":"Science"},{"key":"9527_CR8","unstructured":"Farhi, E., Goldstone, J. & Gutmann, S. A quantum approximate optimization algorithm applied to a bounded occurrence constraint problem. Preprint at https:\/\/arxiv.org\/abs\/1412.6062 (2014)."},{"key":"9527_CR9","doi-asserted-by":"publisher","first-page":"78","DOI":"10.22331\/q-2018-07-26-78","volume":"2","author":"MB Hastings","year":"2018","unstructured":"Hastings, M. B. A short path quantum algorithm for exact optimization. Quantum 2, 78 (2018).","journal-title":"Quantum"},{"key":"9527_CR10","unstructured":"Basso, J., Farhi, E., Marwaha, K., Villalonga, B. & Zhou, L. The quantum approximate optimization algorithm at high depth for MaxCut on large-girth regular graphs and the Sherrington-Kirkpatrick model. In Proc. 17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022) (eds Le Gall, F. & Morimae, T.) 7:1\u20137:21 (Dagstuhl, 2022)."},{"key":"9527_CR11","doi-asserted-by":"crossref","unstructured":"Dalzell, A. M., Pancotti, N., Campbell, E. T. & Brand\u00e3o, F. G. S. L. Mind the gap: achieving a super-Grover quantum speedup by jumping to the end. In Proc. 55th Annual ACM Symposium on Theory of Computing (STOC) (eds Saha, B. & Servedio, R. A.) 1131\u20131144 (ACM, 2023).","DOI":"10.1145\/3564246.3585203"},{"key":"9527_CR12","unstructured":"Kapit, E. et al. On the approximability of random-hypergraph MAX-3-XORSAT problems with quantum algorithms. Preprint at https:\/\/arxiv.org\/abs\/2312.06104 (2023)."},{"key":"9527_CR13","doi-asserted-by":"publisher","first-page":"eadm6761","DOI":"10.1126\/sciadv.adm6761","volume":"10","author":"R Shaydulin","year":"2024","unstructured":"Shaydulin, R. et al. Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem. Sci. Adv. 10, eadm6761 (2024).","journal-title":"Sci. Adv."},{"key":"9527_CR14","unstructured":"Farhi, E., Gutmann, S., Ranard, D. & Villalonga, B. Lower bounding the MaxCut of high girth 3-regular graphs using the QAOA. Preprint at https:\/\/arxiv.org\/abs\/2503.12789 (2025)."},{"key":"9527_CR15","unstructured":"Leng, J., Zheng, Y. & Wu, X. A quantum-classical performance separation in nonconvex optimization. Preprint at https:\/\/arxiv.org\/abs\/2311.00811 (2023)."},{"key":"9527_CR16","doi-asserted-by":"crossref","unstructured":"Chen, Y., Liu, Q. & Zhandry, M. Quantum algorithms for variants of average-case lattice problems via filtering. In Proc. Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT) (eds Dunkelman, O. & Dziembowski, S.) 372\u2013401 (Springer, 2022).","DOI":"10.1007\/978-3-031-07082-2_14"},{"key":"9527_CR17","doi-asserted-by":"publisher","first-page":"eadj5170","DOI":"10.1126\/sciadv.adj5170","volume":"10","author":"N Pirnay","year":"2024","unstructured":"Pirnay, N., Ulitzsh, V., Wilde, F., Eisert, J. & Seifert, J.-P. An in-principle super-polynomial quantum advantage for approximating combinatorial optimization problems via computational learning theory. Sci. Adv. 10, eadj5170 (2024).","journal-title":"Sci. Adv."},{"key":"9527_CR18","unstructured":"Szegedy, M. Quantum advantage for combinatorial optimization problems, simplified. Preprint at https:\/\/arxiv.org\/abs\/2212.12572 (2022)."},{"key":"9527_CR19","doi-asserted-by":"crossref","unstructured":"Gily\u00e9n, A., Hastings, M. B. & Vazirani, U. (Sub)exponential advantage of adiabatic quantum computation with no sign problem. In Proc. 53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC) (eds Khuller, S. & Vassilevska Williams, V.) 1357\u20131369 (ACM, 2021).","DOI":"10.1145\/3406325.3451060"},{"key":"9527_CR20","unstructured":"Eldar, L. & Hallgren, S. An efficient quantum algorithm for lattice problems achieving subexponential approximation factor. Preprint at https:\/\/arxiv.org\/abs\/2201.13450 (2022)."},{"key":"9527_CR21","first-page":"031015","volume":"6","author":"VS Denchev","year":"2016","unstructured":"Denchev, V. S. et al. What is the computational value of finite-range tunneling? Phys. Rev. X 6, 031015 (2016).","journal-title":"Phys. Rev. X"},{"key":"9527_CR22","doi-asserted-by":"crossref","unstructured":"Bartschi, A. & Eidenbenz, S. Short-depth circuits for Dicke state preparation. In Proc. 2022 IEEE International Conference on Quantum Computing and Engineering (QCE) (IEEE, 2022).","DOI":"10.1109\/QCE53715.2022.00027"},{"key":"9527_CR23","doi-asserted-by":"crossref","unstructured":"Wang, H., Tan, B., Cong, J. & De Micheli, G. Quantum state preparation using an exact CNOT synthesis formulation. In Proc. Design, Automation and Test in Europe (DATE) 1\u20136 (IEEE, 2024).","DOI":"10.23919\/DATE58400.2024.10546633"},{"key":"9527_CR24","unstructured":"Nielsen, M. A. & Chuang, I. L. Quantum Computation and Quantum Information (Cambridge Univ. Press, 2010)."},{"key":"9527_CR25","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E Berlekamp","year":"1978","unstructured":"Berlekamp, E., McEliece, R. & van Tilborg, H. On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory 24, 384\u2013386 (1978).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9527_CR26","doi-asserted-by":"crossref","unstructured":"Berlekamp, E. R. Algebraic Coding Theory (revised edition) (World Scientific, 2015).","DOI":"10.1142\/9407"},{"key":"9527_CR27","doi-asserted-by":"crossref","unstructured":"Naor, M. & Pinkas, B. Oblivious transfer and polynomial evaluation. In Proc. 31st Annual ACM Symposium on Theory of Computing (STOC) 245\u2013254 (ACM, 1999).","DOI":"10.1145\/301250.301312"},{"key":"9527_CR28","doi-asserted-by":"crossref","unstructured":"Bleichenbacher, D. & Nguyen, P. Q. Noisy polynomial interpolation and noisy Chinese remaindering. In Proc. International Conference on the Theory and Applications of Cryptographic Techniques (ed. Preneel, B.) 53\u201369 (Springer, 2000).","DOI":"10.1007\/3-540-45539-6_4"},{"key":"9527_CR29","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1080\/10586458.2014.890918","volume":"23","author":"O Garcia-Morchon","year":"2014","unstructured":"Garcia-Morchon, O., Rietman, R., Shparlinski, I. E. & Tolhuizen, L. Interpolation and approximation of polynomials in finite fields over a short interval from noisy values. Exp. Math. 23, 241\u2013260 (2014).","journal-title":"Exp. Math."},{"key":"9527_CR30","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s00200-005-0180-1","volume":"16","author":"I Shparlinski","year":"2005","unstructured":"Shparlinski, I. & Winterhof, A. Noisy interpolation of sparse polynomials in finite fields. Appl. Algebra Eng. Commun. Comput. 16, 307\u2013317 (2005).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"9527_CR31","unstructured":"Shparlinski, I. E. Playing \u2018hide-and-seek\u2019 with numbers. In Public-Key Cryptography: American Mathematical Society Short Course (2005)."},{"key":"9527_CR32","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1137\/S0097539704383633","volume":"35","author":"M Naor","year":"2006","unstructured":"Naor, M. & Pinkas, B. Oblivious polynomial evaluation. SIAM J. Comput. 35, 1254\u20131281 (2006).","journal-title":"SIAM J. Comput."},{"key":"9527_CR33","doi-asserted-by":"publisher","first-page":"2249","DOI":"10.1109\/TIT.2005.850102","volume":"51","author":"V Guruswami","year":"2005","unstructured":"Guruswami, V. & Vardy, A. Maximum-likelihood decoding of Reed-Solomon codes is NP-hard. IEEE Trans. Inf. Theory 51, 2249\u20132256 (2005).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9527_CR34","doi-asserted-by":"publisher","first-page":"1547","DOI":"10.1137\/16M110349X","volume":"47","author":"V Gandikota","year":"2018","unstructured":"Gandikota, V., Ghazi, B. & Grigorescu, E. NP-hardness of Reed-Solomon decoding, and the Prouhet-Tarry-Escott problem. SIAM J. Comput. 47, 1547\u20131584 (2018).","journal-title":"SIAM J. Comput."},{"key":"9527_CR35","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/S0097539705447335","volume":"37","author":"Q Cheng","year":"2007","unstructured":"Cheng, Q. & Wan, D. On the list and bounded distance decodability of Reed-Solomon codes. SIAM J. Comput. 37, 195\u2013209 (2007).","journal-title":"SIAM J. Comput."},{"key":"9527_CR36","doi-asserted-by":"crossref","unstructured":"Cheng, Q. & Wan, D. Complexity of decoding positive-rate Reed-Solomon codes. In Proc. International Colloquium on Automata, Languages, and Programming (ICALP) (eds Aceto, L. et al.) 283\u2013293 (Springer, 2008).","DOI":"10.1007\/978-3-540-70575-8_24"},{"key":"9527_CR37","unstructured":"Harrigan, M. P. et al. Expressing and analyzing quantum algorithms with Qualtran. Preprint at https:\/\/arxiv.org\/abs\/2409.04643 (2024)."},{"key":"9527_CR38","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","volume":"8","author":"R Gallager","year":"1962","unstructured":"Gallager, R. Low-density parity-check codes. IRE Trans. Inf. Theory 8, 21\u201328 (1962).","journal-title":"IRE Trans. Inf. Theory"},{"key":"9527_CR39","doi-asserted-by":"crossref","unstructured":"M\u00e9zard, M. & Montanari, A. Information, Physics, and Computation (Oxford Univ. Press, 2009).","DOI":"10.1093\/acprof:oso\/9780198570837.001.0001"},{"key":"9527_CR40","doi-asserted-by":"crossref","unstructured":"Aharonov, D. & Ta-Shma, A. Adiabatic quantum state generation and statistical zero knowledge. In Proc. 35th Annual ACM Symposium on Theory of Computing (STOC) 20\u201329 (ACM, 2003).","DOI":"10.1145\/780542.780546"},{"key":"9527_CR41","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1137\/S0097539703440678","volume":"33","author":"O Regev","year":"2004","unstructured":"Regev, O. Quantum computation and lattice problems. SIAM J. Comput. 33, 738\u2013760 (2004).","journal-title":"SIAM J. Comput."},{"key":"9527_CR42","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1145\/1089023.1089025","volume":"52","author":"D Aharonov","year":"2005","unstructured":"Aharonov, D. & Regev, O. Lattice problems in NP \u2229 coNP. J. ACM 52, 749\u2013765 (2005).","journal-title":"J. ACM"},{"key":"9527_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O. On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56, 1\u201340 (2009).","journal-title":"J. ACM"},{"key":"9527_CR44","unstructured":"Chailloux, A. & Tillich, J.-P. The quantum decoding problem. In 19th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC) (eds Magniez, F. & Grilo, A. B.) 6:1-6:14 (Schloss Dagstuhl\u2013Leibniz-Zentrum fur Informatik, 2024)."},{"key":"9527_CR45","doi-asserted-by":"crossref","unstructured":"Debris-Alazard, T., Remaud, M. & Tillich, J.-P. Quantum reduction of finding short code vectors to the decoding problem. IEEE Trans. Inf. Theory. 70, 5323\u20135342 (2023).","DOI":"10.1109\/TIT.2023.3327759"},{"key":"9527_CR46","doi-asserted-by":"crossref","unstructured":"Yamakawa, T. & Zhandry, M. Verifiable quantum advantage without structure. In Proc. 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) 69\u201374 (IEEE, 2022).","DOI":"10.1109\/FOCS54457.2022.00014"},{"key":"9527_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3549524","volume":"69","author":"N-H Chia","year":"2022","unstructured":"Chia, N.-H. et al. Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning. J. ACM 69, 1\u201372 (2022).","journal-title":"J. ACM"},{"key":"9527_CR48","first-page":"229","volume":"52","author":"L Fortnow","year":"1994","unstructured":"Fortnow, L. The role of relativization in complexity theory. Bull. Eur. Assoc. Theor. Comput. Sci. 52, 229\u2013243 (1994).","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci."},{"key":"9527_CR49","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1109\/TIT.2004.825043","volume":"50","author":"R Pellikaan","year":"2004","unstructured":"Pellikaan, R. & Wu, X.-W. List decoding of q-ary Reed-Muller codes. IEEE Trans. Inf. Theory 50, 679\u2013682 (2004).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9527_CR50","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1109\/TIT.2004.842696","volume":"51","author":"J Feldman","year":"2005","unstructured":"Feldman, J., Wainwright, M. J. & Karger, D. R. Using linear programming to decode binary linear codes. IEEE Trans. Inf. Theory 51, 954\u2013972 (2005).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9527_CR51","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/TIT.2006.887523","volume":"53","author":"J Feldman","year":"2007","unstructured":"Feldman, J., Malkin, T., Servedio, R. A., Stein, C. & Wainwright, M. J. LP decoding corrects a constant fraction of errors. IEEE Trans. Inf. Theory 53, 82\u201389 (2007).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9527_CR52","doi-asserted-by":"publisher","first-page":"3565","DOI":"10.1109\/TIT.2008.926452","volume":"54","author":"C Daskalakis","year":"2008","unstructured":"Daskalakis, C., Dimakis, A. G., Karp, R. M. & Wainwright, M. J. Probabilistic analysis of linear programming decoding. IEEE Trans. Inf. Theory 54, 3565\u20133578 (2008).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9527_CR53","doi-asserted-by":"publisher","first-page":"5396","DOI":"10.1109\/TIT.2008.2006384","volume":"54","author":"MH Taghavi","year":"2008","unstructured":"Taghavi, M. H. & Siegel, P. H. Adaptive methods for linear programming decoding. IEEE Trans. Inf. Theory 54, 5396\u20135410 (2008).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9527_CR54","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1109\/TCOMM.2011.122110.090729","volume":"59","author":"A Yufit","year":"2010","unstructured":"Yufit, A., Lifshitz, A. & Be\u2019ery, Y. Efficient linear programming decoding of HDPC codes. IEEE Trans. Commun. 59, 758\u2013766 (2010).","journal-title":"IEEE Trans. Commun."},{"key":"9527_CR55","doi-asserted-by":"crossref","unstructured":"Tanatmis, A. et al. Valid inequalities for binary linear codes. In Proc. 2009 IEEE International Symposium on Information Theory (ISIT) 2216\u20132220 (IEEE, 2009).","DOI":"10.1109\/ISIT.2009.5205846"},{"key":"9527_CR56","doi-asserted-by":"publisher","first-page":"3277","DOI":"10.1109\/TIT.2010.2048489","volume":"56","author":"A Tanatmis","year":"2010","unstructured":"Tanatmis, A. et al. A separation algorithm for improved LP decoding of linear block codes. IEEE Trans. Inf. Theory 56, 3277\u20133289 (2010).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9527_CR57","doi-asserted-by":"publisher","first-page":"784","DOI":"10.22331\/q-2022-08-23-784","volume":"6","author":"C Piveteau","year":"2022","unstructured":"Piveteau, C. & Renes, J. M. Quantum message-passing algorithm for optimal and efficient decoding. Quantum 6, 784 (2022).","journal-title":"Quantum"},{"key":"9527_CR58","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0890-5401(89)90067-9","volume":"82","author":"A Sinclair","year":"1989","unstructured":"Sinclair, A. & Jerrum, M. Approximate counting, uniform generation and rapidly mixing Markov chains. Inf. Comput. 82, 93\u2013133 (1989).","journal-title":"Inf. Comput."},{"key":"9527_CR59","doi-asserted-by":"publisher","unstructured":"Shutty, N., Jordan, S. & Khattar, T. Supporting material for: optimization by decoded quantum interferometry. Zenodo https:\/\/doi.org\/10.5281\/zenodo.13327870 (2025).","DOI":"10.5281\/zenodo.13327870"}],"container-title":["Nature"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41586-025-09527-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41586-025-09527-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41586-025-09527-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T17:03:27Z","timestamp":1761152607000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41586-025-09527-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,22]]},"references-count":59,"journal-issue":{"issue":"8086","published-print":{"date-parts":[[2025,10,23]]}},"alternative-id":["9527"],"URL":"https:\/\/doi.org\/10.1038\/s41586-025-09527-5","relation":{},"ISSN":["0028-0836","1476-4687"],"issn-type":[{"value":"0028-0836","type":"print"},{"value":"1476-4687","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,22]]},"assertion":[{"value":"4 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Google has filed a patent application pertaining to the DQI algorithm, on which S.P.J. is the inventor.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}