{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T15:37:49Z","timestamp":1774021069862,"version":"3.50.1"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T00:00:00Z","timestamp":1706572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T00:00:00Z","timestamp":1706572800000},"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":["Quantum Mach. Intell."],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s42484-023-00128-x","type":"journal-article","created":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T05:02:08Z","timestamp":1706590928000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Quantum sparse coding"],"prefix":"10.1007","volume":"6","author":[{"given":"Yaniv","family":"Romano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harel","family":"Primack","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Talya","family":"Vaknin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Idan","family":"Meirzada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilan","family":"Karpas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dov","family":"Furman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chene","family":"Tradonsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruti Ben","family":"Shlomi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,30]]},"reference":[{"issue":"11","key":"128_CR1","doi-asserted-by":"publisher","first-page":"4311","DOI":"10.1109\/TSP.2006.881199","volume":"54","author":"M Aharon","year":"2006","unstructured":"Aharon M, Elad M, Bruckstein A (2006) K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation. IEEE Trans Signal Proc 54(11):4311\u20134322","journal-title":"IEEE Trans Signal Proc"},{"key":"128_CR2","doi-asserted-by":"crossref","unstructured":"Anschuetz ER, Funcke L, Komiske PT, et\u00a0al (2022) Degeneracy engineering for classical and quantum annealing: a case study of sparse linear regression in collider physics. arXiv preprint 2205.10375","DOI":"10.1103\/PhysRevD.106.056008"},{"key":"128_CR3","unstructured":"Ayanzadeh R, Mousavi S, Halem M, et al (2019) Quantum annealing based binary compressive sensing with matrix uncertainty. arXiv preprintarXiv: 1901.00088"},{"key":"128_CR4","doi-asserted-by":"crossref","unstructured":"Ayanzadeh R, Halem M, Finin T (2020) An ensemble approach for compressive sensing with quantum annealers. In: IEEE Int Geosci Remote Sens Symp, IEEE, pp 3517\u20133520","DOI":"10.1109\/IGARSS39084.2020.9323509"},{"issue":"1","key":"128_CR5","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck A, Teboulle M (2009) A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J Imaging Sci 2(1):183\u2013202","journal-title":"SIAM J Imaging Sci"},{"key":"128_CR6","unstructured":"Bradley PS, Mangasarian OL (1998) Feature selection via concave minimization and support vector machines. In: ICML, pp 82\u201390"},{"issue":"12","key":"128_CR7","doi-asserted-by":"publisher","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Candes","year":"2005","unstructured":"Candes EJ, Tao T (2005) Decoding by linear programming. IEEE Trans Inf Theory 51(12):4203\u20134215","journal-title":"IEEE Trans Inf Theory"},{"issue":"8","key":"128_CR8","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1002\/cpa.20124","volume":"59","author":"EJ Candes","year":"2006","unstructured":"Candes EJ, Romberg JK, Tao T (2006) Stable signal recovery from incomplete and inaccurate measurements. Commun Pur Appl Math: J Issued Courant Inst Math Sci 59(8):1207\u20131223","journal-title":"Commun Pur Appl Math: J Issued Courant Inst Math Sci"},{"key":"128_CR9","doi-asserted-by":"crossref","unstructured":"Chen S, Donoho D (1994) Basis pursuit. In: Proc 1994 28th Asilomar Conf Signals Syst Comput IEEE, pp 41\u201344","DOI":"10.1109\/ACSSC.1994.471413"},{"issue":"1","key":"128_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/S003614450037906X","volume":"43","author":"SS Chen","year":"2001","unstructured":"Chen SS, Donoho DL, Saunders MA (2001) Atomic decomposition by basis pursuit. SIAM review 43(1):129\u2013159","journal-title":"SIAM review"},{"issue":"4","key":"128_CR11","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"PL Combettes","year":"2005","unstructured":"Combettes PL, Wajs VR (2005) Signal recovery by proximal forward-backward splitting. Multiscale modeling & simulation 4(4):1168\u20131200","journal-title":"Multiscale modeling & simulation"},{"issue":"1","key":"128_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-021-89461-4","volume":"11","author":"P Date","year":"2021","unstructured":"Date P, Arthur D, Pusey-Nazzaro L (2021) QUBO formulations for training machine learning models. Scientific reports 11(1):1\u201310","journal-title":"Scientific reports"},{"issue":"11","key":"128_CR13","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1002\/cpa.20042","volume":"57","author":"I Daubechies","year":"2004","unstructured":"Daubechies I, Defrise M, De Mol C (2004) An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Commun Pur Appl Math: J Issued Courant Inst Math Sci 57(11):1413\u20131457","journal-title":"Commun Pur Appl Math: J Issued Courant Inst Math Sci"},{"issue":"1","key":"128_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF02678430","volume":"13","author":"G Davis","year":"1997","unstructured":"Davis G, Mallat S, Avellaneda M (1997) Adaptive greedy approximations. Cons Approx 13(1):57\u201398","journal-title":"Adaptive greedy approximations. Cons Approx"},{"issue":"6110","key":"128_CR15","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1126\/science.1219021","volume":"338","author":"KA Dill","year":"2012","unstructured":"Dill KA, MacCallum JL (2012) The protein-folding problem, 50 years on. Sci 338(6110):1042\u20131046","journal-title":"Sci"},{"key":"128_CR16","doi-asserted-by":"crossref","unstructured":"Dong W, Li X, Zhang L, et al (2011) Sparsity-based image denoising via dictionary learning and structural clustering. In: CVPR 2011, IEEE, pp 457\u2013464","DOI":"10.1109\/CVPR.2011.5995478"},{"issue":"4","key":"128_CR17","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho DL (2006) Compressed sensing. IEEE Trans Inf Theo 52(4):1289\u20131306","journal-title":"Compressed sensing. IEEE Trans Inf Theo"},{"issue":"1","key":"128_CR18","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/TIT.2005.860430","volume":"52","author":"DL Donoho","year":"2005","unstructured":"Donoho DL, Elad M, Temlyakov VN (2005) Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Trans Inf Theo 52(1):6\u201318","journal-title":"IEEE Trans Inf Theo"},{"issue":"2","key":"128_CR19","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1214\/009053604000000067","volume":"32","author":"B Efron","year":"2004","unstructured":"Efron B, Hastie T, Johnstone I et al (2004) Least angle regression. Ann Stat 32(2):407\u2013499","journal-title":"Ann Stat"},{"key":"128_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7011-4","volume-title":"Sparse and redundant representations: From theory to applications in signal and image processing,","author":"M Elad","year":"2010","unstructured":"Elad M (2010) Sparse and redundant representations: From theory to applications in signal and image processing, vol 2. Springer"},{"issue":"12","key":"128_CR21","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1109\/TIP.2006.881969","volume":"15","author":"M Elad","year":"2006","unstructured":"Elad M, Aharon M (2006) Image denoising via sparse and redundant representations over learned dictionaries. IEEE Trans Image Proc 15(12):3736\u20133745","journal-title":"IEEE Trans Image Proc"},{"key":"128_CR22","doi-asserted-by":"crossref","unstructured":"Emani PS, Warrell J, Anticevic A et al (2021) Quantum computing at the frontiers of biological sciences. Nat Methods 18(7):701\u2013709","DOI":"10.1038\/s41592-020-01004-3"},{"key":"128_CR23","doi-asserted-by":"crossref","unstructured":"Engan K, Aase SO, Husoy JH (1999) Method of optimal directions for frame design. Int Conf Acoust Speech Signal Proc. Proc, IEEE, pp 2443\u20132446","DOI":"10.1109\/ICASSP.1999.760624"},{"issue":"1","key":"128_CR24","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1093\/comjnl\/bxm055","volume":"52","author":"MJ Fadili","year":"2009","unstructured":"Fadili MJ, Starck JL, Murtagh F (2009) Inpainting and zooming using sparse representations. Comput J 52(1):64\u201379","journal-title":"Comput J"},{"key":"128_CR25","doi-asserted-by":"crossref","unstructured":"Ferrari Dacrema M, Moroni F, Nembrini R, et al (2022) Towards feature selection for ranking and classification exploiting quantum annealers. In: Proc 45th Int ACM SIGIR Conf Res Dev Inf Retr, pp 2814\u20132824","DOI":"10.1145\/3477495.3531755"},{"key":"128_CR26","doi-asserted-by":"crossref","unstructured":"Freedman D, Drineas P (2005) Energy minimization via graph cuts: settling what is possible. In: 2005 IEEE Comput Soc Conf Comput Vision Pattern Recognit (CVPR\u201905), IEEE, pp 939\u2013946","DOI":"10.1109\/CVPR.2005.143"},{"key":"128_CR27","doi-asserted-by":"crossref","unstructured":"Gao N, Wilson M, Vandal T, et al (2020) High-dimensional similarity search with quantum-assisted variational autoencoder. In: Proc 26th ACM SIGKDD Int Conf Knowl Disc Data Min, pp 956\u2013964","DOI":"10.1145\/3394486.3403138"},{"issue":"3","key":"128_CR28","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search-part I. ORSA J Comput 1(3):190\u2013206","journal-title":"Tabu search-part I. ORSA J Comput"},{"issue":"1","key":"128_CR29","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover F (1990) Tabu search-part II. ORSA J Comput 2(1):4\u201332","journal-title":"Tabu search-part II. ORSA J Comput"},{"key":"128_CR30","unstructured":"Ide N, Ohzeki M (2022) Sparse signal reconstruction with QUBO formulation in l0-regularized linear regression. arXiv preprint 2202.00452"},{"issue":"6","key":"128_CR31","doi-asserted-by":"publisher","first-page":"1234","DOI":"10.1109\/TPAMI.2010.91","volume":"33","author":"H Ishikawa","year":"2010","unstructured":"Ishikawa H (2010) Transformation of general binary MRF minimization to the first-order case. IEEE Trans Pattern Anal Mach Intell 33(6):1234\u20131249","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"128_CR32","doi-asserted-by":"crossref","unstructured":"Jun K, Yu K (2021) QUBO formulations for system of linear equations. arXiv preprint arXiv 2106.10819","DOI":"10.21203\/rs.3.rs-558111\/v1"},{"issue":"1","key":"128_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41534-018-0060-8","volume":"4","author":"RY Li","year":"2018","unstructured":"Li RY, Di Felice R, Rohs R et al (2018) Quantum annealing versus classical machine learning applied to a simplified computational biology problem. NPJ quantum information 4(1):1\u201310","journal-title":"NPJ quantum information"},{"key":"128_CR34","doi-asserted-by":"crossref","unstructured":"Lucas A (2014) Ising formulations of many NP problems. Frontiers in Physics p 5","DOI":"10.3389\/fphy.2014.00005"},{"issue":"6","key":"128_CR35","doi-asserted-by":"publisher","first-page":"1182","DOI":"10.1002\/mrm.21391","volume":"58","author":"M Lustig","year":"2007","unstructured":"Lustig M, Donoho D, Pauly JM (2007) Sparse MRI: the application of compressed sensing for rapid MR imaging. Magnetic Resonance in Med: An Official J Int Soc Magn Reson Med 58(6):1182\u20131195","journal-title":"Magnetic Resonance in Med: An Official J Int Soc Magn Reson Med"},{"key":"128_CR36","doi-asserted-by":"crossref","unstructured":"Mairal J, Bach F, Ponce J, et al (2009) Online dictionary learning for sparse coding. In: Proc 26th Annual Int Conf Mach Learn, pp 689\u2013696","DOI":"10.1145\/1553374.1553463"},{"issue":"12","key":"128_CR37","doi-asserted-by":"publisher","first-page":"3397","DOI":"10.1109\/78.258082","volume":"41","author":"SG Mallat","year":"1993","unstructured":"Mallat SG, Zhang Z (1993) Matching pursuits with time-frequency dictionaries. IEEE Trans Signal Proc 41(12):3397\u20133415","journal-title":"IEEE Trans Signal Proc"},{"key":"128_CR38","unstructured":"Meirzada I, Kalinski A, Furman D, et al (2022) Lightsolver\u2013a new quantuminspired solver cracks the 3-regular 3-XORSAT challenge. arXiv preprint arXiv 2207.09517"},{"issue":"2","key":"128_CR39","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"BK Natarajan","year":"1995","unstructured":"Natarajan BK (1995) Sparse approximate solutions to linear systems. SIAM J Comput 24(2):227\u2013234","journal-title":"SIAM J Comput"},{"key":"128_CR40","unstructured":"Otterbach JS, Manenti R, Alidoust N, et al (2017) Unsupervised machine learning on a hybrid quantum computer. arXiv preprint arXiv 1712.05771"},{"key":"128_CR41","doi-asserted-by":"crossref","unstructured":"Pati YC, Rezaiifar R, Krishnaprasad PS (1993) Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition. In: Proc 27th Asilomar Conf Signals Syst Comput, IEEE, pp 40\u201344","DOI":"10.1109\/ACSSC.1993.342465"},{"key":"128_CR42","doi-asserted-by":"crossref","unstructured":"Patton R, Schuman C, Potok T et al (2019) Efficiently embedding QUBO problems on adiabatic quantum computers. Quantum Inf Proc 18(4):1\u201331","DOI":"10.1007\/s11128-019-2236-3"},{"issue":"7","key":"128_CR43","doi-asserted-by":"publisher","first-page":"3085","DOI":"10.1109\/TIP.2014.2325774","volume":"23","author":"Y Romano","year":"2014","unstructured":"Romano Y, Protter M, Elad M (2014) Single image interpolation via adaptive nonlocal sparsity-based modeling. IEEE Trans Image Proc 23(7):3085\u20133098","journal-title":"IEEE Trans Image Proc"},{"issue":"1","key":"128_CR44","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"SE Schaeffer","year":"2007","unstructured":"Schaeffer SE (2007) Graph clustering. Comput Sci Rev 1(1):27\u201364","journal-title":"Graph clustering. Comput Sci Rev"},{"key":"128_CR45","doi-asserted-by":"crossref","unstructured":"Sesia M, Bates S, Cand\u00e9s E, et al (2021) False discovery rate control in genome-wide association studies with population structure. Proc Natl Acad Sci 118(40): e2105841,118","DOI":"10.1073\/pnas.2105841118"},{"key":"128_CR46","doi-asserted-by":"crossref","unstructured":"Shen B, Hu W, Zhang Y, et al (2009) Image inpainting via sparse representation. In: 2009 IEEE Int Conf Acoust Speech Signal Proc, IEEE, pp 697\u2013700","DOI":"10.1109\/ICASSP.2009.4959679"},{"issue":"12","key":"128_CR47","doi-asserted-by":"publisher","first-page":"3180","DOI":"10.1109\/TSP.2016.2540599","volume":"64","author":"J Sulam","year":"2016","unstructured":"Sulam J, Ophir B, Zibulevsky M et al (2016) Trainlets: dictionary learning in high dimensions. IEEE Trans Signal Proc 64(12):3180\u20133193","journal-title":"IEEE Trans Signal Proc"},{"issue":"1","key":"128_CR48","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani R (1996) Regression shrinkage and selection via the lasso. J R Stat Soc: Series B (Methodological) 58(1):267\u2013288","journal-title":"J R Stat Soc: Series B (Methodological)"},{"issue":"10","key":"128_CR49","doi-asserted-by":"publisher","first-page":"2231","DOI":"10.1109\/TIT.2004.834793","volume":"50","author":"JA Tropp","year":"2004","unstructured":"Tropp JA (2004) Greed is good: algorithmic results for sparse approximation. IEEE Trans Inf Theory 50(10):2231\u20132242","journal-title":"IEEE Trans Inf Theory"},{"issue":"3","key":"128_CR50","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1109\/TIT.2005.864420","volume":"52","author":"JA Tropp","year":"2006","unstructured":"Tropp JA (2006) Just relax: convex programming methods for identifying sparse signals in noise. IEEE Trans Inf Theory 52(3):1030\u20131051","journal-title":"IEEE Trans Inf Theory"},{"issue":"6","key":"128_CR51","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1017\/S0016672309990334","volume":"91","author":"MG Usai","year":"2009","unstructured":"Usai MG, Goddard ME, Hayes BJ (2009) LASSO with cross-validation for genomic selection. Genet Res 91(6):427\u2013436","journal-title":"Genet Res"},{"key":"128_CR52","doi-asserted-by":"publisher","first-page":"270","DOI":"10.3389\/fgene.2013.00270","volume":"4","author":"P Waldmann","year":"2013","unstructured":"Waldmann P, M\u00e9sz\u00e1ros G, Gredler B et al (2013) Evaluation of the lasso and the elastic net in genome-wide association studies. Front Genet 4:270","journal-title":"Front Genet"},{"key":"128_CR53","doi-asserted-by":"crossref","unstructured":"Wezeman RS, Chiscop I, Anitori L, et al (2022) Quantum-classical solution methods for binary compressive sensing problems. In: Int Conf Comput Sci, Springer, pp 107\u2013121","DOI":"10.1007\/978-3-031-08760-8_9"},{"key":"128_CR54","doi-asserted-by":"crossref","unstructured":"Yang J, Wright J, Huang TS et al (2010) Image super-resolution via sparse representation. IEEE Trans Image Proc 19(11):2861\u20132873","DOI":"10.1109\/TIP.2010.2050625"},{"key":"128_CR55","doi-asserted-by":"crossref","unstructured":"Zeyde R, Elad M, Protter M (2010) On single image scale-up using sparserepresentations. In: Int Conf Curves Surf, Springer, pp 711\u2013730","DOI":"10.1007\/978-3-642-27413-8_47"}],"container-title":["Quantum Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-023-00128-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42484-023-00128-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-023-00128-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T12:18:22Z","timestamp":1719231502000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42484-023-00128-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,30]]},"references-count":55,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["128"],"URL":"https:\/\/doi.org\/10.1007\/s42484-023-00128-x","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-2127012\/v1","asserted-by":"object"}]},"ISSN":["2524-4906","2524-4914"],"issn-type":[{"value":"2524-4906","type":"print"},{"value":"2524-4914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,30]]},"assertion":[{"value":"3 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 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 their consent for COPE guidelines.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"The authors declare their consent for publication.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare no competing interests.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"4"}}