{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T03:46:25Z","timestamp":1778643985643,"version":"3.51.4"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,2,20]],"date-time":"2024-02-20T00:00:00Z","timestamp":1708387200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,20]],"date-time":"2024-02-20T00:00:00Z","timestamp":1708387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62202301"],"award-info":[{"award-number":["62202301"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62202088"],"award-info":[{"award-number":["62202088"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62072082"],"award-info":[{"award-number":["62072082"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U2241212"],"award-info":[{"award-number":["U2241212"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1811261"],"award-info":[{"award-number":["U1811261"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012456","name":"National Social Science Foundation of China","doi-asserted-by":"crossref","award":["21 &ZD124"],"award-info":[{"award-number":["21 &ZD124"]}],"id":[{"id":"10.13039\/501100012456","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["N2216012"],"award-info":[{"award-number":["N2216012"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["N2216015"],"award-info":[{"award-number":["N2216015"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key R &D Program of Liaoning Province","award":["2020JH2\/10100037"],"award-info":[{"award-number":["2020JH2\/10100037"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s00778-024-00838-z","type":"journal-article","created":{"date-parts":[[2024,2,20]],"date-time":"2024-02-20T06:02:05Z","timestamp":1708408925000},"page":"781-806","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Ingress: an automated incremental graph processing system"],"prefix":"10.1007","volume":"33","author":[{"given":"Shufeng","family":"Gong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3398-8345","authenticated-orcid":false,"given":"Qiang","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengdong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Song","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanfeng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenyuan","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Geng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chong","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ge","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingren","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,20]]},"reference":[{"key":"838_CR1","unstructured":"Acar, U.A.: Self-adjusting computation. Ph.D. thesis, CMU (2005)"},{"key":"838_CR2","doi-asserted-by":"crossref","unstructured":"Baluja, S., Seth, R., Sivakumar, D., Jing, Y., Yagnik, J., Kumar, S., Ravichandran, D., Aly, M.: Video suggestion and discovery for youtube: taking random walks through the view graph. In: WWW, pp. 895\u2013904 (2008)","DOI":"10.1145\/1367497.1367618"},{"key":"838_CR3","volume-title":"Digraphs-Theory, Algorithms and Applications","author":"J Bang-Jensen","year":"2009","unstructured":"Bang-Jensen, J., Gutin, G.Z.: Digraphs-Theory, Algorithms and Applications, 2nd edn. Springer, Cham (2009)","edition":"2"},{"key":"838_CR4","doi-asserted-by":"crossref","unstructured":"Cai, Y., Giarrusso, P.G., Rendel, T., Ostermann, K.: A theory of changes for higher-order languages: incrementalizing $$\\lambda $$-calculi by static differentiation. In: PLDI, pp. 145\u2013155 (2014)","DOI":"10.1145\/2666356.2594304"},{"key":"838_CR5","doi-asserted-by":"crossref","unstructured":"Chang, X., Liu, X., Wen, J., Li, S., Fang, Y., Song, L., Qi, Y.: Continuous-time dynamic graph learning via neural interaction processes. In: CIKM, pp. 145\u2013154 (2020)","DOI":"10.1145\/3340531.3411946"},{"key":"838_CR6","unstructured":"Europe-OSM. https:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/DIMACS10\/europe_osm.html (2010)"},{"key":"838_CR7","doi-asserted-by":"crossref","unstructured":"Fan, W., Hu, C., Tian, C.: Incremental graph computations: Doable and undoable. In: SIGMOD, pp. 155\u2013169 (2017)","DOI":"10.1145\/3035918.3035944"},{"issue":"8","key":"838_CR8","first-page":"1261","volume":"13","author":"W Fan","year":"2020","unstructured":"Fan, W., Liu, M., Tian, C., Xu, R., Zhou, J.: Incrementalization of graph partitioning algorithms. PVLDB 13(8), 1261\u20131274 (2020)","journal-title":"PVLDB"},{"key":"838_CR9","doi-asserted-by":"crossref","unstructured":"Fan, W., Tiao, C., Xu, R., Yin, Q., Yu, W., Zhou, J.: Incrementalizing graph algorithms. pp. 459\u2013471 (2022)","DOI":"10.1145\/3448016.3452796"},{"key":"838_CR10","doi-asserted-by":"crossref","unstructured":"Fan, W., Xu, J., Wu, Y., Yu, W., Jiang, J., Zheng, Z., Zhang, B., Cao, Y., Tian, C.: Parallelizing sequential graph computations. In: SIGMOD, pp. 495\u2013510 (2017)","DOI":"10.1145\/3035918.3035942"},{"key":"838_CR11","doi-asserted-by":"crossref","unstructured":"Feng, G., Ma, Z., Li, D., Chen, S., Zhu, X., Han, W., Chen, W.: Risgraph: A real-time streaming system for evolving graphs to support sub-millisecond per-update analysis at millions ops\/s. In: SIGMOD, pp. 513\u2013527 (2021)","DOI":"10.1145\/3448016.3457263"},{"issue":"3","key":"838_CR12","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3), 596\u2013615 (1987)","journal-title":"J. ACM"},{"issue":"9","key":"838_CR13","first-page":"1613","volume":"14","author":"S Gong","year":"2021","unstructured":"Gong, S., Tian, C., Yin, Q., Yu, W., Zhang, Y., Geng, L., Yu, S., Yu, G., Zhou, J.: Automating incremental graph processing with flexible memoization. PVLDB 14(9), 1613\u20131625 (2021)","journal-title":"PVLDB"},{"key":"838_CR14","unstructured":"Gonzalez, J.E., Low, Y., Gu, H., Bickson, D., Guestrin, C.: Powergraph: distributed graph-parallel computation on natural graphs. In: OSDI, pp. 17\u201330 (2012)"},{"issue":"1","key":"838_CR15","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/421196","volume":"3","author":"E Gr\u00e4del","year":"1997","unstructured":"Gr\u00e4del, E., Kolaitis, P.G., Vardi, M.Y.: On the decision problem for two-variable first-order logic. Bull. Symb. Log. 3(1), 53\u201369 (1997)","journal-title":"Bull. Symb. Log."},{"key":"838_CR16","doi-asserted-by":"crossref","unstructured":"Guan, Z., Wu, J., Zhang, Q., Singh, A.K., Yan, X.: Assessing and ranking structural correlations in graphs. In: SIGMOD, pp. 937\u2013948 (2011)","DOI":"10.1145\/1989323.1989421"},{"key":"838_CR17","unstructured":"Hamilton, W.L., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: NIPS (2017)"},{"key":"838_CR18","doi-asserted-by":"crossref","unstructured":"Hammer, M.A., Khoo, Y.P., Hicks, M., Foster, J.S.: Adapton: composable, demand-driven incremental computation. In: PLDI, pp. 156\u2013166 (2014)","DOI":"10.1145\/2666356.2594324"},{"issue":"4","key":"838_CR19","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1145\/502090.502095","volume":"48","author":"J Holm","year":"2001","unstructured":"Holm, J., de Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM 48(4), 723\u2013760 (2001)","journal-title":"J. ACM"},{"key":"838_CR20","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Simrank: a measure of structural-context similarity. In: KDD, pp. 538\u2013543 (2002)","DOI":"10.1145\/775047.775126"},{"key":"838_CR21","doi-asserted-by":"crossref","unstructured":"Jiang, X., Xu, C., Yin, X., Zhao, Z., Gupta, R.: Tripoline: generalized incremental graph processing via graph triangle inequality. In: EuroSys, pp. 17\u201332 (2021)","DOI":"10.1145\/3447786.3456226"},{"issue":"1","key":"838_CR22","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz, L.: A new status index derived from sociometric analysis. Psychometrika 18(1), 39\u201343 (1953)","journal-title":"Psychometrika"},{"key":"838_CR23","doi-asserted-by":"crossref","unstructured":"Kim, K., Seo, I., Han, W., Lee, J., Hong, S., Chafi, H., Shin, H., Jeong, G.: Turboflux: a fast continuous subgraph matching system for streaming graph data. In: SIGMOD, pp. 411\u2013426 (2018)","DOI":"10.1145\/3183713.3196917"},{"key":"838_CR24","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. In: ICLR (2017)"},{"issue":"10","key":"838_CR25","first-page":"2453","volume":"26","author":"R Li","year":"2014","unstructured":"Li, R., Yu, J.X., Mao, R.: Efficient core maintenance in large dynamic graphs. TKDE 26(10), 2453\u20132465 (2014)","journal-title":"TKDE"},{"issue":"4","key":"838_CR26","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1023\/A:1026547031739","volume":"13","author":"YA Liu","year":"2000","unstructured":"Liu, Y.A.: Efficiency by incrementalization: an introduction. High. Order Symb. Comput. 13(4), 289\u2013313 (2000)","journal-title":"High. Order Symb. Comput."},{"key":"838_CR27","doi-asserted-by":"crossref","unstructured":"Luo, X., Liu, L., Yang, Y., Bo, L., Cao, Y., Wu, J., Li, Q., Yang, K., Zhu, K.Q.: Alicoco: Alibaba e-commerce cognitive concept net. In: SIGMOD, pp. 313\u2013327 (2020)","DOI":"10.1145\/3318464.3386132"},{"key":"838_CR28","unstructured":"Libgrape-Lite. https:\/\/github.com\/alibaba\/libgrape-lite"},{"key":"838_CR29","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: SIGMOD, pp. 135\u2013146 (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"838_CR30","doi-asserted-by":"crossref","unstructured":"Mariappan, M., Che, J., Vora, K.: Dzig: Sparsity-aware incremental processing of streaming graphs. In: EuroSys, pp. 83\u201398 (2021)","DOI":"10.1145\/3447786.3456230"},{"key":"838_CR31","doi-asserted-by":"crossref","unstructured":"Mariappan, M., Vora, K.: Graphbolt: Dependency-driven synchronous processing of streaming graphs. In: EuroSys, pp. 1\u201316 (2019)","DOI":"10.1145\/3302424.3303974"},{"key":"838_CR32","doi-asserted-by":"crossref","unstructured":"Matijasevi\u010d, Y.V.: Diophantine representation of recursively enumerable predicates. In: Studies in Logic and the Foundations of Mathematics, vol.\u00a063, pp. 171\u2013177 (1971)","DOI":"10.1016\/S0049-237X(08)70846-2"},{"issue":"2","key":"838_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2818185","volume":"48","author":"RR McCune","year":"2015","unstructured":"McCune, R.R., Weninger, T., Madey, G.: Thinking like a vertex: a survey of vertex-centric frameworks for large-scale distributed graph processing. ACM Comput. Surv. 48(2), 1\u201339 (2015)","journal-title":"ACM Comput. Surv."},{"key":"838_CR34","doi-asserted-by":"crossref","unstructured":"McGregor, A., Vorotnikova, S., Vu, H.T.: Better algorithms for counting triangles in data streams. In: PODS, pp. 401\u2013411 (2016)","DOI":"10.1145\/2902251.2902283"},{"key":"838_CR35","unstructured":"McSherry, F., Murray, D.G., Isaacs, R., Isard, M.: Differential dataflow. In: CIDR (2013)"},{"key":"838_CR36","doi-asserted-by":"crossref","unstructured":"de\u00a0Moura, L.M., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: TACAS, pp. 337\u2013340 (2008)","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"838_CR37","doi-asserted-by":"crossref","unstructured":"Murray, D.G., McSherry, F., Isaacs, R., Isard, M., Barham, P., Abadi, M.: Naiad: a timely dataflow system. In: SOSP, pp. 439\u2013455 (2013)","DOI":"10.1145\/2517349.2522738"},{"key":"838_CR38","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: bringing order to the web. Technical report, Stanford InfoLab (1999)"},{"key":"838_CR39","doi-asserted-by":"crossref","unstructured":"Pearl, J.: Reverend Bayes on inference engines: a distributed hierarchical approach. In: AAAI, pp. 129\u2013138 (1982)","DOI":"10.1145\/3501714.3501727"},{"key":"838_CR40","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015). http:\/\/networkrepository.com","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"838_CR41","unstructured":"Road-USA-Graph. https:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/DIMACS10\/road_usa.html (2011)"},{"issue":"6","key":"838_CR42","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B Schieber","year":"1988","unstructured":"Schieber, B., Vishkin, U.: On finding lowest common ancestors: simplification and parallelization. SIAM J. Comput. 17(6), 1253\u20131262 (1988)","journal-title":"SIAM J. Comput."},{"key":"838_CR43","doi-asserted-by":"crossref","unstructured":"Sengupta, D., Sundaram, N., Zhu, X., Willke, T.L., Young, J., Wolf, M., Schwan, K.: Graphin: an online high performance incremental graph processing framework. In: Euro-Par, pp. 319\u2013333 (2016)","DOI":"10.1007\/978-3-319-43659-3_24"},{"key":"838_CR44","doi-asserted-by":"crossref","unstructured":"Shi, X., Cui, B., Shao, Y., Tong, Y.: Tornado: a system for real-time iterative analysis over evolving data. In: SIGMOD, pp. 417\u2013430 (2016)","DOI":"10.1145\/2882903.2882950"},{"key":"838_CR45","unstructured":"Sukhbaatar, S., Szlam, A., Fergus, R.: Learning multiagent communication with backpropagation. In: NIPS (2016)"},{"key":"838_CR46","unstructured":"Size of Wikipedia (2020). https:\/\/en.wikipedia.org\/wiki\/Wikipedia:Size_of_Wikipedia"},{"issue":"3","key":"838_CR47","first-page":"193","volume":"7","author":"Y Tian","year":"2013","unstructured":"Tian, Y., Balmin, A., Corsten, S.A., Tatikonda, S., McPherson, J.: From \u201cthink like a vertex\u2019\u2019 to \u201cthink like a graph\u2019\u2019. PVLDB 7(3), 193\u2013204 (2013)","journal-title":"PVLDB"},{"key":"838_CR48","unstructured":"UK-2005. https:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/LAW\/uk-2005.html (2005)"},{"issue":"8","key":"838_CR49","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"LG Valiant","year":"1990","unstructured":"Valiant, L.G.: A bridging model for parallel computation. CACM 33(8), 103\u2013111 (1990)","journal-title":"CACM"},{"key":"838_CR50","doi-asserted-by":"crossref","unstructured":"Vora, K., Gupta, R., Xu, G.: Kickstarter: Fast and accurate computations on streaming graphs via trimmed approximations. In: ASPLOS, pp. 237\u2013251 (2017)","DOI":"10.1145\/3093336.3037748"},{"key":"838_CR51","doi-asserted-by":"crossref","unstructured":"Wang, Q., Zhang, Y., Wang, H., Geng, L., Lee, R., Zhang, X., Yu, G.: Automating incremental and asynchronous evaluation for recursive aggregate data processing. In: SIGMOD, pp. 2439\u20132454 (2020)","DOI":"10.1145\/3318464.3389712"},{"key":"838_CR52","unstructured":"Xu, S., Zhang, H., Neubig, G., Dai, W., Kim, J.K., Deng, Z., Ho, Q., Yang, G., Xing, E.P.: Cavs: an efficient runtime system for dynamic neural networks. In: ATC, pp. 937\u2013950 (2018)"},{"key":"838_CR53","unstructured":"Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. In: ICDM, pp. 1\u20138 (2015)"},{"key":"838_CR54","doi-asserted-by":"crossref","unstructured":"Zakian, T.A.K., Capelli, L.A.R., Hu, Z.: Incrementalization of vertex-centric programs. In: IPDPS, pp. 1019\u20131029 (2019)","DOI":"10.1109\/IPDPS.2019.00109"},{"key":"838_CR55","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Gao, Q., Gao, L., Wang, C.: Priter: a distributed framework for prioritized iterative computations. In: SOCC, pp. 1\u201314 (2011)","DOI":"10.1145\/2038916.2038929"},{"issue":"8","key":"838_CR56","first-page":"2091","volume":"25","author":"Y Zhang","year":"2013","unstructured":"Zhang, Y., Gao, Q., Gao, L., Wang, C.: Maiter: an asynchronous graph processing framework for delta-based accumulative iterative computation. TPDS 25(8), 2091\u20132100 (2013)","journal-title":"TPDS"},{"key":"838_CR57","doi-asserted-by":"crossref","unstructured":"Zhao, J., Yang, Y., Zhang, Y., Liao, X., Gu, L., He, L., He, B., Jin, H., Liu, H., Jiang, X., Yu, H.: Tdgraph: a topology-driven accelerator for high-performance streaming graph processing. In: ISCA, pp. 116\u2013129 (2022)","DOI":"10.1145\/3470496.3527409"},{"key":"838_CR58","doi-asserted-by":"crossref","unstructured":"Zheng, L., Li, Z., Li, J., Li, Z., Gao, J.: Addgraph: anomaly detection in dynamic graph using attention-based temporal GCN. In: IJCAI (2019)","DOI":"10.24963\/ijcai.2019\/614"},{"key":"838_CR59","unstructured":"Zhu, X., Chen, W., Zheng, W., Ma, X.: Gemini: A computation-centric distributed graph processing system. In: OSDI, pp. 301\u2013316 (2016)"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-024-00838-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-024-00838-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-024-00838-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,23]],"date-time":"2024-04-23T07:08:45Z","timestamp":1713856125000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-024-00838-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,20]]},"references-count":59,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["838"],"URL":"https:\/\/doi.org\/10.1007\/s00778-024-00838-z","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,20]]},"assertion":[{"value":"24 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 January 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}