{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:00:55Z","timestamp":1740178855746,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T00:00:00Z","timestamp":1634601600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T00:00:00Z","timestamp":1634601600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100011199","name":"fp7 ideas: european research council","doi-asserted-by":"publisher","award":["339025"],"award-info":[{"award-number":["339025"]}],"id":[{"id":"10.13039\/100011199","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004281","name":"narodowe centrum nauki","doi-asserted-by":"publisher","award":["2019\/35\/D\/ST6\/04525"],"award-info":[{"award-number":["2019\/35\/D\/ST6\/04525"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"agence nationale de la recherche","doi-asserted-by":"publisher","award":["ANR-19-P3IA-0002"],"award-info":[{"award-number":["ANR-19-P3IA-0002"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Appl. and Comput. Topology"],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Given a set <jats:italic>P<\/jats:italic> of <jats:italic>n<\/jats:italic> points and a constant <jats:italic>k<\/jats:italic>, we are interested in computing the persistent homology of the \u010cech filtration of <jats:italic>P<\/jats:italic> for the <jats:italic>k<\/jats:italic>-distance, and investigate the effectiveness of dimensionality reduction for this problem, answering an open question of Sheehy (The persistent homology of distance functions under random projection. In Cheng, Devillers (eds), 30th Annual Symposium on Computational Geometry, SOCG\u201914, Kyoto, Japan, June 08\u201311, p 328, ACM, 2014). We show that <jats:italic>any<\/jats:italic> linear transformation that preserves pairwise distances up to a <jats:inline-formula><jats:alternatives><jats:tex-math>$$(1\\pm {\\varepsilon })$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mn>1<\/mml:mn>\n                    <mml:mo>\u00b1<\/mml:mo>\n                    <mml:mi>\u03b5<\/mml:mi>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> multiplicative factor, must preserve the persistent homology of the \u010cech filtration up to a factor of <jats:inline-formula><jats:alternatives><jats:tex-math>$$(1-{\\varepsilon })^{-1}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mrow>\n                      <mml:mo>(<\/mml:mo>\n                      <mml:mn>1<\/mml:mn>\n                      <mml:mo>-<\/mml:mo>\n                      <mml:mi>\u03b5<\/mml:mi>\n                      <mml:mo>)<\/mml:mo>\n                    <\/mml:mrow>\n                    <mml:mrow>\n                      <mml:mo>-<\/mml:mo>\n                      <mml:mn>1<\/mml:mn>\n                    <\/mml:mrow>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. Our results also show that the Vietoris-Rips and Delaunay filtrations for the <jats:italic>k<\/jats:italic>-distance, as well as the \u010cech filtration for the approximate <jats:italic>k<\/jats:italic>-distance of Buchet et al. [J Comput Geom, 58:70\u201396, 2016] are preserved up to a <jats:inline-formula><jats:alternatives><jats:tex-math>$$(1\\pm {\\varepsilon })$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mn>1<\/mml:mn>\n                    <mml:mo>\u00b1<\/mml:mo>\n                    <mml:mi>\u03b5<\/mml:mi>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> factor. We also prove extensions of our main theorem, for point sets (<jats:italic>i<\/jats:italic>) lying in a region of bounded Gaussian width or (<jats:italic>ii<\/jats:italic>) on a low-dimensional submanifold, obtaining embeddings having the dimension bounds of Lotz (Proc R Soc A Math Phys Eng Sci, 475(2230):20190081, 2019) and Clarkson (Tighter bounds for random projections of manifolds. In Teillaud (ed) Proceedings of the 24th ACM Symposium on Computational Geom- etry, College Park, MD, USA, June 9\u201311, pp 39\u201348, ACM, 2008) respectively. Our results also work in the <jats:italic>terminal dimensionality reduction<\/jats:italic> setting, where the distance of any point in the original ambient space, to any point in <jats:italic>P<\/jats:italic>, needs to be approximately preserved.\n<\/jats:p>","DOI":"10.1007\/s41468-021-00079-x","type":"journal-article","created":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T08:21:53Z","timestamp":1634631713000},"page":"671-691","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Dimensionality reduction for k-distance applied to persistent homology"],"prefix":"10.1007","volume":"5","author":[{"given":"Shreya","family":"Arya","sequence":"first","affiliation":[]},{"given":"Jean-Daniel","family":"Boissonnat","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3055-9326","authenticated-orcid":false,"given":"Kunal","family":"Dutta","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Lotz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,19]]},"reference":[{"key":"79_CR1","doi-asserted-by":"publisher","unstructured":"Achlioptas, D.: Database-friendly random projections. In Buneman, P. (ed.) Proceedings of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 21-23, 2001, Santa Barbara, California, USA. ACM, 2001. https:\/\/doi.org\/10.1145\/375551.375608,","DOI":"10.1145\/375551.375608"},{"issue":"1","key":"79_CR2","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1137\/060673096","volume":"39","author":"N Ailon","year":"2009","unstructured":"Ailon, N., Chazelle, B.: The fast Johnson-Lindenstrauss transform and approximate nearest neighbors. SIAM J. Comput. 39(1), 302\u2013322 (2009). https:\/\/doi.org\/10.1137\/060673096","journal-title":"SIAM J. Comput."},{"key":"79_CR3","doi-asserted-by":"publisher","unstructured":"Alon, N., Klartag, B.: Optimal compression of approximate inner products and dimension reduction. In Umans, C. (ed.) 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, pp. 639\u2013650. IEEE Computer Society, (2017). https:\/\/doi.org\/10.1109\/FOCS.2017.65,","DOI":"10.1109\/FOCS.2017.65"},{"key":"79_CR4","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BF02187788","volume":"5","author":"F Aurenhammer","year":"1990","unstructured":"Aurenhammer, F.: A new duality result concerning Voronoi diagrams. Discret. Comput. Geom. 5, 243\u2013254 (1990). https:\/\/doi.org\/10.1007\/BF02187788","journal-title":"Discret. Comput. Geom."},{"issue":"1","key":"79_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s10208-007-9011-z","volume":"9","author":"RG Baraniuk","year":"2009","unstructured":"Baraniuk, R.G., Wakin, M.B.: Random projections of smooth manifolds. Found. Comput. Math. 9(1), 51\u201377 (2009). https:\/\/doi.org\/10.1007\/s10208-007-9011-z","journal-title":"Found. Comput. Math."},{"key":"79_CR6","doi-asserted-by":"publisher","unstructured":"Boucheron, S., Lugosi, G., Massart, P.: Concentration Inequalities - A Nonasymptotic Theory of Independence. Oxford University Press, Oxford (2013). https:\/\/doi.org\/10.1093\/acprof:oso\/9780199535255.001.0001","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"key":"79_CR7","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.comgeo.2016.07.001","volume":"58","author":"M Buchet","year":"2016","unstructured":"Buchet, M., Chazal, F., Oudot, S.Y., Sheehy, D.R.: Efficient and robust persistent homology for measures. Comput. Geom. 58, 70\u201396 (2016). https:\/\/doi.org\/10.1016\/j.comgeo.2016.07.001","journal-title":"Comput. Geom."},{"issue":"2","key":"79_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.20382\/jocg.v9i2a3","volume":"9","author":"M Buchet","year":"2018","unstructured":"Buchet, M., Dey, T.K., Wang, J., Wang, Y.: Declutter and resample: towards parameter free denoising. JoCG 9(2), 21\u201346 (2018). https:\/\/doi.org\/10.20382\/jocg.v9i2a3","journal-title":"JoCG"},{"issue":"6","key":"79_CR9","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/s10208-011-9098-0","volume":"11","author":"F Chazal","year":"2011","unstructured":"Chazal, F., Cohen-Steiner, D., M\u00e9rigot, Q.: Geometric inference for probability measures. Found. Comput. Math. 11(6), 733\u2013751 (2011). https:\/\/doi.org\/10.1007\/s10208-011-9098-0","journal-title":"Found. Comput. Math."},{"key":"79_CR10","doi-asserted-by":"publisher","unstructured":"Chazal, F., de Silva, V., Glisse, M., Oudot, S.Y.: The Structure and Stability of Persistence Modules. Springer Briefs in Mathematics. Springer, Berlin (2016). https:\/\/doi.org\/10.1007\/978-3-319-42545-0","DOI":"10.1007\/978-3-319-42545-0"},{"key":"79_CR11","doi-asserted-by":"publisher","unstructured":"Chazal, F., Oudot, S.: Towards persistence-based reconstruction in Euclidean spaces. In Teillaud, M. (ed.) Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9\u201311, 2008, pp. 232\u2013241. ACM, (2008). https:\/\/doi.org\/10.1145\/1377676.1377719","DOI":"10.1145\/1377676.1377719"},{"key":"79_CR12","doi-asserted-by":"publisher","unstructured":"Clarkson, K.L.: Tighter bounds for random projections of manifolds. In Teillaud, M. (ed.) Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9\u201311, 2008, pp. 39\u201348. ACM, (2008). https:\/\/doi.org\/10.1145\/1377676.1377685","DOI":"10.1145\/1377676.1377685"},{"key":"79_CR13","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/BF02187740","volume":"4","author":"KL Clarkson","year":"1989","unstructured":"Clarkson, K.L., Shor, P.W.: Application of random sampling in computational geometry. II. Discret. Comput. Geom. 4, 387\u2013421 (1989). https:\/\/doi.org\/10.1007\/BF02187740","journal-title":"Discret. Comput. Geom."},{"issue":"1","key":"79_CR14","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1002\/rsa.10073","volume":"22","author":"S Dasgupta","year":"2003","unstructured":"Dasgupta, S., Gupta, A.: An elementary proof of a theorem of Johnson and Lindenstrauss. Random Struct. Algorithms 22(1), 60\u201365 (2003). https:\/\/doi.org\/10.1002\/rsa.10073","journal-title":"Random Struct. Algorithms"},{"issue":"5","key":"79_CR15","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1007\/s10208-015-9280-x","volume":"16","author":"S Dirksen","year":"2016","unstructured":"Dirksen, S.: Dimensionality reduction with subgaussian matrices: a unified theory. Found. Comput. Math. 16(5), 1367\u20131396 (2016). https:\/\/doi.org\/10.1007\/s10208-015-9280-x","journal-title":"Found. Comput. Math."},{"key":"79_CR16","doi-asserted-by":"crossref","unstructured":"Edelsbrunner, H., Harer, J.: Computational Topology - An Introduction. American Mathematical Society (2010). http:\/\/www.ams.org\/bookstore-getitem\/item=MBK-69","DOI":"10.1090\/mbk\/069"},{"issue":"4","key":"79_CR17","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/s00454-002-2885-2","volume":"28","author":"H Edelsbrunner","year":"2002","unstructured":"Edelsbrunner, H., Letscher, D., Zomorodian, A.: Topological persistence and simplification. Discret. Comput. Geom. 28(4), 511\u2013533 (2002). https:\/\/doi.org\/10.1007\/s00454-002-2885-2","journal-title":"Discret. Comput. Geom."},{"key":"79_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2017.06.021","volume":"697","author":"M Elkin","year":"2017","unstructured":"Elkin, M., Filtser, A., Neiman, O.: Terminal embeddings. Theor. Comput. Sci. 697, 1\u201336 (2017). https:\/\/doi.org\/10.1016\/j.tcs.2017.06.021","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"79_CR19","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1090\/jams\/852","volume":"29","author":"C Fefferman","year":"2016","unstructured":"Fefferman, C., Mitter, S., Narayanan, H.: Testing the manifold hypothesis. J. Am. Math. Soc. 29(4), 983\u20131049 (2016). https:\/\/doi.org\/10.1090\/jams\/852","journal-title":"J. Am. Math. Soc."},{"key":"79_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4948-7","author":"S Foucart","year":"2013","unstructured":"Foucart, S., Rauhut, H.: A mathematical introduction to compressive sensing. Appl. Numer. Harmonic Anal. (2013). https:\/\/doi.org\/10.1007\/978-0-8176-4948-7","journal-title":"Appl. Numer. Harmonic Anal."},{"key":"79_CR21","doi-asserted-by":"crossref","unstructured":"Giraud, C.: Introduction to High-Dimensional Statistics. Chapman and Hall\/CRC Monographs on Statistics and Applied Probability. Taylor and Francis, (2014). https:\/\/www.crcpress.com\/Introduction-to-High-Dimensional-Statistics\/Giraud\/p\/book\/9781482237948","DOI":"10.1201\/b17895"},{"key":"79_CR22","doi-asserted-by":"publisher","unstructured":"Gordon, Y.: On Milman\u2019s inequality and random subspaces which escape through a mesh in $$R^{n}$$. In Lindenstrauss, J., Milman, V.D. (eds.) Geometric Aspects of Functional Analysis, pp. 84\u2013106, Berlin, Heidelberg (1988). https:\/\/doi.org\/10.1007\/BFb0081737","DOI":"10.1007\/BFb0081737"},{"issue":"1","key":"79_CR23","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/s00454-012-9465-x","volume":"49","author":"LJ Guibas","year":"2013","unstructured":"Guibas, L.J., Morozov, D., M\u00e9rigot, Q.: Witnessed k-distance. Discret. Comput. Geom. 49(1), 22\u201345 (2013). https:\/\/doi.org\/10.1007\/s00454-012-9465-x","journal-title":"Discret. Comput. Geom."},{"key":"79_CR24","doi-asserted-by":"publisher","unstructured":"Indyk P., Motwani, R., Raghavan, P., Vempala, S.S.: Locality-preserving hashing in multidimensional spaces. In Leighton, F.T., Shor, P.W. (eds.) Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, El Paso, Texas, USA, May 4\u20136, 1997, pp. 618\u2013625. ACM (1997). https:\/\/doi.org\/10.1145\/258533.258656","DOI":"10.1145\/258533.258656"},{"issue":"189\u2013206","key":"79_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02764938","volume":"26","author":"WB Johnson","year":"1984","unstructured":"Johnson, W.B., Lindenstrauss, J.: Extensions of Lipschitz mappings into a Hilbert space. Contemp. Math. 26(189\u2013206), 1 (1984). https:\/\/doi.org\/10.1007\/BF02764938","journal-title":"Contemp. Math."},{"issue":"1","key":"79_CR26","doi-asserted-by":"publisher","first-page":"4:1","DOI":"10.1145\/2559902","volume":"61","author":"DM Kane","year":"2014","unstructured":"Kane, D.M., Nelson, J.: Sparser Johnson\u2013Lindenstrauss transforms. J. ACM 61(1), 4:1-4:23 (2014). https:\/\/doi.org\/10.1145\/2559902","journal-title":"J. ACM"},{"issue":"3","key":"79_CR27","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1137\/100810447","volume":"43","author":"F Krahmer","year":"2011","unstructured":"Krahmer, F., Ward, R.: New and improved Johnson-Lindenstrauss embeddings via the restricted isometry property. SIAM J. Math. Anal. 43(3), 1269\u20131281 (2011). https:\/\/doi.org\/10.1137\/100810447","journal-title":"SIAM J. Math. Anal."},{"issue":"2230","key":"79_CR28","doi-asserted-by":"publisher","first-page":"20190081","DOI":"10.1098\/rspa.2019.0081","volume":"475","author":"M Lotz","year":"2019","unstructured":"Lotz, M.: Persistent homology for low-complexity models. Proc. R. Soc. A Math. Phys. Eng. Sci. 475(2230), 20190081 (2019). https:\/\/doi.org\/10.1098\/rspa.2019.0081","journal-title":"Proc. R. Soc. A Math. Phys. Eng. Sci."},{"key":"79_CR29","doi-asserted-by":"publisher","unstructured":"Mahabadi, S., Makarychev, K., Makarychev, Y., Razenshteyn, I.P.: In Ilias, D., David, K., Monika, H. (eds.) Nonlinear dimension reduction via outer bi-lipschitz extensions, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25\u201329, 2018, pp. 1088\u20131101. ACM (2018). https:\/\/doi.org\/10.1145\/3188745.3188828","DOI":"10.1145\/3188745.3188828"},{"issue":"2","key":"79_CR30","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1002\/rsa.20218","volume":"33","author":"J Matou\u0161ek","year":"2008","unstructured":"Matou\u0161ek, J.: On variants of the Johnson Lindenstrauss lemma. Random Struct. Algorithms 33(2), 142\u2013156 (2008). https:\/\/doi.org\/10.1002\/rsa.20218","journal-title":"Random Struct. Algorithms"},{"key":"79_CR31","doi-asserted-by":"publisher","unstructured":"Narayanan, S., Nelson, J.: Optimal terminal dimensionality reduction in Euclidean space. In Charikar, M., Cohen, E. (eds.) Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23\u201326, 2019, pages 1064\u20131069. ACM, (2019). https:\/\/doi.org\/10.1145\/3313276.3316307","DOI":"10.1145\/3313276.3316307"},{"key":"79_CR32","doi-asserted-by":"crossref","unstructured":"Oudot, S.Y.: Persistence Theory - From Quiver Representations to Data Analysis. In Volume 209 of Mathematical Surveys and Monographs. American Mathematical Society (2015). http:\/\/bookstore.ams.org\/surv-209\/","DOI":"10.1090\/surv\/209"},{"key":"79_CR33","doi-asserted-by":"publisher","unstructured":"Phillips, J.M., Wang, B., Zheng, Y.: Geometric inference on kernel density estimates. In Arge, L., Pach, J. (eds.) 31st International Symposium on Computational Geometry, SoCG 2015, June 22\u201325, 2015, Eindhoven, The Netherlands, volume\u00a034 of LIPIcs, pp. 857\u2013871. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, (2015). https:\/\/doi.org\/10.4230\/LIPIcs.SOCG.2015.857","DOI":"10.4230\/LIPIcs.SOCG.2015.857"},{"key":"79_CR34","doi-asserted-by":"publisher","unstructured":"Sarl\u00f3s, T.: In: Improved approximation algorithms for large matrices via random projections, In 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21\u201324 October 2006, Berkeley, California, USA, Proceedings, pp. 143\u2013152. IEEE Computer Society (2006). https:\/\/doi.org\/10.1109\/FOCS.2006.37","DOI":"10.1109\/FOCS.2006.37"},{"key":"79_CR35","doi-asserted-by":"publisher","unstructured":"Sheehy, D.R.: The persistent homology of distance functions under random projection. In Cheng, S.-W., Devillers, O. (eds.) 30th Annual Symposium on Computational Geometry, SOCG\u201914, Kyoto, Japan, June 08\u201311, 2014, p. 328. ACM, (2014). https:\/\/doi.org\/10.1145\/2582112.2582126","DOI":"10.1145\/2582112.2582126"},{"key":"79_CR36","unstructured":"Verma, N.: A note on random projections for preserving paths on a manifold. Technical report, UC San Diego (2011). https:\/\/csetechrep.ucsd.edu\/Dienst\/UI\/2.0\/Describe\/ncstrl.ucsd_cse\/CS2011-0971"},{"key":"79_CR37","doi-asserted-by":"publisher","unstructured":"Vershynin, R.: High-Dimensional Probability: An Introduction with Applications in Data Science. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press (2018). https:\/\/doi.org\/10.1017\/9781108231596","DOI":"10.1017\/9781108231596"},{"issue":"1","key":"79_CR38","doi-asserted-by":"publisher","first-page":"e2","DOI":"10.4108\/trans.sis.2013.01-03.e2","volume":"1","author":"J Zhang","year":"2013","unstructured":"Zhang, J.: Advancements of outlier detection: A survey. EAI Endorsed Trans. Scalable Inf. Syst. 1(1), e2 (2013). https:\/\/doi.org\/10.4108\/trans.sis.2013.01-03.e2","journal-title":"EAI Endorsed Trans. Scalable Inf. Syst."}],"container-title":["Journal of Applied and Computational Topology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41468-021-00079-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41468-021-00079-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41468-021-00079-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T20:41:13Z","timestamp":1635626473000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41468-021-00079-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,19]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["79"],"URL":"https:\/\/doi.org\/10.1007\/s41468-021-00079-x","relation":{},"ISSN":["2367-1726","2367-1734"],"issn-type":[{"type":"print","value":"2367-1726"},{"type":"electronic","value":"2367-1734"}],"subject":[],"published":{"date-parts":[[2021,10,19]]},"assertion":[{"value":"11 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}