{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T15:18:45Z","timestamp":1780413525731,"version":"3.54.1"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T00:00:00Z","timestamp":1565308800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T00:00:00Z","timestamp":1565308800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000739","name":"University of Southampton","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000739","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s12532-019-00168-0","type":"journal-article","created":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T06:02:25Z","timestamp":1565330545000},"page":"337-387","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Robust Euclidean embedding via EDM optimization"],"prefix":"10.1007","volume":"12","author":[{"given":"Shenglong","family":"Zhou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Naihua","family":"Xiu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hou-Duo","family":"Qi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,8,9]]},"reference":[{"key":"168_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, A., Phillips, J.M., Venkatasubramanian, S.: Universal multi-dimensional scaling, In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1149\u20131158, ACM (2010)","DOI":"10.1145\/1835804.1835948"},{"key":"168_CR2","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/S1052623498342794","volume":"14","author":"LTH An","year":"2003","unstructured":"An, L.T.H., Tao, P.D.: Large-scale molecular optimization from distance matrices by a dc optimization approach. SIAM J. Optim. 14, 77\u2013114 (2003)","journal-title":"SIAM J. Optim."},{"key":"168_CR3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.dsp.2016.05.006","volume":"55","author":"S Bai","year":"2016","unstructured":"Bai, S., Qi, H.-D.: Tackling the flip ambiguity in wireless sensor network localization and beyond. Digit. Signal Process. 55, 85\u201397 (2016)","journal-title":"Digit. Signal Process."},{"key":"168_CR4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1093\/nar\/28.1.235","volume":"28","author":"HM Berman","year":"2000","unstructured":"Berman, H.M., Westbrook, J., Feng, Z., Gillilan, G., Bhat, T.N., Weissig, H., Shindyalov, I.N., Bourne, P.E.: The protein data bank. Nucleic Acids Res. 28, 235\u2013242 (2000)","journal-title":"Nucleic Acids Res."},{"key":"168_CR5","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1109\/TASE.2006.877401","volume":"3","author":"P Biswas","year":"2006","unstructured":"Biswas, P., Liang, T.-C., Toh, K.-C., Wang, T.-C., Ye, Y.: Semidefinite programming approaches for sensor network localization with noisy distance measurements. IEEE Trans. Auto. Sci. Eng. 3, 360\u2013371 (2006)","journal-title":"IEEE Trans. Auto. Sci. Eng."},{"key":"168_CR6","series-title":"Springer Series in Statistics","volume-title":"Modern Multidimensional Scaling: Theory and Applications","author":"I Borg","year":"2005","unstructured":"Borg, I., Groenen, P.J.F.: Modern Multidimensional Scaling: Theory and Applications. Springer Series in Statistics, 2nd edn. Springer, Berlin (2005)","edition":"2"},{"key":"168_CR7","volume-title":"The History of Mathematics","author":"DM Burton","year":"2011","unstructured":"Burton, D.M.: The History of Mathematics, 7th edn. MaGraw-Hill, New York City (2011)","edition":"7"},{"key":"168_CR8","doi-asserted-by":"crossref","unstructured":"Cayton, L., Dasgupta, S.: Robust Euclidean embedding. In: Proceedings of the 23rd International Conference on Machine Learning, Pittsburgh, PA, pp.\u00a0169\u2013176 (2006)","DOI":"10.1145\/1143844.1143866"},{"key":"168_CR9","doi-asserted-by":"crossref","first-page":"2053","DOI":"10.1007\/s11590-013-0701-y","volume":"8","author":"YQ Chen","year":"2014","unstructured":"Chen, Y.Q., Xiu, N.H., Peng, D.T.: Global solutions of non-Lipschitz $$S_{2}-S_{p}$$ minimization over the positive semidefinite cone. Optim. Lett. 8, 2053\u20132064 (2014)","journal-title":"Optim. Lett."},{"key":"168_CR10","volume-title":"Multidimensional Scaling","author":"TF Cox","year":"2001","unstructured":"Cox, T.F., Cox, M.A.A.: Multidimensional Scaling, 2nd edn. Chapman and Hall\/CRC, Boca Raton (2001)","edition":"2"},{"key":"168_CR11","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s10107-016-1090-7","volume":"164","author":"C Ding","year":"2017","unstructured":"Ding, C., Qi, H.-D.: Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction. Math. Program. 164, 341\u2013381 (2017)","journal-title":"Math. Program."},{"issue":"4","key":"168_CR12","doi-asserted-by":"crossref","first-page":"2301","DOI":"10.1137\/15M103710X","volume":"27","author":"D Drusvyatskiy","year":"2017","unstructured":"Drusvyatskiy, D., Krislock, N., Voronin, Y.L., Wolkowicz, H.: Noisy Euclidean distance realization: robust facial reduction and the Pareto frontier. SIAM J. Optim. 27(4), 2301\u20132331 (2017)","journal-title":"SIAM J. Optim."},{"key":"168_CR13","first-page":"133","volume-title":"Recent Developments in Statistics","author":"J de Leeuw","year":"1977","unstructured":"de Leeuw, J.: Applications of Convex analysis to multidimensional scaling. In: Barra, J., Brodeau, F., Romier, G., van Cutsem, B. (eds.) Recent Developments in Statistics, pp. 133\u2013145. North Holland Publishing Company, Amsterdam, The Netherlands (1977)"},{"key":"168_CR14","first-page":"1","volume":"31","author":"J de Leeuw","year":"2009","unstructured":"de Leeuw, J., Mair, P.: Multidimensional scaling using majorization: Smacof in R. J. Stat. Softw. 31, 1\u201330 (2009)","journal-title":"J. Stat. Softw."},{"key":"168_CR15","doi-asserted-by":"crossref","unstructured":"Biswas, P., Ye, Y.: Semidefinite programming for ad hoc wireless sensor network localization. In: Proceedings of the 3rd IPSN, pp. 46\u201354. Berkeley, CA (2004)","DOI":"10.1145\/984622.984630"},{"key":"168_CR16","doi-asserted-by":"crossref","first-page":"2301","DOI":"10.1137\/15M103710X","volume":"27","author":"D Drusvyatskiy","year":"2017","unstructured":"Drusvyatskiy, D., Krislock, N., Voronin, Y.-L., Wolkowicz, H.: Noisy Euclidean distance realization: robust facial reduction and the Pareto frontier. SIAM J. Optim. 27, 2301\u20132331 (2017)","journal-title":"SIAM J. Optim."},{"key":"168_CR17","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TSMCC.2010.2078502","volume":"41","author":"SL France","year":"2011","unstructured":"France, S.L., Carroll, J.D.: Two-way multidimensional scaling: a review. IEEE Trans. Syst. Man Cyber. Part C 41, 644\u2013661 (2011)","journal-title":"IEEE Trans. Syst. Man Cyber. Part C"},{"key":"168_CR18","unstructured":"Gao, Y.: Structured Low Rank Matrix Optimization Problems: a Penalty Approach, PhD Thesis, National University of Singapore (2010)"},{"key":"168_CR19","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF02614077","volume":"36","author":"N Gaffke","year":"1989","unstructured":"Gaffke, N., Mathar, R.: A cyclic projection algorithm via duality. Metrika 36, 29\u201354 (1989)","journal-title":"Metrika"},{"key":"168_CR20","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1137\/0611042","volume":"11","author":"W Glunt","year":"1990","unstructured":"Glunt, W., Hayden, T.L., Hong, S., Wells, J.: An alternating projection algorithm for computing the nearest Euclidean distance matrix. SIAM J. Matrix Anal. Appl. 11, 589\u2013600 (1990)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"168_CR21","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1002\/jcc.540140115","volume":"14","author":"W Glunt","year":"1993","unstructured":"Glunt, W., Hayden, T.L., Raydan, R.: Molecular conformations from distance matrices. J. Comput. Chem. 14, 114\u2013120 (1993)","journal-title":"J. Comput. Chem."},{"issue":"1966","key":"168_CR22","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1093\/biomet\/53.3-4.325","volume":"53","author":"JC Gower","year":"1966","unstructured":"Gower, J.C.: Some distance properties of latent root and vector methods used in multivariate analysis. Biometrika 53(1966), 325\u2013338 (1966)","journal-title":"Biometrika"},{"key":"168_CR23","unstructured":"Heiser, W.J.: Multidimensional scaling with least absolute residuals. In: Proceedings of the First Conference of the International Federation of Classification Societies (IFCS), pp. 455\u2013462. Germany, Aachen (1987)"},{"key":"168_CR24","first-page":"133","volume-title":"Solving Nuclear Norm Regularized and Semidefinite Matrix Least Squares Problems with Linear Equality Constraints, Discrete Geometry and Optimization","author":"KF Jiang","year":"2013","unstructured":"Jiang, K.F., Sun, D.F., Toh, K.C.: Solving Nuclear Norm Regularized and Semidefinite Matrix Least Squares Problems with Linear Equality Constraints, Discrete Geometry and Optimization, pp. 133\u2013162. Springer International Publishing, Berlin (2013)"},{"key":"168_CR25","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s12532-014-0069-8","volume":"6","author":"KF Jiang","year":"2014","unstructured":"Jiang, K.F., Sun, D.F., Toh, K.-C.: A partial proximal point algorithm for nuclear norm regularized matrix least squares problems. Math. Progr. omput. 6, 281\u2013325 (2014)","journal-title":"Math. Progr. omput."},{"key":"168_CR26","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s101070050047","volume":"85","author":"C Kanzow","year":"1999","unstructured":"Kanzow, C., Qi, H.-D.: A QP-free constrained Newton-type method for variational inequality problems. Math. Progr. 85, 81\u2013106 (1999)","journal-title":"Math. Progr."},{"issue":"4","key":"168_CR27","first-page":"27:1","volume":"38","author":"S Kim","year":"2012","unstructured":"Kim, S., Kojima, M., Waki, H., Yamashita, M.: Algorithm 920: SFSDP: a sparse version of full semidefinite programming relaxation for sensor network localization problems. ACM Trans. Math. Softw. 38(4), 27:1\u201327:19 (2012)","journal-title":"ACM Trans. Math. Softw."},{"key":"168_CR28","doi-asserted-by":"crossref","unstructured":"Korkmaz, S., Van der Veen, A.J.: Robust localization in sensor networks with iterative majorization techniques. ICASSP 2049\u20132052 (2009)","DOI":"10.1109\/ICASSP.2009.4960017"},{"key":"168_CR29","doi-asserted-by":"crossref","unstructured":"Kovnatsky, A., Glashoff, K., Bronstein M.M.: MADMM: a generic algorithm for non-smooth optimization on manifolds. In: European Conference on Computer Vision, Springer, Cham., pp. 680\u2013696 (2016)","DOI":"10.1007\/978-3-319-46454-1_41"},{"key":"168_CR30","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF02289694","volume":"29","author":"JB Kruskal","year":"1964","unstructured":"Kruskal, J.B.: Nonmetric multidimensional scaling: a numerical method. Psychometrika 29, 115\u2013129 (1964)","journal-title":"Psychometrika"},{"key":"168_CR31","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1109\/TSP.2016.2625265","volume":"65","author":"FD Mandanas","year":"2017","unstructured":"Mandanas, F.D., Kotropoulos, C.L.: Robust multidimensional scaling using a maximum correntropy criterion. IEEE Trans. Signal Process. 65, 919\u2013932 (2017)","journal-title":"IEEE Trans. Signal Process."},{"key":"168_CR32","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF01893414","volume":"2","author":"CA Micchelli","year":"1986","unstructured":"Micchelli, C.A.: Interpolation of scattered data: distance matrices and conditionally positive definite functinos. Constr. Approx. 2, 11\u201322 (1986)","journal-title":"Constr. Approx."},{"key":"168_CR33","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1137\/S1052623495283024","volume":"7","author":"JJ More","year":"1997","unstructured":"More, J.J., Wu, Z.: Global continuation for distance geometry problems. SIAM J. Optim. 7, 814\u2013836 (1997)","journal-title":"SIAM J. Optim."},{"key":"168_CR34","volume-title":"Numerical Optimization","author":"G Nocedal","year":"2006","unstructured":"Nocedal, G., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, Berlin (2006)","edition":"2"},{"key":"168_CR35","doi-asserted-by":"crossref","first-page":"3930","DOI":"10.1109\/TSP.2011.2153848","volume":"59","author":"P O\u011fuz-Ekim","year":"2011","unstructured":"O\u011fuz-Ekim, P., Gomes, J.P., Xavier, J., Oliveira, P.: Robust localization of nodes and time-recursive tracking in sensor networks using noisy range measurements. IEEE Trans. Signal Process. 59, 3930\u20133942 (2011)","journal-title":"IEEE Trans. Signal Process."},{"key":"168_CR36","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/s10589-017-9898-5","volume":"67","author":"DT Peng","year":"2017","unstructured":"Peng, D.T., Xiu, N.H., Yu, J.: $$S_{1\/2}$$ regularization methods and fixed point algorithms for affine rank minimization problems. Comput. Optim. Appl. 67, 543\u2013569 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"168_CR37","doi-asserted-by":"publisher","unstructured":"Piovesan, N., Erseghe, T.: Cooperative localization in WSNs: a hybrid convex\/non-convex solution. IEEE Trans. Signal and Information Processing over Networks. \nhttps:\/\/doi.org\/10.1109\/TSIPN.2016.2639442\n\n. (IEEE early access article, 2016)","DOI":"10.1109\/TSIPN.2016.2639442"},{"key":"168_CR38","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10589-011-9447-6","volume":"53","author":"TK Pong","year":"2012","unstructured":"Pong, T.K.: Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints. Comput. Optim. Appl. 53, 23\u201344 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"168_CR39","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1137\/110849523","volume":"34","author":"H-D Qi","year":"2013","unstructured":"Qi, H.-D.: A semismooth Newton method for the nearest Euclidean distance matrix problem. SIAM J. Matrix Anal. Appl. 34, 67\u201393 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"168_CR40","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10107-013-0726-0","volume":"147","author":"H-D Qi","year":"2014","unstructured":"Qi, H.-D., Yuan, X.M.: Computing the nearest Euclidean distance matrix with low embedding dimensions. Math. Progr. 147, 351\u2013389 (2014)","journal-title":"Math. Progr."},{"key":"168_CR41","doi-asserted-by":"crossref","first-page":"3815","DOI":"10.1109\/TSP.2013.2264814","volume":"61","author":"H-D Qi","year":"2013","unstructured":"Qi, H.-D., Xiu, N.H., Yuan, X.M.: A Lagrangian dual approach to the single source localization problem. IEEE Trans. Signal Process. 61, 3815\u20133826 (2013)","journal-title":"IEEE Trans. Signal Process."},{"key":"168_CR42","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis, 3rd edn. Springer, Berlin (2009)","edition":"3"},{"key":"168_CR43","doi-asserted-by":"crossref","first-page":"724","DOI":"10.2307\/1968654","volume":"36","author":"IJ Schoenberg","year":"1935","unstructured":"Schoenberg, I.J.: Remarks to Maurice Frechet\u2019s article Sur la definition axiomatque d\u2019une classe d\u2019espaces vectoriels distancies applicbles vectoriellement sur l\u2019espace de Hilbet. Ann. Math. 36, 724\u2013732 (1935)","journal-title":"Ann. Math."},{"key":"168_CR44","doi-asserted-by":"crossref","unstructured":"Shang, Y., Ruml, W., Zhang, Y., Fromherz, M.P.J.: Localization from mere connectivity. In: Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking & Computing, MobiHoc 03, ACM, New York, NY, USA, pp.\u00a0201\u2013212 (2003)","DOI":"10.1145\/778415.778439"},{"issue":"17","key":"168_CR45","doi-asserted-by":"crossref","first-page":"4532","DOI":"10.1109\/TSP.2015.2454853","volume":"63","author":"C Soares","year":"2015","unstructured":"Soares, C., Xavier, J., Gomes, J.: Simple and fast convex relaxation method for cooperative localization in sensor networks using range measurements. IEEE Trans. Signal Process. 63(17), 4532\u20134543 (2015)","journal-title":"IEEE Trans. Signal Process."},{"key":"168_CR46","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1109\/TSP.2016.2601299","volume":"65","author":"Y Sun","year":"2017","unstructured":"Sun, Y., Babu, P., Palomar, D.P.: Majorization-minimization algorithms in signal processing, communications, and machine learning. IEEE Trans. Signal Process. 65, 794\u2013816 (2017)","journal-title":"IEEE Trans. Signal Process."},{"key":"168_CR47","doi-asserted-by":"crossref","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","volume":"290","author":"JB Tenenbaum","year":"2000","unstructured":"Tenenbaum, J.B., de Silva, V., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290, 2319\u20132323 (2000)","journal-title":"Science"},{"key":"168_CR48","first-page":"221","volume":"112","author":"KC Toh","year":"2008","unstructured":"Toh, K.C.: An inexact path-following algorithm for convex quadratic SDP. Math. Progr. 112, 221\u2013254 (2008)","journal-title":"Math. Progr."},{"key":"168_CR49","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF02288916","volume":"17","author":"WS Torgerson","year":"1952","unstructured":"Torgerson, W.S.: Multidimensional scaling: I. Theory and method. Psychometrika 17, 401\u2013419 (1952)","journal-title":"Psychometrika"},{"key":"168_CR50","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1137\/060669395","volume":"19","author":"Z Wang","year":"2008","unstructured":"Wang, Z., Zheng, S., Ye, Y., Boyd, S.: Further relaxations of the semidefinite pro-gramming approach to sensor network localization. SIAM J. Optim. 19, 655\u2013673 (2008)","journal-title":"SIAM J. Optim."},{"key":"168_CR51","first-page":"207","volume":"12","author":"FC Xing","year":"2003","unstructured":"Xing, F.C.: Investigation on solutions of cubic equations with one unknown. J. Central Univ. Nat. (Natural Sci. Ed.) 12, 207\u2013218 (2003)","journal-title":"J. Central Univ. Nat. (Natural Sci. Ed.)"},{"key":"168_CR52","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1109\/TNNLS.2012.2197412","volume":"23","author":"Z Xu","year":"2012","unstructured":"Xu, Z., Chang, X., Xu, F., Zhang, H.: $$\\text{ L }_{1\/2}$$ regularization: a thresholding representation theory and a fast solver. IEEE Trans. Neural Netw. Learn. Sys. 23, 1013\u20131027 (2012)","journal-title":"IEEE Trans. Neural Netw. Learn. Sys."},{"key":"168_CR53","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF02287916","volume":"3","author":"G Young","year":"1938","unstructured":"Young, G., Householder, A.S.: Discussion of a set of points in terms of their mutual distances. Psychometrika 3, 19\u201322 (1938)","journal-title":"Psychometrika"},{"key":"168_CR54","first-page":"35:1","volume":"6","author":"L Zhang","year":"2010","unstructured":"Zhang, L., Liu, L., Gotsman, C., Gortler, S.J.: An as-rigid-as-possible approach to sensor network localization. ACM Trans. Sen. Netw. 6, 35:1\u201335:21 (2010)","journal-title":"ACM Trans. Sen. Netw."},{"key":"168_CR55","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1111\/rssb.12138","volume":"78","author":"L Zhang","year":"2016","unstructured":"Zhang, L., Wahba, G., Yuan, M.: Distance shrinkage and Euclidean embedding via regularized kernel estimation. J. R. Stat. Soc.: Ser. B 78, 849\u2013867 (2016)","journal-title":"J. R. Stat. Soc.: Ser. B"},{"key":"168_CR56","doi-asserted-by":"crossref","first-page":"4331","DOI":"10.1109\/TSP.2018.2849734","volume":"66","author":"SL Zhou","year":"2018","unstructured":"Zhou, S.L., Xiu, N.H., Qi, H.D.: A fast matrix majorization-projection method for penalized stress minimization with box constraints. IEEE Trans. Signal Process. 66, 4331\u20134346 (2018)","journal-title":"IEEE Trans. Signal Process."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-019-00168-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-019-00168-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-019-00168-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,7]],"date-time":"2020-08-07T23:11:05Z","timestamp":1596841865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-019-00168-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,9]]},"references-count":56,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["168"],"URL":"https:\/\/doi.org\/10.1007\/s12532-019-00168-0","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,9]]},"assertion":[{"value":"21 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}