{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T12:37:15Z","timestamp":1777379835234,"version":"3.51.4"},"reference-count":51,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2020,4,18]],"date-time":"2020-04-18T00:00:00Z","timestamp":1587168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61672528, 61773392, and 61671463"],"award-info":[{"award-number":["61672528, 61773392, and 61671463"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Key R 8 D Program of China","award":["2018YFB1003203"],"award-info":[{"award-number":["2018YFB1003203"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2020,6,30]]},"abstract":"<jats:p>\n            As a metric to measure the performance of an online method, dynamic regret with switching cost has drawn much attention for online decision making problems. Although the sublinear regret has been provided in much previous research, we still have little knowledge about the relation between the\n            <jats:italic>dynamic regret<\/jats:italic>\n            and the\n            <jats:italic>switching cost<\/jats:italic>\n            . In the article, we investigate the relation for two classic online settings: Online Algorithms (OA) and Online Convex Optimization (OCO). We provide a new theoretical analysis framework that shows an interesting observation; that is, the relation between the switching cost and the dynamic regret is different for settings of OA and OCO. Specifically, the switching cost has significant impact on the dynamic regret in the setting of OA. But it does not have an impact on the dynamic regret in the setting of OCO. Furthermore, we provide a lower bound of regret for the setting of OCO, which is same with the lower bound in the case of no switching cost. It shows that the switching cost does not change the difficulty of online decision making problems in the setting of OCO.\n          <\/jats:p>","DOI":"10.1145\/3375788","type":"journal-article","created":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T08:04:44Z","timestamp":1588579484000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Understand Dynamic Regret with Switching Cost for Online Decision Making"],"prefix":"10.1145","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8352-0092","authenticated-orcid":false,"given":"Yawei","family":"Zhao","sequence":"first","affiliation":[{"name":"School of Computer, National University of Defense Technology, Changsha, Hunan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qian","family":"Zhao","sequence":"additional","affiliation":[{"name":"College of Mathematics and System Science, Xinjiang University, Urumqi, Xinjiang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xingxing","family":"Zhang","sequence":"additional","affiliation":[{"name":"Institute of Information Science, and Beijing Key Laboratory of Advanced Information Science and Network Technology, Beijing Jiaotong University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"En","family":"Zhu","sequence":"additional","affiliation":[{"name":"School of Computer, National University of Defense Technology, Changsha, Hunan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinwang","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer, National University of Defense Technology, Changsha, Hunan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianping","family":"Yin","sequence":"additional","affiliation":[{"name":"School of Computer, Dongguan University of Technology, Dongguan, Guangdong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,4,18]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1893193.1893223"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465529.2465533"},{"key":"e_1_2_1_3_1","volume-title":"Approximation and Online Algorithms","author":"Antoniadis Antonios","unstructured":"Antonios Antoniadis , Kevin Schewior , and Rudolf Fleischer . 2018. A tight lower bound for online convex optimization with switching costs . In Approximation and Online Algorithms . Springer International Publishing , Cham , 164--175. Antonios Antoniadis, Kevin Schewior, and Rudolf Fleischer. 2018. A tight lower bound for online convex optimization with switching costs. In Approximation and Online Algorithms. Springer International Publishing, Cham, 164--175."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1880918.1880950"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00231-6"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of Advances in Neural Information Processing Systems (NIPS\u201910)","author":"Bernstein Andrey","year":"2010","unstructured":"Andrey Bernstein , Shie Mannor , and Nahum Shimkin . 2010 . Online classification with specificity constraints . In Proceedings of Advances in Neural Information Processing Systems (NIPS\u201910) , J. D. Lafferty, C. K. I. Williams, J. Shawe-Taylor, R. S. Zemel, and A. Culotta (Eds.). 190--198. Andrey Bernstein, Shie Mannor, and Nahum Shimkin. 2010. Online classification with specificity constraints. In Proceedings of Advances in Neural Information Processing Systems (NIPS\u201910), J. D. Lafferty, C. K. I. Williams, J. Shawe-Taylor, R. S. Zemel, and A. Culotta (Eds.). 190--198."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/3215594.3215610"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007621832648"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000050"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.6"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188798"},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the 25th Annual Conference on Learning Theory (COLT\u201912)","volume":"23","author":"Buchbinder Niv","year":"2012","unstructured":"Niv Buchbinder , Shahar Chen , Joshep (Seffi) Naor , and Ohad Shamir . 2012 . Unified algorithms for online learning and competitive analysis . In Proceedings of the 25th Annual Conference on Learning Theory (COLT\u201912) , Shie Mannor, Nathan Srebro, and Robert C. Williamson (Eds.) , Vol. 23 , 5.1--5.18. Niv Buchbinder, Shahar Chen, Joshep (Seffi) Naor, and Ohad Shamir. 2012. Unified algorithms for online learning and competitive analysis. In Proceedings of the 25th Annual Conference on Learning Theory (COLT\u201912), Shie Mannor, Nathan Srebro, and Robert C. Williamson (Eds.), Vol. 23, 5.1--5.18."},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the ACM International Conference on Measurement and Modeling of Computer Systems. 191--204","author":"Chen Niangjun","unstructured":"Niangjun Chen , Anish Agarwal , Adam Wierman , Siddharth Barman , and Lachlan L. H. Andrew . 2015. Online convex optimization using predictions . In Proceedings of the ACM International Conference on Measurement and Modeling of Computer Systems. 191--204 . Niangjun Chen, Anish Agarwal, Adam Wierman, Siddharth Barman, and Lachlan L. H. Andrew. 2015. Online convex optimization using predictions. In Proceedings of the ACM International Conference on Measurement and Modeling of Computer Systems. 191--204."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2896377.2901464"},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the 31st Conference On Learning Theory (COLT\u201918)","volume":"75","author":"Chen Niangjun","year":"2018","unstructured":"Niangjun Chen , Gautam Goel , and Adam Wierman . 2018 . Smoothed online convex optimization in high dimensions via online balanced descent . In Proceedings of the 31st Conference On Learning Theory (COLT\u201918) , Vol. 75 . 1574--1594. Niangjun Chen, Gautam Goel, and Adam Wierman. 2018. Smoothed online convex optimization in high dimensions via online balanced descent. In Proceedings of the 31st Conference On Learning Theory (COLT\u201918), Vol. 75. 1574--1594."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2750109"},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the 25th Annual Conference on Learning Theory (COLT'12)","author":"Chiang Chao Kai","year":"2012","unstructured":"Chao Kai Chiang , Tianbao Yang , Chia Jung Lee , Mehrdad Mahdavi , Chi Jen Lu , Rong Jin , and Shenghuo Zhu . 2012 . Online optimization with gradual variations . In Proceedings of the 25th Annual Conference on Learning Theory (COLT'12) . 1--20. Chao Kai Chiang, Tianbao Yang, Chia Jung Lee, Mehrdad Mahdavi, Chi Jen Lu, Rong Jin, and Shenghuo Zhu. 2012. Online optimization with gradual variations. In Proceedings of the 25th Annual Conference on Learning Theory (COLT'12). 1--20."},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of Advances in Neural Information Processing Systems (NIPS\u201904)","author":"Crammer Koby","year":"2004","unstructured":"Koby Crammer , Jaz Kandola , and Yoram Singer . 2004 . Online classification on a budget . In Proceedings of Advances in Neural Information Processing Systems (NIPS\u201904) . 225--232. Koby Crammer, Jaz Kandola, and Yoram Singer. 2004. Online classification on a budget. In Proceedings of Advances in Neural Information Processing Systems (NIPS\u201904). 225--232."},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the 21st International Conference on Artificial Intelligence and Statistics (AISTATS\u201918)","volume":"84","author":"Gao Xiand","year":"2018","unstructured":"Xiand Gao , Xiaobo Li , and Shuzhong Zhang . 2018 . Online learning with non-convex losses and non-stationary regret . In Proceedings of the 21st International Conference on Artificial Intelligence and Statistics (AISTATS\u201918) , Amos Storkey and Fernando Perez-Cruz (Eds.) , Vol. 84 . 235--243. Xiand Gao, Xiaobo Li, and Shuzhong Zhang. 2018. Online learning with non-convex losses and non-stationary regret. In Proceedings of the 21st International Conference on Artificial Intelligence and Statistics (AISTATS\u201918), Amos Storkey and Fernando Perez-Cruz (Eds.), Vol. 84. 235--243."},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the 33rd International Conference on Machine Learning (ICML\u201916)","author":"Gy\u00f6rgy Andr\u00e1s","year":"2016","unstructured":"Andr\u00e1s Gy\u00f6rgy and Csaba Szepesv\u00e1ri . 2016 . Shifting regret, mirror descent, and matrices . In Proceedings of the 33rd International Conference on Machine Learning (ICML\u201916) . 2943--2951. Andr\u00e1s Gy\u00f6rgy and Csaba Szepesv\u00e1ri. 2016. Shifting regret, mirror descent, and matrices. In Proceedings of the 33rd International Conference on Machine Learning (ICML\u201916). 2943--2951."},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of International Conference on International Conference on Machine Learning (ICML\u201913)","author":"Eric","unstructured":"Eric C. Hall and Rebecca Willett. 2013. Dynamical models and tracking regret in online convex programming . In Proceedings of International Conference on International Conference on Machine Learning (ICML\u201913) . Eric C. Hall and Rebecca Willett. 2013. Dynamical models and tracking regret in online convex programming. In Proceedings of International Conference on International Conference on Machine Learning (ICML\u201913)."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2404790"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1561\/2400000013"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of International Conference on Artificial Intelligence and Statistics (AISTATS\u201915)","author":"Jadbabaie Ali","year":"2015","unstructured":"Ali Jadbabaie , Alexander Rakhlin , Shahin Shahrampour , and Karthik Sridharan . 2015 . Online optimization: Competing with dynamic comparators . In Proceedings of International Conference on Artificial Intelligence and Statistics (AISTATS\u201915) . 398--406. Ali Jadbabaie, Alexander Rakhlin, Shahin Shahrampour, and Karthik Sridharan. 2015. Online optimization: Competing with dynamic comparators. In Proceedings of International Conference on Artificial Intelligence and Statistics (AISTATS\u201915). 398--406."},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of the 33rd International Conference on Machine Learning (ICML\u201916)","volume":"48","author":"Jenatton Rodolphe","year":"2016","unstructured":"Rodolphe Jenatton , Jim Huang , and Cedric Archambeau . 2016 . Adaptive algorithms for online convex optimization with long-term constraints . In Proceedings of the 33rd International Conference on Machine Learning (ICML\u201916) , Vol. 48 . 402--411. Rodolphe Jenatton, Jim Huang, and Cedric Archambeau. 2016. Adaptive algorithms for online convex optimization with long-term constraints. In Proceedings of the 33rd International Conference on Machine Learning (ICML\u201916), Vol. 48. 402--411."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00049"},{"key":"e_1_2_1_27_1","volume-title":"Hoi","author":"Li Bin","year":"2014","unstructured":"Bin Li and Steven C. H . Hoi . 2014 . Online portfolio selection: A survey. Comput. Surv . 46, 3 (2014), 35:1--35:36. Bin Li and Steven C. H. Hoi. 2014. Online portfolio selection: A survey. Comput. Surv. 46, 3 (2014), 35:1--35:36."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2435209.2435213"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2794384"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2018.8431296"},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of IEEE International Conference on Computer Communications (INFOCOMM\u201911)","author":"Lin M.","unstructured":"M. Lin , A. Wierman , L. L. H. Andrew , and E. Thereska . 2011. Dynamic right-sizing for power-proportional data centers . In Proceedings of IEEE International Conference on Computer Communications (INFOCOMM\u201911) . 1098--1106. M. Lin, A. Wierman, L. L. H. Andrew, and E. Thereska. 2011. Dynamic right-sizing for power-proportional data centers. In Proceedings of IEEE International Conference on Computer Communications (INFOCOMM\u201911). 1098--1106."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2425248.2425275"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.241"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7799379"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.3934\/jimo.2008.4.425"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0098-1354(98)00301-9"},{"key":"e_1_2_1_37_1","volume-title":"Renault and Adi Ros\u00e9n","author":"Marc","year":"2012","unstructured":"Marc P. Renault and Adi Ros\u00e9n . 2012 . On online algorithms with advice for the k-server problem. In Approximation and Online Algorithms, Roberto Solis-Oba and Giuseppe Persiano (Eds.). Springer , Berlin, 198--210. Marc P. Renault and Adi Ros\u00e9n. 2012. On online algorithms with advice for the k-server problem. In Approximation and Online Algorithms, Roberto Solis-Oba and Giuseppe Persiano (Eds.). Springer, Berlin, 198--210."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2526675"},{"key":"e_1_2_1_40_1","first-page":"3","article-title":"Exploring smart grid and data center interactions for electric power load balancing","volume":"41","author":"Wang Hao","year":"2014","unstructured":"Hao Wang , Jianwei Huang , Xiaojun Lin , and Hamed Mohsenian-Rad . 2014 . Exploring smart grid and data center interactions for electric power load balancing . SIGMETRICS Perf. Eval. Rev. 41 , 3 (Jan. 2014), 89--94. Hao Wang, Jianwei Huang, Xiaojun Lin, and Hamed Mohsenian-Rad. 2014. Exploring smart grid and data center interactions for electric power load balancing. SIGMETRICS Perf. Eval. Rev. 41, 3 (Jan. 2014), 89--94.","journal-title":"SIGMETRICS Perf. Eval. Rev."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983374"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2019.2892561"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2499907.2499909"},{"key":"e_1_2_1_44_1","volume-title":"Proceedings of the 34th International Conference on Machine Learning (ICML\u201916)","author":"Yang Tianbao","year":"2016","unstructured":"Tianbao Yang , Lijun Zhang , Rong Jin , and Jinfeng Yi . 2016 . Tracking slowly moving clairvoyant\u2014Optimal dynamic regret of online learning with true and noisy gradient . In Proceedings of the 34th International Conference on Machine Learning (ICML\u201916) . Tianbao Yang, Lijun Zhang, Rong Jin, and Jinfeng Yi. 2016. Tracking slowly moving clairvoyant\u2014Optimal dynamic regret of online learning with true and noisy gradient. In Proceedings of the 34th International Conference on Machine Learning (ICML\u201916)."},{"key":"e_1_2_1_45_1","unstructured":"Lijun Zhang Shiyin Lu and Zhi-Hua Zhou. 2018. Adaptive online learning in dynamic environments. In Advances in Neural Information Processing Systems 31 S. Bengio H. Wallach H. Larochelle K. Grauman N. Cesa-Bianchi and R. Garnett (Eds.). 1323--1333.  Lijun Zhang Shiyin Lu and Zhi-Hua Zhou. 2018. Adaptive online learning in dynamic environments. In Advances in Neural Information Processing Systems 31 S. Bengio H. Wallach H. Larochelle K. Grauman N. Cesa-Bianchi and R. Garnett (Eds.). 1323--1333."},{"key":"e_1_2_1_46_1","volume-title":"Proceedings of the 35th International Conference on Machine Learning (ICML\u201918)","author":"Zhang Lijun","year":"2018","unstructured":"Lijun Zhang , Tianbao Yang , rong jin, and Zhi-Hua Zhou . 2018 . Dynamic regret of strongly adaptive methods . In Proceedings of the 35th International Conference on Machine Learning (ICML\u201918) . 5882--5891. Lijun Zhang, Tianbao Yang, rong jin, and Zhi-Hua Zhou. 2018. Dynamic regret of strongly adaptive methods. In Proceedings of the 35th International Conference on Machine Learning (ICML\u201918). 5882--5891."},{"key":"e_1_2_1_47_1","volume-title":"Proceedings of the Conference on Neural Information Processing Systems (NIPS\u201917)","author":"Zhang Lijun","year":"2017","unstructured":"Lijun Zhang , Tianbao Yang , Jinfeng Yi , Rong Jin , and Zhi-Hua Zhou . 2017 . Improved dynamic regret for non-degenerate functions . In Proceedings of the Conference on Neural Information Processing Systems (NIPS\u201917) . Lijun Zhang, Tianbao Yang, Jinfeng Yi, Rong Jin, and Zhi-Hua Zhou. 2017. Improved dynamic regret for non-degenerate functions. In Proceedings of the Conference on Neural Information Processing Systems (NIPS\u201917)."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/3294771.3294841"},{"key":"e_1_2_1_49_1","volume-title":"Proceedings of the IEEE 32nd International Conference on Distributed Computing Systems (ICDCS\u201912)","author":"Zhang Q.","unstructured":"Q. Zhang , Q. Zhu , M. F. Zhani , and R. Boutaba . 2012. Dynamic service placement in geographically distributed clouds . In Proceedings of the IEEE 32nd International Conference on Distributed Computing Systems (ICDCS\u201912) . 526--535. Q. Zhang, Q. Zhu, M. F. Zhani, and R. Boutaba. 2012. Dynamic service placement in geographically distributed clouds. In Proceedings of the IEEE 32nd International Conference on Distributed Computing Systems (ICDCS\u201912). 526--535."},{"key":"e_1_2_1_50_1","volume-title":"Proximal online gradient is optimum for dynamic regret. CoRR cs.LG (Oct","author":"Zhao Yawei","year":"2018","unstructured":"Yawei Zhao , Shuang Qiu , and Ji Liu . 2018. Proximal online gradient is optimum for dynamic regret. CoRR cs.LG (Oct . 2018 ). arXiv:cs.LG\/1810.03594. Yawei Zhao, Shuang Qiu, and Ji Liu. 2018. Proximal online gradient is optimum for dynamic regret. CoRR cs.LG (Oct. 2018). arXiv:cs.LG\/1810.03594."},{"key":"e_1_2_1_51_1","volume-title":"Proceedings of International Conference on Machine Learning (ICML\u201903)","author":"Zinkevich Martin","year":"2003","unstructured":"Martin Zinkevich . 2003 . Online convex programming and generalized infinitesimal gradient ascent . In Proceedings of International Conference on Machine Learning (ICML\u201903) . 928--935. Martin Zinkevich. 2003. Online convex programming and generalized infinitesimal gradient ascent. In Proceedings of International Conference on Machine Learning (ICML\u201903). 928--935."}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3375788","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3375788","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:15Z","timestamp":1750199895000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3375788"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,18]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,6,30]]}},"alternative-id":["10.1145\/3375788"],"URL":"https:\/\/doi.org\/10.1145\/3375788","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"value":"2157-6904","type":"print"},{"value":"2157-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,18]]},"assertion":[{"value":"2019-06-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-04-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}