{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T22:36:20Z","timestamp":1778279780550,"version":"3.51.4"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T00:00:00Z","timestamp":1732579200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T00:00:00Z","timestamp":1732579200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["62172146"],"award-info":[{"award-number":["62172146"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2021ZD40303"],"award-info":[{"award-number":["2021ZD40303"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s00778-024-00882-9","type":"journal-article","created":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T05:12:21Z","timestamp":1732597941000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Accelerating maximum biplex search over large bipartite graphs"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-2444-8331","authenticated-orcid":false,"given":"Dong","family":"Pan","sequence":"first","affiliation":[]},{"given":"Xu","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Wensheng","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Zhibang","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Qing","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Yunjun","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Kenli","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,26]]},"reference":[{"key":"882_CR1","unstructured":"Xilinx. https:\/\/www.xilinx.com (2024)"},{"key":"882_CR2","unstructured":"Xilinx documents. https:\/\/docs.xilinx.com (2024)"},{"key":"882_CR3","doi-asserted-by":"crossref","unstructured":"Abidi, A., Zhou, R., Chen, L., Liu, C.: Pivot-based maximal biclique enumeration. In: IJCAI, pp. 3558\u20133564 (2020)","DOI":"10.24963\/ijcai.2020\/492"},{"issue":"1","key":"882_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.dam.2003.09.004","volume":"145","author":"G Alexe","year":"2004","unstructured":"Alexe, G., Alexe, S., Crama, Y., Foldes, S., Hammer, P.L., Simeone, B.: Consensus algorithms for the generation of all maximal bicliques. Discret. Appl. Math. 145(1), 11\u201321 (2004)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"882_CR5","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1137\/080729256","volume":"40","author":"C Amb\u00fchl","year":"2011","unstructured":"Amb\u00fchl, C., Mastrolilli, M., Svensson, O.: Inapproximability results for maximum edge biclique, minimum linear arrangement, and sparsest cut. SIAM J. Comput. 40(2), 567\u2013596 (2011)","journal-title":"SIAM J. Comput."},{"key":"882_CR6","unstructured":"Besta, M., Stanojevic, D., Licht, J.D.F., Ben-Nun, T., Hoefler, T.: Graph processing on fpgas: Taxonomy, survey, challenges. arXiv preprint arXiv:1903.06697 (2019)"},{"issue":"10","key":"882_CR7","doi-asserted-by":"publisher","first-page":"2267","DOI":"10.1016\/j.dam.2008.06.052","volume":"157","author":"E Birmel\u00e9","year":"2009","unstructured":"Birmel\u00e9, E.: A scale-free graph model based on bipartite graphs. Discret. Appl. Math. 157(10), 2267\u20132284 (2009)","journal-title":"Discret. Appl. Math."},{"issue":"9","key":"882_CR8","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Finding all cliques of an undirected graph (algorithm 457). Commun. ACM 16(9), 575\u2013576 (1973)","journal-title":"Commun. ACM"},{"key":"882_CR9","doi-asserted-by":"crossref","unstructured":"Chang, W.C., Vakati, S., Krause, R., Eulenstein, O.: Exploring biological interaction networks with tailored weighted quasi-bicliques. In: BMC bioinformatics, pp. 1\u20139. BioMed Central (2012)","DOI":"10.1186\/1471-2105-13-S10-S16"},{"key":"882_CR10","doi-asserted-by":"crossref","unstructured":"Chen, L., Liu, C., Zhou, R., Xu, J., Li, J.: Efficient exact algorithms for maximum balanced biclique search in bipartite graphs. In: SIGMOD \u201921: International Conference on Management of Data, pp. 248\u2013260. ACM (2021)","DOI":"10.1145\/3448016.3459241"},{"key":"882_CR11","doi-asserted-by":"crossref","unstructured":"Conte, A., De\u00a0Matteis, T., De\u00a0Sensi, D., Grossi, R., Marino, A., Versari, L.: D2k: scalable community detection in massive networks via small-diameter k-plexes. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 1272\u20131281 (2018)","DOI":"10.1145\/3219819.3220093"},{"key":"882_CR12","doi-asserted-by":"crossref","unstructured":"Conte, A., Firmani, D., Mordente, C., Patrignani, M., Torlone, R.: Fast enumeration of large k-plexes. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 115\u2013124 (2017)","DOI":"10.1145\/3097983.3098031"},{"key":"882_CR13","doi-asserted-by":"crossref","unstructured":"Date, K., Feng, K., Nagi, R., Xiong, J., Kim, N.S., Hwu, W.M.: Collaborative (cpu+ gpu) algorithms for triangle counting and truss decomposition on the minsky architecture: Static graph challenge: Subgraph isomorphism. In: 2017 IEEE High Performance Extreme Computing Conference (HPEC), pp. 1\u20137. IEEE (2017)","DOI":"10.1109\/HPEC.2017.8091042"},{"key":"882_CR14","doi-asserted-by":"crossref","unstructured":"Ding, D., Li, H., Huang, Z., Mamoulis, N.: Efficient fault-tolerant group recommendation using alpha-beta-core. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, pp. 2047\u20132050 (2017)","DOI":"10.1145\/3132847.3133130"},{"issue":"1","key":"882_CR15","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00778-019-00556-x","volume":"29","author":"Y Fang","year":"2020","unstructured":"Fang, Y., Huang, X., Qin, L., Zhang, Y., Zhang, W., Cheng, R., Lin, X.: A survey of community search over big graphs. VLDB J. 29(1), 353\u2013392 (2020)","journal-title":"VLDB J."},{"key":"882_CR16","doi-asserted-by":"crossref","unstructured":"Fang, Y., Wang, K., Lin, X., Zhang, W.: Cohesive subgraph search over big heterogeneous information networks: Applications, challenges, and solutions. In: SIGMOD \u201921: International Conference on Management of Data, pp. 2829\u20132838. ACM (2021)","DOI":"10.1145\/3448016.3457538"},{"issue":"14","key":"882_CR17","doi-asserted-by":"publisher","first-page":"e150","DOI":"10.1093\/bioinformatics\/btl243","volume":"22","author":"E Fratkin","year":"2006","unstructured":"Fratkin, E., Naughton, B.T., Brutlag, D.L., Batzoglou, S.: Motifcut: regulatory motifs finding with maximum density subgraphs. Bioinformatics 22(14), e150\u2013e157 (2006)","journal-title":"Bioinformatics"},{"key":"882_CR18","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.ins.2021.04.027","volume":"572","author":"Y He","year":"2021","unstructured":"He, Y., Wang, K., Zhang, W., Lin, X., Zhang, Y.: Exploring cohesive subgraphs with vertex engagement and tie strength in bipartite graphs. Inf. Sci. 572, 277\u2013296 (2021)","journal-title":"Inf. Sci."},{"issue":"1","key":"882_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13015-016-0074-8","volume":"11","author":"R Henriques","year":"2016","unstructured":"Henriques, R., Madeira, S.C.: Bicnet: flexible module discovery in large-scale biological networks using biclustering. Algorithms Mol. Biol. 11(1), 1\u201330 (2016)","journal-title":"Algorithms Mol. Biol."},{"key":"882_CR20","doi-asserted-by":"crossref","unstructured":"Jin, X., Yang, Z., Lin, X., Yang, S., Qin, L., Peng, Y.: Fast: Fpga-based subgraph matching on massive graphs. In: 2021 IEEE 37th International Conference on Data Engineering (ICDE), pp. 1452\u20131463 (2021)","DOI":"10.1109\/ICDE51399.2021.00129"},{"key":"882_CR21","doi-asserted-by":"crossref","unstructured":"Khot, S.: Improved inapproximability results for maxclique, chromatic number and approximate graph coloring. In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pp. 600\u2013609 (2001)","DOI":"10.1109\/SFCS.2001.959936"},{"key":"882_CR22","doi-asserted-by":"crossref","unstructured":"Lai, Z., Peng, Y., Yang, S., Lin, X., Zhang, W.: Pefp: Efficient k-hop constrained st simple path enumeration on fpga. In: 2021 IEEE 37th International Conference on Data Engineering (ICDE), pp. 1320\u20131331. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00118"},{"key":"882_CR23","doi-asserted-by":"crossref","unstructured":"Lanciano, T., Miyauchi, A., Fazzone, A., Bonchi, F.: A survey on the densest subgraph problem and its variants. arXiv preprint arXiv:2303.14467 (2023)","DOI":"10.1145\/3653298"},{"key":"882_CR24","unstructured":"Lewis, H.R.: Computers and intractability. a guide to the theory of np-completeness (1983)"},{"key":"882_CR25","unstructured":"Li, Z., Fresacher, M., Scarlett, J.: Learning erdos-renyi random graphs via edge detecting queries. Adv. Neural Inf. Process. Syst. 32 (2019)"},{"issue":"5","key":"882_CR26","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1007\/s00778-020-00606-9","volume":"29","author":"B Liu","year":"2020","unstructured":"Liu, B., Yuan, L., Lin, X., Qin, L., Zhang, W., Zhou, J.: Efficient ($$\\alpha $$, $$\\beta $$)-core computation in bipartite graphs. VLDB J. 29(5), 1075\u20131099 (2020)","journal-title":"VLDB J."},{"key":"882_CR27","doi-asserted-by":"crossref","unstructured":"Liu, G., Sim, K., Li, J.: Efficient mining of large maximal bicliques. In: Data Warehousing and Knowledge Discovery: 8th International Conference, DaWaK 2006, Krakow, Poland, September 4-8, 2006. Proceedings 8, no.\u00a012 in DaWaK\u201906, pp. 437\u2013448 (2006)","DOI":"10.1007\/11823728_42"},{"key":"882_CR28","doi-asserted-by":"crossref","unstructured":"Liu, Q., Liao, X., Huang, X., Xu, J., Gao, Y.: Distributed ($$\\alpha $$, $$\\beta $$)-core decomposition over bipartite graphs. In: 39th IEEE International Conference on Data Engineering, ICDE 2023, Anaheim, CA, USA, April 3-7, 2023, pp. 909\u2013921. IEEE (2023)","DOI":"10.1109\/ICDE55515.2023.00075"},{"key":"882_CR29","doi-asserted-by":"crossref","unstructured":"Liu, Q., Zhao, M., Huang, X., Xu, J., Gao, Y.: Truss-based community search over large directed graphs. In: Proceedings of the 2020 International Conference on Management of Data, SIGMOD Conference 2020, pp. 2183\u20132197. ACM (2020)","DOI":"10.1145\/3318464.3380587"},{"issue":"2","key":"882_CR30","first-page":"354","volume":"7","author":"X Liu","year":"2008","unstructured":"Liu, X., Li, J., Wang, L.: Modeling protein interacting groups by quasi-bicliques: complexity, algorithm, and application. IEEE\/ACM Trans. Comput. Biol. Bioinf. 7(2), 354\u2013364 (2008)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"882_CR31","doi-asserted-by":"crossref","unstructured":"Luo, W., Li, K., Zhou, X., Gao, Y., Li, K.: Maximum biplex search over bipartite graphs. In: 2022 IEEE 38th International Conference on Data Engineering (ICDE), pp. 898\u2013910 (2022)","DOI":"10.1109\/ICDE53745.2022.00072"},{"key":"882_CR32","doi-asserted-by":"crossref","unstructured":"Luo, W., Zhou, X., Yang, J., Peng, P., Xiao, G., Gao, Y.: Efficient approaches to top-r influential community search. IEEE Internet Things J. (2020)","DOI":"10.1109\/JIOT.2020.3021488"},{"issue":"9","key":"882_CR33","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."},{"issue":"2","key":"882_CR34","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1109\/TCBB.2012.139","volume":"10","author":"U Maulik","year":"2012","unstructured":"Maulik, U., Mukhopadhyay, A., Bhattacharyya, M., Kaderali, L., Brors, B., Bandyopadhyay, S., Eils, R.: Mining quasi-bicliques from hiv-1-human protein interaction network: a multiobjective biclustering approach. IEEE\/ACM Trans. Comput. Biol. Bioinf. 10(2), 423\u2013435 (2012)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"issue":"1\u20133","key":"882_CR35","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1023\/B:MACH.0000033117.77257.41","volume":"56","author":"N Mishra","year":"2004","unstructured":"Mishra, N., Ron, D., Swaminathan, R.: A new conceptual clustering framework. Mach. Learn. 56(1\u20133), 115\u2013151 (2004)","journal-title":"Mach. Learn."},{"key":"882_CR36","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Pachocki, J., Peng, R., Tsourakakis, C., Xu, S.C.: Scalable large near-clique detection in large-scale networks via sampling. In: The 21th ACM SIGKDD International Conference, pp. 815-824 (2015)","DOI":"10.1145\/2783258.2783385"},{"key":"882_CR37","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Pachocki, J., Peng, R., Tsourakakis, C., Xu, S.C.: Scalable large near-clique detection in large-scale networks via sampling. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 815\u2013824 (2015)","DOI":"10.1145\/2783258.2783385"},{"issue":"1","key":"882_CR38","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1147\/sj.461.0135","volume":"46","author":"RA Mushlin","year":"2007","unstructured":"Mushlin, R.A., Kershenbaum, A., Gallagher, S.T., Rebbeck, T.R.: A graph-theoretical approach for pattern discovery in epidemiological research. IBM Syst. J. 46(1), 135\u2013149 (2007)","journal-title":"IBM Syst. J."},{"issue":"7","key":"882_CR39","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1093\/molbev\/msg115","volume":"20","author":"MJ Sanderson","year":"2003","unstructured":"Sanderson, M.J., Driskell, A.C., Ree, R.H., Eulenstein, O., Langley, S.: Obtaining maximal concatenated phylogenetic data sets from large sequence databases. Mol. Biol. Evol. 20(7), 1036\u20131042 (2003)","journal-title":"Mol. Biol. Evol."},{"issue":"4","key":"882_CR40","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1002\/sam.10051","volume":"2","author":"K Sim","year":"2009","unstructured":"Sim, K., Li, J., Gopalkrishnan, V., Liu, G.: Mining maximal quasi-bicliques: novel algorithm and applications in the stock market and protein networks. Stat. Anal. Data Min. ASA Data Sci. J. 2(4), 255\u2013273 (2009)","journal-title":"Stat. Anal. Data Min. ASA Data Sci. J."},{"key":"882_CR41","doi-asserted-by":"crossref","unstructured":"Su, X., Lin, Y., Zou, L.: Fasi: Fpga-friendly subgraph isomorphism on massive graphs. In: 2023 IEEE 39th International Conference on Data Engineering (ICDE), pp. 2099\u20132112 (2023)","DOI":"10.1109\/ICDE55515.2023.00163"},{"key":"882_CR42","doi-asserted-by":"crossref","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Efficient bitruss decomposition for large-scale bipartite graphs. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE), pp. 661\u2013672. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00063"},{"key":"882_CR43","doi-asserted-by":"crossref","unstructured":"Wang, K., Zhang, W., Lin, X., Zhang, Y., Qin, L., Zhang, Y.: Efficient and effective community search on large-scale bipartite graphs. In: 37th IEEE International Conference on Data Engineering, ICDE 2021, pp. 85\u201396. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00015"},{"issue":"3","key":"882_CR44","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s10878-011-9392-4","volume":"25","author":"L Wang","year":"2013","unstructured":"Wang, L.: Near optimal solutions for maximum quasi-bicliques. J. Comb. Optim. 25(3), 481\u2013497 (2013)","journal-title":"J. Comb. Optim."},{"issue":"3","key":"882_CR45","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/j.ympev.2005.02.008","volume":"35","author":"C Yan","year":"2005","unstructured":"Yan, C., Burleigh, J.G., Eulenstein, O.: Identifying optimal incomplete phylogenetic data sets from sequence databases. Mol. Phylogenet. Evol. 35(3), 528\u2013535 (2005)","journal-title":"Mol. Phylogenet. Evol."},{"issue":"5","key":"882_CR46","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1007\/s00778-023-00786-0","volume":"32","author":"J Yang","year":"2023","unstructured":"Yang, J., Peng, Y., Ouyang, D., Zhang, W., Lin, X., Zhao, X.: (p, q)-biclique counting and enumeration for large sparse bipartite graphs. VLDB J. 32(5), 1137\u20131161 (2023)","journal-title":"VLDB J."},{"issue":"1","key":"882_CR47","doi-asserted-by":"publisher","first-page":"49:1","DOI":"10.1145\/3588729","volume":"1","author":"K Yu","year":"2023","unstructured":"Yu, K., Long, C.: Maximum k-biplex search on bipartite graphs: a symmetric-bk branching approach. Proc. ACM Manag. Data 1(1), 49:1-49:26 (2023)","journal-title":"Proc. ACM Manag. Data"},{"key":"882_CR48","doi-asserted-by":"crossref","unstructured":"Yu, K., Long, C., Deepak, P., Chakraborty, T.: On efficient large maximal biplex discovery. IEEE Transactions on Knowledge and Data Engineering (2021)","DOI":"10.1109\/TKDE.2021.3077071"},{"key":"882_CR49","doi-asserted-by":"crossref","unstructured":"Yu, K., Long, C., Liu, S., Yan, D.: Efficient algorithms for maximal k-biplex enumeration. In: Proceedings of the 2022 International Conference on Management of Data, pp. 860\u2013873 (2022)","DOI":"10.1145\/3514221.3517847"},{"issue":"1","key":"882_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-15-110","volume":"15","author":"Y Zhang","year":"2014","unstructured":"Zhang, Y., Phillips, C.A., Rogers, G.L., Baker, E.J., Chesler, E.J., Langston, M.A.: On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types. BMC Bioinform. 15(1), 1\u201318 (2014)","journal-title":"BMC Bioinform."},{"key":"882_CR51","doi-asserted-by":"crossref","unstructured":"Zhao, G., Wang, K., Zhang, W., Lin, X., Zhang, Y., He, Y.: Efficient computation of cohesive subgraphs in uncertain bipartite graphs. In: 2022 IEEE 38th International Conference on Data Engineering (ICDE), pp. 2333\u20132345. IEEE (2022)","DOI":"10.1109\/ICDE53745.2022.00220"},{"key":"882_CR52","doi-asserted-by":"crossref","unstructured":"Zou, Z.: Bitruss decomposition of bipartite graphs. In: International Conference on Database Systems for Advanced Applications, pp. 218\u2013233. Springer (2016)","DOI":"10.1007\/978-3-319-32049-6_14"},{"key":"882_CR53","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, STOC \u201906, p. 681-690 (2006)","DOI":"10.1145\/1132516.1132612"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-024-00882-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-024-00882-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-024-00882-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,27]],"date-time":"2025-01-27T05:53:26Z","timestamp":1737957206000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-024-00882-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,26]]},"references-count":53,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["882"],"URL":"https:\/\/doi.org\/10.1007\/s00778-024-00882-9","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,26]]},"assertion":[{"value":"28 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"1"}}