{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:26:04Z","timestamp":1772295964902,"version":"3.50.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T00:00:00Z","timestamp":1547683200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"CNRS MASTODONS","award":["2016TABASCO"],"award-info":[{"award-number":["2016TABASCO"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s10589-019-00060-6","type":"journal-article","created":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T06:58:42Z","timestamp":1547708322000},"page":"707-726","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["A random block-coordinate Douglas\u2013Rachford splitting method with low computational complexity for binary logistic regression"],"prefix":"10.1007","volume":"72","author":[{"given":"Luis M.","family":"Brice\u00f1o-Arias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5899-689X","authenticated-orcid":false,"given":"Giovanni","family":"Chierchia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emilie","family":"Chouzenoux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Christophe","family":"Pesquet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,17]]},"reference":[{"issue":"5","key":"60_CR1","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1162\/089976604773135104","volume":"16","author":"L Rosasco","year":"2004","unstructured":"Rosasco, L., De Vito, E., Caponnetto, A., Piana, M., Verri, A.: Are loss functions all the same? Neural Comput. 16(5), 1063\u20131076 (2004)","journal-title":"Neural Comput."},{"issue":"473","key":"60_CR2","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1198\/016214505000000907","volume":"101","author":"PL Bartlett","year":"2006","unstructured":"Bartlett, P.L., Jordan, M.I., McAuliffe, J.D.: Convexity, classification, and risk bounds. J. Am. Stat. Assoc. 101(473), 138\u2013156 (2006)","journal-title":"J. Am. Stat. Assoc."},{"key":"60_CR3","unstructured":"Bradley, P.S., Mangasarian, O.L.: Feature selection via concave minimization and support vector machines. In: Proceedings of ICML, Madison, USA, pp. 82\u201390 (1998)"},{"key":"60_CR4","first-page":"1439","volume":"3","author":"J Weston","year":"2002","unstructured":"Weston, J., Elisseeff, A., Sch\u00f6lkopf, B., Tipping, M.: Use of the zero-norm with linear models and kernel methods. Mach. Learn. 3, 1439\u20131461 (2002)","journal-title":"Mach. Learn."},{"issue":"12","key":"60_CR5","doi-asserted-by":"publisher","first-page":"6380","DOI":"10.1016\/j.csda.2007.02.006","volume":"51","author":"Y Liu","year":"2007","unstructured":"Liu, Y., Helen Zhang, H., Park, C., Ahn, J.: Support vector machines with adaptive Lq penalty. Comput. Stat. Data Anal. 51(12), 6380\u20136394 (2007)","journal-title":"Comput. Stat. Data Anal."},{"key":"60_CR6","first-page":"379","volume":"18","author":"H Zou","year":"2008","unstructured":"Zou, H., Yuan, M.: The \n                    \n                      \n                    \n                    $$\\text{ f }_\\infty $$\n                    \n                      \n                        \n                          \n                          f\n                          \n                            \n                            \u221e\n                          \n                        \n                      \n                    \n                  -norm support vector machine. Stat. Sin. 18, 379\u2013398 (2008)","journal-title":"Stat. Sin."},{"issue":"6","key":"60_CR7","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1109\/TNNLS.2013.2286696","volume":"25","author":"L Laporte","year":"2014","unstructured":"Laporte, L., Flamary, R., Canu, S., D\u00e9jean, S., Mothe, J.: Non-convex regularizations for feature selection in ranking with sparse SVM. IEEE Trans. Neural Netw. Learn. Syst. 25(6), 1118\u20131130 (2014)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"6","key":"60_CR8","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1109\/TPAMI.2005.127","volume":"27","author":"B Krishnapuram","year":"2005","unstructured":"Krishnapuram, B., Carin, L., Figueiredo, M.A.T., Hartemink, A.J.: Sparse multinomial logistic regression: fast algorithms and generalization bounds. IEEE Trans. Pattern Anal. Mach. Intell. 27(6), 957\u2013968 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"60_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1111\/j.1467-9868.2007.00627.x","volume":"70","author":"L Meier","year":"2008","unstructured":"Meier, L., Van De Geer, S., B\u00fchlmann, P.: The group lasso for logistic regression. J. R. Stat. Soc. B 70(1), 53\u201371 (2008)","journal-title":"J. R. Stat. Soc. B"},{"key":"60_CR10","doi-asserted-by":"crossref","unstructured":"Duchi, J., Singer, Y.: Boosting with structural sparsity. In: Proceedings of ICML, Montreal, Canada, pp. 297\u2013304 (2009)","DOI":"10.1145\/1553374.1553412"},{"issue":"2","key":"60_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s11222-008-9111-x","volume":"20","author":"G Obozinski","year":"2010","unstructured":"Obozinski, G., Taskar, B., Jordan, M.I.: Joint covariate selection and joint subspace selection for multiple classification problems. Stat. Comput. 20(2), 231\u2013252 (2010)","journal-title":"Stat. Comput."},{"key":"60_CR12","first-page":"3183","volume":"11","author":"G-X Yuan","year":"2010","unstructured":"Yuan, G.-X., Chang, K.-W., Hsieh, C.-J., Lin, C.-J.: A comparison of optimization methods and software for large-scale L1-regularized linear classification. Mach. Learn. 11, 3183\u20133234 (2010)","journal-title":"Mach. Learn."},{"key":"60_CR13","first-page":"1665","volume":"14","author":"L Rosasco","year":"2013","unstructured":"Rosasco, L., Villa, S., Mosci, S., Santoro, M., Verri, A.: Nonparametric sparsity and regularization. J. Mach. Learn. Res. 14, 1665\u20131714 (2013)","journal-title":"J. Mach. Learn. Res."},{"key":"60_CR14","doi-asserted-by":"crossref","unstructured":"Blondel, M., Fujino, A., Ueda, N.: Large-scale multiclass support vector machine training via euclidean projection onto the simplex. In: Proceedings of ICPR, Stockholm, Sweden, 24\u201328 August 2014, pp. 1289\u20131294","DOI":"10.1109\/ICPR.2014.231"},{"key":"60_CR15","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1198\/016214506000001383","volume":"102","author":"L Wang","year":"2007","unstructured":"Wang, L., Shen, X.: On \n                    \n                      \n                    \n                    $$l_1$$\n                    \n                      \n                        \n                          l\n                          1\n                        \n                      \n                    \n                  -norm multi-class support vector machines: methodology and theory. J. Am. Stat. Assoc. 102, 583\u2013594 (2007)","journal-title":"J. Am. Stat. Assoc."},{"key":"60_CR16","unstructured":"Mairal, J.: Optimization with first-order surrogate functions. In: Proceedings of ICML, pp. 783\u2013791 (2013)"},{"key":"60_CR17","unstructured":"Chierchia, G., Pustelnik, N., Pesquet, J.-C., Pesquet-Popescu, B.: A proximal approach for sparse multiclass SVM (2015). Preprint \n                    arXiv:1501.03669"},{"issue":"17","key":"60_CR18","doi-asserted-by":"publisher","first-page":"4635","DOI":"10.1109\/TSP.2017.2709262","volume":"65","author":"M Barlaud","year":"2017","unstructured":"Barlaud, M., Belhajali, W., Combettes, P.L., Fillatre, L.: Classification and regression using a constrained convex splitting method. IEEE Trans. Signal Process. 65(17), 4635\u20134644 (2017)","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"60_CR19","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1007\/s10957-018-1226-4","volume":"176","author":"F Iutzeler","year":"2018","unstructured":"Iutzeler, F., Malick, J.: On the proximal gradient algorithm with alternated inertia. J. Optim. Theory Appl. 176(3), 688\u2013710 (2018). \n                    https:\/\/doi.org\/10.1007\/s10957-018-1226-4","journal-title":"J. Optim. Theory Appl."},{"key":"60_CR20","unstructured":"Tan, M., Wang, L., Tsang, I.W.: Learning sparse SVM for feature selection on very high dimensional datasets. In: Proceedings of ICML, Haifa, Israel, 21\u201324 June 2010, pp. 1047\u20131054"},{"key":"60_CR21","doi-asserted-by":"crossref","unstructured":"Hsieh, C.J., Chang, K.W., Lin, C.J., Keerthi, S.S., Sundararajan, S.: A dual coordinate descent method for large-scale linear SVM. In: Proceedings of ICML, pp. 408\u2013415 (2008)","DOI":"10.1145\/1390156.1390208"},{"issue":"1","key":"60_CR22","first-page":"53","volume":"28","author":"S Lacoste-Julien","year":"2013","unstructured":"Lacoste-Julien, S., Jaggi, M., Schmidt, M., Pletscher, P.: Block-coordinate Frank-Wolfe optimization for structural SVMs. Proc. ICML 28(1), 53\u201361 (2013)","journal-title":"Proc. ICML"},{"issue":"2","key":"60_CR23","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1109\/JSTSP.2015.2496908","volume":"10","author":"M Pereyra","year":"2016","unstructured":"Pereyra, M., Schniter, P., Chouzenoux, E., Pesquet, J.-C., Tourneret, J.-Y., Hero, A., McLaughlin, S.: A survey of stochastic simulation and optimization methods in signal processing. IEEE J. Sel. Top. Signal Process. 10(2), 224\u2013241 (2016)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"60_CR24","first-page":"1865","volume":"12","author":"S Shalev-Shwartz","year":"2011","unstructured":"Shalev-Shwartz, S., Tewari, A.: Stochastic methods for l1-regularized loss minimization. J. Mach. Learn. Res. 12, 1865\u20131892 (2011)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"60_CR25","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10994-013-5367-2","volume":"93","author":"M Blondel","year":"2013","unstructured":"Blondel, M., Seki, K., Uehara, K.: Block coordinate descent algorithms for large-scale sparse multiclass classification. Mach. Learn. 93(1), 31\u201352 (2013)","journal-title":"Mach. Learn."},{"issue":"4","key":"60_CR26","doi-asserted-by":"publisher","first-page":"1997","DOI":"10.1137\/130949993","volume":"25","author":"O Fercoq","year":"2015","unstructured":"Fercoq, O., Richt\u00e1rik, P.: Accelerated, parallel, and proximal coordinate descent. SIAM J. Optim. 25(4), 1997\u20132023 (2015)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"60_CR27","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s10107-014-0800-2","volume":"152","author":"Z Lu","year":"2015","unstructured":"Lu, Z., Xiao, L.: On the complexity analysis of randomized block-coordinate descent methods. Math. Program. 152(1\u20132), 615\u2013642 (2015)","journal-title":"Math. Program."},{"key":"60_CR28","first-page":"777","volume":"10","author":"J Langford","year":"2009","unstructured":"Langford, J., Li, L., Zhang, T.: Sparse online learning via truncated gradient. J. Mach. Learn. Res. 10, 777\u2013801 (2009)","journal-title":"J. Mach. Learn. Res."},{"key":"60_CR29","first-page":"2543","volume":"11","author":"L Xiao","year":"2010","unstructured":"Xiao, L.: Dual averaging methods for regularized stochastic learning and online optimization. J. Mach. Learn. Res. 11, 2543\u20132596 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"60_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-012-0614-z","volume":"144","author":"P Richt\u00e1rik","year":"2014","unstructured":"Richt\u00e1rik, P., Tak\u00e1\u010d, M.: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Math. Program. 144(1), 1\u201338 (2014)","journal-title":"Math. Program."},{"issue":"2","key":"60_CR31","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/s10957-016-0893-2","volume":"169","author":"L Rosasco","year":"2016","unstructured":"Rosasco, L., Villa, S., V\u0169, B.C.: Stochastic forward\u2013backward splitting for monotone inclusions. J. Optim. Theory Appl. 169(2), 388\u2013406 (2016)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"60_CR32","first-page":"13","volume":"1","author":"P Combettes","year":"2016","unstructured":"Combettes, P., Pesquet, J.-C.: Stochastic approximations and perturbations in forward\u2013backward splitting for monotone operators. Pure Appl. Funct. Anal. 1(1), 13\u201337 (2016)","journal-title":"Pure Appl. Funct. Anal."},{"key":"60_CR33","doi-asserted-by":"crossref","unstructured":"Combettes, L., Pesquet, J.-C.: Stochastic quasi-Fej\u00e9r block-coordinate fixed point iterations with random sweeping II: mean-square and linear convergence. Math. Program. (2018)","DOI":"10.1007\/s10107-018-1296-y"},{"issue":"2","key":"60_CR34","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1137\/140971233","volume":"25","author":"PL Combettes","year":"2015","unstructured":"Combettes, P.L., Pesquet, J.-C.: Stochastic quasi-Fej\u00e9r block-coordinate fixed point iterations with random sweeping. SIAM J. Optim. 25(2), 1221\u20131248 (2015)","journal-title":"SIAM J. Optim."},{"issue":"12","key":"60_CR35","first-page":"2453","volume":"16","author":"J-C Pesquet","year":"2015","unstructured":"Pesquet, J.-C., Repetti, A.: A class of randomized primal-dual algorithms for distributed optimization. J. Nonlinear Convex Anal. 16(12), 2453\u20132490 (2015)","journal-title":"J. Nonlinear Convex Anal."},{"key":"60_CR36","unstructured":"Mairal, J.: Stochastic majorization\u2013minimization algorithms for large-scale optimization. In: Proceedings of NIPS, pp. 2283\u20132291 (2013)"},{"issue":"18","key":"60_CR37","doi-asserted-by":"publisher","first-page":"4770","DOI":"10.1109\/TSP.2017.2709265","volume":"65","author":"E Chouzenoux","year":"2017","unstructured":"Chouzenoux, E., Pesquet, J.-C.: A stochastic majorize-minimize subspace algorithm for online penalized least squares estimation. IEEE Trans. Signal Process. 65(18), 4770\u20134783 (2017)","journal-title":"IEEE Trans. Signal Process."},{"issue":"4","key":"60_CR38","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1137\/10081602X","volume":"21","author":"LM Brice\u00f1o-Arias","year":"2011","unstructured":"Brice\u00f1o-Arias, L.M., Combettes, P.L.: A monotone + skew splitting model for composite monotone inclusions in duality. SIAM J. Optim. 21(4), 1230\u20131250 (2011)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"60_CR39","doi-asserted-by":"publisher","first-page":"2541","DOI":"10.1137\/120901106","volume":"23","author":"RI Bo\u0163","year":"2013","unstructured":"Bo\u0163, R.I., Hendrich, C.: A Douglas\u2013Rachford type primal-dual method for solving inclusions with mixtures of composite and parallel-sum type monotone operators. SIAM J. Optim. 23(4), 2541\u20132565 (2013)","journal-title":"SIAM J. Optim."},{"key":"60_CR40","unstructured":"Perekrestenko, D., Cevher, V., Jaggi, M.: Faster coordinate descent via adaptive importance sampling. In: Proceedings of AISTATS, Fort Lauderdale, Florida, USA, 20\u201322 April (2017)"},{"issue":"11","key":"60_CR41","doi-asserted-by":"publisher","first-page":"7917","DOI":"10.1090\/tran\/6911","volume":"369","author":"I Mez\u0151","year":"2017","unstructured":"Mez\u0151, I., Baricz, \u00c1.: On the generalization of the Lambert W function. Trans. Am. Math. Soc. 369(11), 7917\u20137934 (2017)","journal-title":"Trans. Am. Math. Soc."},{"issue":"2","key":"60_CR42","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/2992274.2992275","volume":"50","author":"A Maignan","year":"2016","unstructured":"Maignan, A., Scott, T.: Fleshing out the generalized Lambert W function. ACM Commun. Comput. Algebra 50(2), 45\u201360 (2016)","journal-title":"ACM Commun. Comput. Algebra"},{"key":"60_CR43","doi-asserted-by":"crossref","unstructured":"Chierchia, G., Pustelnik, N., Pesquet, J.-C.: Random primal-dual proximal iterations for sparse multiclass SVM. In: Proceedings of MLSP, Salerno, Italy (2016)","DOI":"10.1109\/MLSP.2016.7738833"},{"issue":"1","key":"60_CR44","first-page":"310","volume":"18","author":"YF Atchad\u00e9","year":"2017","unstructured":"Atchad\u00e9, Y.F., Fort, G., Moulines, E.: On perturbed proximal gradient algorithms. J. Mach. Learn. Res. 18(1), 310\u2013342 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"60_CR45","unstructured":"Combettes, P., Glaudin, L.: Proximal activation of smooth functions in splitting algorithms for convex minimization. Tech. Rep. (2018). \n                    arxiv:1803.02919"},{"key":"60_CR46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. Springer, New York (2017)","edition":"2"},{"issue":"1","key":"60_CR47","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10957-017-1074-7","volume":"173","author":"J Eckstein","year":"2017","unstructured":"Eckstein, J.: A simplified form of block-iterative operator splitting and an asynchronous algorithm resembling the multi-block alternating direction method of multipliers. J. Optim. Theory Appl. 173(1), 155\u2013182 (2017)","journal-title":"J. Optim. Theory Appl."},{"key":"60_CR48","unstructured":"Johnstone, P.R., Eckstein, J.: Projective splitting with forward steps: asynchronous and block-iterative operator splitting. Tech. Rep. (2018). \n                    https:\/\/arxiv.org\/pdf\/1803.07043.pdf"},{"issue":"1\u20132","key":"60_CR49","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/s10107-016-1044-0","volume":"168","author":"PL Combettes","year":"2018","unstructured":"Combettes, P.L., Eckstein, J.: Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions. Math. Program. Ser. B 168(1\u20132), 645\u2013672 (2018). \n                    https:\/\/doi.org\/10.1007\/s10107-016-1044-0","journal-title":"Math. Program. Ser. B"},{"key":"60_CR50","unstructured":"Chierchia, G., Cherni, A., Chouzenoux, E., Pesquet, J.-C.: Approche de Douglas\u2013Rachford al\u00e9atoire par blocs appliqu\u00e9e \u00e0 la r\u00e9gression logistique parcimonieuse. In: Actes du GRETSI. Juan-les-Pins, France (2017)"},{"issue":"3","key":"60_CR51","first-page":"273","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes, C., Vapnik, V.: Support-vector networks. Mach. Learn. 20(3), 273\u2013297 (1995)","journal-title":"Mach. Learn."},{"key":"60_CR52","unstructured":"Martins, A., Astudillo, R.: From softmax to sparsemax: a sparse model of attention and multi-label classification. In: Proceedings of ICML, New York, USA, pp. 1614\u20131623 (2016)"},{"issue":"1","key":"60_CR53","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000015","volume":"4","author":"F Bach","year":"2012","unstructured":"Bach, F., Jenatton, R., Mairal, J., Obozinski, G.: Optimization with sparsity-inducing penalties. Found. Trends Mach. Learn. 4(1), 1\u2013106 (2012)","journal-title":"Found. Trends Mach. Learn."},{"key":"60_CR54","unstructured":"Chierchia, G., Chouzenoux, E., Combettes, P.L., Pesquet, J.-C.: The proximity operator repository (user\u2019s guide). \n                    http:\/\/proximity-operator.net\/\n                    \n                   (2017). Accessed 10 Jan 2019"},{"key":"60_CR55","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-1-4419-9569-8_10","volume-title":"Fixed-Point Algorithms for Inverse Problems in Science and Engineering","author":"PL Combettes","year":"2011","unstructured":"Combettes, P.L., Pesquet, J.-C.: Proximal splitting methods in signal processing. In: Bauschke, H.H., Burachik, R.S., Combettes, P.L., Elser, V., Luke, D.R., Wolkowicz, H. (eds.) Fixed-Point Algorithms for Inverse Problems in Science and Engineering, pp. 185\u2013212. Springer, New York (2011)"},{"issue":"3","key":"60_CR56","first-page":"123","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 123\u2013231 (2014)","journal-title":"Found. Trends Optim."},{"key":"60_CR57","unstructured":"Wang, P.-W., Wytock, M., Kolter, J.Z.: Epigraph projections for fast general convex programming. In: Proceedings of ICML (2016)"},{"key":"60_CR58","first-page":"101","volume":"5","author":"R Rifkin","year":"2004","unstructured":"Rifkin, R., Klautau, A.: In defense of one-vs-all classification. Mach. Learn. 5, 101\u2013141 (2004)","journal-title":"Mach. Learn."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00060-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00060-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00060-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T19:12:53Z","timestamp":1579201973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00060-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,17]]},"references-count":58,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["60"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00060-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,17]]},"assertion":[{"value":"23 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}