{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T23:07:44Z","timestamp":1772838464708,"version":"3.50.1"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T00:00:00Z","timestamp":1695340800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T00:00:00Z","timestamp":1695340800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001711","name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","doi-asserted-by":"publisher","award":["176938"],"award-info":[{"award-number":["176938"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Swiss Federal Institute of Technology Zurich"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Apart from nodes and links, for many networked systems, we have access to data on paths, i.e., collections of temporally ordered variable-length node sequences that are constrained by the system\u2019s topology. Understanding the patterns in such data is key to advancing our understanding of the structure and dynamics of complex systems. Moreover, the ability to accurately model and predict paths is important for engineered systems, e.g., to optimise supply chains or provide smart mobility services. Here, we introduce MOGen, a generative modelling framework that enables both next-element and out-of-sample prediction in paths with high accuracy and consistency. It features a model selection approach that automatically determines the optimal model directly from data, effectively making MOGen parameter-free. Using empirical data, we show that our method outperforms state-of-the-art sequence modelling techniques. We further introduce a mathematical formalism that links higher-order models of paths to transition matrices of random walks in multi-layer networks.<\/jats:p>","DOI":"10.1007\/s41109-023-00596-x","type":"journal-article","created":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T07:01:59Z","timestamp":1695366119000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Predicting variable-length paths in networked systems using multi-order generative models"],"prefix":"10.1007","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0382-1336","authenticated-orcid":false,"given":"Christoph","family":"Gote","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0233-5747","authenticated-orcid":false,"given":"Giona","family":"Casiraghi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1551-6491","authenticated-orcid":false,"given":"Frank","family":"Schweitzer","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2253-0216","authenticated-orcid":false,"given":"Ingo","family":"Scholtes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,22]]},"reference":[{"issue":"6","key":"596_CR1","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1109\/TAC.1974.1100705","volume":"19","author":"H Akaike","year":"1974","unstructured":"Akaike H (1974) A new look at the statistical model identification. IEEE Trans Autom Control 19(6):716\u2013723","journal-title":"IEEE Trans Autom Control"},{"issue":"3","key":"596_CR2","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/65.844498","volume":"14","author":"M Arlitt","year":"2000","unstructured":"Arlitt M, Jin T (2000) A workload characterization study of the 1998 world cup web site. IEEE Network 14(3):30\u201337","journal-title":"IEEE Network"},{"key":"596_CR3","doi-asserted-by":"crossref","unstructured":"Augusto A, Conforti R, Dumas M, La Rosa M (2017) Split miner: discovering accurate and simple business process models from event logs. In: 2017 IEEE international conference on data mining (ICDM). IEEE, pp 1\u201310","DOI":"10.1109\/ICDM.2017.9"},{"issue":"1\u20132","key":"596_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10994-013-5416-x","volume":"96","author":"B Balle","year":"2014","unstructured":"Balle B, Carreras X, Luque FM, Quattoni A (2014) Spectral learning of weighted automata. Mach Learn 96(1\u20132):33\u201363","journal-title":"Mach Learn"},{"key":"596_CR5","doi-asserted-by":"crossref","unstructured":"Belth C, Kamran F, Tjandra D, Koutra D (2019) When to remember where you came from: node representation learning in higher-order networks. In: Proceedings of the 2019 IEEE\/ACM international conference on advances in social networks analysis and mining, pp 222\u2013225","DOI":"10.1145\/3341161.3342911"},{"key":"596_CR6","unstructured":"Benson AR, Gleich DF, Higham DJ (2021) Higher-order network analysis takes off, fueled by old ideas and new data. SIAM News. https:\/\/cutt.ly\/gkwhM9w. Last accessed 29 Jan"},{"issue":"2","key":"596_CR7","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1137\/16M1074023","volume":"59","author":"AR Benson","year":"2017","unstructured":"Benson AR, Gleich DF, Lim L-H (2017) The spacey random walk: a stochastic process for higher-order data. SIAM Rev 59(2):321\u2013345","journal-title":"SIAM Rev"},{"key":"596_CR8","doi-asserted-by":"crossref","unstructured":"Bernhard SD, Leung CK, Reimer VJ, Westlake J (2016) Clickstream prediction using sequential stream mining techniques with markov chains. In: Proceedings of the 20th international database engineering & applications symposium, pp 24\u201333","DOI":"10.1145\/2938503.2938535"},{"key":"596_CR9","doi-asserted-by":"crossref","unstructured":"Bestavros A (1995) Using speculation to reduce server load and service time on the www. In: Proceedings of the fourth international conference on information and knowledge management, pp 403\u2013410","DOI":"10.1145\/221270.221653"},{"key":"596_CR10","volume-title":"Pattern recognition and machine learning","author":"CM Bishop","year":"2006","unstructured":"Bishop CM, Nasrabadi NM (2006) Pattern recognition and machine learning, vol 4. Springer, New York"},{"issue":"3","key":"596_CR11","doi-asserted-by":"publisher","first-page":"4803","DOI":"10.1371\/journal.pone.0004803","volume":"4","author":"J Bollen","year":"2009","unstructured":"Bollen J, Sompel H, Hagberg A, Bettencourt L, Chute R, Rodriguez MA, Balakireva L (2009) Clickstream data yields high-resolution maps of science. PLoS ONE 4(3):4803","journal-title":"PLoS ONE"},{"key":"596_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern graph theory","author":"B Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s B (1998) Modern graph theory, vol 184. Springer, New York"},{"issue":"6164","key":"596_CR13","first-page":"1337","volume":"342","author":"D Brockmann","year":"2013","unstructured":"Brockmann D, Helbing D (2013) The hidden geometry of complex network-driven contagion. Phenomena Sci 342(6164):1337\u20131342","journal-title":"Phenomena Sci"},{"key":"596_CR14","unstructured":"Brodley C, Kohavi R (2000) KDD-Cup 2000 homepage. http:\/\/www.kdd.org\/kdd-cup\/view\/kdd-cup-2000"},{"key":"596_CR15","doi-asserted-by":"crossref","unstructured":"Buijs, JC, Van Dongen BF, Der Aalst WM (2012)On the role of fitness, precision, generalization and simplicity in process discovery. In: OTM confederated international conferences \u201cOn the Move to Meaningful Internet Systems\u201d. Springer, pp 305\u2013322","DOI":"10.1007\/978-3-642-33606-5_19"},{"key":"596_CR16","doi-asserted-by":"crossref","unstructured":"Cadez I, Heckerman D, Meek C, Smyth P, White S (2000) Visualization of navigation patterns on a web site using model-based lustering. In: Proceedings of the Sixth ACM SIGKDD international conference on knowledge discovery and data mining, pp 280\u2013284","DOI":"10.1145\/347090.347151"},{"issue":"3","key":"596_CR17","doi-asserted-by":"publisher","DOI":"10.1088\/2632-072x\/ac0493","volume":"2","author":"G Casiraghi","year":"2021","unstructured":"Casiraghi G (2021) The likelihood-ratio test for multi-edge network models. J Phys: Compl 2(3):035012. https:\/\/doi.org\/10.1088\/2632-072x\/ac0493","journal-title":"J Phys: Compl"},{"issue":"1","key":"596_CR18","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1109\/TNET.2016.2594382","volume":"25","author":"WK Chai","year":"2016","unstructured":"Chai WK, Pavlou G (2016) Path-based epidemic spreading in networks. IEEE\/ACM Trans Netw 25(1):565\u2013578","journal-title":"IEEE\/ACM Trans Netw"},{"key":"596_CR19","doi-asserted-by":"crossref","unstructured":"Chierichetti F, Kumar R, Raghavan P, Sarlos T (2012) Are web users really Markovian? In: Proceedings of the 21st international conference on World Wide Web, pp 609\u2013618","DOI":"10.1145\/2187836.2187919"},{"issue":"4","key":"596_CR20","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1109\/TCOM.1984.1096090","volume":"32","author":"J Cleary","year":"1984","unstructured":"Cleary J, Witten I (1984) Data compression using adaptive coding and partial string matching. IEEE Trans Commun 32(4):396\u2013402","journal-title":"IEEE Trans Commun"},{"key":"596_CR21","doi-asserted-by":"crossref","unstructured":"Dai W, Hu H, Wu T, Dai Y (2014) formation spread of emergency events: path searching on social networks. Sci World J","DOI":"10.1155\/2014\/179620"},{"issue":"2","key":"596_CR22","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1145\/990301.990304","volume":"4","author":"M Deshpande","year":"2004","unstructured":"Deshpande M, Karypis G (2004) Selective Markov models for predicting web page accesses. ACM Trans Internet Technol (TOIT) 4(2):163\u2013184","journal-title":"ACM Trans Internet Technol (TOIT)"},{"issue":"1","key":"596_CR23","first-page":"3389","volume":"15","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger P, Gomariz A, Gueniche T, Soltani A, Wu C-W, Tseng VS (2014) Spmf: a java open-source pattern mining library. J Mach Learn Res 15(1):3389\u20133393","journal-title":"J Mach Learn Res"},{"issue":"1","key":"596_CR24","first-page":"54","volume":"1","author":"P Fournier-Viger","year":"2017","unstructured":"Fournier-Viger P, Lin JC-W, Kiran RU, Koh YS, Thomas R (2017) A survey of sequential pattern mining. Data Sci Pattern Recogn 1(1):54\u201377","journal-title":"Data Sci Pattern Recogn"},{"key":"596_CR25","unstructured":"Frias-Martinez E, Karamcheti V (2002) A prediction model for user access sequences. In: WEBKDD workshop: Web mining for usage patterns and user profiles"},{"key":"596_CR26","doi-asserted-by":"crossref","unstructured":"Gueniche T, Fournier-Viger P, Raman R, Tseng VS (2015) Cpt+: decreasing the time\/space complexity of the compact prediction tree. In: Pacific-Asia conference on knowledge discovery and data mining, pp 625\u2013636","DOI":"10.1007\/978-3-319-18032-8_49"},{"key":"596_CR27","doi-asserted-by":"crossref","unstructured":"G\u00fcnd\u00fcz, \u015e, \u00d6zsu MT(2003) A web page prediction model based on click-stream tree representation of user behavior. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining, pp 535\u2013540","DOI":"10.1145\/956750.956815"},{"issue":"8","key":"596_CR28","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1111\/mice.12346","volume":"33","author":"J Hackl","year":"2018","unstructured":"Hackl J, Adey BT, Lethanh N (2018) Determination of near-optimal restoration programs for transportation networks following natural hazard events using simulated annealing. Comput-Aid Civil Infrastruct Eng 33(8):618\u2013637","journal-title":"Comput-Aid Civil Infrastruct Eng"},{"issue":"2","key":"596_CR29","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1287\/mksc.1080.0400","volume":"28","author":"SK Hui","year":"2009","unstructured":"Hui SK, Fader PS, Bradlow ET (2009) Path data in marketing: an integrative framework and prospectus for model building. Mark Sci 28(2):320\u2013335","journal-title":"Mark Sci"},{"issue":"1","key":"596_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-021-87837-0","volume":"11","author":"W Jo","year":"2021","unstructured":"Jo W, Chang D, You M, Ghim G-H (2021) A social network analysis of the spread of covid-19 in South Korea and policy implications. Sci Rep 11(1):1\u201310","journal-title":"Sci Rep"},{"issue":"10","key":"596_CR31","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1038\/nrm2503","volume":"9","author":"G Karlebach","year":"2008","unstructured":"Karlebach G, Shamir R (2008) Modelling and analysis of gene regulatory networks. Nat Rev Mol Cell Biol 9(10):770\u2013780","journal-title":"Nat Rev Mol Cell Biol"},{"key":"596_CR32","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.jom.2014.10.006","volume":"33","author":"Y Kim","year":"2015","unstructured":"Kim Y, Chen Y-S, Linderman K (2015) Supply network disruption and resilience: a network structural perspective. J Oper Manag 33:43\u201359","journal-title":"J Oper Manag"},{"issue":"3","key":"596_CR33","first-page":"203","volume":"2","author":"M Kivel\u00e4","year":"2014","unstructured":"Kivel\u00e4 M, Arenas A, Barthelemy M, Gleeson JP, Moreno Y, Porter MA (2014) Multilayer networks. J Comp Netw 2(3):203\u2013271","journal-title":"J Comp Netw"},{"key":"596_CR34","doi-asserted-by":"crossref","unstructured":"Kraus M, Feuerriegel S (2019) Personalized purchase prediction of market baskets with wasserstein-based sequence matching. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining, pp 2643\u20132652","DOI":"10.1145\/3292500.3330791"},{"issue":"1","key":"596_CR35","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF01000408","volume":"15","author":"P Laird","year":"1994","unstructured":"Laird P, Saul R (1994) Discrete sequence prediction and its applications. Mach Learn 15(1):43\u201368","journal-title":"Mach Learn"},{"key":"596_CR36","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 (2019) From networks to optimal higher-order models of complex systems. Nat Phys 15:313\u2013320","journal-title":"Nat Phys"},{"key":"596_CR37","doi-asserted-by":"crossref","unstructured":"LaRock T, Nanumyan V, Scholtes I, Casiraghi G, Eliassi-Rad T, Schweitzer F (2019) HYPA: efficient detection of path anomalies in time series data on networks","DOI":"10.1137\/1.9781611976236.52"},{"key":"596_CR38","doi-asserted-by":"crossref","unstructured":"Leemans SJ, Tax N, Hofstede AH (2018) Indulpet miner: combining discovery algorithms. In: OTM confederated international conferences on the move to meaningful internet systems. Springer, pp 97\u2013115","DOI":"10.1007\/978-3-030-02610-3_6"},{"key":"596_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2020.107693","volume":"228","author":"Y Li","year":"2020","unstructured":"Li Y, Zobel CW (2020) Exploring supply chain network resilience in the presence of the ripple effect. Int J Prod Econ 228:107693","journal-title":"Int J Prod Econ"},{"issue":"4","key":"596_CR40","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1287\/mksc.1040.0073","volume":"23","author":"AL Montgomery","year":"2004","unstructured":"Montgomery AL, Li S, Srinivasan K, Liechty JC (2004) Modeling online browsing and path analysis using clickstream data. Mark Sci 23(4):579\u2013595","journal-title":"Mark Sci"},{"issue":"5795","key":"596_CR41","doi-asserted-by":"publisher","first-page":"1922","DOI":"10.1126\/science.1132292","volume":"313","author":"EN Olson","year":"2006","unstructured":"Olson EN (2006) Gene regulatory networks in the evolution and development of the heart. Science 313(5795):1922\u20131927","journal-title":"Science"},{"issue":"3","key":"596_CR42","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/235160.235164","volume":"26","author":"VN Padmanabhan","year":"1996","unstructured":"Padmanabhan VN, Mogul JC (1996) Using predictive prefetching to improve World Wide Web latency. ACM SIGCOMM Comput Commun Rev 26(3):22\u201336","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"596_CR43","doi-asserted-by":"crossref","unstructured":"Pavlov A, Ivanov D, Werner F, Dolgui A, Sokolov B (2019) Integrated detection of disruption scenarios, the ripple effect dispersal and recovery paths in supply chains. Ann Oper Res 1\u201323","DOI":"10.1007\/s10479-019-03454-1"},{"issue":"1","key":"596_CR44","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1038\/s41467-017-00148-9","volume":"8","author":"TP Peixoto","year":"2017","unstructured":"Peixoto TP, Rosvall M (2017) Modelling sequences and temporal networks with dynamic community structures. Nat Commun 8(1):582","journal-title":"Nat Commun"},{"key":"596_CR45","unstructured":"Pitkow J, Pirolli P (1999) Mining longest repeating subsequences to predict World Wide Web surfing. In: UsENIX symposium on Internet technologies and systems, p 1"},{"key":"596_CR46","unstructured":"RITA TransStat (2014) Origin and destination survey database. http:\/\/www.transtats.bts.gov\/Tables.asp?DB_ID=125"},{"key":"596_CR47","doi-asserted-by":"publisher","first-page":"4630","DOI":"10.1038\/ncomms5630","volume":"5","author":"M Rosvall","year":"2014","unstructured":"Rosvall M, Esquivel AV, Lancichinetti A, West JD, Lambiotte R (2014) Memory in network flows and its effects on spreading dynamics and community detection. Nat Commun 5:4630","journal-title":"Nat Commun"},{"key":"596_CR48","unstructured":"Saebi M, Ciampaglia GL, Kaplan LM, Chawla NV (2019) Honem: Network embedding using higher-order patterns in sequential data. arXiv:1908.05387"},{"key":"596_CR49","doi-asserted-by":"crossref","unstructured":"Scholtes I (2017) When is a network a network? Multi-order graphical model selection in pathways and temporal networks. In: Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 1037\u20131046","DOI":"10.1145\/3097983.3098145"},{"issue":"4","key":"596_CR50","doi-asserted-by":"publisher","first-page":"2516","DOI":"10.1137\/20M1361602","volume":"20","author":"AC Schwarze","year":"2021","unstructured":"Schwarze AC, Porter MA (2021) Motifs for processes on networks. SIAM J Appl Dyn Syst 20(4):2516\u20132557","journal-title":"SIAM J Appl Dyn Syst"},{"issue":"7","key":"596_CR51","doi-asserted-by":"publisher","first-page":"1255","DOI":"10.1016\/j.cell.2009.12.018","volume":"139","author":"SD Shapira","year":"2009","unstructured":"Shapira SD, Gat-Viks I, Shum BO, Dricot A, Grace MM, Wu L, Gupta PB, Hao T, Silver SJ, Root DE (2009) A physical and regulatory map of host-influenza interactions reveals pathways in h1n1 infection. Cell 139(7):1255\u20131267","journal-title":"Cell"},{"issue":"7","key":"596_CR52","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0102070","volume":"9","author":"P Singer","year":"2014","unstructured":"Singer P, Helic D, Taraghi B, Strohmaier M (2014) Detecting memory and structure in human navigation patterns using Markov chain models of varying order. PLoS ONE 9(7):102070","journal-title":"PLoS ONE"},{"issue":"6","key":"596_CR53","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1007\/s10270-020-00789-3","volume":"19","author":"N Tax","year":"2020","unstructured":"Tax N, Teinemaa I, Zelst SJ (2020) An interdisciplinary comparison of sequence modeling methods for next-element prediction. Softw Syst Model 19(6):1345\u20131365","journal-title":"Softw Syst Model"},{"issue":"3","key":"596_CR54","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1137\/20M1355896","volume":"63","author":"L Torres","year":"2021","unstructured":"Torres L, Blevins AS, Bassett D, Eliassi-Rad T (2021) The why, how, and when of representations for complex systems. SIAM Rev 63(3):435\u2013485","journal-title":"SIAM Rev"},{"key":"596_CR55","unstructured":"Transport for London: Rolling Origin and Destination Survey (RODS) database (2014). http:\/\/www.tfl.gov.uk\/info-for\/open-data-users\/our-feeds"},{"issue":"1","key":"596_CR56","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41467-017-02088-w","volume":"9","author":"L Wang","year":"2018","unstructured":"Wang L, Wu JT (2018) Characterizing the dynamics underlying global spread of epidemics. Nat Commun 9(1):1\u201311","journal-title":"Nat Commun"},{"key":"596_CR57","doi-asserted-by":"crossref","unstructured":"Weijters A, Ribeiro J (2011) Flexible heuristics miner (fhm). In: 2011 IEEE symposium on computational intelligence and data mining (CIDM). IEEE, , pp 310\u2013317","DOI":"10.1109\/CIDM.2011.5949453"},{"key":"596_CR58","doi-asserted-by":"crossref","unstructured":"West R, Leskovec J (2012) man wayfinding in information networks. In: Proceedings of the 21st International conference on World Wide Web, pp 619\u2013628","DOI":"10.1145\/2187836.2187920"},{"key":"596_CR59","doi-asserted-by":"crossref","unstructured":"Xu J, Wickramarathne TL, Chawla NV (2016) Representing higher-order dependencies in networks. Sci Adv","DOI":"10.1126\/sciadv.1600028"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-023-00596-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-023-00596-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-023-00596-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,19]],"date-time":"2023-11-19T00:06:27Z","timestamp":1700352387000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-023-00596-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,22]]},"references-count":59,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["596"],"URL":"https:\/\/doi.org\/10.1007\/s41109-023-00596-x","relation":{},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,22]]},"assertion":[{"value":"8 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"The authors declare that they have no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"68"}}