{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:24:13Z","timestamp":1750281853874},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T00:00:00Z","timestamp":1665446400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T00:00:00Z","timestamp":1665446400000},"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":["Found Comput Math"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s10208-022-09588-2","type":"journal-article","created":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T15:03:09Z","timestamp":1665500589000},"page":"1-97","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Adversarial Manifold Estimation"],"prefix":"10.1007","volume":"24","author":[{"given":"Eddie","family":"Aamari","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Knop","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,11]]},"reference":[{"key":"9588_CR1","unstructured":"Ery Arias-Castro, Gilad Lerman, and Teng Zhang. Spectral clustering based on local PCA. J. Mach. Learn. Res., 18:Paper No. 9, 57, 2017."},{"key":"9588_CR2","first-page":"1747","volume":"14","author":"Ery Arias-Castro","year":"2013","unstructured":"Ery Arias-Castro and Bruno Pelletier. On the convergence of maximum variance unfolding. J. Mach. Learn. Res., 14:1747\u20131770, 2013.","journal-title":"J. Mach. Learn. Res."},{"key":"9588_CR3","unstructured":"Srinivasan Arunachalam, Alex\u00a0B. Grilo, and Henry Yuen. Quantum statistical query learning. CoRR, arXiv:2002.08240, 2020."},{"key":"9588_CR4","doi-asserted-by":"crossref","unstructured":"Eddie Aamari and Alexander Knop. Statistical query complexity of manifold estimation. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021, page 116\u2013122, New York, NY, USA, 2021. Association for Computing Machinery.","DOI":"10.1145\/3406325.3451135"},{"issue":"1","key":"9588_CR5","doi-asserted-by":"publisher","first-page":"1359","DOI":"10.1214\/19-EJS1551","volume":"13","author":"Eddie Aamari","year":"2019","unstructured":"Eddie Aamari, Jisu Kim, Fr\u00e9d\u00e9ric Chazal, Bertrand Michel, Alessandro Rinaldo, and Larry Wasserman. Estimating the reach of a manifold. Electron. J. Stat., 13(1):1359\u20131399, 2019.","journal-title":"Electron. J. Stat."},{"issue":"4","key":"9588_CR6","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1007\/s00454-017-9962-z","volume":"59","author":"Eddie Aamari","year":"2018","unstructured":"Eddie Aamari and Cl\u00e9ment Levrard. Stability and minimax optimality of tangential Delaunay complexes for manifold reconstruction. Discrete Comput. Geom., 59(4):923\u2013971, 2018.","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"9588_CR7","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1214\/18-AOS1685","volume":"47","author":"Eddie Aamari","year":"2019","unstructured":"Eddie Aamari and Cl\u00e9ment Levrard. Nonasymptotic rates for manifold, tangent space and curvature estimation. Ann. Statist., 47(1):177\u2013204, 2019.","journal-title":"Ann. Statist."},{"issue":"3","key":"9588_CR8","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1512\/iumj.1986.35.35028","volume":"35","author":"F Almgren","year":"1986","unstructured":"F.\u00a0Almgren. Optimal isoperimetric inequalities. Indiana Univ. Math. J., 35(3):451\u2013547, 1986.","journal-title":"Indiana Univ. Math. J."},{"key":"9588_CR9","unstructured":"Yariv Aizenbud and Barak Sober. Non-Parametric Estimation of Manifolds from Noisy Data. arXiv:2105.04754, May 2021."},{"key":"9588_CR10","doi-asserted-by":"crossref","unstructured":"Dmitri Burago, Yuri Burago, and Sergei Ivanov. A course in metric geometry, volume\u00a033 of Graduate Studies in Mathematics. American Mathematical Society, Providence, RI, 2001.","DOI":"10.1090\/gsm\/033"},{"issue":"3","key":"9588_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1006\/jcss.1998.1569","volume":"56","author":"Shai Ben-David","year":"1998","unstructured":"Shai Ben-David and Eli Dichterman. Learning with restricted focus of attention. J. Comput. Syst. Sci., 56(3):277\u2013298, 1998.","journal-title":"J. Comput. Syst. Sci."},{"key":"9588_CR12","doi-asserted-by":"crossref","unstructured":"Avrim Blum, Merrick Furst, Jeffrey Jackson, Michael Kearns, Yishay Mansour, and Steven Rudich. Weakly learning DNF and characterizing statistical query learning using fourier analysis. In Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, STOC \u201994, page 253\u2013262, New York, NY, USA, 1994. Association for Computing Machinery.","DOI":"10.1145\/195058.195147"},{"issue":"1","key":"9588_CR13","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s00454-013-9557-2","volume":"51","author":"Jean-Daniel Boissonnat","year":"2014","unstructured":"Jean-Daniel Boissonnat and Arijit Ghosh. Manifold reconstruction using tangential Delaunay complexes. Discrete Comput. Geom., 51(1):221\u2013267, 2014.","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"9588_CR14","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s00454-021-00290-8","volume":"67","author":"Cl\u00e9ment Berenfeld","year":"2022","unstructured":"Cl\u00e9ment Berenfeld, John Harvey, Marc Hoffmann, and Krishnan Shankar. Estimating the reach of a manifold via its convexity defect function. Discrete Comput. Geom., 67(2):403\u2013438, 2022.","journal-title":"Discrete Comput. Geom."},{"key":"9588_CR15","unstructured":"Jean-Daniel Boissonnat, Siargey Kachanovich, and Mathijs Wintraecken. Sampling and Meshing Submanifolds in High Dimension. working paper or preprint, November 2019."},{"issue":"1\u20132","key":"9588_CR16","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s41468-019-00029-8","volume":"3","author":"Jean-Daniel Boissonnat","year":"2019","unstructured":"Jean-Daniel Boissonnat, Andr\u00e9 Lieutier, and Mathijs Wintraecken. The reach, metric distortion, geodesic convexity and the variation of tangent spaces. J. Appl. Comput. Topol., 3(1-2):29\u201358, 2019.","journal-title":"J. Appl. Comput. Topol."},{"key":"9588_CR17","doi-asserted-by":"crossref","unstructured":"Tom Bylander. Learning linear threshold functions in the presence of classification noise. In Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, COLT 1994, New Brunswick, NJ, USA, July 12-15, 1994, pages 340\u2013347, 1994.","DOI":"10.1145\/180139.181176"},{"issue":"6","key":"9588_CR18","doi-asserted-by":"publisher","first-page":"2300","DOI":"10.1214\/aos\/1030741073","volume":"25","author":"Antonio Cuevas","year":"1997","unstructured":"Antonio Cuevas and Ricardo Fraiman. A plug-in approach to support estimation. Ann. Statist., 25(6):2300\u20132312, 1997.","journal-title":"Ann. Statist."},{"key":"9588_CR19","unstructured":"Manfredo Perdig\u00e3o do\u00a0Carmo. Riemannian geometry. Mathematics: Theory & Applications. Birkh\u00e4user Boston, Inc., Boston, MA, 1992. Translated from the second Portuguese edition by Francis Flaherty."},{"key":"9588_CR20","unstructured":"Tamal\u00a0K. Dey. Curve and surface reconstruction: algorithms with mathematical analysis, volume\u00a023 of Cambridge Monographs on Applied and Computational Mathematics. Cambridge University Press, Cambridge, 2007."},{"key":"9588_CR21","doi-asserted-by":"crossref","unstructured":"Dana Dachman-Soled, Vitaly Feldman, Li-Yang Tan, Andrew Wan, and Karl Wimmer. Approximate resilience, monotonicity, and the complexity of agnostic learning. In Piotr Indyk, editor, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, pages 498\u2013511. SIAM, 2015.","DOI":"10.1137\/1.9781611973730.34"},{"issue":"2","key":"9588_CR22","doi-asserted-by":"publisher","first-page":"5888","DOI":"10.1214\/21-EJS1934","volume":"15","author":"Vincent Divol","year":"2021","unstructured":"Vincent Divol. Minimax adaptive estimation in manifold inference. Electron. J. Stat., 15(2):5888\u20135932, 2021.","journal-title":"Electron. J. Stat."},{"key":"9588_CR23","unstructured":"Vincent Divol. Reconstructing measures on manifolds: an optimal transport approach. arXiv:2102.07595, February 2021."},{"key":"9588_CR24","doi-asserted-by":"crossref","unstructured":"Ilias Diakonikolas, Daniel\u00a0M. Kane, and Alistair Stewart. Statistical query lower bounds for robust estimation of high-dimensional gaussians and gaussian mixtures. In Chris Umans, editor, 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, pages 73\u201384. IEEE Computer Society, 2017.","DOI":"10.1109\/FOCS.2017.16"},{"issue":"3","key":"9588_CR25","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF01197748","volume":"1","author":"Giuseppe De Marco","year":"1994","unstructured":"Giuseppe De\u00a0Marco, Gianluca Gorni, and Gaetano Zampieri. Global inversion of functions: an introduction. NoDEA Nonlinear Differential Equations Appl., 1(3):229\u2013248, 1994.","journal-title":"NoDEA Nonlinear Differential Equations Appl."},{"key":"9588_CR26","doi-asserted-by":"crossref","unstructured":"Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith. Calibrating noise to sensitivity in private data analysis. In Theory of cryptography, volume 3876 of Lecture Notes in Comput. Sci., pages 265\u2013284. Springer, Berlin, 2006.","DOI":"10.1007\/11681878_14"},{"issue":"1","key":"9588_CR27","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s10107-007-0095-7","volume":"114","author":"John Dunagan","year":"2008","unstructured":"John Dunagan and Santosh\u00a0S. Vempala. A simple polynomial-time rescaling algorithm for solving linear programs. Math. Program., 114(1):101\u2013114, 2008.","journal-title":"Math. Program."},{"key":"9588_CR28","unstructured":"David\u00a0B Dunson and Nan Wu. Inferring Manifolds From Noisy Data Using Gaussian Processes. arXiv:2110.07478, October 2021."},{"key":"9588_CR29","doi-asserted-by":"crossref","unstructured":"Alexandre\u00a0V. Evfimievski, Johannes Gehrke, and Ramakrishnan Srikant. Limiting privacy breaches in privacy preserving data mining. In Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 9-12, 2003, San Diego, CA, USA, pages 211\u2013222. ACM, 2003.","DOI":"10.1145\/773153.773174"},{"key":"9588_CR30","doi-asserted-by":"crossref","unstructured":"Maryam Fazel, Emmanuel Cand\u00e8s, Benjamin Recht, and Pablo Parrilo. Compressed sensing and robust recovery of low rank matrices. In in Proc. 40th Asilomar Conf. Signals, Systems and Computers, 2008.","DOI":"10.1109\/ACSSC.2008.5074571"},{"key":"9588_CR31","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1090\/S0002-9947-1959-0110078-1","volume":"93","author":"Herbert Federer","year":"1959","unstructured":"Herbert Federer. Curvature measures. Trans. Amer. Math. Soc., 93:418\u2013491, 1959.","journal-title":"Trans. Amer. Math. Soc."},{"key":"9588_CR32","unstructured":"Herbert Federer. Geometric measure theory. Die Grundlehren der mathematischen Wissenschaften, Band 153. Springer-Verlag New York Inc., New York, 1969."},{"key":"9588_CR33","unstructured":"Vitaly Feldman. A general characterization of the statistical query complexity. In Proceedings of Machine Learning Research, volume\u00a065, pages 785\u2013830, Amsterdam, Netherlands, 2017."},{"issue":"2","key":"9588_CR34","doi-asserted-by":"publisher","first-page":"8:1","DOI":"10.1145\/3046674","volume":"64","author":"Vitaly Feldman","year":"2017","unstructured":"Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh\u00a0S. Vempala, and Ying Xiao. Statistical algorithms and a lower bound for detecting planted cliques. J. ACM, 64(2):8:1\u20138:37, 2017.","journal-title":"J. ACM"},{"issue":"3","key":"9588_CR35","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1287\/moor.2020.1111","volume":"46","author":"Vitaly Feldman","year":"2021","unstructured":"Vitaly Feldman, Crist\u00f3bal Guzm\u00e1n, and Santosh Vempala. Statistical query algorithms for mean vector estimation and stochastic convex optimization. Math. Oper. Res., 46(3):912\u2013945, 2021.","journal-title":"Math. Oper. Res."},{"key":"9588_CR36","unstructured":"Charles Fefferman, Sergei Ivanov, Matti Lassas, and Hariharan Narayanan. Fitting a manifold of large reach to noisy data. arXiv:1910.05084, October 2019."},{"issue":"4","key":"9588_CR37","doi-asserted-by":"publisher","first-page":"1294","DOI":"10.1137\/16M1078471","volume":"47","author":"Vitaly Feldman","year":"2018","unstructured":"Vitaly Feldman, Will Perkins, and Santosh\u00a0S. Vempala. On the complexity of random satisfiability problems with planted solutions. SIAM J. Comput., 47(4):1294\u20131338, 2018.","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9588_CR38","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1214\/12-AOS994","volume":"40","author":"Christopher R Genovese","year":"2012","unstructured":"Christopher\u00a0R. Genovese, Marco Perone-Pacifico, Isabella Verdinelli, and Larry Wasserman. Manifold estimation and singular deconvolution under Hausdorff loss. Ann. Statist., 40(2):941\u2013963, 2012.","journal-title":"Ann. Statist."},{"key":"9588_CR39","first-page":"1263","volume":"13","author":"Christopher R Genovese","year":"2012","unstructured":"Christopher\u00a0R. Genovese, Marco Perone-Pacifico, Isabella Verdinelli, and Larry Wasserman. Minimax manifold estimation. J. Mach. Learn. Res., 13:1263\u20131291, 2012.","journal-title":"J. Mach. Learn. Res."},{"key":"9588_CR40","volume-title":"Algebraic topology","author":"Allen Hatcher","year":"2002","unstructured":"Allen Hatcher. Algebraic topology. Cambridge University Press, Cambridge, 2002."},{"key":"9588_CR41","doi-asserted-by":"crossref","unstructured":"Trevor Hastie, Robert Tibshirani, and Jerome Friedman. The elements of statistical learning. Springer Series in Statistics. Springer, New York, second edition, 2009. Data mining, inference, and prediction.","DOI":"10.1007\/978-0-387-84858-7"},{"key":"9588_CR42","unstructured":"DR.\u00a0Ron Jarmin. Census bureau adopts cutting edge privacy protections for 2020 census, 2019. available at https:\/\/www.census.gov\/newsroom\/blogs\/random-samplings\/2019\/02\/census_bureau_adopts.html."},{"issue":"5","key":"9588_CR43","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1145\/3187009.3177733","volume":"11","author":"Noah M Johnson","year":"2018","unstructured":"Noah\u00a0M. Johnson, Joseph\u00a0P. Near, and Dawn Song. Towards practical differential privacy for SQL queries. Proc. VLDB Endow., 11(5):526\u2013539, 2018.","journal-title":"Proc. VLDB Endow."},{"issue":"6","key":"9588_CR44","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1145\/293347.293351","volume":"45","author":"Michael J Kearns","year":"1998","unstructured":"Michael\u00a0J. Kearns. Efficient noise-tolerant learning from statistical queries. J. ACM, 45(6):983\u20131006, 1998.","journal-title":"J. ACM"},{"issue":"3","key":"9588_CR45","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1137\/090756090","volume":"40","author":"Shiva\u00a0Prasad Kasiviswanathan","year":"2011","unstructured":"Shiva\u00a0Prasad Kasiviswanathan, Homin\u00a0K. Lee, Kobbi Nissim, Sofya Raskhodnikova, and Adam\u00a0D. Smith. What can we learn privately? SIAM J. Comput., 40(3):793\u2013826, 2011.","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9588_CR46","doi-asserted-by":"publisher","first-page":"1562","DOI":"10.1214\/15-EJS1039","volume":"9","author":"Arlene K.\u00a0H Kim","year":"2015","unstructured":"Arlene K.\u00a0H. Kim and Harrison\u00a0H. Zhou. Tight minimax rates for manifold estimation under Hausdorff loss. Electron. J. Stat., 9(1):1562\u20131582, 2015.","journal-title":"Electron. J. Stat."},{"key":"9588_CR47","doi-asserted-by":"crossref","unstructured":"William\u00a0E. Lorensen and Harvey\u00a0E. Cline. Marching cubes: A high resolution 3d surface construction algorithm. In Proceedings of the 14th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH \u201987, page 163\u2013169, New York, NY, USA, 1987. Association for Computing Machinery.","DOI":"10.1145\/37401.37422"},{"key":"9588_CR48","volume-title":"Advances in Neural Information Processing Systems","author":"Yi-Kai Liu","year":"2011","unstructured":"Yi-Kai Liu. Universal low-rank matrix recovery from pauli measurements. In J.\u00a0Shawe-Taylor, R.\u00a0Zemel, P.\u00a0Bartlett, F.\u00a0Pereira, and K.\u00a0Q. Weinberger, editors, Advances in Neural Information Processing Systems, volume\u00a024. Curran Associates, Inc., Red Hook, 2011."},{"key":"9588_CR49","unstructured":"John\u00a0A. Lee and Michel Verleysen. Nonlinear dimensionality reduction. Information Science and Statistics. Springer, New York, 2007."},{"issue":"1\u20133","key":"9588_CR50","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s00454-008-9053-2","volume":"39","author":"Partha Niyogi","year":"2008","unstructured":"Partha Niyogi, Stephen Smale, and Shmuel Weinberger. Finding the homology of submanifolds with high confidence from random samples. Discrete Comput. Geom., 39(1-3):419\u2013441, 2008.","journal-title":"Discrete Comput. Geom."},{"issue":"40","key":"9588_CR51","first-page":"1","volume":"23","author":"Nikita Puchkin","year":"2022","unstructured":"Nikita Puchkin and Vladimir Spokoiny. Structure-adaptive manifold estimation. Journal of Machine Learning Research, 23(40):1\u201362, 2022.","journal-title":"Journal of Machine Learning Research"},{"issue":"5500","key":"9588_CR52","doi-asserted-by":"publisher","first-page":"2323","DOI":"10.1126\/science.290.5500.2323","volume":"290","author":"Sam T Roweis","year":"2000","unstructured":"Sam\u00a0T. Roweis and Lawrence\u00a0K. Saul. Nonlinear dimensionality reduction by locally linear embedding. Science, 290(5500):2323\u20132326, 2000.","journal-title":"Science"},{"key":"9588_CR53","doi-asserted-by":"crossref","unstructured":"Ryan Rogers, Subbu Subramaniam, Sean Peng, David Durfee, Seunghyun Lee, Santosh\u00a0Kumar Kancha, Shraddha Sahay, and Parvez Ahammad. Linkedin\u2019s audience engagements API: A privacy preserving data analytics system at scale. CoRR, abs\/2002.05839, 2020.","DOI":"10.29012\/jpc.782"},{"issue":"2","key":"9588_CR54","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00037-008-0242-4","volume":"17","author":"Alexander A Sherstov","year":"2008","unstructured":"Alexander\u00a0A. Sherstov. Halfspace matrices. Comput. Complex., 17(2):149\u2013178, 2008.","journal-title":"Comput. Complex."},{"key":"9588_CR55","unstructured":"Jacob Steinhardt, Gregory Valiant, and Stefan Wager. Memory, communication, and statistical queries. In Vitaly Feldman, Alexander Rakhlin, and Ohad Shamir, editors, Proceedings of the 29th Conference on Learning Theory, COLT 2016, New York, USA, June 23-26, 2016, volume\u00a049 of JMLR Workshop and Conference Proceedings, pages 1490\u20131516. JMLR.org, 2016."},{"key":"9588_CR56","first-page":"682","volume-title":"Advances in Neural Information Processing Systems 10, [NIPS Conference, Denver, Colorado, USA, 1997]","author":"Joshua\u00a0B Tenenbaum","year":"1997","unstructured":"Joshua\u00a0B. Tenenbaum. Mapping a manifold of perceptual observations. In Michael\u00a0I. Jordan, Michael\u00a0J. Kearns, and Sara\u00a0A. Solla, editors, Advances in Neural Information Processing Systems 10, [NIPS Conference, Denver, Colorado, USA, 1997], pages 682\u2013688. The MIT Press, Cambridge, 1997."},{"issue":"11","key":"9588_CR57","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"Leslie G Valiant","year":"1984","unstructured":"Leslie\u00a0G. Valiant. A theory of the learnable. Commun. ACM, 27(11):1134\u20131142, 1984.","journal-title":"Commun. ACM"},{"key":"9588_CR58","first-page":"314","volume-title":"Proceedings of the Third Annual Workshop on Computational Learning Theory, COLT 1990, University of Rochester, Rochester, NY, USA, August 6-8, 1990","author":"Karsten\u00a0A Verbeurgt","year":"1990","unstructured":"Karsten\u00a0A. Verbeurgt. Learning DNF under the uniform distribution in quasi-polynomial time. In Mark\u00a0A. Fulk and John Case, editors, Proceedings of the Third Annual Workshop on Computational Learning Theory, COLT 1990, University of Rochester, Rochester, NY, USA, August 6-8, 1990, pages 314\u2013326. Morgan Kaufmann, Burlington, 1990."},{"key":"9588_CR59","unstructured":"Martin\u00a0J. Wainwright. Constrained forms of statistical minimax: computation, communication, and privacy. In Proceedings of the International Congress of Mathematicians\u2014Seoul 2014. Vol. IV, pages 273\u2013290. Kyung Moon Sa, Seoul, 2014."},{"issue":"309","key":"9588_CR60","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1080\/01621459.1965.10480775","volume":"60","author":"Stanley L Warner","year":"1965","unstructured":"Stanley\u00a0L. Warner. Randomized response: A survey technique for eliminating evasive answer bias. Journal of the American Statistical Association, 60(309):63\u201369, 1965.","journal-title":"Journal of the American Statistical Association"},{"key":"9588_CR61","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1146\/annurev-statistics-031017-100045","volume":"5","author":"Larry Wasserman","year":"2018","unstructured":"Larry Wasserman. Topological data analysis. Annu. Rev. Stat. Appl., 5:501\u2013535, 2018.","journal-title":"Annu. Rev. Stat. Appl."},{"key":"9588_CR62","doi-asserted-by":"crossref","unstructured":"Bin Yu. Assouad, fano, and le cam. In Festschrift for Lucien Le Cam, pages 423\u2013435. Springer, 1997.","DOI":"10.1007\/978-1-4612-1880-7_29"},{"issue":"2","key":"9588_CR63","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1093\/biomet\/asv008","volume":"102","author":"Y Yu","year":"2015","unstructured":"Y.\u00a0Yu, T.\u00a0Wang, and R.\u00a0J. Samworth. A useful variant of the Davis-Kahan theorem for statisticians. Biometrika, 102(2):315\u2013323, 2015.","journal-title":"Biometrika"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-022-09588-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10208-022-09588-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-022-09588-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,5]],"date-time":"2024-10-05T15:56:17Z","timestamp":1728143777000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10208-022-09588-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,11]]},"references-count":63,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["9588"],"URL":"https:\/\/doi.org\/10.1007\/s10208-022-09588-2","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"type":"print","value":"1615-3375"},{"type":"electronic","value":"1615-3383"}],"subject":[],"published":{"date-parts":[[2022,10,11]]},"assertion":[{"value":"4 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}