{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:41:10Z","timestamp":1767141670155,"version":"build-2238731810"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,3,7]],"date-time":"2023-03-07T00:00:00Z","timestamp":1678147200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,7]],"date-time":"2023-03-07T00:00:00Z","timestamp":1678147200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the National Key Research and Development Program of China","award":["2020YFA0714200"],"award-info":[{"award-number":["2020YFA0714200"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11871474"],"award-info":[{"award-number":["11871474"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11871385"],"award-info":[{"award-number":["11871385"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s10915-023-02158-w","type":"journal-article","created":{"date-parts":[[2023,3,7]],"date-time":"2023-03-07T05:03:27Z","timestamp":1678165407000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Just Least Squares: Binary Compressive Sampling with Low Generative Intrinsic Dimension"],"prefix":"10.1007","volume":"95","author":[{"given":"Yuling","family":"Jiao","sequence":"first","affiliation":[]},{"given":"Dingwei","family":"Li","sequence":"additional","affiliation":[]},{"given":"Min","family":"Liu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7592-5994","authenticated-orcid":false,"given":"Xiliang","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Yuanyuan","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,7]]},"reference":[{"issue":"1","key":"2158_CR1","first-page":"408","volume":"20","author":"ME Ahsen","year":"2019","unstructured":"Ahsen, M.E., Vidyasagar, M.: An approach to one-bit compressed sensing based on probably approximately correct learning theory. J. Mach. Learn. Res. 20(1), 408\u2013430 (2019)","journal-title":"J. Mach. Learn. Res."},{"key":"2158_CR2","first-page":"2285","volume":"20","author":"PL Bartlett","year":"2019","unstructured":"Bartlett, P.L., Harvey, N., Liaw, C., Mehrabian, A.: Nearly-tight vc-dimension and pseudodimension bounds for piecewise linear neural networks. J. Mach. Learn. Res. 20, 2285\u20132301 (2019)","journal-title":"J. Mach. Learn. Res."},{"key":"2158_CR3","doi-asserted-by":"crossref","unstructured":"Bartlett, P.L., Maiorov, V., Meir, R.: Almost linear VC dimension bounds for piecewise polynomial networks. Adv. Neural Inf. Process. Syst. 11, 190\u2013196 (1998)","DOI":"10.1162\/089976698300017016"},{"key":"2158_CR4","unstructured":"Bora, A., Jalal, A., Price, E., Dimakis, A. G.: Compressed sensing using generative models. In: International Conference on Machine Learning, pp. 537\u2013546. PMLR, (2017)"},{"key":"2158_CR5","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001","volume-title":"Concentration Inequalities: A Nonasymptotic Theory of Independence","author":"S Boucheron","year":"2013","unstructured":"Boucheron, S., Lugosi, G., Massart, P.: Concentration Inequalities: A Nonasymptotic Theory of Independence. Oxford University Press, Oxford (2013)"},{"key":"2158_CR6","doi-asserted-by":"crossref","unstructured":"Boufounos, P. T.: Greedy sparse signal reconstruction from sign measurements. In: Signals, Systems and Computers, 2009 Conference Record of the Forty-Third Asilomar Conference, pp. 1305\u20131309. IEEE (2009)","DOI":"10.1109\/ACSSC.2009.5469926"},{"key":"2158_CR7","doi-asserted-by":"crossref","unstructured":"Boufounos, P. T., Baraniuk, R. G.: 1-bit compressive sensing. In: Information Sciences and Systems, 2008. CISS 2008. 42nd Annual Conference, pp. 16\u201321. IEEE (2008)","DOI":"10.1109\/CISS.2008.4558487"},{"key":"2158_CR8","unstructured":"Brillinger, D. R.: A generalized linear model with gaussian regressor variables. A Festschrift For Erich L. Lehmann, pp. 97 (1982)"},{"issue":"2","key":"2158_CR9","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"EJ Cand\u00e9s","year":"2006","unstructured":"Cand\u00e9s, E.J., Romberg, J., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inform. Theory 52(2), 489\u2013509 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"2158_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.acha.2014.12.001","volume":"40","author":"D-Q Dai","year":"2016","unstructured":"Dai, D.-Q., Shen, L., Yuesheng, X., Zhang, N.: Noisy 1-bit compressive sensing: models and algorithms. Appl. Comput. Harmon. Anal. 40(1), 1\u201332 (2016)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"2158_CR11","unstructured":"Ding, Z., Huang, J., Jiao, Y., Lu, X., Yang, Z.: Robust decoding from binary measurements with cardinality constraint least squares. arXiv preprint arXiv:2006.02890 (2020)"},{"issue":"4","key":"2158_CR12","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inform. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2158_CR13","volume-title":"Fractal Geometry: Mathematical Foundations and Applications","author":"K Falconer","year":"2004","unstructured":"Falconer, K.: Fractal Geometry: Mathematical Foundations and Applications. John Wiley & Sons, New York (2004)"},{"key":"2158_CR14","doi-asserted-by":"crossref","unstructured":"Fazel, M., Candes, E., Recht, B., Parrilo, P.: Compressed sensing and robust recovery of low rank matrices. In: Signals, Systems and Computers, 2008 42nd Asilomar Conference, pp. 1043\u20131047. IEEE (2008)","DOI":"10.1109\/ACSSC.2008.5074571"},{"key":"2158_CR15","doi-asserted-by":"crossref","unstructured":"Foucart, S., Rauhut, H.: A mathematical introduction to compressive sensing, vol. 1. Birkh\u00e4user Basel (2013)","DOI":"10.1007\/978-0-8176-4948-7_1"},{"key":"2158_CR16","unstructured":"Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., et\u00a0al.: Generative adversarial nets. In: Advances in Neural Information Processing Systems 27, pp. 2672\u20132680. Curran Associates Inc., (2014)"},{"key":"2158_CR17","unstructured":"Gopi, S., Netrapalli, P., Jain, P., Nori, A.: One-bit compressed sensing: provable support and vector recovery. In: International Conference on Machine Learning, pp. 154\u2013162. (2013)"},{"key":"2158_CR18","doi-asserted-by":"crossref","unstructured":"Gupta, A., Nowak, R., Recht, B.: Sample complexity for 1-bit compressed sensing and sparse classification. In: Information Theory Proceedings (ISIT), 2010 IEEE International Symposium, pp. 1553\u20131557. IEEE (2010)","DOI":"10.1109\/ISIT.2010.5513510"},{"key":"2158_CR19","unstructured":"Hand, P., Leong, O., Voroninski, V.: Phase retrieval under a generative prior. Adv. Neural Inf. Process. Syst. 31, 9136\u20139146 (2018)"},{"key":"2158_CR20","doi-asserted-by":"crossref","unstructured":"Haupt, J., Baraniuk, R.: Robust support recovery using sparse compressive sensing matrices. In: Information Sciences and Systems (CISS), 2011 45th Annual Conference, pp. 1\u20136. IEEE (2011)","DOI":"10.1109\/CISS.2011.5766202"},{"key":"2158_CR21","unstructured":"Huang, J., Jiao, Y., Li, Z., Liu, S., Wang, Y., Yang, Y.: An error analysis of generative adversarial networks for learning distributions. J. Mach. Learn. Res. 23, 1\u201343 (2022)"},{"issue":"4","key":"2158_CR22","doi-asserted-by":"publisher","first-page":"A2062","DOI":"10.1137\/17M1154102","volume":"40","author":"J Huang","year":"2018","unstructured":"Huang, J., Jiao, Y., Xiliang, L., Zhu, L.: Robust decoding from 1-bit compressive sampling with ordinary and regularized least squares. SIAM J. Sci. Comput. 40(4), A2062\u2013A2086 (2018)","journal-title":"SIAM J. Sci. Comput."},{"key":"2158_CR23","doi-asserted-by":"crossref","unstructured":"Huang, W., Hand, P., Heckel, R., Voroninski, V.: A provably convergent scheme for compressive sensing under random generative priors. J. Fourier Anal. Appl. 27, 1\u201334 (2021)","DOI":"10.1007\/s00041-021-09830-5"},{"key":"2158_CR24","doi-asserted-by":"crossref","unstructured":"Huang, X., Shi, L., Yan, M., Suykens, J. A. K.: Pinball loss minimization for one-bit compressive sensing. Neurocomputing 314, 275\u2013283 (2018)","DOI":"10.1016\/j.neucom.2018.06.070"},{"key":"2158_CR25","unstructured":"Jacques, L., Degraux, K., De\u00a0Vleeschouwer, C.: Quantized iterative hard thresholding: bridging 1-bit and high-resolution quantized compressed sensing. arXiv preprint arXiv:1305.1786 (2013)"},{"issue":"4","key":"2158_CR26","doi-asserted-by":"publisher","first-page":"2082","DOI":"10.1109\/TIT.2012.2234823","volume":"59","author":"L Jacques","year":"2013","unstructured":"Jacques, L., Laska, J.N., Boufounos, P.T., Baraniuk, R.G.: Robust 1-bit compressive sensing via binary stable embeddings of sparse vectors. IEEE Trans. Inf. Theory 59(4), 2082\u20132102 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2158_CR27","unstructured":"Kingma, D. P., Welling, M.: Auto-encoding variational bayes. In: ICLR, (2014)"},{"issue":"7","key":"2158_CR28","doi-asserted-by":"publisher","first-page":"3496","DOI":"10.1109\/TSP.2012.2194710","volume":"60","author":"JN Laska","year":"2012","unstructured":"Laska, J.N., Baraniuk, R.G.: Regime change: bit-depth versus measurement-rate in compressive sensing. IEEE Trans. Signal Process. 60(7), 3496\u20133505 (2012)","journal-title":"IEEE Trans. Signal Process."},{"issue":"11","key":"2158_CR29","doi-asserted-by":"publisher","first-page":"5289","DOI":"10.1109\/TSP.2011.2162324","volume":"59","author":"JN Laska","year":"2011","unstructured":"Laska, J.N., Wen, Z., Yin, W., Baraniuk, R.G.: Trust, but verify: fast and accurate signal recovery from 1-bit compressive measurements. IEEE Trans. Signal Process. 59(11), 5289\u20135301 (2011)","journal-title":"IEEE Trans. Signal Process."},{"issue":"11","key":"2158_CR30","doi-asserted-by":"publisher","first-page":"2278","DOI":"10.1109\/5.726791","volume":"86","author":"Y LeCun","year":"1998","unstructured":"LeCun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proc. IEEE 86(11), 2278\u20132324 (1998)","journal-title":"Proc. IEEE"},{"key":"2158_CR31","doi-asserted-by":"crossref","unstructured":"Li, K.C., Duan, N.: Regression analysis under link violation. Ann. Stat. 17(3), 1009\u20131052 (1989)","DOI":"10.1214\/aos\/1176347254"},{"issue":"2","key":"2158_CR32","doi-asserted-by":"publisher","first-page":"169","DOI":"10.4208\/nmtma.2016.m1428","volume":"9","author":"W Liu","year":"2016","unstructured":"Liu, W., Gong, D., Zhiqiang, X.: One-bit compressed sensing by greedy algorithms. Numer. Math. Theory Methods Appl. 9(2), 169\u2013184 (2016)","journal-title":"Numer. Math. Theory Methods Appl."},{"key":"2158_CR33","doi-asserted-by":"crossref","unstructured":"Liu, Z., Gomes, S., Tiwari, A., Scarlett, J.: Sample complexity bounds for 1-bit compressive sensing and binary stable embeddings with generative priors. In: International Conference on Machine Learning, pp. 6216\u20136225. PMLR, (2020)","DOI":"10.1109\/SPCOM50965.2020.9179594"},{"key":"2158_CR34","first-page":"19125","volume":"33","author":"Z Liu","year":"2020","unstructured":"Liu, Z., Scarlett, J.: The generalized lasso with nonlinear observations and generative priors. Adv. Neural Inf. Process. Syst. 33, 19125\u201319136 (2020)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"1","key":"2158_CR35","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1109\/JSAIT.2020.2980676","volume":"1","author":"Z Liu","year":"2020","unstructured":"Liu, Z., Scarlett, J.: Information-theoretic lower bounds for compressive sensing with generative models. IEEE J. Sel. Areas Inf. Theory 1(1), 292\u2013303 (2020)","journal-title":"IEEE J. Sel. Areas Inf. Theory"},{"key":"2158_CR36","volume-title":"A Wavelet Tour of Signal Processing: The Sparse Way","author":"S Mallat","year":"2008","unstructured":"Mallat, S.: A Wavelet Tour of Signal Processing: The Sparse Way. Academic Press, Cambridge (2008)"},{"issue":"1","key":"2158_CR37","first-page":"2976","volume":"17","author":"M Neykov","year":"2016","unstructured":"Neykov, M., Liu, J.S., Cai, T.: L1-regularized least squares for support recovery of high dimensional single index models with Gaussian designs. J. Mach. Learn. Res. 17(1), 2976\u20133012 (2016)","journal-title":"J. Mach. Learn. Res."},{"issue":"8","key":"2158_CR38","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.1002\/cpa.21442","volume":"66","author":"Y Plan","year":"2013","unstructured":"Plan, Y., Vershynin, R.: One-bit compressed sensing by linear programming. Commun. Pure Appl. Math. 66(8), 1275\u20131297 (2013)","journal-title":"Commun. Pure Appl. Math."},{"issue":"1","key":"2158_CR39","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1109\/TIT.2012.2207945","volume":"59","author":"Y Plan","year":"2013","unstructured":"Plan, Y., Vershynin, R.: Robust 1-bit compressed sensing and sparse logistic regression: a convex programming approach. IEEE Trans. Inf. Theory 59(1), 482\u2013494 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"2158_CR40","doi-asserted-by":"publisher","first-page":"1528","DOI":"10.1109\/TIT.2016.2517008","volume":"62","author":"Y Plan","year":"2016","unstructured":"Plan, Y., Vershynin, R.: The generalized lasso with non-linear observations. IEEE Trans. Inf. Theory 62(3), 1528\u20131537 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"2158_CR41","first-page":"1","volume":"6","author":"Y Plan","year":"2017","unstructured":"Plan, Y., Vershynin, R., Yudovina, E.: High-dimensional estimation with geometric constraints. Inf. Inference J. IMA 6(1), 1\u201340 (2017)","journal-title":"Inf. Inference J. IMA"},{"key":"2158_CR42","unstructured":"Qiu, S., Wei, X., Yang, Z.: Robust one-bit recovery via relu generative networks: near-optimal statistical rate and global landscape analysis. In: International Conference on Machine Learning, pp. 7857\u20137866. PMLR, (2020)"},{"key":"2158_CR43","unstructured":"Jimenez Rezende, D., Mohamed, S: Variational inference with normalizing flows. In: ICML, (2015)"},{"key":"2158_CR44","volume-title":"Introduction to Data Compression","author":"K Sayood","year":"2017","unstructured":"Sayood, K.: Introduction to Data Compression. Morgan Kaufmann, Burlington (2017)"},{"key":"2158_CR45","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.neunet.2019.07.011","volume":"119","author":"Z Shen","year":"2019","unstructured":"Shen, Z., Yang, H., Zhang, S.: Nonlinear approximation via compositions. Neural Netw. 119, 74\u201384 (2019)","journal-title":"Neural Netw."},{"key":"2158_CR46","unstructured":"Ulyanov, D., Vedaldi, A., Lempitsky, V.: Deep image prior. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 9446\u20139454, (2018)"},{"key":"2158_CR47","unstructured":"Vardi, G., Yehudai, G., Shamir, O.: On the optimal memorization power of relu neural networks. In: International Conference on Learning Representations (2022). https:\/\/openreview.net\/forum?id=MkTPtnjeYTV"},{"key":"2158_CR48","doi-asserted-by":"crossref","unstructured":"Vershynin, R.: Estimation in high dimensions: a geometric perspective. In: Pfander, G.E. (ed.) Sampling Theory, a Renaissance: Compressive Sensing and Other Developments, pp. 3\u201366. Springer International Publishing, Cham (2015)","DOI":"10.1007\/978-3-319-19749-4_1"},{"key":"2158_CR49","volume-title":"High-Dimensional Probability: An Introduction with Applications in Data Science","author":"R Vershynin","year":"2018","unstructured":"Vershynin, R.: High-Dimensional Probability: An Introduction with Applications in Data Science, vol. 47. Cambridge University Press, Cambridge (2018)"},{"issue":"4","key":"2158_CR50","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1137\/20M1314884","volume":"2","author":"R Vershynin","year":"2020","unstructured":"Vershynin, R.: Memory capacity of neural networks with threshold and rectified linear unit activations. SIAM J. Math. Data Sci. 2(4), 1004\u20131033 (2020)","journal-title":"SIAM J. Math. Data Sci."},{"key":"2158_CR51","unstructured":"Wei, X., Yang, Z., Wang, Z.: On the statistical rate of nonlinear recovery in generative models with heavy-tailed data. In: International Conference on Machine Learning, pp. 6697\u20136706. PMLR, (2019)"},{"key":"2158_CR52","unstructured":"Wu, Y., Rosca, M., Lillicrap, T.: Deep compressed sensing. In: International Conference on Machine Learning, pp. 6850\u20136860. PMLR, (2019)"},{"issue":"7","key":"2158_CR53","doi-asserted-by":"publisher","first-page":"3868","DOI":"10.1109\/TSP.2012.2193397","volume":"60","author":"M Yan","year":"2012","unstructured":"Yan, M., Yang, Y., Osher, S.: Robust 1-bit compressive sensing using adaptive outlier pursuit. IEEE Trans. Signal Process. 60(7), 3868\u20133875 (2012)","journal-title":"IEEE Trans. Signal Process."},{"key":"2158_CR54","unstructured":"Zhang, L., Yi, J., Jin, R.: Efficient algorithms for robust one-bit compressive sensing. In: International Conference on Machine Learning, pp. 820\u2013828, (2014)"},{"issue":"2","key":"2158_CR55","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1109\/LSP.2009.2035667","volume":"17","author":"A Zymnis","year":"2010","unstructured":"Zymnis, A., Boyd, S., Candes, E.: Compressed sensing with quantized measurements. IEEE Signal Process. Lett. 17(2), 149\u2013152 (2010)","journal-title":"IEEE Signal Process. Lett."}],"updated-by":[{"DOI":"10.1007\/s10915-023-02269-4","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2023,7,6]],"date-time":"2023-07-06T00:00:00Z","timestamp":1688601600000}}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02158-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-023-02158-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02158-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,6]],"date-time":"2023-07-06T02:09:55Z","timestamp":1688609395000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-023-02158-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,7]]},"references-count":55,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["2158"],"URL":"https:\/\/doi.org\/10.1007\/s10915-023-02158-w","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,7]]},"assertion":[{"value":"30 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 December 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2023","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s10915-023-02269-4","URL":"https:\/\/doi.org\/10.1007\/s10915-023-02269-4","order":8,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"28"}}