{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T14:29:36Z","timestamp":1771338576267,"version":"3.50.1"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2015,8,18]],"date-time":"2015-08-18T00:00:00Z","timestamp":1439856000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s10208-015-9280-x","type":"journal-article","created":{"date-parts":[[2015,8,17]],"date-time":"2015-08-17T12:21:48Z","timestamp":1439814108000},"page":"1367-1396","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["Dimensionality Reduction with Subgaussian Matrices: A Unified Theory"],"prefix":"10.1007","volume":"16","author":[{"given":"Sjoerd","family":"Dirksen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,18]]},"reference":[{"issue":"4","key":"9280_CR1","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1016\/S0022-0000(03)00025-4","volume":"66","author":"D Achlioptas","year":"2003","unstructured":"D.\u00a0Achlioptas. Database-friendly random projections: Johnson-Lindenstrauss with binary coins. J. Comput. System Sci., 66(4):671\u2013687, 2003.","journal-title":"J. Comput. System Sci."},{"issue":"13\u201314","key":"9280_CR2","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1016\/j.crma.2011.06.025","volume":"349","author":"R Adamczak","year":"2011","unstructured":"R.\u00a0Adamczak, R.\u00a0Lata\u0142a, A.\u00a0Litvak, A.\u00a0Pajor, and N.\u00a0Tomczak-Jaegermann. Geometry of log-concave ensembles of random matrices and approximate reconstruction. C. R. Math. Acad. Sci. Paris, 349(13-14):783\u2013786, 2011.","journal-title":"C. R. Math. Acad. Sci. Paris"},{"issue":"2","key":"9280_CR3","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1137\/110830046","volume":"42","author":"P Agarwal","year":"2013","unstructured":"P.\u00a0Agarwal, S.\u00a0Har-Peled, and H.\u00a0Yu. Embeddings of surfaces, curves, and moving points in Euclidean space. SIAM J. Comput., 42(2):442\u2013458, 2013.","journal-title":"SIAM J. Comput."},{"issue":"1\u20133","key":"9280_CR4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0012-365X(03)00227-9","volume":"273","author":"N Alon","year":"2003","unstructured":"N.\u00a0Alon. Problems and results in extremal combinatorics. I. Discrete Math., 273(1-3):31\u201353, 2003.","journal-title":"I. Discrete Math."},{"issue":"3","key":"9280_CR5","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s00365-007-9003-x","volume":"28","author":"R Baraniuk","year":"2008","unstructured":"R.\u00a0Baraniuk, M.\u00a0Davenport, R.\u00a0DeVore, and M.\u00a0Wakin. A simple proof of the restricted isometry property for random matrices. Constr. Approx., 28(3):253\u2013263, 2008.","journal-title":"Constr. Approx."},{"issue":"1","key":"9280_CR6","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s10208-007-9011-z","volume":"9","author":"R Baraniuk","year":"2009","unstructured":"R.\u00a0Baraniuk and M.\u00a0Wakin. Random projections of smooth manifolds. Found. Comput. Math., 9(1):51\u201377, 2009.","journal-title":"Found. Comput. Math."},{"issue":"2","key":"9280_CR7","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1109\/TIT.2007.913516","volume":"54","author":"G Biau","year":"2008","unstructured":"G.\u00a0Biau, L.\u00a0Devroye, and G.\u00a0Lugosi. On the performance of clustering in Hilbert spaces. IEEE Trans. Inform. Theory, 54(2):781\u2013790, 2008.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9280_CR8","doi-asserted-by":"crossref","unstructured":"E.\u00a0Bingham and H.\u00a0Mannila. Random projection in dimensionality reduction: applications to image and text data. In Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, pages 245\u2013250. ACM, 2001.","DOI":"10.1145\/502512.502546"},{"issue":"7","key":"9280_CR9","doi-asserted-by":"crossref","first-page":"4660","DOI":"10.1109\/TIT.2011.2146550","volume":"57","author":"T Blumensath","year":"2011","unstructured":"T.\u00a0Blumensath. Sampling and reconstructing signals from a union of linear subspaces. IEEE Trans. Inform. Theory, 57(7):4660\u20134671, 2011.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"9280_CR10","doi-asserted-by":"crossref","first-page":"1872","DOI":"10.1109\/TIT.2009.2013003","volume":"55","author":"T Blumensath","year":"2009","unstructured":"T.\u00a0Blumensath and M.\u00a0Davies. Sampling theorems for signals from the union of finite-dimensional linear subspaces. IEEE Trans. Inform. Theory, 55(4):1872\u20131882, 2009.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"9280_CR11","doi-asserted-by":"crossref","first-page":"2342","DOI":"10.1109\/TIT.2011.2111771","volume":"57","author":"E Cand\u00e8s","year":"2011","unstructured":"E.\u00a0Cand\u00e8s and Y.\u00a0Plan. Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements. IEEE Trans. Inform. Theory, 57(4):2342\u20132359, 2011.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"12","key":"9280_CR12","doi-asserted-by":"crossref","first-page":"5406","DOI":"10.1109\/TIT.2006.885507","volume":"52","author":"E Cand\u00e8s","year":"2006","unstructured":"E.\u00a0Cand\u00e8s and T.\u00a0Tao. Near-optimal signal recovery from random projections: universal encoding strategies? IEEE Trans. Inform. Theory, 52(12):5406\u20135425, 2006.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9280_CR13","doi-asserted-by":"crossref","unstructured":"K.\u00a0Clarkson. Tighter bounds for random projections of manifolds. In Proceedings of the twenty-fourth annual symposium on Computational geometry, pages 39\u201348. ACM, 2008.","DOI":"10.1145\/1377676.1377685"},{"key":"9280_CR14","doi-asserted-by":"crossref","unstructured":"S.\u00a0Dasgupta. Learning mixtures of Gaussians. In 40th Annual Symposium on Foundations of Computer Science (New York, 1999), pages 634\u2013644. IEEE Computer Soc., Los Alamitos, CA, 1999.","DOI":"10.1109\/SFFCS.1999.814639"},{"issue":"1","key":"9280_CR15","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1002\/rsa.10073","volume":"22","author":"S Dasgupta","year":"2003","unstructured":"S.\u00a0Dasgupta and A.\u00a0Gupta. An elementary proof of a theorem of Johnson and Lindenstrauss. Random Structures Algorithms, 22(1):60\u201365, 2003.","journal-title":"Random Structures Algorithms"},{"issue":"53","key":"9280_CR16","first-page":"1","volume":"20","author":"S Dirksen","year":"2015","unstructured":"S.\u00a0Dirksen. Tail bounds via generic chaining. Electron. J. Probab., 20:no. 53, 1\u201329, 2015.","journal-title":"Electron. J. Probab."},{"issue":"4","key":"9280_CR17","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"D Donoho","year":"2006","unstructured":"D.\u00a0Donoho. Compressed sensing. IEEE Trans. Inform. Theory, 52(4):1289\u20131306, 2006.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"9280_CR18","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s00211-010-0331-6","volume":"117","author":"P Drineas","year":"2011","unstructured":"P.\u00a0Drineas, M.\u00a0Mahoney, S.\u00a0Muthukrishnan, and T.\u00a0Sarl\u00f3s. Faster least squares approximation. Numer. Math., 117(2):219\u2013249, 2011.","journal-title":"Numer. Math."},{"issue":"1","key":"9280_CR19","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.acha.2014.08.005","volume":"39","author":"A Eftekhari","year":"2015","unstructured":"A.\u00a0Eftekhari and M.\u00a0Wakin. New analysis of manifold embeddings and signal recovery from compressive measurements. Applied and Computational Harmonic Analysis, 39(1):67 \u2013 109, 2015.","journal-title":"Applied and Computational Harmonic Analysis"},{"issue":"11","key":"9280_CR20","doi-asserted-by":"crossref","first-page":"5302","DOI":"10.1109\/TIT.2009.2030471","volume":"55","author":"Y Eldar","year":"2009","unstructured":"Y.\u00a0Eldar and M.\u00a0Mishali. Robust recovery of signals from a structured union of subspaces. IEEE Trans. Inform. Theory, 55(11):5302\u20135316, 2009.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9280_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-8176-4948-7","volume-title":"A Mathematical Introduction to Compressive Sensing","author":"S Foucart","year":"2013","unstructured":"S.\u00a0Foucart and H.\u00a0Rauhut. A Mathematical Introduction to Compressive Sensing. Birkha\u00fcser, Boston, 2013."},{"issue":"3","key":"9280_CR22","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0095-8956(88)90043-3","volume":"44","author":"P Frankl","year":"1988","unstructured":"P.\u00a0Frankl and H.\u00a0Maehara. The Johnson-Lindenstrauss lemma and the sphericity of some graphs. J. Combin. Theory Ser. B, 44(3):355\u2013362, 1988.","journal-title":"J. Combin. Theory Ser. B"},{"key":"9280_CR23","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.laa.2013.03.004","volume":"441","author":"R Giryes","year":"2014","unstructured":"R.\u00a0Giryes, S.\u00a0Nam, M.\u00a0Elad, R.\u00a0Gribonval, and M.\u00a0E. Davies. Greedy-like algorithms for the cosparse analysis model. Linear Algebra Appl., 441:22\u201360, 2014.","journal-title":"Linear Algebra Appl."},{"key":"9280_CR24","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Gordon. On Milman\u2019s inequality and random subspaces which escape through a mesh in $${\\bf R}^n$$ R n . In Geometric aspects of functional analysis (1986\/87), volume 1317 of Lecture Notes in Math., pages 84\u2013106. Springer, Berlin, 1988.","DOI":"10.1007\/BFb0081737"},{"key":"9280_CR25","unstructured":"C.\u00a0Hegde, M.\u00a0Wakin, and R.\u00a0Baraniuk. Random projections for manifold learning. In Advances in neural information processing systems, pages 641\u2013648, 2007."},{"key":"9280_CR26","doi-asserted-by":"crossref","unstructured":"P.\u00a0Indyk and R.\u00a0Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC \u201998, pages 604\u2013613, New York, NY, USA, 1998. ACM.","DOI":"10.1145\/276698.276876"},{"issue":"3","key":"9280_CR27","doi-asserted-by":"crossref","first-page":"Art. 31, 12","DOI":"10.1145\/1273340.1273347","volume":"3","author":"P Indyk","year":"2007","unstructured":"P.\u00a0Indyk and A.\u00a0Naor. Nearest-neighbor-preserving embeddings. ACM Trans. Algorithms, 3(3):Art. 31, 12, 2007.","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"9280_CR28","doi-asserted-by":"crossref","first-page":"Art. 26, 17","DOI":"10.1145\/2483699.2483706","volume":"9","author":"T Jayram","year":"2013","unstructured":"T.\u00a0Jayram and D.\u00a0Woodruff. Optimal bounds for Johnson-Lindenstrauss transforms and streaming problems with subconstant error. ACM Trans. Algorithms, 9(3):Art. 26, 17, 2013.","journal-title":"ACM Trans. Algorithms"},{"key":"9280_CR29","doi-asserted-by":"crossref","unstructured":"W.\u00a0Johnson and J.\u00a0Lindenstrauss. Extensions of Lipschitz mappings into a Hilbert space. In Conference in modern analysis and probability (New Haven, Conn., 1982), volume\u00a026 of Contemp. Math., pages 189\u2013206. Amer. Math. Soc., Providence, RI, 1984.","DOI":"10.1090\/conm\/026\/737400"},{"issue":"2","key":"9280_CR30","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/2076450.2076474","volume":"55","author":"A Kalai","year":"2012","unstructured":"A.\u00a0Kalai, A.\u00a0Moitra, and G.\u00a0Valiant. Disentangling gaussians. Commun. ACM, 55(2):113\u2013120, February 2012.","journal-title":"Commun. ACM"},{"issue":"1","key":"9280_CR31","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.jfa.2004.10.009","volume":"225","author":"B Klartag","year":"2005","unstructured":"B.\u00a0Klartag and S.\u00a0Mendelson. Empirical processes and random projections. J. Funct. Anal., 225(1):229\u2013245, 2005.","journal-title":"J. Funct. Anal."},{"key":"9280_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-22147-7","volume-title":"Oracle Inequalities in Empirical Risk Minimization and Sparse Recovery Problems","author":"V Koltchinskii","year":"2011","unstructured":"V.\u00a0Koltchinskii. Oracle Inequalities in Empirical Risk Minimization and Sparse Recovery Problems. Springer, Berlin, 2011."},{"key":"9280_CR33","unstructured":"K.\u00a0Larsen and J.\u00a0Nelson. The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction. ArXiv:1411.2404 , 2014."},{"key":"9280_CR34","unstructured":"G.\u00a0Lecu\u00e9 and S.\u00a0Mendelson. Sparse recovery under weak moment assumptions. ArXiv:1401.2188 , 2014."},{"key":"9280_CR35","doi-asserted-by":"crossref","DOI":"10.1007\/b98852","volume-title":"Riemannian manifolds","author":"J Lee","year":"1997","unstructured":"J.\u00a0Lee. Riemannian manifolds. Springer-Verlag, New York, 1997."},{"issue":"6","key":"9280_CR36","doi-asserted-by":"crossref","first-page":"2334","DOI":"10.1109\/TSP.2007.914346","volume":"56","author":"Y Lu","year":"2008","unstructured":"Y.\u00a0Lu and M.\u00a0Do. A theory for sampling signals from a union of subspaces. IEEE Trans. Signal Process., 56(6):2334\u20132345, 2008.","journal-title":"IEEE Trans. Signal Process."},{"key":"9280_CR37","first-page":"2735","volume":"13","author":"O Maillard","year":"2012","unstructured":"O.\u00a0Maillard and R.\u00a0Munos. Linear regression with random projections. J. Mach. Learn. Res., 13:2735\u20132772, 2012.","journal-title":"J. Mach. Learn. Res."},{"key":"9280_CR38","unstructured":"W.\u00a0Mantzel. Parametric estimation of randomly compressed functions. PhD. Thesis, Georgia Institute of Technology, 2013."},{"issue":"2","key":"9280_CR39","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1093\/imaiai\/iav008","volume":"4","author":"W Mantzel","year":"2015","unstructured":"W.\u00a0Mantzel and J.\u00a0Romberg. Compressed subspace matching on the continuum. Information and Inference, 4(2):79\u2013107, 2015.","journal-title":"Information and Inference"},{"key":"9280_CR40","doi-asserted-by":"crossref","unstructured":"W.\u00a0Mantzel, J.\u00a0Romberg, and K.\u00a0Sabra. Compressive matched-field processing. The Journal of the Acoustical Society of America, 132(1), 2012.","DOI":"10.1121\/1.4728224"},{"issue":"2","key":"9280_CR41","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1002\/rsa.20218","volume":"33","author":"J Matou\u0161ek","year":"2008","unstructured":"J.\u00a0Matou\u0161ek. On variants of the Johnson-Lindenstrauss lemma. Random Structures Algorithms, 33(2):142\u2013156, 2008.","journal-title":"Random Structures Algorithms"},{"issue":"4","key":"9280_CR42","doi-asserted-by":"crossref","first-page":"1248","DOI":"10.1007\/s00039-007-0618-7","volume":"17","author":"S Mendelson","year":"2007","unstructured":"S.\u00a0Mendelson, A.\u00a0Pajor, and N.\u00a0Tomczak-Jaegermann. Reconstruction and subgaussian operators in asymptotic geometric analysis. Geom. Funct. Anal., 17(4):1248\u20131282, 2007.","journal-title":"Geom. Funct. Anal."},{"issue":"3","key":"9280_CR43","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s00365-007-9005-8","volume":"28","author":"S Mendelson","year":"2008","unstructured":"S.\u00a0Mendelson, A.\u00a0Pajor, and N.\u00a0Tomczak-Jaegermann. Uniform uncertainty principle for Bernoulli and subgaussian ensembles. Constr. Approx., 28(3):277\u2013289, 2008.","journal-title":"Constr. Approx."},{"issue":"1","key":"9280_CR44","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.acha.2012.03.006","volume":"34","author":"S Nam","year":"2013","unstructured":"S.\u00a0Nam, M.\u00a0Davies, M.\u00a0Elad, and R.\u00a0Gribonval. The cosparse analysis model and algorithms. Appl. Comput. Harmon. Anal., 34(1):30\u201356, 2013.","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"1\u20133","key":"9280_CR45","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/s00454-008-9053-2","volume":"39","author":"P Niyogi","year":"2008","unstructured":"P.\u00a0Niyogi, S.\u00a0Smale, and S.\u00a0Weinberger. 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":"8","key":"9280_CR46","doi-asserted-by":"crossref","first-page":"3990","DOI":"10.1109\/TSP.2010.2049997","volume":"58","author":"M Raginsky","year":"2010","unstructured":"M.\u00a0Raginsky, R.\u00a0Willett, Z.\u00a0Harmany, and R.\u00a0Marcia. Compressed sensing performance bounds under Poisson noise. IEEE Trans. Signal Process., 58(8):3990\u20134002, 2010.","journal-title":"IEEE Trans. Signal Process."},{"key":"9280_CR47","unstructured":"H.\u00a0Rauhut, R.\u00a0Schneider, and Z.\u00a0Stojanac. Low rank tensor recovery via iterative hard thresholding. In Proc. 10th International Conference on Sampling Theory and Applications, 2013."},{"issue":"3","key":"9280_CR48","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"B.\u00a0Recht, M.\u00a0Fazel, and P.\u00a0Parrilo. Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev., 52(3):471\u2013501, 2010.","journal-title":"SIAM Rev."},{"key":"9280_CR49","doi-asserted-by":"crossref","unstructured":"T.\u00a0Sarlos. Improved approximation algorithms for large matrices via random projections. In Foundations of Computer Science, 2006. FOCS \u201906. 47th Annual IEEE Symposium on, pages 143\u2013152, Oct 2006.","DOI":"10.1109\/FOCS.2006.37"},{"key":"9280_CR50","doi-asserted-by":"crossref","unstructured":"L.\u00a0Schulman. Clustering for edge-cost minimization. In Proceedings of the Thirty-second Annual ACM Symposium on Theory of Computing, STOC \u201900, pages 547\u2013555, New York, NY, USA, 2000. ACM.","DOI":"10.1145\/335305.335373"},{"key":"9280_CR51","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1137\/1015095","volume":"15","author":"G Stewart","year":"1973","unstructured":"G.\u00a0Stewart. Error and perturbation bounds for subspaces associated with certain eigenvalue problems. SIAM Rev., 15:727\u2013764, 1973.","journal-title":"SIAM Rev."},{"issue":"1\u20132","key":"9280_CR52","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF02392556","volume":"159","author":"M Talagrand","year":"1987","unstructured":"M.\u00a0Talagrand. Regularity of Gaussian processes. Acta Math., 159(1-2):99\u2013149, 1987.","journal-title":"Acta Math."},{"issue":"1","key":"9280_CR53","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1214\/aop\/1008956336","volume":"29","author":"M Talagrand","year":"2001","unstructured":"M.\u00a0Talagrand. Majorizing measures without measures. Ann. Probab., 29(1):411\u2013417, 2001.","journal-title":"Ann. Probab."},{"key":"9280_CR54","volume-title":"The generic chaining","author":"M Talagrand","year":"2005","unstructured":"M.\u00a0Talagrand. The generic chaining. Springer-Verlag, Berlin, 2005."},{"key":"9280_CR55","doi-asserted-by":"crossref","unstructured":"S.\u00a0Vempala. The random projection method. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 65. American Mathematical Society, Providence, RI, 2004.","DOI":"10.1090\/dimacs\/065"},{"key":"9280_CR56","first-page":"2415","volume":"14","author":"N Verma","year":"2013","unstructured":"N.\u00a0Verma. Distance preserving embeddings for general $$n$$ n -dimensional manifolds. J. Mach. Learn. Res., 14:2415\u20132448, 2013.","journal-title":"J. Mach. Learn. Res."}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-015-9280-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-015-9280-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-015-9280-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-015-9280-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T09:07:34Z","timestamp":1567069654000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-015-9280-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,18]]},"references-count":56,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["9280"],"URL":"https:\/\/doi.org\/10.1007\/s10208-015-9280-x","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,18]]}}}