{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:05Z","timestamp":1740109265700,"version":"3.37.3"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,5,14]],"date-time":"2018-05-14T00:00:00Z","timestamp":1526256000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,5,14]],"date-time":"2018-05-14T00:00:00Z","timestamp":1526256000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Deutsche Forschungsgemeinschaft","award":["SFB 876"],"award-info":[{"award-number":["SFB 876"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-0953754","CCF-1320719"],"award-info":[{"award-number":["CCF-0953754","CCF-1320719"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1649515","CCF-1649515"],"award-info":[{"award-number":["CCF-1649515","CCF-1649515"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s00453-018-0449-y","type":"journal-article","created":{"date-parts":[[2018,5,14]],"date-time":"2018-05-14T13:52:44Z","timestamp":1526305964000},"page":"367-392","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Structural Results on Matching Estimation with Applications to Streaming"],"prefix":"10.1007","volume":"81","author":[{"given":"Marc","family":"Bury","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elena","family":"Grigorescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"McGregor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morteza","family":"Monemizadeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1202-0805","authenticated-orcid":false,"given":"Chris","family":"Schwiegelshohn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sofya","family":"Vorotnikova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samson","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,14]]},"reference":[{"key":"449_CR1","unstructured":"Ai, Y., Hu, W., Li, Y, Woodruff, D.P.: New characterizations in turnstile streams with applications. In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 20:1\u201320, 22 (2016)"},{"key":"449_CR2","doi-asserted-by":"crossref","unstructured":"Andoni, A., Nguyen, H.L.: Eigenvalues of a matrix in the streaming model. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1729\u20131737 (2013)","DOI":"10.1137\/1.9781611973105.124"},{"key":"449_CR3","doi-asserted-by":"crossref","unstructured":"Assadi, S., Khanna, S., Li, Y.: On estimating maximum matching size in graph streams. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, 16\u201319 January, pp. 1723\u20131742 (2017)","DOI":"10.1137\/1.9781611974782.113"},{"key":"449_CR4","unstructured":"Assadi, S., Khanna, S., Li, Y., Yaroslavtsev, G.: Maximum matchings in dynamic graph streams and the simultaneous communication model. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, 10\u201312 January, 2016, pp. 1345\u20131364 (2016)"},{"issue":"1","key":"449_CR5","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1137\/060651835","volume":"38","author":"Z Bar-Yossef","year":"2008","unstructured":"Bar-Yossef, Z., Jayram, T.S., Kerenidis, I.: Exponential separation of quantum and classical one-way communication complexity. SIAM J. Comput. 38(1), 366\u2013384 (2008)","journal-title":"SIAM J. Comput."},{"key":"449_CR6","unstructured":"Bar-Yossef, Z., Kumar, R., Sivakumar, D.: Reductions in streaming algorithms, with an application to counting triangles in graphs. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 623\u2013632 (2002)"},{"key":"449_CR7","doi-asserted-by":"crossref","unstructured":"Buriol, L.S., Frahling, G., Leonardi, S., Marchetti-Spaccamela, A., Sohler, C.: Counting triangles in data streams. In: Proceedings of the 29th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), pp. 253\u2013262 (2006)","DOI":"10.1145\/1142351.1142388"},{"key":"449_CR8","doi-asserted-by":"crossref","unstructured":"Bury, M., Schwiegelshohn, C.: Sublinear estimation of weighted matchings in dynamic data streams. In: Algorithms\u2014ESA 2015\u201323rd Annual European Symposium, Patras, Greece, 14\u201316 September, 2015, Proceedings, pp. 263\u2013274 (2015)","DOI":"10.1007\/978-3-662-48350-3_23"},{"key":"449_CR9","doi-asserted-by":"crossref","unstructured":"Chakrabarti, A., Kale, S.: Strong fooling sets for multi-player communication with applications to deterministic estimation of stream statistics. In: IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9\u201311 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA, pp. 41\u201350 (2016)","DOI":"10.1109\/FOCS.2016.14"},{"key":"449_CR10","unstructured":"Chitnis, R., Cormode, G., Esfandiari, H., Hajiaghayi, M., McGregor, A., Monemizadeh, M., Vorotnikova, S.: Kernelization via sampling with applications to finding matchings and related problems in dynamic graph streams. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, 10\u201312 January, 2016, pp. 1326\u20131344 (2016)"},{"key":"449_CR11","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L., Woodruff, D.P.: Numerical linear algebra in the streaming model. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), pp. 205\u2013214 (2009)","DOI":"10.1145\/1536414.1536445"},{"key":"449_CR12","unstructured":"Cormode, G., Jowhari, H., Monemizadeh, M., Muthukrishnan. S.: The sparse awakens: streaming algorithms for matching size estimation in sparse graphs. In: 25th Annual European Symposium on Algorithms, ESA 2017, 4\u20136 September, 2017, Vienna, Austria, pp. 29:1\u201329:15 (2017)"},{"key":"449_CR13","doi-asserted-by":"crossref","unstructured":"Crouch, M., McGregor, A., Stubbs, D.: Dynamic graphs in the sliding-window model. In: Proceedings of the 21st Annual European Symposium (ESA), pp. 337\u2013348 (2013)","DOI":"10.1007\/978-3-642-40450-4_29"},{"key":"449_CR14","unstructured":"Crouch, M., and Stubbs, D.: Improved streaming algorithms for weighted matching, via unweighted matching. In: Proceedings of the 18th Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM), pp. 96\u2013104 (2014)"},{"key":"449_CR15","unstructured":"Crouch, M., Stubbs, D.S.: Improved streaming algorithms for weighted matching, via unweighted matching. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2014, 4\u20136 September, 2014, Barcelona, Spain, pp. 96\u2013104 (2014)"},{"key":"449_CR16","doi-asserted-by":"crossref","unstructured":"Czygrinow, A., Hanckowiak, M., Szymanska, E.: Fast distributed approximation algorithm for the maximum matching problem in bounded arboricity graphs. In: Proceedings of the 20th International Symposium on Symbolic and Algebraic Computation (ISSAC), pp. 668\u2013678 (2009)","DOI":"10.1007\/978-3-642-10631-6_68"},{"key":"449_CR17","doi-asserted-by":"publisher","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0,1-vertices. J. Res. Natl. Bur. Stand. 69, 125\u2013130 (1965)","journal-title":"J. Res. Natl. Bur. Stand."},{"issue":"3","key":"449_CR18","doi-asserted-by":"publisher","first-page":"1251","DOI":"10.1137\/100801901","volume":"25","author":"L Epstein","year":"2011","unstructured":"Epstein, L., Levin, A., Mestre, J., Segev, D.: Improved approximation guarantees for weighted matching in the semi-streaming model. SIAM J. Discrete Math. 25(3), 1251\u20131265 (2011)","journal-title":"SIAM J. Discrete Math."},{"key":"449_CR19","unstructured":"Epstein, L., Levin, A., Segev, D., Weimann, O.: Improved bounds for online preemptive matching. In: Proceedings of the 30th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp. 389\u2013399 (2013)"},{"key":"449_CR20","doi-asserted-by":"crossref","unstructured":"Esfandiari, H., Hajiaghayi, M.T, Liaghat, V., Monemizadeh, M., Onak, K.: Streaming algorithms for estimating the matching size in planar graphs and beyond. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1217\u20131233 (2015)","DOI":"10.1137\/1.9781611973730.81"},{"issue":"2\u20133","key":"449_CR21","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.tcs.2005.09.013","volume":"348","author":"J Feigenbaum","year":"2005","unstructured":"Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: On graph problems in a semi-streaming model. Theor. Comput. Sci. 348(2\u20133), 207\u2013216 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"449_CR22","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1137\/070706550","volume":"38","author":"D Gavinsky","year":"2008","unstructured":"Gavinsky, D., Kempe, J., Kerenidis, I., Raz, R., de Wolf, R.: Exponential separation for one-way quantum communication complexity, with applications to cryptography. SIAM J. Comput. 38(5), 1695\u20131708 (2008)","journal-title":"SIAM J. Comput."},{"key":"449_CR23","unstructured":"Ghaffari. M.: Space-optimal semi-streaming for (2+$$\\epsilon $$)-approximate matching. CoRR (2017), \n                    arXiv:1701.03730"},{"issue":"5","key":"449_CR24","doi-asserted-by":"publisher","first-page":"1762","DOI":"10.1137\/15M1009718","volume":"45","author":"M Ghashami","year":"2016","unstructured":"Ghashami, M., Liberty, E., Phillips, J.M., Woodruff, D.P.: Frequent directions: Simple and deterministic matrix sketching. SIAM J. Comput. 45(5), 1762\u20131792 (2016)","journal-title":"SIAM J. Comput."},{"key":"449_CR25","doi-asserted-by":"crossref","unstructured":"Goel, A., Kapralov, M., Khanna, S.: On the communication and streaming complexity of maximum bipartite matching. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 468\u2013485 (2012).","DOI":"10.1137\/1.9781611973099.41"},{"key":"449_CR26","unstructured":"Grigorescu, E., Monemizadeh, M., Zhou, S.: Estimating weighted matchings in o(n) space.CoRR (2016), \n                    arXiv:1604.07467"},{"key":"449_CR27","doi-asserted-by":"crossref","unstructured":"Henzinger, M.R., Raghavan, P., Rajagopalan, S.: Computing on data streams. In: External Memory Algorithms: DIMACS Workshop External Memory and Visualization, vol. 50, pp. 107\u2013118. American Mathematical Society (1999)","DOI":"10.1090\/dimacs\/050\/05"},{"key":"449_CR28","doi-asserted-by":"crossref","unstructured":"Kane, D.M., Nelson, J., Woodruff, D.P.: An optimal algorithm for the distinct elements problem. In: Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2010, 6\u201311 June, 2010, Indianapolis, Indiana, USA, pp. 41\u201352 (2010)","DOI":"10.1145\/1807085.1807094"},{"key":"449_CR29","doi-asserted-by":"crossref","unstructured":"Kapralov, M.: Better bounds for matchings in the streaming model. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1679\u20131697 (2013)","DOI":"10.1137\/1.9781611973105.121"},{"key":"449_CR30","doi-asserted-by":"crossref","unstructured":"Kapralov, M., Khanna, S., Sudan, M.: Approximating matching size from random streams. In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 734\u2013751 (2014)","DOI":"10.1137\/1.9781611973402.55"},{"key":"449_CR31","doi-asserted-by":"crossref","unstructured":"Konrad, C.: Maximum matching in turnstile streams. In: Algorithms - ESA 2015\u201423rd Annual European Symposium, Patras, Greece, 14\u201316 September, 2015, Proceedings, pp. 840\u2013852 (2015)","DOI":"10.1007\/978-3-662-48350-3_70"},{"key":"449_CR32","doi-asserted-by":"crossref","unstructured":"Konrad, C., Magniez, F., Mathieu, C.: Maximum matching in semi-streaming with few passes. In Proceedings of the 16th Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM), pp. 231\u2013242 (2012)","DOI":"10.1007\/978-3-642-32512-0_20"},{"key":"449_CR33","doi-asserted-by":"crossref","unstructured":"Li, Y., Nguyen, H.L., Woodruff, D.P.: On sketching matrix norms and the top singular vector. In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1562\u20131581 (2014)","DOI":"10.1137\/1.9781611973402.114"},{"key":"449_CR34","doi-asserted-by":"crossref","unstructured":"Li, Y., Woodruff, D.P.: On approximating functions of the singular values in a stream. In: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, 18\u201321 June, 2016, pp. 726\u2013739 (2016)","DOI":"10.1145\/2897518.2897581"},{"key":"449_CR35","unstructured":"Li ,Y., Woodruff, D.P.: Tight bounds for sketching the operator norm, schatten norms, and subspace embeddings. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2016, 7\u20139 September, 2016, Paris, France, pp. 39:1\u201339:11 (2016)"},{"key":"449_CR36","unstructured":"Lov\u00e1sz, L.: On determinants, matchings, and random algorithms. In: Proceedings of the 2nd Conference on Fundamentals of Computation Theory (FCT), pp. 565\u2013574 (1979)"},{"key":"449_CR37","doi-asserted-by":"crossref","unstructured":"Manjunath, M., Mehlhorn, K., Panagiotou, K., He, S.: Approximate counting of cycles in streams. In: Algorithms\u2014ESA 2011\u201419th Annual European Symposium, Saarbr\u00fccken, Germany, 5\u20139 September, 2011. Proceedings, pp. 677\u2013688 (2011)","DOI":"10.1007\/978-3-642-23719-5_57"},{"key":"449_CR38","doi-asserted-by":"crossref","unstructured":"McGregor, A.: Finding graph matchings in data streams. In: Proceedings of the 9th Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM), pp. 170\u2013181 (2005)","DOI":"10.1007\/11538462_15"},{"key":"449_CR39","unstructured":"McGregor, A., Vorotnikova, S.: Planar matching in streams revisited. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2016, 7\u20139 September, 2016, Paris, France, pp. 17:1\u201317:12, (2016)"},{"key":"449_CR40","doi-asserted-by":"crossref","unstructured":"McGregor, A., Vorotnikova, S.: A simple, space-efficient, streaming algorithm for matchings in low arboricity graphs. In: 1st Symposium on Simplicity in Algorithms, SOSA 2018, 7\u201310 January, 2018, New Orleans, LA, USA, pp. 14:1\u201314:4 (2018)","DOI":"10.1145\/3230819"},{"key":"449_CR41","unstructured":"Monemizadeh, M., Muthukrishnan, S., Peng, P., Sohler, C.: Testable bounded degree graph properties are random order streamable. In: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, 10\u201314 July, 2017, Warsaw, Poland, pp. 131:1\u2013131:14 (2017)"},{"key":"449_CR42","doi-asserted-by":"crossref","unstructured":"Nguyen, H.N., and Onak, K.: Constant-time approximation algorithms via local improvements. In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, 25\u201328 October, 2008, Philadelphia, PA, USA, pp. 327\u2013336 (2008)","DOI":"10.1109\/FOCS.2008.81"},{"issue":"1","key":"449_CR43","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1137\/060658400","volume":"38","author":"A Pagh","year":"2008","unstructured":"Pagh, A., Pagh, R.: Uniform hashing in constant time and optimal space. SIAM J. Comput. 38(1), 85\u201396 (2008)","journal-title":"SIAM J. Comput."},{"key":"449_CR44","doi-asserted-by":"crossref","unstructured":"Paz, A., Schwartzman, G.: A (2+$$\\epsilon $$)-approximation for maximum weight matching in the semi-streaming model. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA vol. 2017, pp. 2153\u20132161 (2017)","DOI":"10.1137\/1.9781611974782.140"},{"issue":"4","key":"449_CR45","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/0196-6774(89)90005-9","volume":"10","author":"Michael O Rabin","year":"1989","unstructured":"Rabin, Michael O., Vazirani, Vijay V.: Maximum matchings in general graphs through randomization. J. Algorithms 10(4), 557\u2013567 (1989)","journal-title":"J. Algorithms"},{"key":"449_CR46","doi-asserted-by":"crossref","unstructured":"Sarl\u00f3s, T.: Improved approximation algorithms for large matrices via random projections. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 143\u2013152 (2006)","DOI":"10.1109\/FOCS.2006.37"},{"key":"449_CR47","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","volume":"22","author":"WT Tutte","year":"1947","unstructured":"Tutte, W.T.: The factorization of linear graphs. J. Lond. Math. Soc. 22, 107\u2013111 (1947)","journal-title":"J. Lond. Math. Soc."},{"issue":"1\u20132","key":"449_CR48","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0020-0190(00)00128-9","volume":"76","author":"R Uehara","year":"2000","unstructured":"Uehara, R., Chen, Z.-Z.: Parallel approximation algorithms for maximum weighted matching in general graphs. Inf. Process. Lett. 76(1\u20132), 13\u201317 (2000)","journal-title":"Inf. Process. Lett."},{"key":"449_CR49","doi-asserted-by":"crossref","unstructured":"Varadaraja, A.B.: Buyback problem\u2014approximate matroid intersection with cancellation costs. In: Automata, Languages and Programming\u201438th International Colloquium, ICALP 2011, Zurich, Switzerland, 4\u20138 July, 2011, Proceedings, Part I, pp. 379\u2013390 (2011)","DOI":"10.1007\/978-3-642-22006-7_32"},{"key":"449_CR50","doi-asserted-by":"crossref","unstructured":"Verbin, E., Yu, W.: The streaming complexity of cycle counting, sorting by reversals, and other problems. In: Proceedings of the 22th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 11\u201325 (2011)","DOI":"10.1137\/1.9781611973082.2"},{"issue":"1\u20132","key":"449_CR51","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-010-9438-5","volume":"62","author":"M Zelke","year":"2012","unstructured":"Zelke, M.: Weighted matching in the semi-streaming model. Algorithmica 62(1\u20132), 1\u201320 (2012)","journal-title":"Algorithmica"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-018-0449-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0449-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0449-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T06:32:10Z","timestamp":1589697130000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-018-0449-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,14]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["449"],"URL":"https:\/\/doi.org\/10.1007\/s00453-018-0449-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2018,5,14]]},"assertion":[{"value":"17 November 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 April 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}