{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:00:15Z","timestamp":1740178815164,"version":"3.37.3"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T00:00:00Z","timestamp":1715040000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T00:00:00Z","timestamp":1715040000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DBI IIBR 2047631","IIS 2145314"],"award-info":[{"award-number":["DBI IIBR 2047631","IIS 2145314"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000048","name":"American Cancer Society","doi-asserted-by":"publisher","award":["RSG-22-062-01-MM"],"award-info":[{"award-number":["RSG-22-062-01-MM"]}],"id":[{"id":"10.13039\/100000048","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007316","name":"Division of Cancer Prevention, National Cancer Institute","doi-asserted-by":"publisher","award":["5P30CA082709-2"],"award-info":[{"award-number":["5P30CA082709-2"]}],"id":[{"id":"10.13039\/100007316","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Appl. and Comput. Topology"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s41468-024-00172-x","type":"journal-article","created":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T11:01:58Z","timestamp":1715079718000},"page":"1333-1361","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Ambiguities in neural-network-based hyperedge prediction"],"prefix":"10.1007","volume":"8","author":[{"given":"Changlin","family":"Wan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muhan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pengtao","family":"Dang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Hao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sha","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,7]]},"reference":[{"issue":"6","key":"172_CR1","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1038\/nrg2102","volume":"8","author":"U Alon","year":"2007","unstructured":"Alon, U.: Network motifs: theory and experimental approaches. Nat. Rev. Genet. 8(6), 450\u2013461 (2007)","journal-title":"Nat. Rev. Genet."},{"key":"172_CR2","unstructured":"Arya, D., Gupta, D.K., Rudinac, S., Worring, M.: Hypersage: generalizing inductive representation learning on hypergraphs (2020). arXiv preprint arXiv:2010.04558"},{"key":"172_CR3","unstructured":"Azizian, W., Lelarge, M.: Expressive power of invariant and equivariant graph neural networks (2020). arXiv preprint arXiv:2006.15646"},{"key":"172_CR4","doi-asserted-by":"publisher","first-page":"107637","DOI":"10.1016\/j.patcog.2020.107637","volume":"110","author":"S Bai","year":"2021","unstructured":"Bai, S., Zhang, F., Torr, P.H.: Hypergraph convolution and hypergraph attention. Pattern Recognit. 110, 107637 (2021)","journal-title":"Pattern Recognit."},{"issue":"7646","key":"172_CR5","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1038\/nature21411","volume":"543","author":"RA Beagrie","year":"2017","unstructured":"Beagrie, R.A., Scialdone, A., Schueler, M., Kraemer, D.C., Chotalia, M., Xie, S.Q., Barbieri, M., de Santiago, I., Lavitas, L.-M., Branco, M.R., et al.: Complex multi-enhancer contacts captured by genome architecture mapping. Nature 543(7646), 519\u2013524 (2017)","journal-title":"Nature"},{"key":"172_CR6","unstructured":"Benson, A.R., Gleich, D.F., Higham, D.J.: Higher-order network analysis takes off, fueled by classical ideas and new data (2021). arXiv preprint arXiv:2103.05031"},{"issue":"6295","key":"172_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1126\/science.aad9029","volume":"353","author":"AR Benson","year":"2016","unstructured":"Benson, A.R., Gleich, D.F., Leskovec, J.: Higher-order organization of complex networks. Science 353(6295), 163\u2013166 (2016)","journal-title":"Science"},{"issue":"48","key":"172_CR8","doi-asserted-by":"publisher","first-page":"11221","DOI":"10.1073\/pnas.1800683115","volume":"115","author":"AR Benson","year":"2018","unstructured":"Benson, A.R., Abebe, R., Schaub, M.T., Jadbabaie, A., Kleinberg, J.: Simplicial closure and higher-order link prediction. Proc. Natl. Acad. Sci. 115(48), 11221\u201311230 (2018)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"172_CR9","unstructured":"Berge, C.: Hypergraphs: Combinatorics of Finite Sets, vol. 45. Elsevier (1984)"},{"key":"172_CR10","unstructured":"Chien, E., Pan, C., Peng, J., Milenkovic, O.: You are allset: a multiset function framework for hypergraph neural networks. In: International Conference on Learning Representations (2022)"},{"key":"172_CR11","unstructured":"Cotta, L., Teixeira, C.H., Swami, A., Ribeiro, B.: Unsupervised joint $$ k $$-node graph representations with compositional energy-based models. In: NeurIPS (2020)"},{"issue":"7772","key":"172_CR12","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1038\/s41586-019-1517-4","volume":"573","author":"P Cramer","year":"2019","unstructured":"Cramer, P.: Organization and regulation of gene transcription. Nature 573(7772), 45\u201354 (2019)","journal-title":"Nature"},{"issue":"4","key":"172_CR13","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.tips.2005.02.007","volume":"26","author":"P Csermely","year":"2005","unstructured":"Csermely, P., Agoston, V., Pongor, S.: The efficiency of multi-target drugs: the network approach might help drug design. Trends Pharmacol. Sci. 26(4), 178\u2013182 (2005)","journal-title":"Trends Pharmacol. Sci."},{"issue":"7398","key":"172_CR14","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1038\/nature11082","volume":"485","author":"JR Dixon","year":"2012","unstructured":"Dixon, J.R., Selvaraj, S., Yue, F., Kim, A., Li, Y., Shen, Y., Hu, M., Liu, J.S., Ren, B.: Topological domains in mammalian genomes identified by analysis of chromatin interactions. Nature 485(7398), 376\u2013380 (2012)","journal-title":"Nature"},{"key":"172_CR15","unstructured":"Dong, Y., Sawin, W., Bengio, Y.: Hnhn: Hypergraph networks with hyperedge neurons (2020). arXiv preprint arXiv:2006.12278"},{"key":"172_CR16","doi-asserted-by":"crossref","unstructured":"Feng, Y., You, H., Zhang, Z., Ji, R., Gao, Y.: Hypergraph neural networks. In: AAAI (2019)","DOI":"10.1609\/aaai.v33i01.33013558"},{"issue":"3\u20135","key":"172_CR17","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3\u20135), 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"key":"172_CR18","unstructured":"Fountoulakis, K., Li, P., Yang, S.: Local hyper-flow diffusion. In: Advances in Neural Information Processing Systems 34 (2021)"},{"key":"172_CR19","unstructured":"Hamilton, W., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: NeurIPS (2017)"},{"key":"172_CR20","unstructured":"Hein, M., Setzer, S., Jost, L., Rangapuram, S.S.: The total variation on hypergraphs-learning on hypergraphs revisited. In: Advances in Neural Information Processing Systems, pp. 2427\u20132435 (2013)"},{"key":"172_CR21","doi-asserted-by":"crossref","unstructured":"Huang, J., Yang, J.: Unignn: a unified framework for graph and hypergraph neural networks (2021). arXiv preprint arXiv:2105.00956","DOI":"10.24963\/ijcai.2021\/353"},{"issue":"3","key":"172_CR22","first-page":"1","volume":"38","author":"J Huang","year":"2020","unstructured":"Huang, J., Chen, C., Ye, F., Hu, W., Zheng, Z.: Nonuniform hyper-network embedding with dual mechanism. ACM Trans. Inf. Syst. (TOIS) 38(3), 1\u201318 (2020)","journal-title":"ACM Trans. Inf. Syst. (TOIS)"},{"key":"172_CR23","doi-asserted-by":"crossref","unstructured":"Jiang, J., Wei, Y., Feng, Y., Cao, J., Gao, Y.: Dynamic hypergraph neural networks. In: IJCAI (2019)","DOI":"10.24963\/ijcai.2019\/366"},{"issue":"10","key":"172_CR24","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1038\/s42256-020-00236-4","volume":"2","author":"J Jim\u00e9nez-Luna","year":"2020","unstructured":"Jim\u00e9nez-Luna, J., Grisoni, F., Schneider, G.: Drug discovery with explainable artificial intelligence. Nat. Mach. Intell. 2(10), 573\u2013584 (2020)","journal-title":"Nat. Mach. Intell."},{"key":"172_CR25","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. In: ICLR (2017)"},{"issue":"4","key":"172_CR26","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1038\/s41567-019-0459-y","volume":"15","author":"R Lambiotte","year":"2019","unstructured":"Lambiotte, R., Rosvall, M., Scholtes, I.: From networks to optimal higher-order models of complex systems. Nat. Phys. 15(4), 313\u2013320 (2019)","journal-title":"Nat. Phys."},{"key":"172_CR27","unstructured":"Lee, J., Lee, Y., Kim, J., Kosiorek, A., Choi, S., Teh, Y.W.: Set transformer: a framework for attention-based permutation-invariant neural networks. In: International Conference on Machine Learning, pp. 3744\u20133753. PMLR (2019)"},{"key":"172_CR28","doi-asserted-by":"crossref","unstructured":"Li, P., Dau, H., Puleo, G., Milenkovic, O.: Motif clustering and overlapping clustering for social network analysis. In: INFOCOM 2017-IEEE Conference on Computer Communications, IEEE, pp. 1\u20139. IEEE (2017)","DOI":"10.1109\/INFOCOM.2017.8056956"},{"key":"172_CR29","unstructured":"Li, P., Wang, Y., Wang, H., Leskovec, J.: Distance encoding: Design provably more powerful neural networks for graph representation learning. In: NeurIPS (2020)"},{"issue":"7","key":"172_CR30","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell, D., Kleinberg, J.: The link-prediction problem for social networks. J. Am. Soc. Inf. Sci. Technol. 58(7), 1019 (2007)","journal-title":"J. Am. Soc. Inf. Sci. Technol."},{"key":"172_CR31","doi-asserted-by":"crossref","unstructured":"Liu, Y., Ma, J., Li, P.: Neural predicting higher-order patterns in temporal networks. In: Proceedings of the ACM Web Conference 2022, pp. 1340\u20131351 (2022)","DOI":"10.1145\/3485447.3512181"},{"issue":"1","key":"172_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2012.02.006","volume":"519","author":"L L\u00fc","year":"2012","unstructured":"L\u00fc, L., Medo, M., Yeung, C.H., Zhang, Y.-C., Zhang, Z.-K., Zhou, T.: Recommender systems. Phys. Rep. 519(1), 1\u201349 (2012)","journal-title":"Phys. Rep."},{"key":"172_CR33","unstructured":"Maron, H., Ben-Hamu, H., Serviansky, H., Lipman, Y.: Provably powerful graph networks. In: Advances in Neural Information Processing Systems (2019)"},{"issue":"6","key":"172_CR34","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1016\/j.ajhg.2020.04.016","volume":"106","author":"US Melo","year":"2020","unstructured":"Melo, U.S., Sch\u00f6pflin, R., Acuna-Hidalgo, R., Mensah, M.A., Fischer-Zirnsak, B., Holtgrewe, M., Klever, M.-K., T\u00fcrkmen, S., Heinrich, V., Pluym, I.D., et al.: Hi-c identifies complex genomic rearrangements and tad-shuffling in developmental diseases. Am. J. Hum. Genet. 106(6), 872\u2013884 (2020)","journal-title":"Am. J. Hum. Genet."},{"issue":"5594","key":"172_CR35","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: simple building blocks of complex networks. Science 298(5594), 824\u2013827 (2002)","journal-title":"Science"},{"key":"172_CR36","doi-asserted-by":"crossref","unstructured":"Morris, C., Rattan, G., Mutzel, P.: Weisfeiler and leman go sparse: Towards scalable higher-order graph embeddings. In: Advances in Neural Information Processing Systems 33 (2020)","DOI":"10.1609\/aaai.v33i01.33014602"},{"issue":"1","key":"172_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-020-00671-6","volume":"10","author":"H Nassar","year":"2020","unstructured":"Nassar, H., Benson, A.R., Gleich, D.F.: Neighborhood and Pagerank methods for pairwise link prediction. Soc. Netw. Anal. Min. 10(1), 1\u201313 (2020)","journal-title":"Soc. Netw. Anal. Min."},{"issue":"3","key":"172_CR38","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1016\/j.cell.2018.05.024","volume":"174","author":"SA Quinodoz","year":"2018","unstructured":"Quinodoz, S.A., Ollikainen, N., Tabak, B., Palla, A., Schmidt, J.M., Detmar, E., Lai, M.M., Shishkin, A.A., Bhat, P., Takei, Y., et al.: Higher-order inter-chromosomal hubs shape 3d genome organization in the nucleus. Cell 174(3), 744\u2013757 (2018)","journal-title":"Cell"},{"key":"172_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2021.108149","volume":"187","author":"MT Schaub","year":"2021","unstructured":"Schaub, M.T., Zhu, Y., Seby, J.-B., Roddenberry, T.M., Segarra, S.: Signal processing on higher-order networks: Livin\u2019on the edge... and beyond. Signal Process. 187, 108149 (2021)","journal-title":"Signal Process."},{"key":"172_CR40","unstructured":"Srinivasan, B., Ribeiro, B.: On the equivalence between positional node embeddings and structural graph representations (2019). arXiv preprint arXiv:1910.00452"},{"key":"172_CR41","unstructured":"Srinivasan, B., Ribeiro, B.: On the equivalence between positional node embeddings and structural graph representations. In: ICLR (2020)"},{"key":"172_CR42","doi-asserted-by":"crossref","unstructured":"Srinivasan, B., Zheng, D., Karypis, G.: Learning over families of sets-hypergraph representation learning for higher order tasks. In: Proceedings of the 2021 SIAM International Conference on Data Mining (SDM), pp. 756\u2013764. SIAM (2021)","DOI":"10.1137\/1.9781611976700.85"},{"issue":"6","key":"172_CR43","doi-asserted-by":"publisher","first-page":"1641","DOI":"10.1016\/j.cell.2020.07.032","volume":"182","author":"J-H Su","year":"2020","unstructured":"Su, J.-H., Zheng, P., Kinrot, S.S., Bintu, B., Zhuang, X.: Genome-scale imaging of the 3d organization and transcriptional activity of chromatin. Cell 182(6), 1641\u20131659 (2020)","journal-title":"Cell"},{"issue":"7","key":"172_CR44","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1038\/nrg2592","volume":"10","author":"H Sutherland","year":"2009","unstructured":"Sutherland, H., Bickmore, W.A.: Transcription factories: Gene expression in unions? Nat. Rev. Genet. 10(7), 457\u2013466 (2009)","journal-title":"Nat. Rev. Genet."},{"issue":"12","key":"172_CR45","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1038\/s41594-020-0506-5","volume":"27","author":"F Tavares-Cadete","year":"2020","unstructured":"Tavares-Cadete, F., Norouzi, D., Dekker, B., Liu, Y., Dekker, J.: Multi-contact 3c reveals that the human genome during interphase is largely not entangled. Nat. Struct. Mol. Biol. 27(12), 1105\u20131114 (2020)","journal-title":"Nat. Struct. Mol. Biol."},{"key":"172_CR46","doi-asserted-by":"crossref","unstructured":"Tu, K., Cui, P., Wang, X., Wang, F., Zhu, W.: Structural deep embedding for hyper-networks. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 32 (2018)","DOI":"10.1609\/aaai.v32i1.11266"},{"issue":"1\u20133","key":"172_CR47","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0012-365X(95)00233-M","volume":"161","author":"R Tyshkevich","year":"1996","unstructured":"Tyshkevich, R., Zverovich, V.E.: Line hypergraphs. Discret. Math. 161(1\u20133), 265\u2013283 (1996)","journal-title":"Discret. Math."},{"key":"172_CR48","unstructured":"Yadati, N., Nimishakavi, M., Yadav, P., Nitin, V., Louis, A., Talukdar, P.: Hypergcn: a new method for training graph convolutional networks on hypergraphs. In: Advances in neural information processing systems 32 (2019)"},{"key":"172_CR49","doi-asserted-by":"crossref","unstructured":"Yadati, N., Nitin, V., Nimishakavi, M., Yadav, P., Louis, A., Talukdar, P.: Nhp: neural hypergraph link prediction. In: KDD (2020)","DOI":"10.1145\/3340531.3411870"},{"key":"172_CR50","first-page":"3275","volume":"33","author":"N Yadati","year":"2020","unstructured":"Yadati, N.: Neural message passing for multi-relational ordered and recursive hypergraphs. Adv. Neural Inf. Process. Syst. 33, 3275\u20133289 (2020)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"172_CR51","unstructured":"Yang, C., Wang, R., Yao, S., Abdelzaher, T.: Hypergraph learning with line expansion (2020). arXiv preprint arXiv:2005.04843"},{"key":"172_CR52","doi-asserted-by":"crossref","unstructured":"Yoon, S.-e., Song, H., Shin, K., Yi, Y.: How much and when do we need higher-order information in hypergraphs? A case study on hyperedge prediction. In: Proceedings of the Web Conference (2020)","DOI":"10.1145\/3366423.3380016"},{"key":"172_CR53","unstructured":"You, J., Ying, R., Leskovec, J.: Position-aware graph neural networks. In: International Conference on Machine Learning, pp. 7134\u20137143. PMLR (2019)"},{"key":"172_CR54","doi-asserted-by":"crossref","unstructured":"Yu, F., Liu, Q., Wu, S., Wang, L., Tan, T.: A dynamic recurrent model for next basket recommendation. In: Proceedings of the 39th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 729\u2013732 (2016)","DOI":"10.1145\/2911451.2914683"},{"key":"172_CR55","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1146\/annurev-cellbio-100616-060531","volume":"33","author":"M Yu","year":"2017","unstructured":"Yu, M., Ren, B.: The three-dimensional organization of mammalian genomes. Ann. Rev. Cell Dev. Biol. 33, 265\u2013289 (2017)","journal-title":"Ann. Rev. Cell Dev. Biol."},{"key":"172_CR56","unstructured":"Zaheer, M., Kottur, S., Ravanbakhsh, S., Poczos, B., Salakhutdinov, R., Smola, A.: Deep sets (2017). arXiv preprint arXiv:1703.06114"},{"key":"172_CR57","unstructured":"Zhang, M., Chen, Y.: Link prediction based on graph neural networks. In: NeurIPS (2018)"},{"key":"172_CR58","doi-asserted-by":"crossref","unstructured":"Zhang, M., Cui, Z., Jiang, S., Chen, Y.: Beyond link prediction: predicting hyperlinks in adjacency space. In: AAAI (2018)","DOI":"10.1609\/aaai.v32i1.11780"},{"key":"172_CR59","unstructured":"Zhang, M., Li, P., Xia, Y., Wang, K., Jin, L.: Labeling trick: A theory of using graph neural networks for multi-node representation learning. In: Advances in Neural Information Processing Systems 34 (2021)"},{"key":"172_CR60","unstructured":"Zhang, M., Li, P., Xia, Y., Wang, K., Jin, L.: Revisiting graph neural networks for link prediction (2020). arXiv preprint arXiv:2010.16103"},{"key":"172_CR61","doi-asserted-by":"crossref","unstructured":"Zhou, D., Huang, J., Sch\u00f6lkopf, B.: Learning with hypergraphs: Clustering, classification, and embedding. In: Advances in Neural Information Processing Systems, pp. 1601\u20131608 (2007)","DOI":"10.7551\/mitpress\/7503.003.0205"},{"key":"172_CR62","first-page":"1601","volume":"19","author":"D Zhou","year":"2006","unstructured":"Zhou, D., Huang, J., Sch\u00f6lkopf, B.: Learning with hypergraphs: clustering, classification, and embedding. Adv. Neural Inf. Process. Syst. 19, 1601\u20131608 (2006)","journal-title":"Adv. Neural Inf. Process. Syst."}],"container-title":["Journal of Applied and Computational Topology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41468-024-00172-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41468-024-00172-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41468-024-00172-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T10:14:08Z","timestamp":1729592048000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41468-024-00172-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,7]]},"references-count":62,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["172"],"URL":"https:\/\/doi.org\/10.1007\/s41468-024-00172-x","relation":{},"ISSN":["2367-1726","2367-1734"],"issn-type":[{"type":"print","value":"2367-1726"},{"type":"electronic","value":"2367-1734"}],"subject":[],"published":{"date-parts":[[2024,5,7]]},"assertion":[{"value":"23 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}