{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:06:57Z","timestamp":1775815617970,"version":"3.50.1"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,11,26]],"date-time":"2021-11-26T00:00:00Z","timestamp":1637884800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,26]],"date-time":"2021-11-26T00:00:00Z","timestamp":1637884800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100007523","name":"Division of Advanced Cyberinfrastructure","doi-asserted-by":"publisher","award":["1755464"],"award-info":[{"award-number":["1755464"]}],"id":[{"id":"10.13039\/100007523","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s00778-021-00712-2","type":"journal-article","created":{"date-parts":[[2021,11,26]],"date-time":"2021-11-26T16:02:53Z","timestamp":1637942573000},"page":"649-674","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Parallel mining of large maximal quasi-cliques"],"prefix":"10.1007","volume":"31","author":[{"given":"Jalal","family":"Khalil","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4653-0408","authenticated-orcid":false,"given":"Da","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guimu","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lyuheng","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,26]]},"reference":[{"key":"712_CR1","doi-asserted-by":"crossref","unstructured":"Abello, J., Resende, M.G.C., Sudarsky, S.: Massive quasi-clique detection. In: LATIN, volume 2286 of Lecture Notes in Computer Science, pp. 598\u2013612. Springer (2002)","DOI":"10.1007\/3-540-45995-2_51"},{"issue":"1","key":"712_CR2","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1186\/1471-2105-4-2","volume":"4","author":"GD Bader","year":"2003","unstructured":"Bader, G.D., Hogue, C.W.: An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinform. 4(1), 2 (2003)","journal-title":"BMC Bioinform."},{"key":"712_CR3","unstructured":"Batagelj, V., Zaversnik, M.: An o(m) algorithm for cores decomposition of networks. CoRR, cs.DS\/0310049 (2003)"},{"key":"712_CR4","doi-asserted-by":"crossref","unstructured":"Bayardo Jr, R.J.: Efficiently mining long patterns from databases. In: SIGMOD Conference, pp. 85\u201393. ACM Press (1998)","DOI":"10.1145\/276305.276313"},{"key":"712_CR5","doi-asserted-by":"crossref","unstructured":"Berlowitz, D., Cohen, S., Kimelfeld, B.: Efficient enumeration of maximal k-plexes. In: SIGMOD Conference, pp. 431\u2013444. ACM (2015)","DOI":"10.1145\/2723372.2746478"},{"key":"712_CR6","doi-asserted-by":"crossref","unstructured":"Bhattacharyya, M., Bandyopadhyay, S.: Mining the largest quasi-clique in human protein interactome. In: 2009 International Conference on Adaptive and Intelligent Systems, pp. 194\u2013199. IEEE (2009)","DOI":"10.1109\/ICAIS.2009.39"},{"key":"712_CR7","doi-asserted-by":"crossref","unstructured":"Brunato, M., Hoos, H.H., Battiti, R.: On effectively finding maximal quasi-cliques in graphs. In: International Conference on Learning and Intelligent Optimization, pp. 41\u201355. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-92695-5_4"},{"issue":"9","key":"712_CR8","doi-asserted-by":"publisher","first-page":"2443","DOI":"10.1093\/nar\/gkg340","volume":"31","author":"D Bu","year":"2003","unstructured":"Bu, D., Zhao, Y., Cai, L., Xue, H., Zhu, X., Lu, H., Zhang, J., Sun, S., Ling, L., Zhang, N., et al.: Topological structure analysis of the protein-protein interaction network in budding yeast. Nucleic Acids Res. 31(9), 2443\u20132450 (2003)","journal-title":"Nucleic Acids Res."},{"key":"712_CR9","unstructured":"COST in the Land of Databases. https:\/\/github.com\/frankmcsherry\/blog\/blob\/master\/posts\/2017-09-23.md"},{"key":"712_CR10","doi-asserted-by":"crossref","unstructured":"Chang, L., Yu, J.X., Qin, L., Lin, X., Liu, C., Liang, W.: Efficiently computing k-edge connected components via graph decomposition. In: SIGMOD Conference, pp. 205\u2013216. ACM (2013)","DOI":"10.1145\/2463676.2465323"},{"key":"712_CR11","doi-asserted-by":"crossref","unstructured":"Chen, H., Liu, M., Zhao, Y., Yan, X., Yan, D., Cheng, J.: G-miner: an efficient task-oriented graph mining system. In: EuroSys, pp. 32:1\u201332:12. ACM (2018)","DOI":"10.1145\/3190508.3190545"},{"key":"712_CR12","doi-asserted-by":"crossref","unstructured":"Chou, Y.H., Wang, E.T., Chen, A.L.P.: Finding maximal quasi-cliques containing a target vertex in a graph. In: DATA, pp. 5\u201315. SciTePress (2015)","DOI":"10.5220\/0005498400050015"},{"key":"712_CR13","doi-asserted-by":"crossref","unstructured":"Chu, S., Cheng, J.: Triangle listing in massive networks. TKDD 6(4), 17:1\u201317:32 (2012)","DOI":"10.1145\/2382577.2382581"},{"issue":"1","key":"712_CR14","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s13278-018-0497-y","volume":"8","author":"P Conde-Cespedes","year":"2018","unstructured":"Conde-Cespedes, P., Ngonmang, B., Viennet, E.: An efficient method for mining the maximal $$\\alpha $$-quasi-clique-community of a given node in complex networks. Soc. Netw. Anal. Min. 8(1), 20 (2018)","journal-title":"Soc. Netw. Anal. Min."},{"key":"712_CR15","doi-asserted-by":"crossref","unstructured":"Conte, A., Firmani, D., Mordente, C., Patrignani, M., Torlone, R.: Fast enumeration of large k-plexes. In: SIGKDD, pp. 115\u2013124. ACM (2017)","DOI":"10.1145\/3097983.3098031"},{"key":"712_CR16","doi-asserted-by":"crossref","unstructured":"Conte, A., Matteis, T.D., Sensi, D.D., Grossi, R., Marino, A., Versari, L.: D2K: scalable community detection in massive networks via small-diameter k-plexes. In: SIGKDD, pp. 1272\u20131281. ACM (2018)","DOI":"10.1145\/3219819.3220093"},{"key":"712_CR17","doi-asserted-by":"crossref","unstructured":"Cui, W., Xiao, Y., Wang, H., Lu, Y., Wang, W.: Online search of overlapping communities. In: SIGMOD Conference, pp. 277\u2013288. ACM (2013)","DOI":"10.1145\/2463676.2463722"},{"key":"712_CR18","doi-asserted-by":"crossref","unstructured":"Fan, W., Jin, R., Liu, M., Lu, P., Luo, X., Xu, R., Yin, Q., Yu, W., Zhou, J.: Application driven graph partitioning. In: SIGMOD Conference, pp. 1765\u20131779. ACM (2020)","DOI":"10.1145\/3318464.3389745"},{"issue":"4","key":"712_CR19","doi-asserted-by":"publisher","first-page":"573","DOI":"10.14778\/3436905.3436916","volume":"14","author":"G Guo","year":"2020","unstructured":"Guo, G., Yan, D., \u00d6zsu, M.T., Jiang, Z., Khalil, J.: Scalable mining of maximal quasi-cliques: an algorithm-system codesign approach. Proc. VLDB Endow. 14(4), 573\u2013585 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"712_CR20","doi-asserted-by":"crossref","unstructured":"Guo, G., Yan, D., T. \u00d6zsu, M., Jiang, Z., Khalil, J.: Scalable mining of maximal quasi-cliques: An algorithm-system codesign approach. CoRR, arXiv:2005.00081 (2020)","DOI":"10.14778\/3436905.3436916"},{"issue":"suppl 1","key":"712_CR21","doi-asserted-by":"publisher","first-page":"5249","DOI":"10.1073\/pnas.0307750100","volume":"101","author":"J Hopcroft","year":"2004","unstructured":"Hopcroft, J., Khan, O., Kulis, B., Selman, B.: Tracking evolving communities in large linked networks. Proc. Natl. Acad. Sci. 101(suppl 1), 5249\u20135253 (2004)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"712_CR22","doi-asserted-by":"crossref","unstructured":"Jiang, D., Pei, J.: Mining frequent cross-graph quasi-cliques. ACM Trans. Knowl. Discov. Data 2(4), 16:1\u201316:42 (2009)","DOI":"10.1145\/1460797.1460799"},{"key":"712_CR23","doi-asserted-by":"crossref","unstructured":"Joshi, A., Zhang, Y., Bogdanov, P., Hwang, J.: An efficient system for subgraph discovery. In: IEEE Big Data, pp. 703\u2013712 (2018)","DOI":"10.1109\/BigData.2018.8622126"},{"key":"712_CR24","doi-asserted-by":"crossref","unstructured":"Lee, P., Lakshmanan, L.V.S.: Query-driven maximum quasi-clique search. In: SDM, pp. 522\u2013530. SIAM (2016)","DOI":"10.1137\/1.9781611974348.59"},{"key":"712_CR25","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1016\/j.physa.2014.08.025","volume":"415","author":"J Li","year":"2014","unstructured":"Li, J., Wang, X., Cui, Y.: Uncovering the overlapping community structure of complex networks by maximal cliques. Physica A Stat. Mech. Appl. 415, 398\u2013406 (2014)","journal-title":"Physica A Stat. Mech. Appl."},{"key":"712_CR26","doi-asserted-by":"crossref","unstructured":"Liu, G., Wong, L.: Effective pruning techniques for mining quasi-cliques. In: ECML\/PKDD, volume 5212 of Lecture Notes in Computer Science, pp. 33\u201349. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-87481-2_3"},{"issue":"11","key":"712_CR27","doi-asserted-by":"publisher","first-page":"1538","DOI":"10.14778\/3137628.3137660","volume":"10","author":"C Lu","year":"2017","unstructured":"Lu, C., Yu, J.X., Wei, H., Zhang, Y.: Finding the maximum clique in massive graphs. Proc. VLDB Endow. 10(11), 1538\u20131549 (2017)","journal-title":"Proc. VLDB Endow."},{"issue":"9","key":"712_CR28","doi-asserted-by":"publisher","first-page":"1359","DOI":"10.14778\/3397230.3397234","volume":"13","author":"B Lyu","year":"2020","unstructured":"Lyu, B., Qin, L., Lin, X., Zhang, Y., Qian, Z., Zhou, J.: Maximum biclique search at billion scale. Proc. VLDB Endow. 13(9), 1359\u20131372 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"712_CR29","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J.C., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: SIGMOD Conference, pp. 135\u2013146 (2010)","DOI":"10.1145\/1807167.1807184"},{"issue":"2","key":"712_CR30","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/S0304-3975(98)00091-7","volume":"210","author":"H Matsuda","year":"1999","unstructured":"Matsuda, H., Ishihara, T., Hashimoto, A.: Classifying molecular sequences using a linkage graph with their pairwise similarities. Theor. Comput. Sci. 210(2), 305\u2013325 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"712_CR31","unstructured":"McSherry, F., Isard, M., Murray, D.G.: Scalability! but at what cost? In: HotOS (2015)"},{"issue":"1\u20132","key":"712_CR32","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.dam.2012.07.019","volume":"161","author":"J Pattillo","year":"2013","unstructured":"Pattillo, J., Veremyev, A., Butenko, S., Boginski, V.: On the maximum quasi-clique problem. Discrete Appl. Math. 161(1\u20132), 244\u2013257 (2013)","journal-title":"Discrete Appl. Math."},{"key":"712_CR33","doi-asserted-by":"crossref","unstructured":"Pei, J., Jiang, D., Zhang, A.: On mining cross-graph quasi-cliques. In: SIGKDD, pp. 228\u2013238. ACM (2005)","DOI":"10.1145\/1081870.1081898"},{"key":"712_CR34","doi-asserted-by":"crossref","unstructured":"Qin, L., Yu, J.X., Chang, L., Cheng, H., Zhang, C., Lin, X.: Scalable big graph processing in mapreduce. In: SIGMOD Conference, pp. 827\u2013838. ACM (2014)","DOI":"10.1145\/2588555.2593661"},{"key":"712_CR35","doi-asserted-by":"crossref","unstructured":"Quamar, A., Deshpande, A., Lin, J.: Nscale: neighborhood-centric large-scale graph analytics in the cloud. VLDB J. 1\u201326 (2014)","DOI":"10.14778\/2733004.2733058"},{"key":"712_CR36","doi-asserted-by":"crossref","unstructured":"Sanei-Mehri, S., Das, A., Tirthapura, S.:Enumerating top-k quasi-cliques. In: IEEE BigData, pp. 1107\u20131112. IEEE (2018)","DOI":"10.1109\/BigData.2018.8622352"},{"key":"712_CR37","doi-asserted-by":"crossref","unstructured":"Tanner, B.K., Warner, G., Stern, H., Olechowski, S.: Koobface: The evolution of the social botnet. In: eCrime, pp. 1\u201310. IEEE (2010)","DOI":"10.1109\/ecrime.2010.5706694"},{"key":"712_CR38","doi-asserted-by":"crossref","unstructured":"Teixeira, C.H.C., Fonseca, A.J., Serafini, M., Siganos, G., Zaki, M.J., Aboulnaga, A.: Arabesque: a system for distributed graph mining. In: SOSP, pp. 425\u2013440 (2015)","DOI":"10.1145\/2815400.2815410"},{"key":"712_CR39","unstructured":"Wang, K., Zuo, Z., Thorpe, J., Nguyen, T.Q., Xu, G.H.: Rstream: Marrying relational algebra with streaming for efficient graph mining on A single machine. In: OSDI, pp. 763\u2013782 (2018)"},{"key":"712_CR40","unstructured":"Weiss, D., Warner, G.: Tracking criminals on facebook: a case study from a digital forensics reu program. In: Proceedings of Annual ADFSL Conference on Digital Forensics, Security and Law (2015)"},{"issue":"1\u20132","key":"712_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/1900000056","volume":"7","author":"D Yan","year":"2017","unstructured":"Yan, D., Bu, Y., Tian, Y., Deshpande, A.: Big graph analytics platforms. Found. Trends Databases 7(1\u20132), 1\u2013195 (2017)","journal-title":"Found. Trends Databases"},{"key":"712_CR42","doi-asserted-by":"crossref","unstructured":"Yan, D., Bu, Y., Tian, Y., Deshpande, A., Cheng, J.: Big graph analytics systems. In: SIGMOD Conference, pp. 2241\u20132243. ACM (2016)","DOI":"10.1145\/2882903.2912566"},{"key":"712_CR43","doi-asserted-by":"crossref","unstructured":"Yan, D., Cheng, J., Chen, H., Long, C., Bangalore, P.: Lightweight fault tolerance in pregel-like systems. In: ICPP, pp. 69:1\u201369:10. ACM (2019)","DOI":"10.1145\/3337821.3337823"},{"issue":"14","key":"712_CR44","doi-asserted-by":"publisher","first-page":"1981","DOI":"10.14778\/2733085.2733103","volume":"7","author":"D Yan","year":"2014","unstructured":"Yan, D., Cheng, J., Lu, Y., Ng, W.: Blogel: a block-centric framework for distributed computation on real-world graphs. Proc. VLDB Endow. 7(14), 1981\u20131992 (2014)","journal-title":"Proc. VLDB Endow."},{"key":"712_CR45","doi-asserted-by":"crossref","unstructured":"Yan, D., Cheng, J., Lu, Y., Ng, W.: Effective techniques for message reduction and load balancing in distributed graph computation. In: WWW, pp. 1307\u20131317 (2015)","DOI":"10.1145\/2736277.2741096"},{"issue":"7","key":"712_CR46","doi-asserted-by":"publisher","first-page":"564","DOI":"10.14778\/2904483.2904488","volume":"9","author":"D Yan","year":"2016","unstructured":"Yan, D., Cheng, J., \u00d6zsu, M.T., Yang, F., Lu, Y., Lui, J.C.S., Zhang, Q., Ng, W.: A general-purpose query-centric framework for querying big graphs. Proc. VLDB Endow. 9(7), 564\u2013575 (2016)","journal-title":"Proc. VLDB Endow."},{"issue":"14","key":"712_CR47","first-page":"1821","volume":"7","author":"D Yan","year":"2014","unstructured":"Yan, D., Cheng, J., Xing, K., Lu, Y., Ng, W., Bu, Y.: Pregel algorithms for graph connectivity problems with performance guarantees. PVLDB 7(14), 1821\u20131832 (2014)","journal-title":"PVLDB"},{"key":"712_CR48","unstructured":"Yan, D., Guo, G.: Systems and algorithms for massively parallel graph mining. In: BigData. IEEE (2020)"},{"key":"712_CR49","doi-asserted-by":"crossref","unstructured":"Yan, D., Guo, G., Chowdhury, M.M.R., \u00d6zsu, M.T., Ku, W., Lui, J.C.S.: G-thinker: a distributed framework for mining subgraphs in a big graph. In: ICDE, pp. 1369\u20131380. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00122"},{"key":"712_CR50","doi-asserted-by":"publisher","unstructured":"Yan, D., Guo, G., Khalil, J. et al. G-thinker: a general distributed framework for finding qualified subgraphs in a big graph with load balancing. The VLDB Journal (2021). https:\/\/doi.org\/10.1007\/s00778-021-00688-z","DOI":"10.1007\/s00778-021-00688-z"},{"key":"712_CR51","doi-asserted-by":"crossref","unstructured":"Yan, D., Guo, G., Chowdhury, M.M.R., \u00d6zsu, M.T., Lui, J.C.S., Tan, W.: T-thinker: a task-centric distributed framework for compute-intensive divide-and-conquer algorithms. In: PPoPP, pp. 411\u2013412. ACM (2019)","DOI":"10.1145\/3293883.3295709"},{"issue":"1","key":"712_CR52","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1109\/TPDS.2017.2743708","volume":"29","author":"D Yan","year":"2018","unstructured":"Yan, D., Huang, Y., Liu, M., Chen, H., Cheng, J., Wu, H., Zhang, C.: Graphd: Distributed vertex-centric graph processing beyond the memory limit. IEEE Trans. Parallel Distrib. Syst. 29(1), 99\u2013114 (2018)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"712_CR53","doi-asserted-by":"crossref","unstructured":"Yan, D., Liu, H.: Parallel graph processing. In: Encyclopedia of Big Data Technologies. Springer (2019)","DOI":"10.1007\/978-3-319-77525-8_272"},{"key":"712_CR54","doi-asserted-by":"crossref","unstructured":"Yan, D., Qu, W., Guo, G., Wang, X.: Prefixfpm: A parallel framework for general-purpose frequent pattern mining. In: ICDE, pp. 1938\u20131941. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00208"},{"key":"712_CR55","doi-asserted-by":"publisher","unstructured":"Yan, D., Qu, W., Guo, G. et al.: PrefixFPM: a parallel framework for general-purpose mining of frequent and closed patterns. The VLDB Journal (2021). https:\/\/doi.org\/10.1007\/s00778-021-00687-0","DOI":"10.1007\/s00778-021-00687-0"},{"key":"712_CR56","doi-asserted-by":"crossref","unstructured":"Yan, D., Tian, Y., Cheng, J.: Systems for Big Graph Analytics. Springer Briefs in Computer Science. Springer (2017)","DOI":"10.1007\/978-3-319-58217-7"},{"key":"712_CR57","doi-asserted-by":"crossref","unstructured":"Yang, Y., Yan, D., Wu, H., Cheng, J., Zhou, S., Lui, J.C.S.: Diversified temporal subgraph pattern mining. In: SIGKDD, pp. 1965\u20131974. ACM (2016)","DOI":"10.1145\/2939672.2939848"},{"key":"712_CR58","doi-asserted-by":"crossref","unstructured":"Zeng, Z., Wang, J., Zhou, L., Karypis, G.: Coherent closed quasi-clique discovery from large dense graph databases. In: SIGKDD, pp. 797\u2013802. ACM (2006)","DOI":"10.1145\/1150402.1150506"},{"key":"712_CR59","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Yan, D., Cheng, J.: Quegel: A general-purpose system for querying big graphs. In: SIGMOD Conference, pp. 2189\u20132192. ACM (2016)","DOI":"10.1145\/2882903.2899398"},{"key":"712_CR60","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Xu, J., Guo, Z., Xiao, M., Jin, Y.: Enumerating maximal k-plexes with worst-case time guarantee. In: AAAI, pp. 2442\u20132449. AAAI Press (2020)","DOI":"10.1609\/aaai.v34i03.5625"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-021-00712-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-021-00712-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-021-00712-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,25]],"date-time":"2022-06-25T04:05:54Z","timestamp":1656129954000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-021-00712-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,26]]},"references-count":60,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["712"],"URL":"https:\/\/doi.org\/10.1007\/s00778-021-00712-2","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,26]]},"assertion":[{"value":"4 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}