{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T02:58:01Z","timestamp":1781751481250,"version":"3.54.5"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,6,12]],"date-time":"2021-06-12T00:00:00Z","timestamp":1623456000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,12]],"date-time":"2021-06-12T00:00:00Z","timestamp":1623456000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s00778-021-00679-0","type":"journal-article","created":{"date-parts":[[2021,6,12]],"date-time":"2021-06-12T16:02:37Z","timestamp":1623513757000},"page":"403-429","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A fractional memory-efficient approach for online continuous-time influence maximization"],"prefix":"10.1007","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8818-3758","authenticated-orcid":false,"given":"Glenn S.","family":"Bevilacqua","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Laks V. S.","family":"Lakshmanan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,6,12]]},"reference":[{"issue":"3","key":"679_CR1","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1023\/B:JOCO.0000038913.96607.c2","volume":"8","author":"A Ageev","year":"2004","unstructured":"Ageev, A., Sviridenko, M.: Pipage rounding: a new method of constructing algorithms with proven performance guarantee. J. Comb. Optim. 8(3), 307\u2013328 (2004)","journal-title":"J. Comb. Optim."},{"key":"679_CR2","doi-asserted-by":"crossref","unstructured":"Arora, A., Galhotra, S., Ranu, S.: Debunking the myths of influence maximization: an in-depth benchmarking study. In: SIGMOD, pp. 651\u2013666 (2017)","DOI":"10.1145\/3218967"},{"key":"679_CR3","doi-asserted-by":"crossref","unstructured":"Badanidiyuru, A., Mirzasoleiman, B., Karbasi, A., Krause, A.: Streaming submodular maximization: massive data summarization on the fly. In: KDD, pp. 671\u2013680 (2014)","DOI":"10.1145\/2623330.2623637"},{"key":"679_CR4","doi-asserted-by":"crossref","unstructured":"Bateni, M., Esfandiari, H., Mirrokni, V.: Almost optimal streaming algorithms for coverage problems. In: SPAA, pp. 13\u201323 (2017)","DOI":"10.1145\/3087556.3087585"},{"key":"679_CR5","doi-asserted-by":"crossref","unstructured":"Borgs, C., Brautbar, M., Chayes, J., Lucier, B.: Maximizing social influence in nearly optimal time. In: SODA, pp. 946\u2013957 (2014)","DOI":"10.1137\/1.9781611973402.70"},{"key":"679_CR6","volume-title":"Statistical Models in Applied Science","author":"KV Bury","year":"1975","unstructured":"Bury, K.V.: Statistical Models in Applied Science. Wiley, London (1975)"},{"key":"679_CR7","doi-asserted-by":"crossref","unstructured":"Calinescu, G., Chekuri, C., P\u00e1l, M., Vondr\u00e1k, J.: Maximizing a submodular set function subject to a matroid constraint (extended abstract). In: IPCO, pp. 182\u2013196 (2007)","DOI":"10.1007\/978-3-540-72792-7_15"},{"key":"679_CR8","doi-asserted-by":"crossref","unstructured":"Chakrabarti, A., Wirth, A.: Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover, pp. 1365\u20131373 (2016)","DOI":"10.1137\/1.9781611974331.ch94"},{"key":"679_CR9","unstructured":"Chen, L., Hassani, H., Karbasi, A.: Online continuous submodular maximization. In: AISTATS, vol. 84, pp. 1896\u20131905 (2018)"},{"key":"679_CR10","doi-asserted-by":"crossref","unstructured":"Chen, W.: An issue in the martingale analysis of the influence maximization algorithm imm. In: Computational Data and Social Networks, pp. 286\u2013297 (2018)","DOI":"10.1007\/978-3-030-04648-4_24"},{"key":"679_CR11","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: KDD, pp. 1029\u20131038 (2010)","DOI":"10.1145\/1835804.1835934"},{"key":"679_CR12","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: KDD, pp. 199\u2013208 (2009)","DOI":"10.1145\/1557019.1557047"},{"key":"679_CR13","doi-asserted-by":"crossref","unstructured":"Chen, W., Yuan, Y., Zhang, L.: Scalable influence maximization in social networks under the linear threshold model. In: ICDM, pp. 88\u201397 (2010)","DOI":"10.1109\/ICDM.2010.118"},{"key":"679_CR14","doi-asserted-by":"crossref","unstructured":"Cheng, S., Shen, H., Huang, J., Chen, W., Cheng, X.: Imrank: influence maximization via finding self-consistent ranking. In: SIGIR, p. 475\u2013484 (2014)","DOI":"10.1145\/2600428.2609592"},{"key":"679_CR15","doi-asserted-by":"crossref","unstructured":"Cohen, E., Delling, D., Pajor, T., Werneck, R.F.: Sketch-based influence maximization and computation: scaling up with guarantees. In: CIKM, pp. 629\u2013638 (2014)","DOI":"10.1145\/2661829.2662077"},{"issue":"5","key":"679_CR16","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539797315306","volume":"29","author":"P Dagum","year":"2000","unstructured":"Dagum, P., Karp, R., Luby, M., Ross, S.: An optimal algorithm for monte Carlo estimation. SIAM J. Comput. 29(5), 1484\u20131496 (2000)","journal-title":"SIAM J. Comput."},{"key":"679_CR17","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Indyk, P., Mahabadi, S., Vakilian, A.: On streaming and communication complexity of the set cover problem. In: Discrete Computation, pp. 484\u2013498 (2014)","DOI":"10.1007\/978-3-662-45174-8_33"},{"key":"679_CR18","doi-asserted-by":"crossref","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: KDD, pp. 57\u201366 (2001)","DOI":"10.1145\/502512.502525"},{"key":"679_CR19","unstructured":"Du, N., Song, L., Gomez\u00a0Rodriguez, M., Zha, H.: Scalable influence estimation in continuous-time diffusion networks. In: NeurIPS, pp. 3147\u20133155. Curran Associates, Inc. (2013)"},{"key":"679_CR20","unstructured":"Du, N., Song, L., Yuan, M., Smola, A.J.: Learning networks of heterogeneous influence. In: NeurIPS, pp. 2780\u20132788. Curran Associates, Inc. (2012)"},{"issue":"2","key":"679_CR21","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1137\/110831659","volume":"22","author":"JC Duchi","year":"2012","unstructured":"Duchi, J.C., Bartlett, P.L., Wainwright, M.J.: Randomized smoothing for stochastic optimization. SIAM J. Optim. 22(2), 674\u2013701 (2012)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"679_CR22","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"679_CR23","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. Naval Res. Logist. Quart. 3, 95\u2013110 (1956)","journal-title":"Naval Res. Logist. Quart."},{"key":"679_CR24","doi-asserted-by":"crossref","unstructured":"Galhotra, S., Arora, A., Roy, S.: Holistic influence maximization: combining scalability and efficiency with opinion-aware models. In: SIGMOD, pp. 743\u2013758 (2016)","DOI":"10.1145\/2882903.2882929"},{"key":"679_CR25","doi-asserted-by":"crossref","unstructured":"Gibbs, D.L., Shmulevich, I.: Solving the influence maximization problem reveals regulatory organization of the yeast cell cycle. PLOS Comput. Biol. (2017)","DOI":"10.1101\/075069"},{"key":"679_CR26","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1137\/S0895480192243516","volume":"7","author":"MX Goemans","year":"1994","unstructured":"Goemans, M.X., Williamson, D.P.: New 3\/4-approximation algorithms for max sat. SIAM J. Discrete Math. 7, 313\u2013321 (1994)","journal-title":"SIAM J. Discrete Math."},{"key":"679_CR27","unstructured":"Goldenberg, J., Libai, B.: Muller: using complex systems analysis to advance marketing theory development. Acad. Market. Sci. Rev. (2001)"},{"issue":"3","key":"679_CR28","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1011122126881","volume":"12","author":"J Goldenberg","year":"2001","unstructured":"Goldenberg, J., Libai, B., Muller, E.: Talk of the network: a complex systems look at the underlying process of word-of-mouth. Market. Lett. 12(3), 211\u2013223 (2001)","journal-title":"Market. Lett."},{"key":"679_CR29","unstructured":"Gomez-Rodriguez, M., Balduzzi, D., Sch\u00f6lkopf, B.: Uncovering the temporal dynamics of diffusion networks. In: ICML, pp. 561\u2013568 (2011)"},{"key":"679_CR30","unstructured":"Gomez-Rodriguez, M., Leskovec, J., Sch\u00f6lkopf, B.: Modeling information propagation with survival theory. In: ICML, pp. III\u2013666\u2013III\u2013674 (2013)"},{"key":"679_CR31","doi-asserted-by":"crossref","unstructured":"Gomez\u00a0Rodriguez, M., Leskovec, J., Sch\u00f6lkopf, B.: Structure and dynamics of information pathways in online media. In: WSDM, pp. 23\u201332 (2013)","DOI":"10.1145\/2433396.2433402"},{"key":"679_CR32","doi-asserted-by":"crossref","unstructured":"Goyal, A., Lu, W., Lakshmanan, L.V.S.: Simpath: an efficient algorithm for influence maximization under the linear threshold model. In: ICDM, pp. 211\u2013220 (2011)","DOI":"10.1109\/ICDM.2011.132"},{"issue":"6","key":"679_CR33","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1086\/226707","volume":"83","author":"M Granovetter","year":"1978","unstructured":"Granovetter, M.: Threshold models of collective behavior. Am. J. Soc. 83(6), 1420\u20131443 (1978)","journal-title":"Am. J. Soc."},{"key":"679_CR34","doi-asserted-by":"crossref","unstructured":"Guo, Q., Wang, S., Wei, Z., Chen, M.: Influence maximization revisited: efficient reverse reachable set generation with bound tightened. In: SIGMOD, pp. 2167\u20132181 (2020)","DOI":"10.1145\/3318464.3389740"},{"key":"679_CR35","doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Indyk, P., Mahabadi, S., Vakilian, A.: Towards tight bounds for the streaming set cover problem. In: PODS, pp. 371\u2013383 (2016)","DOI":"10.1145\/2902251.2902287"},{"issue":"9","key":"679_CR36","first-page":"913","volume":"10","author":"K Huang","year":"2017","unstructured":"Huang, K., Wang, S., Bevilacqua, G.S., Xiao, X., Lakshmanan, L.V.S.: Revisiting the stop-and-stare algorithms for influence maximization. PVLDB 10(9), 913\u2013924 (2017)","journal-title":"PVLDB"},{"key":"679_CR37","doi-asserted-by":"crossref","unstructured":"Ienco, D., Bonchi, F., Castillo, C.: The meme ranking problem: maximizing microblogging virality. In: ICDMW, pp. 328\u2013335 (2010)","DOI":"10.1109\/ICDMW.2010.127"},{"key":"679_CR38","first-page":"427","volume":"28","author":"M Jaggi","year":"2013","unstructured":"Jaggi, M.: Revisiting Frank-Wolfe: projection-free sparse convex optimization. ICML 28, 427\u2013435 (2013)","journal-title":"ICML"},{"key":"679_CR39","doi-asserted-by":"crossref","unstructured":"Jung, K., Heo, W., Chen, W.: IRIE: scalable and robust influence maximization in social networks. In: ICDM, pp. 918\u2013923 (2012)","DOI":"10.1109\/ICDM.2012.79"},{"key":"679_CR40","unstructured":"Karimi, M., Lucic, M., Hassani, H., Krause, A.: Stochastic submodular maximization: the case of coverage functions. In: NeurIPS, pp. 6853\u20136863. Curran Associates, Inc. (2017)"},{"key":"679_CR41","volume-title":"Mathematical Methods and Theory in Games, Programming, and Economics","author":"S Karlin","year":"1959","unstructured":"Karlin, S.: Mathematical Methods and Theory in Games, Programming, and Economics. Addison-Wesley, Reading (1959)"},{"key":"679_CR42","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: KDD, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"679_CR43","doi-asserted-by":"crossref","unstructured":"Kwak, H., Lee, C., Park, H., Moon, S.: What is twitter, a social network or a news media? http:\/\/an.kaist.ac.kr\/traces\/WWW2010.html (2010)","DOI":"10.1145\/1772690.1772751"},{"key":"679_CR44","doi-asserted-by":"crossref","unstructured":"Lee, D., Hosanagar, K., Nair, H.: Advertising content and consumer engagement on social media: evidence from facebook. Manag. Sci. 64 (2018)","DOI":"10.2139\/ssrn.2290802"},{"key":"679_CR45","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., Faloutsos, C., Van Briesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: KDD, pp. 420\u2013429 (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"679_CR46","unstructured":"Leskovec, J., Krevl, A.: SNAP datasets: stanford large network dataset collection. http:\/\/snap.stanford.edu\/data (2014)"},{"key":"679_CR47","doi-asserted-by":"crossref","unstructured":"Li, X., Smith, J.D., Dinh, T.N., Thai, M.T.: Why approximate when you can get the exact? Optimal targeted viral marketing at scale. In: INFOCOM, pp. 1\u20139 (2017)","DOI":"10.1109\/INFOCOM.2017.8057069"},{"key":"679_CR48","doi-asserted-by":"crossref","unstructured":"Li, Y., Fan, J., Zhang, D., Tan, K.L.: Discovering your selling points: personalized social influential tags exploration. In: SIGMOD, pp. 619\u2013634 (2017)","DOI":"10.1145\/3035918.3035952"},{"key":"679_CR49","volume-title":"Probabilistic Methods for Algorithmic Discrete Mathematics","author":"C McDiarmid","year":"1998","unstructured":"McDiarmid, C.: Concentration. In: Habib, M., McDiarmid, C., Ramirez-Alfonsin, J., Reed, B. (eds.) Probabilistic Methods for Algorithmic Discrete Mathematics. Springer, New York (1998)"},{"key":"679_CR50","first-page":"1886","volume":"84","author":"A Mokhtari","year":"2018","unstructured":"Mokhtari, A., Hassani, H., Karbasi, A.: Conditional gradient method for stochastic submodular maximization: closing the gap. AISTATS 84, 1886\u20131895 (2018)","journal-title":"AISTATS"},{"issue":"2","key":"679_CR51","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1561\/0400000002","volume":"1","author":"S Muthukrishnan","year":"2005","unstructured":"Muthukrishnan, S.: Data streams: algorithms and applications. Found. Trends Theor. Comput. Sci. 1(2), 117\u2013236 (2005)","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"679_CR52","doi-asserted-by":"crossref","unstructured":"Nguyen, H., Nguyen, T., Phan, N.H., Dinh, T.: Importance sketching of influence dynamics in billion-scale networks. In: ICDM, pp. 337\u2013346 (2017)","DOI":"10.1109\/ICDM.2017.43"},{"key":"679_CR53","doi-asserted-by":"crossref","unstructured":"Nguyen, H.T., Thai, M.T., Dinh, T.N.: Stop-and-stare: Optimal sampling algorithms for viral marketing in billion-scale networks. In: SIGMOD, pp. 695\u2013710 (2016)","DOI":"10.1145\/2882903.2915207"},{"key":"679_CR54","doi-asserted-by":"crossref","unstructured":"Ohsaka, N.: The solution distribution of influence maximization: a high-level experimental study on three algorithmic approaches. In: SIGMOD, pp. 2151\u20132166 (2020)","DOI":"10.1145\/3318464.3380564"},{"key":"679_CR55","doi-asserted-by":"crossref","unstructured":"Ohsaka, N., Akiba, T., Yoshida, Y., Kawarabayashi, K.I.: Fast and accurate influence maximization on large networks with pruned monte-carlo simulations. In: AAAI, pp. 138\u2013144 (2014)","DOI":"10.1609\/aaai.v28i1.8726"},{"key":"679_CR56","doi-asserted-by":"crossref","unstructured":"Ohsaka, N., Sonobe, T., Fujita, S., Kawarabayashi, K.I.: Coarsening massive influence networks for scalable diffusion analysis. In: SIGMOD, pp. 635\u2013650 (2017)","DOI":"10.1145\/3035918.3064045"},{"key":"679_CR57","doi-asserted-by":"crossref","unstructured":"Popova, D., Ohsaka, N., Kawarabayashi, K.i., Thomo, A.: Nosingles: a space-efficient algorithm for influence maximization. In: SSDBM, pp. 18:1\u201318:12 (2018)","DOI":"10.1145\/3221269.3221291"},{"key":"679_CR58","doi-asserted-by":"crossref","unstructured":"Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: KDD, pp. 61\u201370 (2002)","DOI":"10.1145\/775047.775057"},{"key":"679_CR59","doi-asserted-by":"crossref","unstructured":"Saha, B., Getoor, L.: On maximum coverage in the streaming model & application to multi-topic blog-watch. In: SDM, pp. 697\u2013708 (2009)","DOI":"10.1137\/1.9781611972795.60"},{"issue":"4","key":"679_CR60","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1002\/cpa.3160110408","volume":"11","author":"HN Shapiro","year":"1958","unstructured":"Shapiro, H.N.: Note on a computation method in the theory of games. Commun. Pure Appl. Math. 11(4), 587\u2013593 (1958)","journal-title":"Commun. Pure Appl. Math."},{"key":"679_CR61","unstructured":"Shewan, D.: The comprehensive guide to online advertising costs. https:\/\/www.wordstream.com\/blog\/ws\/2017\/07\/05\/online-advertising-costs (2020)"},{"key":"679_CR62","doi-asserted-by":"crossref","unstructured":"Song, X., Chi, Y., Hino, K., Tseng, B.L.: Information flow modeling based on diffusion rate for prediction and ranking. In: WWW, pp. 191\u2013200 (2007)","DOI":"10.1145\/1242572.1242599"},{"key":"679_CR63","doi-asserted-by":"crossref","unstructured":"Tang, J., Tang, X., Xiao, X., Yuan, J.: Online processing algorithms for influence maximization. In: SIGMOD, pp. 991\u20131005 (2018)","DOI":"10.1145\/3183713.3183749"},{"key":"679_CR64","doi-asserted-by":"crossref","unstructured":"Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: a martingale approach. In: SIGMOD, pp. 1539\u20131554 (2015)","DOI":"10.1145\/2723372.2723734"},{"key":"679_CR65","doi-asserted-by":"crossref","unstructured":"Tang, Y., Xiao, X., Shi, Y.: Influence maximization: near-optimal time complexity meets practical efficiency. In: SIGMOD, pp. 75\u201386 (2014)","DOI":"10.1145\/2588555.2593670"},{"key":"679_CR66","doi-asserted-by":"crossref","unstructured":"Wang, C., Chen, W., Wang, Y.: Scalable influence maximization for independent cascade model in large-scale social networks. Data Min. Knowl. Disc. 25(3), 545\u2013576 (2012)","DOI":"10.1007\/s10618-012-0262-1"},{"key":"679_CR67","doi-asserted-by":"publisher","first-page":"849","DOI":"10.25300\/MISQ\/2016\/40.4.03","volume":"40","author":"K Zhang","year":"2016","unstructured":"Zhang, K., Bhattacharyya, S., Ram, S.: Large-scale network analysis for online social brand advertising. MIS Q. 40, 849\u2013868 (2016)","journal-title":"MIS Q."},{"key":"679_CR68","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s11129-010-9093-9","volume":"9","author":"PP Zubcsek","year":"2011","unstructured":"Zubcsek, P.P., Sarvary, M.: Advertising to a social network. Quant. Market. Econ. 9, 71\u2013107 (2011)","journal-title":"Quant. Market. Econ."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-021-00679-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-021-00679-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-021-00679-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T22:57:24Z","timestamp":1672441044000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-021-00679-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,12]]},"references-count":68,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["679"],"URL":"https:\/\/doi.org\/10.1007\/s00778-021-00679-0","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,12]]},"assertion":[{"value":"14 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}