{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:25:26Z","timestamp":1778495126537,"version":"3.51.4"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,2,17]],"date-time":"2018-02-17T00:00:00Z","timestamp":1518825600000},"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":["Math. Program."],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s10107-018-1248-6","type":"journal-article","created":{"date-parts":[[2018,2,17]],"date-time":"2018-02-17T08:05:52Z","timestamp":1518854752000},"page":"419-459","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":52,"title":["Submodular functions: from discrete to continuous domains"],"prefix":"10.1007","volume":"175","author":[{"given":"Francis","family":"Bach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,17]]},"reference":[{"key":"1248_CR1","doi-asserted-by":"crossref","DOI":"10.1561\/9781601987570","volume-title":"Learning with Submodular Functions: A Convex Optimization Perspective, Volume 6 of Foundations and Trends in Machine Learning","author":"F Bach","year":"2013","unstructured":"Bach, F.: Learning with Submodular Functions: A Convex Optimization Perspective, Volume 6 of Foundations and Trends in Machine Learning. NOW, Breda (2013)"},{"issue":"1","key":"1248_CR2","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1137\/130941961","volume":"25","author":"F Bach","year":"2015","unstructured":"Bach, F.: Duality between subgradient and conditional gradient methods. SIAM J. Optim. 25(1), 115\u2013129 (2015)","journal-title":"SIAM J. Optim."},{"key":"1248_CR3","doi-asserted-by":"crossref","unstructured":"Bae, E., Yuan, J., Tai, X.-C., Boykov, Y.: A fast continuous max-flow approach to non-convex multi-labeling problems. In: Bruhn, A., Pock, T., Tai, X.-C. (eds.) Efficient Algorithms for Global Optimization Methods in Computer Vision, pp. 134\u2013154. Springer (2014)","DOI":"10.1007\/978-3-642-54774-4_7"},{"issue":"1","key":"1248_CR4","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/BF01580873","volume":"47","author":"MJ Best","year":"1990","unstructured":"Best, M.J., Chakravarti, N.: Active set algorithms for isotonic regression: a unifying framework. Math. Program. 47(1), 425\u2013439 (1990)","journal-title":"Math. Program."},{"issue":"3","key":"1248_CR5","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.acha.2009.04.002","volume":"27","author":"T Blumensath","year":"2009","unstructured":"Blumensath, T., Davies, M.E.: Iterative hard thresholding for compressed sensing. Appl. Comput. Harmon. Anal. 27(3), 265\u2013274 (2009)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"1248_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-31256-9","volume-title":"Convex Analysis and Nonlinear Optimization: Theory and Examples","author":"JM Borwein","year":"2006","unstructured":"Borwein, J.M., Lewis, A.S.: Convex Analysis and Nonlinear Optimization: Theory and Examples. Springer, Berlin (2006)"},{"key":"1248_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"SP Boyd","year":"2004","unstructured":"Boyd, S.P., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"11","key":"1248_CR8","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y Boykov","year":"2001","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. Pattern Anal. Mach. Intell. 23(11), 1222\u20131239 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"1248_CR9","first-page":"517","volume":"10","author":"G Carlier","year":"2003","unstructured":"Carlier, G.: On a class of multidimensional optimal transportation problems. J. Convex Anal. 10(2), 517\u2013530 (2003)","journal-title":"J. Convex Anal."},{"issue":"3","key":"1248_CR10","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/s11263-009-0238-9","volume":"84","author":"A Chambolle","year":"2009","unstructured":"Chambolle, A., Darbon, J.: On total variation minimization and surface evolution using parametric maximum flows. Int. J. Comput. Vis. 84(3), 288\u2013307 (2009)","journal-title":"Int. J. Comput. Vis."},{"key":"1248_CR11","doi-asserted-by":"publisher","first-page":"131","DOI":"10.5802\/aif.53","volume":"5","author":"G Choquet","year":"1954","unstructured":"Choquet, G.: Theory of capacities. Annales de l\u2019Institut Fourier 5, 131\u2013295 (1954)","journal-title":"Annales de l\u2019Institut Fourier"},{"key":"1248_CR12","unstructured":"Djolonga, J., Krause, A.: From MAP to marginals: variational inference in Bayesian submodular models. In: Advances in Neural Information Processing Systems (NIPS) (2014)"},{"key":"1248_CR13","unstructured":"Djolonga, J., Krause, A.: Scalable variational inference in log-supermodular models. In: International Conference on Machine Learning (ICML) (2015)"},{"key":"1248_CR14","doi-asserted-by":"crossref","unstructured":"Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: J\u00fcnger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial optimization\u2014Eureka, you shrink! pp. 11\u201326. Springer (2003)","DOI":"10.1007\/3-540-36478-1_2"},{"issue":"456","key":"1248_CR15","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96(456), 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"key":"1248_CR16","first-page":"3","volume":"53","author":"P Favati","year":"1990","unstructured":"Favati, P., Tardella, F.: Convexity in nonlinear integer programming. Ric. Oper. 53, 3\u201344 (1990)","journal-title":"Ric. Oper."},{"issue":"4","key":"1248_CR17","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1137\/090779346","volume":"40","author":"U Feige","year":"2011","unstructured":"Feige, U., Mirrokni, V.S., Vondr\u00e1k, J.: Maximizing non-monotone submodular functions. SIAM J. Comput. 40(4), 1133\u20131153 (2011)","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"1248_CR18","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P.: An algorithm for quadratic programming. Nav. Res. Logist. Q. 3(1\u20132), 95\u2013110 (1956)","journal-title":"Nav. Res. Logist. Q."},{"issue":"10","key":"1248_CR19","doi-asserted-by":"publisher","first-page":"3872","DOI":"10.1016\/j.laa.2011.11.021","volume":"438","author":"S Friedland","year":"2013","unstructured":"Friedland, S., Gaubert, S.: Submodular spectral functions of principal submatrices of a hermitian matrix, extensions and applications. Linear Algebra Appl. 438(10), 3872\u20133884 (2013)","journal-title":"Linear Algebra Appl."},{"key":"1248_CR20","volume-title":"Submodular Functions and Optimization","author":"S Fujishige","year":"2005","unstructured":"Fujishige, S.: Submodular Functions and Optimization. Elsevier, Amsterdam (2005)"},{"issue":"1","key":"1248_CR21","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/PL00011371","volume":"88","author":"S Fujishige","year":"2000","unstructured":"Fujishige, S., Murota, K.: Notes on l-\/m-convex functions and the separation theorems. Math. Program. 88(1), 129\u2013146 (2000)","journal-title":"Math. Program."},{"issue":"2","key":"1248_CR22","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0377-2217(91)90300-K","volume":"54","author":"H Groenevelt","year":"1991","unstructured":"Groenevelt, H.: Two algorithms for maximizing a separable concave function over a polymatroid feasible region. Eur. J. Oper. Res. 54(2), 227\u2013236 (1991)","journal-title":"Eur. J. Oper. Res."},{"key":"1248_CR23","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1214\/11-EJS638","volume":"5","author":"M Hebiri","year":"2011","unstructured":"Hebiri, M., Van De Geer, S.: The smooth-lasso and other $$\\ell _1 +\\ell _2$$ \u2113 1 + \u2113 2 -penalized methods. Electron. J. Stat. 5, 1184\u20131226 (2011)","journal-title":"Electron. J. Stat."},{"issue":"10","key":"1248_CR24","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1109\/TPAMI.2003.1233908","volume":"25","author":"H Ishikawa","year":"2003","unstructured":"Ishikawa, H.: Exact optimization for markov random fields with convex priors. IEEE Trans. Pattern Anal. Mach. Intell. 25(10), 1333\u20131336 (2003)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"4","key":"1248_CR25","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1145\/502090.502096","volume":"48","author":"S Iwata","year":"2001","unstructured":"Iwata, S., Fleischer, L., Fujishige, S.: A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM 48(4), 761\u2013777 (2001)","journal-title":"J. ACM"},{"key":"1248_CR26","unstructured":"Jaggi, M.: Revisiting Frank\u2013Wolfe: projection-free sparse convex optimization. In: Proceedings of the International Conference on Machine Learning (ICML) (2013)"},{"key":"1248_CR27","doi-asserted-by":"crossref","first-page":"121","DOI":"10.7551\/mitpress\/8996.003.0007","volume-title":"Optimization for Machine Learning","author":"A Juditsky","year":"2011","unstructured":"Juditsky, A., Nemirovski, A.: First order methods for nonsmooth convex large-scale optimization, I: general purpose methods. In: Sra, S., Nowozin, S., Wright, S.J. (eds.) Optimization for Machine Learning, pp. 121\u2013148. MIT Press, Cambridge (2011)"},{"key":"1248_CR28","first-page":"199","volume":"37","author":"LV Kantorovich","year":"1942","unstructured":"Kantorovich, L.V.: On the translocation of masses. Dokl. Akad. Nauk SSSR 37, 199\u2013201 (1942)","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"4","key":"1248_CR29","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1016\/0047-259X(80)90065-2","volume":"10","author":"S Karlin","year":"1980","unstructured":"Karlin, S., Rinott, Y.: Classes of orderings of measures and related correlation inequalities. I. Multivariate totally positive distributions. J. Multivar. Anal. 10(4), 467\u2013498 (1980)","journal-title":"J. Multivar. Anal."},{"issue":"2","key":"1248_CR30","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1025794313696","volume":"26","author":"S Kim","year":"2003","unstructured":"Kim, S., Kojima, M.: Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxations. Comput. Optim. Appl. 26(2), 143\u2013154 (2003)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"1248_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1989734.1989736","volume":"2","author":"A Krause","year":"2011","unstructured":"Krause, A., Guestrin, C.: Submodularity and its applications in optimized information gathering. ACM Trans. Intell. Syst. Technol. 2(4), 1\u201320 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"1248_CR32","unstructured":"Lacoste-Julien, S., Jaggi, M.: On the global linear convergence of Frank\u2013Wolfe optimization variants. In: Advances in Neural Information Processing Systems (NIPS) (2015)"},{"issue":"1","key":"1248_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10618600.2000.10474858","volume":"9","author":"K Lange","year":"2000","unstructured":"Lange, K., Hunter, D.R., Yang, I.: Optimization transfer using surrogate objective functions. J. Comput. Gr. Stat. 9(1), 1\u201320 (2000)","journal-title":"J. Comput. Gr. Stat."},{"key":"1248_CR34","unstructured":"Lin, H., Bilmes, J.: A class of submodular functions for document summarization. In: Proceedings of the 49th Annual Meeting of the Association for computational Linguistics: Human Language Technologies, vol. 1. Association for Computational Linguistics (2011)"},{"issue":"3","key":"1248_CR35","doi-asserted-by":"publisher","first-page":"176","DOI":"10.2307\/2307574","volume":"60","author":"GG Lorentz","year":"1953","unstructured":"Lorentz, G.G.: An inequality for rearrangements. Am. Math. Mon. 60(3), 176\u2013179 (1953)","journal-title":"Am. Math. Mon."},{"key":"1248_CR36","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L.: Submodular functions and convexity. In: Bachem, A., Korte, B., Gr\u00f6tschel, M. (eds.) Mathematical Programming: The State of the Art, Bonn, pp. 235\u2013257. Springer, Bonn (1982)","DOI":"10.1007\/978-3-642-68874-4_10"},{"issue":"1","key":"1248_CR37","first-page":"157","volume":"62","author":"P Milgrom","year":"1994","unstructured":"Milgrom, P., Shannon, C.: Monotone comparative statics. Econ. J. Econ. Soc. 62(1), 157\u2013180 (1994)","journal-title":"Econ. J. Econ. Soc."},{"key":"1248_CR38","doi-asserted-by":"crossref","unstructured":"Mitter, S.K.: Convex optimization in infinite dimensional spaces. In: Blondel, V.D., Boyd, S.P., Kimura, H. (eds.) Recent Advances in Learning and Control, pp. 161\u2013179. Springer (2008)","DOI":"10.1007\/978-1-84800-155-8_12"},{"key":"1248_CR39","unstructured":"Monge, G.: M\u00e9moire sur la th\u00e9orie des d\u00e9blais et des remblais. Histoire de l\u2019Acad\u00e9mie Royale des Sciences, pp. 666\u2013704 (1781)"},{"key":"1248_CR40","volume-title":"Machine Learning: A Probabilistic Perspective","author":"KP Murphy","year":"2012","unstructured":"Murphy, K.P.: Machine Learning: A Probabilistic Perspective. MIT Press, Cambridge (2012)"},{"issue":"4","key":"1248_CR41","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1137\/070708111","volume":"19","author":"A Nedi\u0107","year":"2009","unstructured":"Nedi\u0107, A., Ozdaglar, A.: Approximate primal solutions and rate analysis for dual subgradient methods. SIAM J. Optim. 19(4), 1757\u20131780 (2009)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1248_CR42","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions-I. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"issue":"2","key":"1248_CR43","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10107-007-0189-2","volume":"118","author":"JB Orlin","year":"2009","unstructured":"Orlin, J.B.: A faster strongly polynomial time algorithm for submodular function minimization. Math. Program. 118(2), 237\u2013251 (2009)","journal-title":"Math. Program."},{"key":"1248_CR44","doi-asserted-by":"crossref","unstructured":"Pock, T., Chambolle, A., Cremers, D., Bischof, H.: A convex relaxation approach for computing minimal partitions. In: Conference on Computer Vision and Pattern Recognition (CVPR) (2009)","DOI":"10.1109\/CVPR.2009.5206604"},{"key":"1248_CR45","volume-title":"Probability Metrics and the Stability of Stochastic Models","author":"ST Rachev","year":"1991","unstructured":"Rachev, S.T.: Probability Metrics and the Stability of Stochastic Models. Wiley, New York (1991)"},{"key":"1248_CR46","volume-title":"Real and Complex Analysis","author":"W Rudin","year":"1986","unstructured":"Rudin, W.: Real and Complex Analysis. McGraw-Hill, New York (1986)"},{"key":"1248_CR47","unstructured":"Ruozzi, N.: Exactness of approximate MAP inference in continuous MRFs. In: Advances in Neural Information Processing Systems (NIPS) (2015)"},{"key":"1248_CR48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20828-2","volume-title":"Optimal Transport for Applied Mathematicians","author":"F Santambrogio","year":"2015","unstructured":"Santambrogio, F.: Optimal Transport for Applied Mathematicians. Springer, Berlin (2015)"},{"key":"1248_CR49","unstructured":"Schlesinger, D., Flach, B.: Transforming an arbitrary MinSum problem into a binary one. Technical Report TUD-FI06-01, Dresden University of Technology, Germany (2006)"},{"issue":"2","key":"1248_CR50","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1006\/jctb.2000.1989","volume":"80","author":"A Schrijver","year":"2000","unstructured":"Schrijver, A.: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Comb. Theory Ser. B 80(2), 346\u2013355 (2000)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1248_CR51","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, vol. 24. Springer, Berlin (2003)"},{"issue":"1","key":"1248_CR52","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/nav.3800090106","volume":"9","author":"LS Shapley","year":"1962","unstructured":"Shapley, L.S.: Complements and substitutes in the optimal assignment problem. Nav. Res. Logist. Q. 9(1), 45\u201348 (1962)","journal-title":"Nav. Res. Logist. Q."},{"key":"1248_CR53","volume-title":"Nondifferentiable Optimization and Polynomial Problems","author":"NS Shor","year":"2013","unstructured":"Shor, N.S.: Nondifferentiable Optimization and Polynomial Problems, vol. 24. Springer, Berlin (2013)"},{"issue":"2","key":"1248_CR54","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1287\/opre.26.2.305","volume":"26","author":"DM Topkis","year":"1978","unstructured":"Topkis, D.M.: Minimizing a submodular function on a lattice. Oper. Res. 26(2), 305\u2013321 (1978)","journal-title":"Oper. Res."},{"key":"1248_CR55","doi-asserted-by":"publisher","DOI":"10.1515\/9781400822539","volume-title":"Supermodularity and Complementarity","author":"DM Topkis","year":"2011","unstructured":"Topkis, D.M.: Supermodularity and Complementarity. Princeton University Press, Princeton (2011)"},{"key":"1248_CR56","volume-title":"Optimal Transport: Old and New","author":"C Villani","year":"2008","unstructured":"Villani, C.: Optimal Transport: Old and New, vol. 338. Springer, Berlin (2008)"},{"key":"1248_CR57","doi-asserted-by":"crossref","unstructured":"Vondr\u00e1k, J.: Optimal approximation for the submodular welfare problem in the value oracle model. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pp. 67\u201374. ACM (2008)","DOI":"10.1145\/1374376.1374389"},{"key":"1248_CR58","unstructured":"Wald, Y., Globerson, A.: Tightness results for local consistency relaxations in continuous MRFs. In: Proceedings of Uncertainty in Artifical Intelligence (UAI) (2014)"},{"issue":"7","key":"1248_CR59","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1109\/TPAMI.2007.1036","volume":"29","author":"T Werner","year":"2007","unstructured":"Werner, T.: A linear programming approach to max-sum problem: a review. IEEE Trans. Pattern Anal. Mach. Intell. 29(7), 1165\u20131179 (2007)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"1248_CR60","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/BF01580381","volume":"11","author":"P Wolfe","year":"1976","unstructured":"Wolfe, P.: Finding the nearest point in a polytope. Math. Program. 11(1), 128\u2013149 (1976)","journal-title":"Math. Program."},{"key":"1248_CR61","volume-title":"Advanced Structured Prediction","author":"S \u017divn\u00fd","year":"2014","unstructured":"\u017divn\u00fd, S., Werner, T., Pr\u016f\u0161a, D.: The power of lp relaxation for map inference. In: Nowozin, S., Gehler, P.V., Jancsary, J., Lampert, C.H. (eds.) Advanced Structured Prediction. MIT Press, Cambridge (2014)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-018-1248-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1248-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1248-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T08:42:49Z","timestamp":1719823369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-018-1248-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,17]]},"references-count":61,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["1248"],"URL":"https:\/\/doi.org\/10.1007\/s10107-018-1248-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,17]]},"assertion":[{"value":"20 February 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}