{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T01:22:56Z","timestamp":1768353776834,"version":"3.49.0"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T00:00:00Z","timestamp":1603152000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2018YFB2100302"],"award-info":[{"award-number":["2018YFB2100302"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"name":"NSF China","award":[". 61822206, 61960206002, 61832013, 62041205, 61532012"],"award-info":[{"award-number":[". 61822206, 61960206002, 61832013, 62041205, 61532012"]}]},{"name":"Tencent AI Lab RhinoBird Focused Research Program","award":["JR202034"],"award-info":[{"award-number":["JR202034"]}]},{"name":"Medical Engineering Cross Fund of Shanghai Jiaotong University","award":["YG2020YQ16"],"award-info":[{"award-number":["YG2020YQ16"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Internet Technol."],"published-print":{"date-parts":[[2020,11,30]]},"abstract":"<jats:p>\n            Influence Maximization (IM) aims to maximize the number of people that become aware of a product by finding the \u201cbest\u201d set of \u201cseed\u201d users to initiate the product advertisement. Unlike most prior arts on the static networks containing fixed number of users, we study the\n            <jats:italic>evolving IM<\/jats:italic>\n            in more realistic evolving networks with temporally growing topology. The task of evolving IM, however, is far more challenging over static cases in the sense that the seed selection should consider its impact on future users who will join network during influence diffusion and the probabilities that users influence one another also evolve over time.\n          <\/jats:p>\n          <jats:p>\n            We address the challenges brought by network evolution through EIM, a newly proposed bandit-based framework that alternates between seed nodes selection and knowledge (i.e., nodes\u2019 growing speed and evolving activation probabilities) learning during network evolution. Remarkably, the EIM framework involves three novel components to handle the uncertainties brought by evolution: (1) A fully adaptive particle learning of nodes\u2019 growing speed for accurately estimating future influenced size, with real growing behaviors delineated by a set of weighted particles. (2) A bandit-based refining method with growing arms to cope with the evolving activation probabilities via growing edges from previous influence diffusion feedbacks. (3)\n            <jats:bold>Evo-IMM<\/jats:bold>\n            , an evolving seed selection algorithm, which leverages the Influence Maximization via Martingale (IMM) framework, with the objective to maximize the influence spread to highly attractive users during evolution. Theoretically, the EIM framework returns a regret bound that provably maintains its sublinearity with respect to the growing network size. Empirically, the effectiveness of the EIM framework is also validated with three notable million-scale evolving network datasets possessing complete social relationships and nodes\u2019 joining time. The results confirm the superiority of the EIM framework in terms of an up to 50% larger influenced size over four static baselines.\n          <\/jats:p>","DOI":"10.1145\/3409370","type":"journal-article","created":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T12:27:41Z","timestamp":1603196861000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Evolving Influence Maximization in Evolving Networks"],"prefix":"10.1145","volume":"20","author":[{"given":"Xudong","family":"Wu","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University, Minhang, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luoyi","family":"Fu","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Minhang, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zixin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Minhang, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huan","family":"Long","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Minhang, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingfan","family":"Meng","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Minhang, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinbing","family":"Wang","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Minhang, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guihai","family":"Chen","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Minhang, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,10,20]]},"reference":[{"key":"e_1_2_2_1_1","volume-title":"Proceedings of the ACM SocialSense. 6--11","author":"Wu X.","unstructured":"X. Wu , L. Fu , J. Meng , and X. Wang . 2019. Maximizing influence diffusion over evolving social networks . In Proceedings of the ACM SocialSense. 6--11 . X. Wu, L. Fu, J. Meng, and X. Wang. 2019. Maximizing influence diffusion over evolving social networks. In Proceedings of the ACM SocialSense. 6--11."},{"key":"e_1_2_2_2_1","volume-title":"Proceedings of the ACM SIGKDD. 636--646","author":"Wu Q.","unstructured":"Q. Wu , Z. Li , H. Wang , W. Chen , and H. Wang . 2019. Factorization bandits for online influence maximization . In Proceedings of the ACM SIGKDD. 636--646 . Q. Wu, Z. Li, H. Wang, W. Chen, and H. Wang. 2019. Factorization bandits for online influence maximization. In Proceedings of the ACM SIGKDD. 636--646."},{"key":"e_1_2_2_3_1","volume-title":"Proceedings of the IEEE ICDE. 883--894","author":"Lin Y.","unstructured":"Y. Lin , W. Chen , and J. C. Lui . 2017. Boosting information spread: An algorithmic approach . In Proceedings of the IEEE ICDE. 883--894 . Y. Lin, W. Chen, and J. C. Lui. 2017. Boosting information spread: An algorithmic approach. In Proceedings of the IEEE ICDE. 883--894."},{"key":"e_1_2_2_4_1","volume-title":"Proceedings of the ACM MobiHoc. 121--130","author":"Han K.","unstructured":"K. Han , C. Xu , F. Gui , S. Tang , H. Huang , and J. Luo . 2018. Discount allocation for revenue maximization in online social networks . In Proceedings of the ACM MobiHoc. 121--130 . K. Han, C. Xu, F. Gui, S. Tang, H. Huang, and J. Luo. 2018. Discount allocation for revenue maximization in online social networks. In Proceedings of the ACM MobiHoc. 121--130."},{"key":"e_1_2_2_5_1","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1109\/TNET.2016.2563397","article-title":"Adaptive influence maximization in dynamic social networks","volume":"25","author":"Tong G.","year":"2016","unstructured":"G. Tong , W. Wu , S. Tang , and D. Du . 2016 . Adaptive influence maximization in dynamic social networks . IEEE\/ACM Trans. Netw. 25 , 1 (2016), 112 -- 125 . G. Tong, W. Wu, S. Tang, and D. Du. 2016. Adaptive influence maximization in dynamic social networks. IEEE\/ACM Trans. Netw. 25, 1 (2016), 112--125.","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"e_1_2_2_6_1","volume-title":"Proceedings of the ACM MobiHoc. 1--10","author":"Yuan J.","unstructured":"J. Yuan and S. J. Tang . 2017. Adaptive discount allocation in social networks . In Proceedings of the ACM MobiHoc. 1--10 . J. Yuan and S. J. Tang. 2017. Adaptive discount allocation in social networks. In Proceedings of the ACM MobiHoc. 1--10."},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2879437"},{"key":"e_1_2_2_8_1","volume-title":"Proceedings of the ACM SIGMOD. 1539--1554","author":"Tang Y.","unstructured":"Y. Tang , Y. Shi , and X. Xiao . 2015. Influence maximization in near-linear time: A martingale approach . In Proceedings of the ACM SIGMOD. 1539--1554 . Y. Tang, Y. Shi, and X. Xiao. 2015. Influence maximization in near-linear time: A martingale approach. In Proceedings of the ACM SIGMOD. 1539--1554."},{"key":"e_1_2_2_9_1","volume-title":"Proceedings of the IEEE ICDM. 1313--1318","author":"Zhuang H.","unstructured":"H. Zhuang , Y. Sun , J. Tang , J. Zhang , and X. Sun . 2013. Influence maximization in dynamic social networks . In Proceedings of the IEEE ICDM. 1313--1318 . H. Zhuang, Y. Sun, J. Tang, J. Zhang, and X. Sun. 2013. Influence maximization in dynamic social networks. In Proceedings of the IEEE ICDM. 1313--1318."},{"key":"e_1_2_2_10_1","volume-title":"Proceedings of the ACM SIGKDD. 645--654","author":"Lei S.","unstructured":"S. Lei , S. Maniu , L. Mo , R. Cheng , and P. Senellart . 2015. Online influence maximization . In Proceedings of the ACM SIGKDD. 645--654 . S. Lei, S. Maniu, L. Mo, R. Cheng, and P. Senellart. 2015. Online influence maximization. In Proceedings of the ACM SIGKDD. 645--654."},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3193180"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_2_2_13_1","first-page":"1","article-title":"Outward influence and cascade size estimation in billion-scale networks","volume":"1","author":"Nguyen H. T.","year":"2017","unstructured":"H. T. Nguyen , T. P. Nguyen , T. N. Vu , and T. N. Dinh . 2017 . Outward influence and cascade size estimation in billion-scale networks . In Proceedings of the ACM Sigmetrics. 1 , 1 (2017), 1 -- 30 . H. T. Nguyen, T. P. Nguyen, T. N. Vu, and T. N. Dinh. 2017. Outward influence and cascade size estimation in billion-scale networks. In Proceedings of the ACM Sigmetrics. 1, 1 (2017), 1--30.","journal-title":"Proceedings of the ACM Sigmetrics."},{"key":"e_1_2_2_14_1","volume-title":"Proceedings of the ACM SIGMOD. 75--86","author":"Tang Y.","unstructured":"Y. Tang , X. Xiao , and Y. Shi . 2014. Influence maximization: Near-optimal time complexity meets practical efficiency . In Proceedings of the ACM SIGMOD. 75--86 . Y. Tang, X. Xiao, and Y. Shi. 2014. Influence maximization: Near-optimal time complexity meets practical efficiency. In Proceedings of the ACM SIGMOD. 75--86."},{"key":"e_1_2_2_15_1","volume-title":"Proceedings of the ACM CIKM. 629--638","author":"Cohen E.","unstructured":"E. Cohen , D. Delling , T. Pajor , and R. F. Werneck . 2014. Sketch-based influence maximization and computation: Scaling up with guarantees . In Proceedings of the ACM CIKM. 629--638 . E. Cohen, D. Delling, T. Pajor, and R. F. Werneck. 2014. Sketch-based influence maximization and computation: Scaling up with guarantees. In Proceedings of the ACM CIKM. 629--638."},{"key":"e_1_2_2_16_1","unstructured":"Wechat. 2017. Retrieved from http:\/\/www.wechat.com\/en\/.  Wechat. 2017. Retrieved from http:\/\/www.wechat.com\/en\/."},{"key":"e_1_2_2_17_1","volume-title":"Proceedings of the ACM SIGKDD. 2015--2024","author":"Zang C.","unstructured":"C. Zang , P. Cui , and C. Faloutsos . 2016. Beyond sigmoids: The NetTide model for social network growth, and its applications . In Proceedings of the ACM SIGKDD. 2015--2024 . C. Zang, P. Cui, and C. Faloutsos. 2016. Beyond sigmoids: The NetTide model for social network growth, and its applications. In Proceedings of the ACM SIGKDD. 2015--2024."},{"key":"e_1_2_2_18_1","unstructured":"H. Li S. Bhowmick J. Cui and J. Ma. 2017. Time is what prevents everything from happening at once: Propagation time-conscious influence maximization. arXiv preprint arXiv:1705.10977 (2017).  H. Li S. Bhowmick J. Cui and J. Ma. 2017. Time is what prevents everything from happening at once: Propagation time-conscious influence maximization. arXiv preprint arXiv:1705.10977 (2017)."},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.103.038702"},{"key":"e_1_2_2_20_1","volume-title":"Proceedings of the ACM COSN. 125--135","author":"Gayraud N. T.","unstructured":"N. T. Gayraud , E. Pitoura , and P. Tsaparas . 2015. Diffusion maximization in evolving social networks . In Proceedings of the ACM COSN. 125--135 . N. T. Gayraud, E. Pitoura, and P. Tsaparas. 2015. Diffusion maximization in evolving social networks. In Proceedings of the ACM COSN. 125--135."},{"key":"e_1_2_2_21_1","volume-title":"Proceedings of the NIPS. 3022--3032","author":"Wen Z.","unstructured":"Z. Wen , B. Kveton , M. Valko , and S. Vaswani . 2017. Online influence maximization under independent cascade model with semi-bandit feedback . In Proceedings of the NIPS. 3022--3032 . Z. Wen, B. Kveton, M. Valko, and S. Vaswani. 2017. Online influence maximization under independent cascade model with semi-bandit feedback. In Proceedings of the NIPS. 3022--3032."},{"key":"e_1_2_2_22_1","volume-title":"Proceedings of the IEEE\/ACM IWQoS. 1--6.","author":"Bao Y.","unstructured":"Y. Bao , X. Wang , Z. Wang , C. Wu , and F. C. Lau . 2016. Online influence maximization in non-stationary social networks . In Proceedings of the IEEE\/ACM IWQoS. 1--6. Y. Bao, X. Wang, Z. Wang, C. Wu, and F. C. Lau. 2016. Online influence maximization in non-stationary social networks. In Proceedings of the IEEE\/ACM IWQoS. 1--6."},{"key":"e_1_2_2_23_1","volume-title":"Proceedings of the ACM SIGMOD. 727--741","author":"Yang Y.","unstructured":"Y. Yang , X. Mao , J. Pei , and X. He . 2016. Continuous influence maximization: What discounts should we offer to social network users? In Proceedings of the ACM SIGMOD. 727--741 . Y. Yang, X. Mao, J. Pei, and X. He. 2016. Continuous influence maximization: What discounts should we offer to social network users? In Proceedings of the ACM SIGMOD. 727--741."},{"key":"e_1_2_2_24_1","volume-title":"Proceedings of the IEEE\/ACM ASONAM. 1242--1249","author":"Jankowski J.","unstructured":"J. Jankowski , R. Michalski , and P. Kazienko . 2013. Compensatory seeding in networks with varying avaliability of nodes . In Proceedings of the IEEE\/ACM ASONAM. 1242--1249 . J. Jankowski, R. Michalski, and P. Kazienko. 2013. Compensatory seeding in networks with varying avaliability of nodes. In Proceedings of the IEEE\/ACM ASONAM. 1242--1249."},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00354-014-0402-9"},{"key":"e_1_2_2_26_1","volume-title":"Proceedings of the ACM SIGKDD. 2249--2258","author":"Sun L.","unstructured":"L. Sun , W. Huang , P. S. Yu , and W. Chen . 2018. Multi-round influence maximization . In Proceedings of the ACM SIGKDD. 2249--2258 . L. Sun, W. Huang, P. S. Yu, and W. Chen. 2018. Multi-round influence maximization. In Proceedings of the ACM SIGKDD. 2249--2258."},{"key":"e_1_2_2_27_1","volume-title":"Proceedings of the ACM SIGKDD. 695--704","author":"Lin S. C.","unstructured":"S. C. Lin , S. D. , Lin , and M. S. Chen . 2015. A learning-based framework to handle multi-round multi-party influence maximization on social networks . In Proceedings of the ACM SIGKDD. 695--704 . S. C. Lin, S. D., Lin, and M. S. Chen. 2015. A learning-based framework to handle multi-round multi-party influence maximization on social networks. In Proceedings of the ACM SIGKDD. 695--704."},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"e_1_2_2_29_1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s00493-004-0002-2","article-title":"The diameter of a scale-free random graph","volume":"24","author":"Bollob\u00e1s B.","year":"2004","unstructured":"B. Bollob\u00e1s and O. Riordan . 2004 . The diameter of a scale-free random graph . In Combinatorica , 24 , 1 (2004), 5 -- 34 . B. Bollob\u00e1s and O. Riordan. 2004. The diameter of a scale-free random graph. In Combinatorica, 24, 1 (2004), 5--34.","journal-title":"Combinatorica"},{"key":"e_1_2_2_30_1","volume-title":"Proceedings of the ACM SIGKDD. 565--574","author":"Zang C.","unstructured":"C. Zang , P. Cui , C. Faloutsos , and W. Zhu . 2017. Long short memory process: Modeling growth dynamics of microscopic social connectivity . In Proceedings of the ACM SIGKDD. 565--574 . C. Zang, P. Cui, C. Faloutsos, and W. Zhu. 2017. Long short memory process: Modeling growth dynamics of microscopic social connectivity. In Proceedings of the ACM SIGKDD. 565--574."},{"key":"e_1_2_2_31_1","volume-title":"Proceedings of the NIPS. 1741--1749","author":"Myers S. A.","unstructured":"S. A. Myers and J. Leskovec . 2010. On the convexity of latent social network inference . In Proceedings of the NIPS. 1741--1749 . S. A. Myers and J. Leskovec. 2010. On the convexity of latent social network inference. In Proceedings of the NIPS. 1741--1749."},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2086737.2086741"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms5323"},{"key":"e_1_2_2_34_1","volume-title":"Proceedings of the IEEE\/ACM ASONAM. 178--185","author":"Lamprier S.","unstructured":"S. Lamprier , S. Bourigault , and P. Gallinari . 2015. Extracting diffusion channels from real-world social data: A delay-agnostic learning of transmission probabilities . In Proceedings of the IEEE\/ACM ASONAM. 178--185 . S. Lamprier, S. Bourigault, and P. Gallinari. 2015. Extracting diffusion channels from real-world social data: A delay-agnostic learning of transmission probabilities. In Proceedings of the IEEE\/ACM ASONAM. 178--185."},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1009094108"},{"key":"e_1_2_2_36_1","volume-title":"Proceedings of the ACM SIGKDD. 2025--2034","author":"Zeng C.","unstructured":"C. Zeng , Q. Wang , S. Mokhtari , and T. Li . 2016. Online context-aware recommendation with time varying multi-armed bandit . In Proceedings of the ACM SIGKDD. 2025--2034 . C. Zeng, Q. Wang, S. Mokhtari, and T. Li. 2016. Online context-aware recommendation with time varying multi-armed bandit. In Proceedings of the ACM SIGKDD. 2025--2034."},{"key":"e_1_2_2_37_1","volume-title":"Structural Time Series Models and the Kalman Filter","author":"Harvey A. C.","unstructured":"A. C. Harvey . 1990. Forecasting , Structural Time Series Models and the Kalman Filter . Cambridge University Press . A. C. Harvey. 1990. Forecasting, Structural Time Series Models and the Kalman Filter. Cambridge University Press."},{"key":"e_1_2_2_38_1","volume-title":"Proceedings of the ACM ICML. 151--159","author":"Chen W.","unstructured":"W. Chen , Y. Wang , and Y. Yuan . 2013. Combinatorial multi-armed bandit: General framework and applications . In Proceedings of the ACM ICML. 151--159 . W. Chen, Y. Wang, and Y. Yuan. 2013. Combinatorial multi-armed bandit: General framework and applications. In Proceedings of the ACM ICML. 151--159."},{"key":"e_1_2_2_39_1","volume-title":"Proceedings of the ACM SIGKDD. 1029--1038","author":"Chen W.","unstructured":"W. Chen , C. Wang , and Y. Wang . 2010. Scalable influence maximization for prevalent viral marketing in large-scale social networks . In Proceedings of the ACM SIGKDD. 1029--1038 . W. Chen, C. Wang, and Y. Wang. 2010. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In Proceedings of the ACM SIGKDD. 1029--1038."},{"key":"e_1_2_2_40_1","unstructured":"P. Rigollet and J. C. H\u00fctter. 2019. High dimensional statistics: Lecture notes. Retrieved from http:\/\/www-math.mit.edu\/rigollet\/PDFs\/RigNotes17.pdf.  P. Rigollet and J. C. H\u00fctter. 2019. High dimensional statistics: Lecture notes. Retrieved from http:\/\/www-math.mit.edu\/rigollet\/PDFs\/RigNotes17.pdf."},{"key":"e_1_2_2_41_1","unstructured":"Microsoft Academic Graph. 2016. Retrieved from https:\/\/www.microsoft.com\/en-us\/research\/project\/microsoft-academic-graph\/.  Microsoft Academic Graph. 2016. Retrieved from https:\/\/www.microsoft.com\/en-us\/research\/project\/microsoft-academic-graph\/."},{"key":"e_1_2_2_42_1","unstructured":"Xudong Wu Luoyi Fu Zixin Zhang Huang Long Jingfan Meng Xinbing Wang and Guihai Chen. 2019. Supplementary Material. Retrieved from http:\/\/www.cs.sjtu.edu.cn\/fu-ly\/paper\/EIMfull_ACM_Tran_supp.pdf.  Xudong Wu Luoyi Fu Zixin Zhang Huang Long Jingfan Meng Xinbing Wang and Guihai Chen. 2019. Supplementary Material. Retrieved from http:\/\/www.cs.sjtu.edu.cn\/fu-ly\/paper\/EIMfull_ACM_Tran_supp.pdf."}],"container-title":["ACM Transactions on Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409370","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3409370","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:40Z","timestamp":1750199920000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409370"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,20]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,11,30]]}},"alternative-id":["10.1145\/3409370"],"URL":"https:\/\/doi.org\/10.1145\/3409370","relation":{},"ISSN":["1533-5399","1557-6051"],"issn-type":[{"value":"1533-5399","type":"print"},{"value":"1557-6051","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,20]]},"assertion":[{"value":"2019-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-10-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}