{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:51:48Z","timestamp":1740160308240,"version":"3.37.3"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T00:00:00Z","timestamp":1593388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T00:00:00Z","timestamp":1593388800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["JA 2109\/4-2"],"award-info":[{"award-number":["JA 2109\/4-2"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["NI 369\/17-1"],"award-info":[{"award-number":["NI 369\/17-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Within many real-world networks, the links between pairs of nodes change over time. Thus, there has been a recent boom in studying temporal graphs. Recognizing patterns in temporal graphs requires a proximity measure to compare different temporal graphs.\n To this end, we propose to study dynamic time warping on temporal graphs. We define the dynamic temporal graph warping (dtgw) distance to determine the dissimilarity of two temporal graphs. Our novel measure is flexible and can be applied in various application domains. We show that computing the dtgw-distance is a challenging (in general) -hard optimization problem and identify some polynomial-time solvable special cases.\n Moreover, we develop a quadratic programming formulation and an efficient heuristic. In experiments on real-world data, we show that the heuristic performs very well and that our dtgw-distance performs favorably in de-anonymizing networks compared to other approaches.\n<\/jats:p>","DOI":"10.1007\/s13278-020-00664-5","type":"journal-article","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T12:03:47Z","timestamp":1593432227000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Comparing temporal graphs using dynamic time warping"],"prefix":"10.1007","volume":"10","author":[{"given":"Vincent","family":"Froese","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brijnesh","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1450-1901","authenticated-orcid":false,"given":"Malte","family":"Renken","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,29]]},"reference":[{"key":"664_CR1","doi-asserted-by":"publisher","unstructured":"Abboud A, Backurs A, Williams VV (2015) Tight hardness results for LCS and other sequence similarity measures. In: 2015 IEEE 56th annual symposium on foundations of computer science (FOCS\u00a0\u201915), pp 59\u201378. https:\/\/doi.org\/10.1109\/FOCS.2015.14","DOI":"10.1109\/FOCS.2015.14"},{"issue":"1","key":"664_CR2","doi-asserted-by":"publisher","first-page":"4:1","DOI":"10.1145\/2733380","volume":"10","author":"R Ahmed","year":"2015","unstructured":"Ahmed R, Karypis G (2015) Algorithms for mining the coevolving relational motifs in dynamic networks. ACM Trans Knowl Discov Data 10(1):4:1\u20134:31. https:\/\/doi.org\/10.1145\/2733380","journal-title":"ACM Trans Knowl Discov Data"},{"key":"664_CR3","volume-title":"Network flows: theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice-Hall, Upper Saddle River"},{"key":"664_CR4","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.tcs.2019.03.026","volume":"806","author":"J Baste","year":"2020","unstructured":"Baste J, Bui-Xuan BM, Roux A (2020) Temporal matching. Theor Comput Sci 806:184\u2013196. https:\/\/doi.org\/10.1016\/j.tcs.2019.03.026","journal-title":"Theor Comput Sci"},{"key":"664_CR5","doi-asserted-by":"publisher","unstructured":"Bento J, Ioannidis S (2018) A family of tractable graph distances. In: Proceedings of the 2018 SIAM international conference on data mining (SDM\u00a0\u201918). SIAM, pp 333\u2013341. https:\/\/doi.org\/10.1137\/1.9781611975321.38","DOI":"10.1137\/1.9781611975321.38"},{"key":"664_CR6","unstructured":"Casteigts A, Himmel A, Molter H, Zschoche P (2019) The computational complexity of finding temporal paths under waiting time constraints. In: CoRR. arXiv:abs\/1909.06437"},{"key":"664_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan M, Fomin FV, Kowalik L, Lokshtanov D, Marx D, Pilipczuk M, Pilipczuk M, Saurabh S (2015) Parameterized algorithms. Springer, New York. https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"issue":"3","key":"664_CR8","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1016\/j.ipm.2018.03.005","volume":"56","author":"N Dakiche","year":"2019","unstructured":"Dakiche N, Tayeb FBS, Slimani Y, Benatchba K (2019) Tracking community evolution in social networks: a survey. Inf Process Manag 56(3):1084\u20131102. https:\/\/doi.org\/10.1016\/j.ipm.2018.03.005","journal-title":"Inf Process Manag"},{"key":"664_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of parameterized complexity","author":"R Downey","year":"2013","unstructured":"Downey R, Fellows MR (2013) Fundamentals of parameterized complexity. Springer, New York. https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"key":"664_CR10","doi-asserted-by":"publisher","unstructured":"Elhesha R, Sarkar A, Cinaglia P, Boucher C, Kahveci T (2019) Co-evolving patterns in temporal networks of varying evolution. In: Proceedings of the 10th ACM international conference on bioinformatics, computational biology and health informatics (BCB\u00a0\u201919). ACM, pp 494\u2013503. https:\/\/doi.org\/10.1145\/3307339.3342152","DOI":"10.1145\/3307339.3342152"},{"issue":"3","key":"664_CR11","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1016\/j.ejc.2012.04.008","volume":"34","author":"MR Fellows","year":"2013","unstructured":"Fellows MR, Jansen BMP, Rosamond F (2013) Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity. Eur J Combin 34(3):541\u2013566. https:\/\/doi.org\/10.1016\/j.ejc.2012.04.008","journal-title":"Eur J Combin"},{"key":"664_CR12","unstructured":"Fluschnik T, Niedermeier R, Schubert C, Zschoche P (2020) Multistage $$s$$-$$t$$ path: confronting similarity with dissimilarity. In: CoRR. arXiv:abs\/2002.07569"},{"key":"664_CR13","doi-asserted-by":"publisher","unstructured":"Froese V, Jain B, Niedermeier R, Renken M (2019) Comparing temporal graphs using dynamic time warping. In: Proceedings of the 8th international conference on complex networks and their applications, SCI, vol 882. Springer, pp 469\u2013480. https:\/\/doi.org\/10.1007\/978-3-030-36683-4_38","DOI":"10.1007\/978-3-030-36683-4_38"},{"key":"664_CR14","unstructured":"Froese V, Jain BJ, Rymar M (2020) Fast exact dynamic time warping on run-length encoded time series. In: CoRR. arXiv:abs\/1903.03003"},{"key":"664_CR15","doi-asserted-by":"publisher","unstructured":"Fr\u00f6hlich H, Wegner JK, Sieker F, Zell A (2005) Optimal assignment kernels for attributed molecular graphs. In: Proceedings of the 22nd international conference on machine learning (ICML\u00a0\u201905). ACM, pp 225\u2013232. https:\/\/doi.org\/10.1145\/1102351.1102380","DOI":"10.1145\/1102351.1102380"},{"key":"664_CR16","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Company, New York"},{"key":"664_CR17","doi-asserted-by":"publisher","unstructured":"Gayraud NT, Pitoura E, Tsaparas P (2015) Diffusion maximization in evolving social networks. In: Proceedings of the 2015 ACM conference on online social networks (COSN\u00a0\u201915). ACM, pp 125\u2013135. https:\/\/doi.org\/10.1145\/2817946","DOI":"10.1145\/2817946"},{"issue":"1","key":"664_CR18","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1140\/epjds\/s13688-018-0140-1","volume":"7","author":"M G\u00e9nois","year":"2018","unstructured":"G\u00e9nois M, Barrat A (2018) Can co-location be used as a proxy for face-to-face contacts? EPJ Data Sci 7(1):11. https:\/\/doi.org\/10.1140\/epjds\/s13688-018-0140-1","journal-title":"EPJ Data Sci"},{"issue":"4","key":"664_CR19","doi-asserted-by":"publisher","first-page":"50:1","DOI":"10.1145\/3230734","volume":"14","author":"O Gold","year":"2018","unstructured":"Gold O, Sharir M (2018) Dynamic time warping and geometric edit distance: breaking the quadratic barrier. ACM Trans Algorithms 14(4):50:1\u201350:17. https:\/\/doi.org\/10.1145\/3230734","journal-title":"ACM Trans Algorithms"},{"key":"664_CR20","unstructured":"Heeger K, Himmel A, Kammer F, Niedermeier R, Renken M, Sajenko A (2019) Multistage problems on a global budget. In: CoRR. arXiv:abs\/1912.04392"},{"issue":"3","key":"664_CR21","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme P, Saram\u00e4ki J (2012) Temporal networks. Phys Rep 519(3):97\u2013125. https:\/\/doi.org\/10.1016\/j.physrep.2012.03.001","journal-title":"Phys Rep"},{"key":"664_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36461-7","volume-title":"Temporal networks","author":"P Holme","year":"2013","unstructured":"Holme P, Saram\u00e4ki J (2013) Temporal networks. Springer, New York. https:\/\/doi.org\/10.1007\/978-3-642-36461-7"},{"key":"664_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-23495-9","volume-title":"Temporal network theory","author":"P Holme","year":"2019","unstructured":"Holme P, Saram\u00e4ki J (2019) Temporal network theory. Springer, New York. https:\/\/doi.org\/10.1007\/978-3-030-23495-9"},{"issue":"2","key":"664_CR24","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo R, Paturi R (2001) On the complexity of $$k$$-SAT. J Comput Syst Sci 62(2):367\u2013375. https:\/\/doi.org\/10.1006\/jcss.2000.1727","journal-title":"J Comput Syst Sci"},{"issue":"4","key":"664_CR25","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo R, Paturi R, Zane F (2001) Which problems have strongly exponential complexity? J Comput Syst Sci 63(4):512\u2013530. https:\/\/doi.org\/10.1006\/jcss.2001.1774","journal-title":"J Comput Syst Sci"},{"key":"664_CR26","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.dam.2016.06.027","volume":"214","author":"BJ Jain","year":"2016","unstructured":"Jain BJ (2016) On the geometry of graph spaces. Discrete Appl Math 214:126\u2013144. https:\/\/doi.org\/10.1016\/j.dam.2016.06.027","journal-title":"Discrete Appl Math"},{"issue":"4","key":"664_CR27","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF02278710","volume":"38","author":"R Jonker","year":"1987","unstructured":"Jonker R, Volgenant A (1987) A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38(4):325\u2013340. https:\/\/doi.org\/10.1007\/BF02278710","journal-title":"Computing"},{"key":"664_CR28","doi-asserted-by":"publisher","unstructured":"Jouili S, Tabbone S (2009) Graph matching based on node signatures. In: Proceedings of the 7th IAPR-TC-15 international workshop on graph-based representations in pattern recognition. LNCS, vol 5534. Springer, pp 154\u2013163. https:\/\/doi.org\/10.1007\/978-3-642-02124-4_16","DOI":"10.1007\/978-3-642-02124-4_16"},{"issue":"6","key":"664_CR29","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1016\/j.physa.2008.11.021","volume":"388","author":"V Kostakos","year":"2009","unstructured":"Kostakos V (2009) Temporal graphs. Physica A 388(6):1007\u20131023. https:\/\/doi.org\/10.1016\/j.physa.2008.11.021","journal-title":"Physica A"},{"key":"664_CR30","unstructured":"Kriege NM, Giscard PL, Wilson R (2016) On valid optimal assignment kernels and applications to graph classification. In: Advances in neural information processing systems 29 (NIPS\u00a0\u201916). Curran Associates, Inc., pp 1623\u20131631. http:\/\/papers.nips.cc\/paper\/6166-on-valid-optimal-assignment-kernels-and-applications-to-graph-classification"},{"issue":"1","key":"664_CR31","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/s41109-019-0195-3","volume":"5","author":"NM Kriege","year":"2020","unstructured":"Kriege NM, Johansson FD, Morris C (2020) A survey on graph kernels. Appl Netw Sci 5(1):6. https:\/\/doi.org\/10.1007\/s41109-019-0195-3","journal-title":"Appl Netw Sci"},{"key":"664_CR32","doi-asserted-by":"publisher","unstructured":"Kuszmaul W (2019) Dynamic time warping in strongly subquadratic time: algorithms for the low-distance regime and approximate evaluation. In: Proceedings of the 46th international colloquium on automata, languages, and programming (ICALP\u00a0\u201919), Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, LIPIcs, vol 132, pp 80:1\u201380:15. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.80","DOI":"10.4230\/LIPIcs.ICALP.2019.80"},{"issue":"6366","key":"664_CR33","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1126\/science.aai7488","volume":"358","author":"A Li","year":"2017","unstructured":"Li A, Cornelius SP, Liu YY, Wang L, Barab\u00e1si AL (2017) The fundamental advantages of temporal networks. Science 358(6366):1042\u20131046. https:\/\/doi.org\/10.1126\/science.aai7488","journal-title":"Science"},{"key":"664_CR34","doi-asserted-by":"publisher","unstructured":"Mertzios GB, Molter H, Niedermeier R, Zamaraev V, Zschoche P (2020) Computing maximum matchings in temporal graphs. In: Proceedings of the 37th international symposium on theoretical aspects of computer science (STACS\u00a0\u201920), Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, LIPIcs, pp 27:1\u201327:14. https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2020.27","DOI":"10.4230\/LIPIcs.STACS.2020.27"},{"key":"664_CR35","doi-asserted-by":"publisher","unstructured":"Narayanan A, Shmatikov V (2009) De-anonymizing social networks. In: Proceedings of the 30th IEEE symposium on security and privacy, pp 173\u2013187. https:\/\/doi.org\/10.1109\/SP.2009.22","DOI":"10.1109\/SP.2009.22"},{"key":"664_CR36","doi-asserted-by":"publisher","unstructured":"Nguyen GH, Lee JB, Rossi RA, Ahmed NK, Koh E, Kim S (2018) Continuous-time dynamic network embeddings. In: Companion proceedings of the web conference 2018\u00a0(WWW \u201918), International World Wide Web Conferences Steering Committee, pp 969\u2013976. https:\/\/doi.org\/10.1145\/3184558.3191526","DOI":"10.1145\/3184558.3191526"},{"key":"664_CR37","doi-asserted-by":"publisher","unstructured":"Niedermeier R (2010) Reflections on multivariate algorithmics and problem parameterization. In: Proceedings of the 27th international symposium on theoretical aspects of computer science (STACS\u00a0\u201910), Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, LIPIcs, vol\u00a05, pp 17\u201332. https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2010.2495","DOI":"10.4230\/LIPIcs.STACS.2010.2495"},{"key":"664_CR38","doi-asserted-by":"publisher","unstructured":"Rakthanmanon T, Campana B, Mueen A, Batista G, Westover B, Zhu Q, Zakaria J, Keogh E (2012) Searching and mining trillions of time series subsequences under dynamic time warping. In: Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining\u00a0(KDD \u201912). ACM, pp 262\u2013270. https:\/\/doi.org\/10.1145\/2339530.2339576","DOI":"10.1145\/2339530.2339576"},{"key":"664_CR39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-27252-8","volume-title":"Structural pattern recognition with graph edit distance","author":"K Riesen","year":"2015","unstructured":"Riesen K (2015) Structural pattern recognition with graph edit distance. Springer, New York. https:\/\/doi.org\/10.1007\/978-3-319-27252-8"},{"key":"664_CR40","doi-asserted-by":"publisher","unstructured":"Rozenshtein P, Gionis A (2019) Mining temporal networks. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining (KDD\u00a0\u201919). ACM, pp 3225\u20133226. https:\/\/doi.org\/10.1145\/3292500.3332295","DOI":"10.1145\/3292500.3332295"},{"key":"664_CR41","doi-asserted-by":"publisher","unstructured":"Rozenshtein P, Gionis A, Prakash BA, Vreeken J (2016) Reconstructing an epidemic over time. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining (KDD\u00a0\u201916).ACM, pp 1835\u20131844. https:\/\/doi.org\/10.1145\/2939672.2939865","DOI":"10.1145\/2939672.2939865"},{"issue":"1","key":"664_CR42","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/TASSP.1978.1163055","volume":"26","author":"H Sakoe","year":"1978","unstructured":"Sakoe H, Chiba S (1978) Dynamic programming algorithm optimization for spoken word recognition. IEEE Trans Acoust Speech Signal Process 26(1):43\u201349. https:\/\/doi.org\/10.1109\/TASSP.1978.1163055","journal-title":"IEEE Trans Acoust Speech Signal Process"},{"issue":"14","key":"664_CR43","doi-asserted-by":"publisher","first-page":"i180","DOI":"10.1093\/bioinformatics\/btx246","volume":"33","author":"V Vijayan","year":"2017","unstructured":"Vijayan V, Critchlow D, Milenkovi\u0107 T (2017) Alignment of dynamic networks. Bioinformatics 33(14):i180\u2013i189. https:\/\/doi.org\/10.1093\/bioinformatics\/btx246","journal-title":"Bioinformatics"},{"issue":"2","key":"664_CR44","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s10618-012-0250-5","volume":"26","author":"X Wang","year":"2013","unstructured":"Wang X, Mueen A, Ding H, Trajcevski G, Scheuermann P, Keogh E (2013) Experimental comparison of representation methods and distance measures for time series data. Data Min Knowl Disc 26(2):275\u2013309. https:\/\/doi.org\/10.1007\/s10618-012-0250-5","journal-title":"Data Min Knowl Disc"},{"key":"664_CR45","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.jcss.2019.07.006","volume":"107","author":"P Zschoche","year":"2020","unstructured":"Zschoche P, Fluschnik T, Molter H, Niedermeier R (2020) The complexity of finding small separators in temporal graphs. J Comput Syst Sci 107:72\u201392. https:\/\/doi.org\/10.1016\/j.jcss.2019.07.006","journal-title":"J Comput Syst Sci"},{"key":"664_CR46","doi-asserted-by":"publisher","unstructured":"Zuo Y, Liu G, Lin H, Guo J, Hu X, Wu J (2018) Embedding temporal network via neighborhood formation. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery and data mining\u00a0(KDD \u201918). ACM, pp 2857\u20132866. https:\/\/doi.org\/10.1145\/3219819.3220054","DOI":"10.1145\/3219819.3220054"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-020-00664-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-020-00664-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-020-00664-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T23:22:34Z","timestamp":1624922554000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-020-00664-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,29]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["664"],"URL":"https:\/\/doi.org\/10.1007\/s13278-020-00664-5","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"type":"print","value":"1869-5450"},{"type":"electronic","value":"1869-5469"}],"subject":[],"published":{"date-parts":[[2020,6,29]]},"assertion":[{"value":"27 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"50"}}