{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T01:39:16Z","timestamp":1778895556990,"version":"3.51.4"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,3,10]],"date-time":"2024-03-10T00:00:00Z","timestamp":1710028800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,10]],"date-time":"2024-03-10T00:00:00Z","timestamp":1710028800000},"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":["Acta Informatica"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s00236-024-00455-x","type":"journal-article","created":{"date-parts":[[2024,3,10]],"date-time":"2024-03-10T11:01:40Z","timestamp":1710068500000},"page":"131-159","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Exact distributed quantum algorithm for generalized Simon\u2019s problem"],"prefix":"10.1007","volume":"61","author":[{"given":"Hao","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daowen","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Le","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paulo","family":"Mateus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,10]]},"reference":[{"key":"455_CR1","doi-asserted-by":"publisher","unstructured":"Ambainis, A.: Superlinear advantage for exact quantum algorithms. In: Proceedings of the 45th Annual ACM Symposium on Theory of Computing, STOC\u201913, pp. 891\u2013900. ACM, New York, USA (2013). https:\/\/doi.org\/10.1145\/2488608.2488721","DOI":"10.1145\/2488608.2488721"},{"key":"455_CR2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.104.052404","volume":"104","author":"J Avron","year":"2021","unstructured":"Avron, J., Casper, O., Rozen, I.: Quantum advantage and noise reduction in distributed quantum computing. Phys. Rev. A 104, 052404 (2021). https:\/\/doi.org\/10.1103\/PhysRevA.104.052404","journal-title":"Phys. Rev. A"},{"key":"455_CR3","doi-asserted-by":"publisher","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","volume":"52","author":"A Barenco","year":"1995","unstructured":"Barenco, A., Bennett, C.H., Cleve, R., DiVincenzo, D.P., Margolus, N., Shor, P., Sleator, T., Smolin, J.A., Weinfurter, H.: Elementary gates for quantum computation. Phys. Rev. A 52, 3457\u20133467 (1995). https:\/\/doi.org\/10.1103\/PhysRevA.52.3457","journal-title":"Phys. Rev. A"},{"key":"455_CR4","doi-asserted-by":"publisher","first-page":"2153","DOI":"10.1098\/rspa.2012.0686","volume":"469","author":"R Beals","year":"2013","unstructured":"Beals, R., Brierley, S., Gray, O., Harrow, A., Kutin, S., Linden, N., Shepherd, D., Stather, M.: Efficient distributed quantum computing. Proc. Math. Phys. Eng. Sci. 469, 2153 (2013). https:\/\/doi.org\/10.1098\/rspa.2012.0686","journal-title":"Proc. Math. Phys. Eng. Sci."},{"key":"455_CR5","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1090\/conm\/305\/05215","volume":"305","author":"G Brassard","year":"2002","unstructured":"Brassard, G., H\u00f8yer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. AMS Contemp. Math. 305, 53\u201374 (2002)","journal-title":"AMS Contemp. Math."},{"issue":"3","key":"455_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/1412700.1412717","volume":"39","author":"A Broadbent","year":"2008","unstructured":"Broadbent, A., Tapp, A.: Can quantum mechanics help distributed computing? SIGACT News 39(3), 67\u201376 (2008). https:\/\/doi.org\/10.1145\/1412700.1412717","journal-title":"SIGACT News"},{"key":"455_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-45138-9_1","volume-title":"Mathematical Foundations of Computer Science","author":"H Buhrman","year":"2003","unstructured":"Buhrman, H., R\u00f6hrig, H.: Distributed quantum computing. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) Mathematical Foundations of Computer Science, pp. 1\u201320. Springer, Berlin (2003). https:\/\/doi.org\/10.1007\/978-3-540-45138-9_1"},{"issue":"1","key":"455_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0304-3975(01)00144-X","volume":"288","author":"H Buhrman","year":"2002","unstructured":"Buhrman, H., de Wolf, R.: Complexity measures and decision tree complexity: a survey. Theor. Comput. Sci. 288(1), 21\u201343 (2002). https:\/\/doi.org\/10.1016\/S0304-3975(01)00144-X","journal-title":"Theor. Comput. Sci."},{"key":"455_CR9","doi-asserted-by":"publisher","first-page":"2737","DOI":"10.1103\/PhysRevA.60.2737","volume":"60","author":"H Buhrman","year":"1999","unstructured":"Buhrman, H., Dam, W., H\u00f8yer, P., Tapp, A.: Multiparty quantum communication complexity. Phys. Rev. A 60, 2737\u20132741 (1999). https:\/\/doi.org\/10.1103\/PhysRevA.60.2737","journal-title":"Phys. Rev. A"},{"key":"455_CR10","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.jcss.2018.05.001","volume":"97","author":"G Cai","year":"2018","unstructured":"Cai, G., Qiu, D.: Optimal separation in exact query complexities for Simon\u2019s problem. J. Comput. Syst. Sci. 97, 83\u201393 (2018). https:\/\/doi.org\/10.1016\/j.jcss.2018.05.001","journal-title":"J. Comput. Syst. Sci."},{"key":"455_CR11","doi-asserted-by":"publisher","unstructured":"Caleffi, M., Cacciapuoti, A.S., Bianchi, G.: Quantum internet: From communication to distributed computing! In: Proceedings of the 5th ACM International Conference on Nanoscale Computing and Communication, pp. 1\u20134. ACM, New York, USA (2018). https:\/\/doi.org\/10.1145\/3233188.3233224","DOI":"10.1145\/3233188.3233224"},{"key":"455_CR12","doi-asserted-by":"publisher","unstructured":"Chia, N.-H., Chung, K.-M., Lai, C.-Y.: On the need for large quantum depth. In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pp. 902\u2013915. ACM, New York, USA (2020). https:\/\/doi.org\/10.1145\/3357713.3384291","DOI":"10.1145\/3357713.3384291"},{"issue":"1","key":"455_CR13","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0304-3975(02)00377-8","volume":"287","author":"R de Wolf","year":"2002","unstructured":"de Wolf, R.: Quantum communication and complexity. Theor. Comput. Sci. 287(1), 337\u2013353 (2002). https:\/\/doi.org\/10.1016\/S0304-3975(02)00377-8","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"455_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/1412700.1412718","volume":"39","author":"VS Denchev","year":"2008","unstructured":"Denchev, V.S., Pandurangan, G.: Distributed quantum computing: A new frontier in distributed systems or science fiction? SIGACT News 39(3), 77\u201395 (2008). https:\/\/doi.org\/10.1145\/1412700.1412718","journal-title":"SIGACT News"},{"key":"455_CR15","doi-asserted-by":"publisher","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC\u201996, pp. 212\u2013219. ACM, New York, USA (1996). https:\/\/doi.org\/10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"key":"455_CR16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.103.150502","volume":"103","author":"AW Harrow","year":"2009","unstructured":"Harrow, A.W., Hassidim, A., Lloyd, S.: Quantum algorithm for linear systems of equations. Phys. Rev. Lett. 103, 150502 (2009). https:\/\/doi.org\/10.1103\/PhysRevLett.103.150502","journal-title":"Phys. Rev. Lett."},{"key":"455_CR17","doi-asserted-by":"publisher","unstructured":"Hasegawa, A., Le Gall, F.: An optimal oracle separation of classical and quantum hybrid schemes. In: Proceedings of 33rd International Symposium on Algorithms and Computation, pp. 1\u201314. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2022.6","DOI":"10.4230\/LIPIcs.ISAAC.2022.6"},{"key":"455_CR18","doi-asserted-by":"publisher","unstructured":"Izumi, T., Le Gall, F.: Quantum distributed algorithm for the all-pairs shortest path problem in the CONGEST-CLIQUE model. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. PODC\u201919, pp. 84\u201393. ACM, New York, USA (2019). https:\/\/doi.org\/10.1145\/3293611.3331628","DOI":"10.1145\/3293611.3331628"},{"key":"455_CR19","doi-asserted-by":"publisher","unstructured":"Kaplan, M., Leurent, G., Leverrier, A., Naya-Plasencia, M.: Breaking symmetric cryptosystems using quantum period finding. In: Robshaw, M., Katz, J. (eds.) Advances in Cryptology\u2014CRYPTO 2016, pp. 207\u2013237. Springer, Berlin (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_8","DOI":"10.1007\/978-3-662-53008-5_8"},{"key":"455_CR20","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198570004.001.0001","volume-title":"An Introduction to Quantum Computing","author":"P Kaye","year":"2006","unstructured":"Kaye, P., Laflamme, R., Mosca, M.: An Introduction to Quantum Computing. Oxford University Press, Oxford (2006)"},{"key":"455_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574948","volume-title":"Communication Complexity","author":"E Kushilevitz","year":"1996","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1996). https:\/\/doi.org\/10.1017\/CBO9780511574948"},{"key":"455_CR22","doi-asserted-by":"publisher","unstructured":"Le Gall, F., Magniez, F.: Sublinear-time quantum computation of the diameter in CONGEST networks. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing. PODC\u201918, pp. 337\u2013346. ACM, New York, USA (2018). https:\/\/doi.org\/10.1145\/3212734.3212744","DOI":"10.1145\/3212734.3212744"},{"key":"455_CR23","doi-asserted-by":"publisher","unstructured":"Le Gall, F., Nishimura, H., Rosmanis, A.: Quantum advantage for the LOCAL model in distributed computing. In: Niedermeier, R., Paul, C. (eds.) 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Leibniz International Proceedings in Informatics (LIPIcs), vol. 126, pp. 49:1\u201349:14. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2019). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2019.49","DOI":"10.4230\/LIPIcs.STACS.2019.49"},{"key":"455_CR24","doi-asserted-by":"crossref","unstructured":"Li, H., Qiu, D., Luo, L.: Distributed exact quantum algorithms for Deutsch\u2013Jozsa problem (2023). arXiv:2303.10663","DOI":"10.2139\/ssrn.4698889"},{"key":"455_CR25","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.ipl.2016.12.002","volume":"120","author":"K Li","year":"2017","unstructured":"Li, K., Qiu, D., Li, L., Zheng, S., Rong, Z.: Application of distributed semi-quantum computing model in phase estimation. Inf. Process. Lett. 120, 23\u201329 (2017). https:\/\/doi.org\/10.1016\/j.ipl.2016.12.002","journal-title":"Inf. Process. Lett."},{"key":"455_CR26","unstructured":"Ngoenriang, N., Xu, M., Supittayapornpong, S., Niyato, D., Yu, H., Shen, X.: Optimal Stochastic Resource Allocation for Distributed Quantum Computing. (2022). arXiv:2210.02886"},{"issue":"5","key":"455_CR27","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1109\/MCOM.003.2200573","volume":"61","author":"N Ngoenriang","year":"2023","unstructured":"Ngoenriang, N., Xu, M., Kang, J., Niyato, D., Yu, H., Shen, X.: DQC$$^{2}$$O: distributed quantum computing for collaborative optimization in future networks. IEEE Commun. Mag. 61(5), 188\u2013194 (2023). https:\/\/doi.org\/10.1109\/MCOM.003.2200573","journal-title":"IEEE Commun. Mag."},{"key":"455_CR28","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2010","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2010)"},{"key":"455_CR29","doi-asserted-by":"publisher","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","volume":"2","author":"J Preskill","year":"2018","unstructured":"Preskill, J.: Quantum Computing in the NISQ era and beyond. Quantum 2, 79 (2018). https:\/\/doi.org\/10.22331\/q-2018-08-06-79","journal-title":"Quantum"},{"key":"455_CR30","doi-asserted-by":"publisher","unstructured":"Qiu, D., Luo, L., Xiao, L.: Distributed Grover\u2019s algorithm. Theor. Comput. Sci. 993, 114461 (2024). https:\/\/doi.org\/10.1016\/j.tcs.2024.114461","DOI":"10.1016\/j.tcs.2024.114461"},{"key":"455_CR31","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.97.062331","volume":"97","author":"D Qiu","year":"2018","unstructured":"Qiu, D., Zheng, S.: Generalized Deutsch\u2013Jozsa problem and the optimal quantum algorithm. Phys. Rev. A 97, 062331 (2018). https:\/\/doi.org\/10.1103\/PhysRevA.97.062331","journal-title":"Phys. Rev. A"},{"key":"455_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2020.104605","volume":"275","author":"D Qiu","year":"2020","unstructured":"Qiu, D., Zheng, S.: Revisiting Deutsch\u2013Jozsa algorithm. Inf. Comput. 275, 104605 (2020). https:\/\/doi.org\/10.1016\/j.ic.2020.104605","journal-title":"Inf. Comput."},{"issue":"1\u20132","key":"455_CR33","doi-asserted-by":"publisher","first-page":"65","DOI":"10.26421\/QIC17.1-2-4","volume":"17","author":"T Santoli","year":"2017","unstructured":"Santoli, T., Schaffner, C.: Using Simon\u2019s algorithm to attack symmetric-key cryptographic primitives. Quantum Inf. Comput. 17(1\u20132), 65\u201378 (2017). https:\/\/doi.org\/10.26421\/QIC17.1-2-4","journal-title":"Quantum Inf. Comput."},{"issue":"5","key":"455_CR34","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). https:\/\/doi.org\/10.1137\/S0097539795293172","journal-title":"SIAM J. Comput."},{"issue":"5","key":"455_CR35","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1137\/S0097539796298637","volume":"26","author":"DR Simon","year":"1997","unstructured":"Simon, D.R.: On the power of quantum computation. SIAM J. Comput. 26(5), 1474\u20131483 (1997). https:\/\/doi.org\/10.1137\/S0097539796298637","journal-title":"SIAM J. Comput."},{"key":"455_CR36","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.106.032417","volume":"106","author":"J Tan","year":"2022","unstructured":"Tan, J., Xiao, L., Qiu, D., Luo, L., Mateus, P.: Distributed quantum algorithm for Simon\u2019s problem. Phys. Rev. A 106, 032417 (2022). https:\/\/doi.org\/10.1103\/PhysRevA.106.032417","journal-title":"Phys. Rev. A"},{"key":"455_CR37","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.tcs.2022.05.025","volume":"924","author":"Z Wu","year":"2022","unstructured":"Wu, Z., Qiu, D., Tan, J., Li, H., Cai, G.: Quantum and classical query complexities for generalized Simon\u2019s problem. Theor. Comput. Sci. 924, 171\u2013186 (2022). https:\/\/doi.org\/10.1016\/j.tcs.2022.05.025","journal-title":"Theor. Comput. Sci."},{"key":"455_CR38","unstructured":"Xiao, L., Qiu, D., Luo, L., Mateus, P.: Distributed Quantum-classical Hybrid Shor\u2019s Algorithm (2023). arXiv:2304.12100"},{"key":"455_CR39","doi-asserted-by":"publisher","first-page":"27","DOI":"10.26421\/QIC23.1-2-3","volume":"23","author":"L Xiao","year":"2022","unstructured":"Xiao, L., Qiu, D., Luo, L., Mateus, P.: Distributed Shor\u2019s algorithm. Quantum Inf. Comput. 23, 27\u201344 (2022). https:\/\/doi.org\/10.26421\/QIC23.1-2-3","journal-title":"Quantum Inf. Comput."},{"key":"455_CR40","doi-asserted-by":"publisher","unstructured":"Yao, A.C.-C.: Quantum circuit complexity. In: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science. SFCS \u201993, pp. 352\u2013361. IEEE Computer Society, USA (1993). https:\/\/doi.org\/10.1109\/SFCS.1993.366852","DOI":"10.1109\/SFCS.1993.366852"},{"key":"455_CR41","doi-asserted-by":"publisher","unstructured":"Yao, A.C.-C.: Some complexity questions related to distributive computing(preliminary report). In: Proceedings of the 11th Annual ACM Symposium on Theory of Computing. STOC\u201979, pp. 209\u2013213. ACM, New York, USA (1979). https:\/\/doi.org\/10.1145\/800135.804414","DOI":"10.1145\/800135.804414"},{"key":"455_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2021.104790","volume":"281","author":"Z Ye","year":"2021","unstructured":"Ye, Z., Huang, Y., Li, L., Wang, Y.: Query complexity of generalized Simon\u2019s problem. Inf. Comput. 281, 104790 (2021). https:\/\/doi.org\/10.1016\/j.ic.2021.104790","journal-title":"Inf. Comput."},{"key":"455_CR43","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1117\/12.546504","volume-title":"Quantum Information Science II","author":"SJL Yimsiriwattana Jr.","year":"2004","unstructured":"Yimsiriwattana, S.J.L., Jr.: Distributed quantum computing: a distributed Shor algorithm. In: Donkor, E., Pirich, A.R., Brandt, H.E. (eds.) Quantum Information Science II, vol. 5436, pp. 360\u2013372. Springer, New York (2004). https:\/\/doi.org\/10.1117\/12.546504"},{"key":"455_CR44","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s11128-023-04089-9","volume":"22","author":"B-M Zhou","year":"2023","unstructured":"Zhou, B.-M., Yuan, Z.: Breaking symmetric cryptosystems using the offline distributed Grover-meets-Simon algorithm. Quantum Inf. Process. 22, 333 (2023). https:\/\/doi.org\/10.1007\/s11128-023-04089-9","journal-title":"Quantum Inf. Process."},{"key":"455_CR45","doi-asserted-by":"publisher","first-page":"51305","DOI":"10.1007\/s11467-023-1327-x","volume":"18","author":"X Zhou","year":"2023","unstructured":"Zhou, X., Qiu, D., Luo, L.: Distributed exact Grover\u2019s algorithm. Front. Phys. 18, 51305 (2023). https:\/\/doi.org\/10.1007\/s11467-023-1327-x","journal-title":"Front. Phys."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-024-00455-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-024-00455-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-024-00455-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,14]],"date-time":"2024-05-14T06:05:08Z","timestamp":1715666708000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-024-00455-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,10]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["455"],"URL":"https:\/\/doi.org\/10.1007\/s00236-024-00455-x","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3266287\/v1","asserted-by":"object"}]},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,10]]},"assertion":[{"value":"15 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 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 competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}