{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T03:43:27Z","timestamp":1764906207382,"version":"3.37.3"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,10,10]],"date-time":"2023-10-10T00:00:00Z","timestamp":1696896000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,10,10]],"date-time":"2023-10-10T00:00:00Z","timestamp":1696896000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001711","name":"Swiss National Science Foundation","doi-asserted-by":"crossref","award":["176938","176938","176938"],"award-info":[{"award-number":["176938","176938","176938"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Swiss Federal Institute of Technology Zurich"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Community smells are negative patterns in software development teams\u2019 interactions that impede their ability to successfully create software. Examples are team members working in isolation, lack of communication and collaboration across departments or sub-teams, or areas of the codebase where only a few team members can work on. Current approaches aim to detect community smells by analysing <jats:italic>static<\/jats:italic> network representations of software teams\u2019 interaction structures. In doing so, they are insufficient to locate community smells within development <jats:italic>processes<\/jats:italic>. Extending beyond the capabilities of traditional social network analysis, we show that higher-order network models provide a robust means of revealing such hidden patterns and complex relationships. To this end, we develop a set of centrality measures based on the  higher-order network model and show their effectiveness in predicting influential nodes using five empirical datasets. We then employ these measures for a comprehensive analysis of a product team at the German IT security company <jats:italic>genua GmbH<\/jats:italic>, showcasing our method\u2019s success in identifying and locating community smells. Specifically, we uncover critical community smells in two areas of the team\u2019s development process. Semi-structured interviews with five team members validate our findings: while the team was aware of one community smell and employed measures to address it, it was not aware of the second. This highlights the potential of our approach as a robust tool for identifying and addressing community smells in software development teams. More generally, our work contributes to the social network analysis field with a powerful set of higher-order network centralities that effectively capture community dynamics and indirect relationships.<\/jats:p>","DOI":"10.1007\/s13278-023-01120-w","type":"journal-article","created":{"date-parts":[[2023,10,10]],"date-time":"2023-10-10T20:30:52Z","timestamp":1696969852000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Locating community smells in software development processes using higher-order network centralities"],"prefix":"10.1007","volume":"13","author":[{"given":"Christoph","family":"Gote","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincenzo","family":"Perri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Zingg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giona","family":"Casiraghi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Arzig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"von Gernler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Schweitzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ingo","family":"Scholtes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,10]]},"reference":[{"key":"1120_CR1","doi-asserted-by":"publisher","first-page":"106201","DOI":"10.1016\/j.knosys.2020.106201","volume":"204","author":"N Almarimi","year":"2020","unstructured":"Almarimi N, Ouni A, Mkaouer MW (2020) Learning to detect community smells in open source software projects. Knowl-Based Syst 204:106201","journal-title":"Knowl-Based Syst"},{"key":"1120_CR2","doi-asserted-by":"crossref","unstructured":"Avelino G, Passos L, Hora A, et\u00a0al (2016) A novel approach for estimating truck factors. In: 2016 IEEE 24th International Conference on Program Comprehension (ICPC), IEEE, pp 1\u201310","DOI":"10.1109\/ICPC.2016.7503718"},{"key":"1120_CR3","doi-asserted-by":"crossref","unstructured":"Battiston F, Cencetti G, Iacopini I, et\u00a0al. (2020) Networks beyond pairwise interactions: structure and dynamics. Phys Rep","DOI":"10.1016\/j.physrep.2020.05.004"},{"key":"1120_CR4","volume-title":"Extreme Programming explained: embrace change","author":"K Beck","year":"1999","unstructured":"Beck K (1999) Extreme Programming explained: embrace change. Addison-Wesley Longman Publishing Co., USA"},{"key":"1120_CR5","doi-asserted-by":"crossref","unstructured":"Bird C, Nagappan N, Gall H, et\u00a0al (2009) Putting it all together: using socio-technical networks to predict failures. In: 2009 20th International Symposium on Software Reliability Engineering, IEEE, pp 109\u2013119","DOI":"10.1109\/ISSRE.2009.17"},{"issue":"6","key":"1120_CR6","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1177\/017084069501600605","volume":"16","author":"F Blackler","year":"1995","unstructured":"Blackler F (1995) Knowledge, knowledge work and organizations: an overview and interpretation. Organ Stud 16(6):1021\u20131046","journal-title":"Organ Stud"},{"key":"1120_CR7","unstructured":"Brodley C, Kohavi R (2000) Kdd cup 2000: Online retailer website clickstream analysis. http:\/\/www.kdd.org\/kdd-cup\/view\/kdd-cup-2000"},{"issue":"2","key":"1120_CR8","doi-asserted-by":"publisher","first-page":"022306","DOI":"10.1103\/PhysRevE.98.022306","volume":"98","author":"R Burkholz","year":"2018","unstructured":"Burkholz R, Schweitzer F (2018) Correlations between thresholds and degrees: An analytic approach to model attacks and failure cascades. Phys Rev E 98(2):022306","journal-title":"Phys Rev E"},{"key":"1120_CR9","doi-asserted-by":"crossref","unstructured":"Caballero-Espinosa E, Carver JC, Stowers K (2023) Community smells-the sources of social debt: a systematic literature review. Inform Softw Technol p 107078","DOI":"10.1016\/j.infsof.2022.107078"},{"issue":"25","key":"1120_CR10","doi-asserted-by":"publisher","first-page":"5468","DOI":"10.1103\/PhysRevLett.85.5468","volume":"85","author":"DS Callaway","year":"2000","unstructured":"Callaway DS, Newman ME, Strogatz SH et al (2000) Network robustness and fragility: percolation on random graphs. Phys Rev Lett 85(25):5468","journal-title":"Phys Rev Lett"},{"key":"1120_CR11","doi-asserted-by":"crossref","unstructured":"Cosentino V, Izquierdo JLC, Cabot J (2015) Assessing the bus factor of git repositories. In: 2015 IEEE 22nd International Conference on Software Analysis, Evolution, and Reengineering (SANER), IEEE, pp 499\u2013503","DOI":"10.1109\/SANER.2015.7081864"},{"issue":"6","key":"1120_CR12","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/j.infsof.2007.02.004","volume":"49","author":"K Crowston","year":"2007","unstructured":"Crowston K, Li Q, Wei K et al (2007) Self-organization of teams for free\/libre Open Source software development. Inf Softw Technol 49(6):564\u2013575","journal-title":"Inf Softw Technol"},{"issue":"4","key":"1120_CR13","doi-asserted-by":"publisher","first-page":"112","DOI":"10.3390\/a10040112","volume":"10","author":"D Edler","year":"2017","unstructured":"Edler D, Bohlin L, Rosvall M (2017) Mapping higher-order network flows in memory and multilayer networks with infomap. Algorithms 10(4):112","journal-title":"Algorithms"},{"issue":"1","key":"1120_CR14","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s11219-020-09538-7","volume":"29","author":"B Eken","year":"2021","unstructured":"Eken B, Palma F, Ay\u015fe B et al (2021) An empirical study on the effect of community smells on bug prediction. Software Qual J 29(1):159\u2013194","journal-title":"Software Qual J"},{"key":"1120_CR15","doi-asserted-by":"publisher","first-page":"106786","DOI":"10.1016\/j.infsof.2021.106786","volume":"143","author":"V Etemadi","year":"2022","unstructured":"Etemadi V, Bushehrian O, Robles G (2022) Task assignment to counter the effect of developer turnover in software maintenance: a knowledge diffusion model. Inf Softw Technol 143:106786","journal-title":"Inf Softw Technol"},{"key":"1120_CR16","doi-asserted-by":"crossref","unstructured":"Ferreira M, Avelino G, Valente MT et al (2016) A comparative study of algorithms for estimating truck factor. 2016 X Brazilian Symposium on Software Components. Architectures and Reuse (SBCARS), IEEE, pp 91\u2013100","DOI":"10.1109\/SBCARS.2016.20"},{"issue":"4","key":"1120_CR17","doi-asserted-by":"publisher","first-page":"1583","DOI":"10.1007\/s11219-019-09457-2","volume":"27","author":"M Ferreira","year":"2019","unstructured":"Ferreira M, Mombach T, Valente MT et al (2019) Algorithms for estimating truck factors: a comparative study. Software Qual J 27(4):1583\u20131617","journal-title":"Software Qual J"},{"issue":"6","key":"1120_CR18","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd RW (1962) Algorithm 97: shortest path. Commun ACM 5(6):345","journal-title":"Commun ACM"},{"issue":"3","key":"1120_CR19","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1017\/nws.2015.10","volume":"3","author":"M G\u00e9nois","year":"2015","unstructured":"G\u00e9nois M et al (2015) Data on face-to-face contacts in an office building suggest a low-cost vaccination strategy based on community linkers. Netw Sci 3(3):326\u2013347","journal-title":"Netw Sci"},{"key":"1120_CR20","doi-asserted-by":"crossref","unstructured":"Gote C, Scholtes I, Schweitzer F (2019) git2net \u2013 Mining time-stamped co-editing networks from large git repositories. In: 2019 IEEE\/ACM 16th International Conference on Mining Software Repositories (MSR), IEEE, pp 433\u2013444","DOI":"10.1109\/MSR.2019.00070"},{"key":"1120_CR21","unstructured":"Gote C, Casiraghi G, Schweitzer F, et\u00a0al. (2020) Predicting sequences of traversed nodes in graphs using network models with multiple higher orders. arXiv preprint arXiv:2007.06662"},{"issue":"4","key":"1120_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10664-020-09928-2","volume":"26","author":"C Gote","year":"2021","unstructured":"Gote C, Scholtes I, Schweitzer F (2021) Analysing time-stamped co-editing networks in software development teams using git2net. Empir Softw Eng 26(4):1\u201341","journal-title":"Empir Softw Eng"},{"key":"1120_CR23","doi-asserted-by":"crossref","unstructured":"Gote C, Perri V, Scholtes I (2022) Predicting influential higher-order patterns in temporal network data. In: An J, Charalampos C, Magdy W (eds) Proceedings of the 2022 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2022), pp 109\u2013116","DOI":"10.1109\/ASONAM55673.2022.10068582"},{"key":"1120_CR24","doi-asserted-by":"crossref","unstructured":"Huang Z, Shao Z, Fan G, et\u00a0al (2021) Predicting community smells\u2019 occurrence on individual developers by sentiments. In: 2021 IEEE\/ACM 29th International Conference on Program Comprehension (ICPC), IEEE, pp 230\u2013241","DOI":"10.1109\/ICPC52881.2021.00030"},{"issue":"1","key":"1120_CR25","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/s11390-021-1596-1","volume":"37","author":"ZJ Huang","year":"2022","unstructured":"Huang ZJ, Shao ZQ, Fan GS et al (2022) Community smell occurrence prediction on multi-granularity by developer-oriented features and process metrics. J Comput Sci Technol 37(1):182\u2013206","journal-title":"J Comput Sci Technol"},{"key":"1120_CR26","unstructured":"Izquierdo-Cortazar D, Robles G, Ortega F, et\u00a0al. (2009) Using software archaeology to measure knowledge loss in software projects due to developer turnover. In: 2009 42nd Hawaii International Conference on System Sciences, IEEE, pp 1\u201310"},{"key":"1120_CR27","doi-asserted-by":"crossref","unstructured":"Krieg SJ, Robertson DH, Pradhan MP, et\u00a0al. (2020) Higher-order networks of diabetes comorbidities: disease trajectories that matter. In: 2020 IEEE International Conference on Healthcare Informatics (ICHI), IEEE, pp 1\u201311","DOI":"10.1109\/ICHI48887.2020.9374390"},{"issue":"2","key":"1120_CR28","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1093\/comnet\/cnu017","volume":"3","author":"R Lambiotte","year":"2015","unstructured":"Lambiotte R, Salnikov V, Rosvall M (2015) Effect of memory on the dynamics of random walks on networks. J Complex Netw 3(2):177\u2013188","journal-title":"J Complex Netw"},{"issue":"4","key":"1120_CR29","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(4):313\u2013320","journal-title":"Nat Phys"},{"key":"1120_CR30","unstructured":"Lang JP (2006) Redmine. http:\/\/www.redmine.org\/"},{"key":"1120_CR31","doi-asserted-by":"crossref","unstructured":"LaRock T, Nanumyan V, Scholtes I, et\u00a0al (2020) Hypa: Efficient detection of path anomalies in time series data on networks. In: Proceedings of the 2020 SIAM International Conference on Data Mining, SIAM, pp 460\u2013468","DOI":"10.1137\/1.9781611976236.52"},{"key":"1120_CR32","doi-asserted-by":"crossref","unstructured":"Lin B, Robles G, Serebrenik A (2017) Developer turnover in global, industrial open source projects: insights from applying survival analysis. In: 2017 IEEE 12th International Conference on Global Software Engineering (ICGSE), pp 66\u201375","DOI":"10.1109\/ICGSE.2017.11"},{"key":"1120_CR33","doi-asserted-by":"crossref","unstructured":"Lisiecka K, Rychwalska A, Samson K, et\u00a0al. (2016) Medium moderates the message. How users adjust their communication trajectories to different media in collaborative task solving. PloS one 11(6):e0157827","DOI":"10.1371\/journal.pone.0157827"},{"key":"1120_CR34","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1007\/s00500-019-04540-z","volume":"24","author":"Z Ma","year":"2020","unstructured":"Ma Z, Li R, Li T et al (2020) A data-driven risk measurement model of software developer turnover. Soft Comput 24:825\u2013842","journal-title":"Soft Comput"},{"issue":"3\u20134","key":"1120_CR35","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/S0378-4371(00)00311-3","volume":"285","author":"M Marchiori","year":"2000","unstructured":"Marchiori M, Latora V (2000) Harmony in the small-world. Physica A 285(3\u20134):539\u2013546","journal-title":"Physica A"},{"key":"1120_CR36","doi-asserted-by":"crossref","unstructured":"Meneely A, Williams L, Snipes W, et\u00a0al. (2008) Predicting failures with developer networks and social network analysis. In: Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering, pp 13\u201323","DOI":"10.1145\/1453101.1453106"},{"key":"1120_CR37","unstructured":"Miller P (2013) Aegis. https:\/\/sourceforge.net\/projects\/aegis\/"},{"key":"1120_CR38","unstructured":"Mozilla Foundation (1998) Bugzilla. https:\/\/www.bugzilla.org\/"},{"issue":"1","key":"1120_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-021-00376-5","volume":"6","author":"AC Myall","year":"2021","unstructured":"Myall AC, Peach RL, Wei\u00dfe AY et al (2021) Network memory in the movement of hospital patients carrying antimicrobial-resistant bacteria. Appl. Netw. Sci. 6(1):1\u201323","journal-title":"Appl. Netw. Sci."},{"issue":"2","key":"1120_CR40","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1093\/comnet\/cnx031","volume":"6","author":"G Palla","year":"2018","unstructured":"Palla G, P\u00e1ll N, Horv\u00e1th A et al (2018) Complex clinical pathways of an autoimmune disease. J. Complex Netw. 6(2):206\u2013214","journal-title":"J. Complex Netw."},{"key":"1120_CR41","unstructured":"Palomba F, Serebrenik A, Zaidman A (2017) Social debt analytics for improving the management of software evolution tasks. In: BENEVOL, pp 18\u201321"},{"issue":"1","key":"1120_CR42","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1109\/TSE.2018.2883603","volume":"47","author":"F Palomba","year":"2018","unstructured":"Palomba F, Tamburri DA, Fontana FA et al (2018) Beyond technical aspects: how do community smells influence the intensity of code smells? IEEE Trans Software Eng 47(1):108\u2013129","journal-title":"IEEE Trans Software Eng"},{"issue":"1","key":"1120_CR43","doi-asserted-by":"publisher","first-page":"1","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):1\u201312","journal-title":"Nat Commun"},{"key":"1120_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/978-3-030-68766-3_8","volume-title":"Graph Drawing and Network Visualization - 28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16\u201318, 2020, Revised Selected Papers","author":"V Perri","year":"2020","unstructured":"Perri V, Scholtes I (2020) Hotvis: Higher-order time-aware visualisation of dynamic graphs. In: Auber D, Valtr P (eds) Graph Drawing and Network Visualization - 28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16\u201318, 2020, Revised Selected Papers, vol 12590. Lecture Notes in Computer Science. Springer, Berlin, pp 99\u2013114"},{"key":"1120_CR45","unstructured":"Qarkaxhija L, Perri V, Scholtes I (2022) De bruijn goes neural: Causality-aware graph neural networks for time series data on dynamic graphs. In: Rieck B, Pascanu R (eds) Learning on Graphs Conference, LoG 2022, 9-12 December 2022, Virtual Event, Proceedings of Machine Learning Research, vol 198. PMLR, p\u00a051"},{"key":"1120_CR46","doi-asserted-by":"crossref","unstructured":"Ricca F, Marchetto A, Torchiano M (2011) On the difficulty of computing the truck factor. In: International Conference on Product Focused Software Process Improvement, Springer, pp 337\u2013351","DOI":"10.1007\/978-3-642-21843-9_26"},{"issue":"04","key":"1120_CR47","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1142\/S1793351X08000567","volume":"2","author":"J Rilling","year":"2008","unstructured":"Rilling J, Witte R, Schuegerl P et al (2008) Beyond information silos-an omnipresent approach to software evolution. Int J Semantic Comput 2(04):431\u2013468","journal-title":"Int J Semantic Comput"},{"issue":"1","key":"1120_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/ncomms5630","volume":"5","author":"M Rosvall","year":"2014","unstructured":"Rosvall M, Esquivel AV, Lancichinetti A et al (2014) Memory in network flows and its effects on spreading dynamics and community detection. Nat Commun 5(1):1\u201313","journal-title":"Nat Commun"},{"issue":"4","key":"1120_CR49","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1089\/big.2019.0169","volume":"8","author":"M Saebi","year":"2020","unstructured":"Saebi M, Ciampaglia GL, Kaplan LM et al (2020) Honem: learning embedding for higher order networks. Big Data 8(4):255\u2013269","journal-title":"Big Data"},{"issue":"1","key":"1120_CR50","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1140\/epjds\/s13688-020-00233-y","volume":"9","author":"M Saebi","year":"2020","unstructured":"Saebi M, Xu J, Kaplan LM et al (2020) Efficient modeling of higher-order dependencies in networks: from algorithm to application for anomaly detection. EPJ Data Sci 9(1):15","journal-title":"EPJ Data Sci"},{"key":"1120_CR51","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, pp 1037\u20131046","DOI":"10.1145\/3097983.3098145"},{"key":"1120_CR52","doi-asserted-by":"publisher","first-page":"5024","DOI":"10.1038\/ncomms6024","volume":"5","author":"I Scholtes","year":"2014","unstructured":"Scholtes I, Wider N, Pfitzner R et al (2014) Causality-driven slow-down and speed-up of diffusion in non-Markovian temporal networks. Nat Commun 5:5024","journal-title":"Nat Commun"},{"issue":"3","key":"1120_CR53","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1140\/epjb\/e2016-60663-0","volume":"89","author":"I Scholtes","year":"2016","unstructured":"Scholtes I, Wider N, Garas A (2016) Higher-order aggregate networks in the analysis of temporal networks: path structures and centralities. Eur Phys J B 89(3):1\u201315","journal-title":"Eur Phys J B"},{"key":"1120_CR54","unstructured":"Schueller W, Wachs J (2022) Modeling interconnected social and technical risks in open source software ecosystems. arXiv preprint arXiv:2205.04268"},{"issue":"1","key":"1120_CR55","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1038\/s41597-022-01819-z","volume":"9","author":"W Schueller","year":"2022","unstructured":"Schueller W, Wachs J, Servedio VD et al (2022) Evolving collaboration, dependencies, and use in the rust open source software ecosystem. Sci Data 9(1):703","journal-title":"Sci Data"},{"key":"1120_CR56","unstructured":"Schwaber K, Sutherland J (2020) The Scrum Guide - The definitive guide to Scrum: The rules of the game. https:\/\/scrumguides.org\/download.html"},{"key":"1120_CR57","doi-asserted-by":"crossref","unstructured":"Sedano T, Ralph P, P\u00e9raire C (2017) Software development waste. In: 2017 IEEE\/ACM 39th International Conference on Software Engineering (ICSE), IEEE, pp 130\u2013140","DOI":"10.1109\/ICSE.2017.20"},{"issue":"8","key":"1120_CR58","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0023176","volume":"6","author":"J Stehl\u00e9","year":"2011","unstructured":"Stehl\u00e9 J, Voirin N, Barrat A et al (2011) High-resolution measurements of face-to-face contact patterns in a primary school. PLoS ONE 6(8):1\u201313","journal-title":"PLoS ONE"},{"issue":"1","key":"1120_CR59","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1109\/TCSS.2018.2886433","volume":"6","author":"DA Tamburri","year":"2019","unstructured":"Tamburri DA (2019) Software architecture social debt: managing the incommunicability factor. IEEE Trans Comput Soc Syst 6(1):20\u201337","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"1120_CR60","doi-asserted-by":"crossref","unstructured":"Tamburri DA, Kruchten P, Lago P, et\u00a0al (2013) What is social debt in software engineering? In: 2013 6th International Workshop on Cooperative and Human Aspects of Software Engineering (CHASE), IEEE, pp 93\u201396","DOI":"10.1109\/CHASE.2013.6614739"},{"issue":"1","key":"1120_CR61","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s13174-014-0015-z","volume":"6","author":"DA Tamburri","year":"2015","unstructured":"Tamburri DA, Kruchten P, Lago P et al (2015) Social debt in software engineering: insights from industry. J Internet Services and Appl 6(1):1\u201317","journal-title":"J Internet Services and Appl"},{"issue":"3","key":"1120_CR62","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1109\/TSE.2019.2901490","volume":"47","author":"DA Tamburri","year":"2019","unstructured":"Tamburri DA, Palomba F, Kazman R (2019) Exploring community smells in open-source: an automated approach. IEEE Trans Software Eng 47(3):630\u2013652","journal-title":"IEEE Trans Software Eng"},{"key":"1120_CR63","unstructured":"Tao J, Xu J, Wang C, et\u00a0al. (2017) Honvis: Visualizing and exploring higher-order networks. In: 2017 IEEE Pacific Visualization Symposium (PacificVis), pp 1\u201310"},{"key":"1120_CR64","unstructured":"Torres L, Blevins AS, Bassett DS, et\u00a0al. (2020) The why, how, and when of representations for complex systems. arXiv preprint arXiv:2006.02870"},{"key":"1120_CR65","unstructured":"Transport for London (2014) Rolling origin and destination survey (rods) database. http:\/\/www.tfl.gov.uk\/info-for\/open-data-users\/our-feeds"},{"issue":"9","key":"1120_CR66","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/annotation\/b20d3cec-62b7-44ec-9150-8a06a9b30a9b","volume":"8","author":"P Vanhems","year":"2013","unstructured":"Vanhems P, Barrat A, Cattuto C et al (2013) Estimating potential infection transmission routes in hospital wards using wearable proximity sensors. PLoS ONE 8(9):1\u20139","journal-title":"PLoS ONE"},{"issue":"5","key":"1120_CR67","doi-asserted-by":"publisher","first-page":"e1600028","DOI":"10.1126\/sciadv.1600028","volume":"2","author":"J Xu","year":"2016","unstructured":"Xu J, Wickramarathne TL, Chawla NV (2016) Representing higher-order dependencies in networks. Sci Adv 2(5):e1600028","journal-title":"Sci Adv"},{"issue":"1","key":"1120_CR68","first-page":"015007","volume":"2","author":"Y Zhang","year":"2021","unstructured":"Zhang Y, Garas A, Scholtes I (2021) Higher-order models capture changes in controllability of temporal networks. J. Phys.: Complex 2(1):015007","journal-title":"J. Phys.: Complex"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-023-01120-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-023-01120-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-023-01120-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T21:10:37Z","timestamp":1702588237000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-023-01120-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,10]]},"references-count":68,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["1120"],"URL":"https:\/\/doi.org\/10.1007\/s13278-023-01120-w","relation":{},"ISSN":["1869-5469"],"issn-type":[{"type":"electronic","value":"1869-5469"}],"subject":[],"published":{"date-parts":[[2023,10,10]]},"assertion":[{"value":"2 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 August 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"129"}}