{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T06:49:45Z","timestamp":1782370185665,"version":"3.54.5"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T00:00:00Z","timestamp":1580342400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T00:00:00Z","timestamp":1580342400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Hypergraphs offer a natural modeling language for studying polyadic interactions between sets of entities. Many polyadic interactions are asymmetric, with nodes playing distinctive roles. In an academic collaboration network, for example, the order of authors on a paper often reflects the nature of their contributions to the completed work. To model these networks, we introduce<jats:italic>annotated hypergraphs<\/jats:italic>as natural polyadic generalizations of directed graphs. Annotated hypergraphs form a highly general framework for incorporating metadata into polyadic graph models. To facilitate data analysis with annotated hypergraphs, we construct a role-aware configuration null model for these structures and prove an efficient Markov Chain Monte Carlo scheme for sampling from it. We proceed to formulate several metrics and algorithms for the analysis of annotated hypergraphs. Several of these, such as assortativity and modularity, naturally generalize dyadic counterparts. Other metrics, such as local role densities, are unique to the setting of annotated hypergraphs. We illustrate our techniques on six digital social networks, and present a detailed case-study of the Enron email data set.<\/jats:p>","DOI":"10.1007\/s41109-020-0252-y","type":"journal-article","created":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T14:03:02Z","timestamp":1580392982000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":48,"title":["Annotated hypergraphs: models and applications"],"prefix":"10.1007","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5667-490X","authenticated-orcid":false,"given":"Philip","family":"Chodrow","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrew","family":"Mellor","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,1,30]]},"reference":[{"issue":"6","key":"252_CR1","doi-asserted-by":"publisher","first-page":"062807","DOI":"10.1103\/PhysRevE.92.062807","volume":"92","author":"A Allard","year":"2015","unstructured":"Allard, A, H\u00e9bert-Dufresne L, Young J-G, Dub\u00e9 LJ (2015) General and exact approach to percolation on random graphs. Phys Rev E 92(6):062807.","journal-title":"Phys Rev E"},{"issue":"6","key":"252_CR2","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1038\/nrg2102","volume":"8","author":"U Alon","year":"2007","unstructured":"Alon, U (2007) Network motifs: Theory and experimental approaches. Nat Rev Genet 8(6):450\u2013461.","journal-title":"Nat Rev Genet"},{"key":"252_CR3","unstructured":"Angel, O, van der Hofstad R, Holmgren C (2016) Limit laws for self-loops and multiple edges in the configuration model:1\u201319. arXiv:1603.07172."},{"issue":"3","key":"252_CR4","doi-asserted-by":"publisher","first-page":"032804","DOI":"10.1103\/PhysRevE.89.032804","volume":"89","author":"F Battiston","year":"2014","unstructured":"Battiston, F, Nicosia V, Latora V (2014) Structural measures for multiplex networks. Phys Rev E 89(3):032804.","journal-title":"Phys Rev E"},{"issue":"2","key":"252_CR5","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1137\/18M1203031","volume":"1","author":"AR Benson","year":"2019","unstructured":"Benson, AR (2019) Three hypergraph eigenvector centralities. SIAM J Math Data Sci 1(2):293\u2013312.","journal-title":"SIAM J Math Data Sci"},{"issue":"6295","key":"252_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1126\/science.aad9029","volume":"353","author":"AR Benson","year":"2016","unstructured":"Benson, AR, Gleich DF, Leskovec J (2016) Higher-order organization of complex networks. Science 353(6295):163\u2013166.","journal-title":"Science"},{"key":"252_CR7","unstructured":"Berge, C (1984) Hypergraphs: Combinatorics of Finite Sets, vol. 45. Elsevier."},{"key":"252_CR8","first-page":"1","volume":"10","author":"VD Blondel","year":"2008","unstructured":"Blondel, VD, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech-Theory Exp 10:1\u201312.","journal-title":"J Stat Mech-Theory Exp"},{"issue":"4","key":"252_CR9","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0195-6698(80)80030-8","volume":"1","author":"B Bollob\u00e1s","year":"1980","unstructured":"Bollob\u00e1s, B (1980) A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. Eur J Comb 1(4):311\u2013316.","journal-title":"Eur J Comb"},{"key":"252_CR10","doi-asserted-by":"publisher","unstructured":"Brandes, U, Delling D, Gaertler M, G\u00f6rke R, Hoefer M, Nikoloski Z, Wagner D (2007) On finding graph clusterings with maximum modularity In: International Workshop on Graph-Theoretic Concepts in Computer Science, 121\u2013132.. Springer. https:\/\/doi.org\/10.1007\/978-3-540-74839-7_12.","DOI":"10.1007\/978-3-540-74839-7_12"},{"issue":"2","key":"252_CR11","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1090\/S0273-0979-09-01249-X","volume":"46","author":"G Carlsson","year":"2009","unstructured":"Carlsson, G (2009) Topology and data. Bull Am Math Soc 46(2):255\u2013308.","journal-title":"Bull Am Math Soc"},{"key":"252_CR12","unstructured":"Chodrow, PS (2019a) Configuration Models of Random Hypergraphs and their Applications. arXiv:1902.09302 [physics, stat]. http:\/\/arxiv.org\/abs\/1902.09302."},{"key":"252_CR13","doi-asserted-by":"crossref","unstructured":"Chodrow, PS (2019b) Moments of uniform random multigraphs with fixed degree sequences. arXiv preprint arXiv:1909.09037.","DOI":"10.1137\/19M1288772"},{"key":"252_CR14","unstructured":"de Arruda, GF, Petri G, Moreno Y (2019) Social contagion models on hypergraphs. arXiv preprint arXiv:1909.11154."},{"key":"252_CR15","unstructured":"Erd\u00f6s, PL, Mikl\u00f3s I, Soukup L (2010) Towards random uniform sampling of bipartite graphs with given degree sequence. arXiv preprint arXiv:1004.2612."},{"key":"252_CR16","first-page":"264","volume":"11","author":"P Erdo\u030bs","year":"1960","unstructured":"Erdo\u030bs, P, Gallai T (1960) Graphs with prescribed degrees of vertices. Mat Lapok 11:264\u2013274.","journal-title":"Mat Lapok"},{"issue":"1","key":"252_CR17","doi-asserted-by":"publisher","first-page":"016105","DOI":"10.1103\/PhysRevE.80.016105","volume":"80","author":"T Evans","year":"2009","unstructured":"Evans, T, Lambiotte R (2009) Line graphs, link partitions, and overlapping communities. Phys Rev E 80(1):016105.","journal-title":"Phys Rev E"},{"issue":"1","key":"252_CR18","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1073\/pnas.0605965104","volume":"104","author":"S Fortunato","year":"2006","unstructured":"Fortunato, S, Barth\u00e9lemy M (2006) Resolution limit in community detection. Proc Natl Acad Sci 104(1):36\u201341.","journal-title":"Proc Natl Acad Sci"},{"issue":"2","key":"252_CR19","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1137\/16M1087175","volume":"60","author":"BK Fosdick","year":"2018","unstructured":"Fosdick, BK, Larremore DB, Nishimura J, Ugander J (2018) Configuring random graph models with fixed degree sequences. SIAM Rev 60(2):315\u2013355.","journal-title":"SIAM Rev"},{"issue":"2","key":"252_CR20","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.2140\/pjm.1957.7.1073","volume":"7","author":"D Gale","year":"1957","unstructured":"Gale, D (1957) A theorem on flows in networks. Pac J. Math 7(2):1073\u20131082.","journal-title":"Pac J. Math"},{"issue":"2-3","key":"252_CR21","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0166-218X(93)90045-P","volume":"42","author":"G Gallo","year":"1993","unstructured":"Gallo, G, Longo G, Pallottino S, Nguyen S (1993) Directed hypergraphs and applications. Discret Appl Math 42(2-3):177\u2013201.","journal-title":"Discret Appl Math"},{"issue":"1-2","key":"252_CR22","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF02735318","volume":"21","author":"G Gallo","year":"1998","unstructured":"Gallo, G, Scutella MG (1998) Directed hypergraphs as a modelling paradigm. Rivista di matematica per le scienze economiche e sociali 21(1-2):97\u2013123.","journal-title":"Rivista di matematica per le scienze economiche e sociali"},{"issue":"6","key":"252_CR23","doi-asserted-by":"publisher","first-page":"066118","DOI":"10.1103\/PhysRevE.79.066118","volume":"79","author":"G Ghoshal","year":"2009","unstructured":"Ghoshal, G, Zlati\u0107 V, Caldarelli G, Newman M (2009) Random hypergraphs and their applications. Phys Rev E 79(6):066118.","journal-title":"Phys Rev E"},{"issue":"2","key":"252_CR24","doi-asserted-by":"publisher","first-page":"028701","DOI":"10.1103\/PhysRevLett.110.028701","volume":"110","author":"S Gomez","year":"2013","unstructured":"Gomez, S, Diaz-Guilera A, Gomez-Gardenes J, Perez-Vicente CJ, Moreno Y, Arenas A (2013) Diffusion dynamics on multiplex networks. Phys Rev Lett 110(2):028701.","journal-title":"Phys Rev Lett"},{"issue":"1","key":"252_CR25","doi-asserted-by":"crossref","first-page":"234","DOI":"10.37236\/721","volume":"18","author":"C Greenhill","year":"2011","unstructured":"Greenhill, C (2011) A polynomial bound on the mixing time of a markov chain for sampling regular directed graphs. Electron J Comb 18(1):234.","journal-title":"Electron J Comb"},{"key":"252_CR26","doi-asserted-by":"publisher","unstructured":"Greenhill, C (2014) The switch markov chain for sampling irregular graphs In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1564\u20131572.. SIAM. https:\/\/doi.org\/10.1137\/1.9781611973730.103.","DOI":"10.1137\/1.9781611973730.103"},{"issue":"1","key":"252_CR27","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1093\/czoolo\/61.1.114","volume":"61","author":"BR Greening Jr","year":"2015","unstructured":"Greening Jr, BR, Pinter-Wollman N, Fefferman NH (2015) Higher-order interactions: understanding the knowledge capacity of social groups using simplicial sets. Curr Zool 61(1):114\u2013127.","journal-title":"Curr Zool"},{"issue":"2","key":"252_CR28","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1109\/TCBB.2007.70243","volume":"6","author":"LS Heath","year":"2009","unstructured":"Heath, LS, Sioson AA (2009) Multimodal networks: Structure and operations. IEEE\/ACM Trans Comput Biol Bioinforma (TCBB) 6(2):321\u2013332.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinforma (TCBB)"},{"key":"252_CR29","doi-asserted-by":"crossref","unstructured":"Henderson, K, Gallagher B, Eliassi-Rad T, Tong H, Basu S, Akoglu L, Koutra D, Faloutsos C, Li L (2012) Rolx: Structural role extraction & mining in large graphs In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 1231\u20131239.. ACM.","DOI":"10.1145\/2339530.2339723"},{"key":"252_CR30","unstructured":"Kaminski, B, Poulin V, Pralat P, Szufel P, Theberge F (2018) Clustering via hypergraph modularity:1\u201317. arXiv:1810.04816."},{"issue":"4","key":"252_CR31","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1002\/(SICI)1098-2418(199907)14:4<293::AID-RSA1>3.0.CO;2-G","volume":"14","author":"R Kannan","year":"1999","unstructured":"Kannan, R, Tetali P, Vempala S (1999) Simple markov-chain algorithms for generating bipartite graphs and tournaments. Random Struct Algoritm 14(4):293\u2013308.","journal-title":"Random Struct Algoritm"},{"issue":"6","key":"252_CR32","doi-asserted-by":"publisher","first-page":"066118","DOI":"10.1103\/PhysRevE.82.066118","volume":"82","author":"B Karrer","year":"2010","unstructured":"Karrer, B, Newman ME (2010) Random graphs containing arbitrary distributions of subgraphs. Phys Rev E 82(6):066118.","journal-title":"Phys Rev E"},{"key":"252_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.chaos.2015.03.016","volume":"80","author":"DY Kenett","year":"2015","unstructured":"Kenett, DY, Perc M, Boccaletti S (2015) Networks of networks\u2013an introduction. Chaos Solitons Fractals 80:1\u20136.","journal-title":"Chaos Solitons Fractals"},{"issue":"5","key":"252_CR34","doi-asserted-by":"publisher","first-page":"1000385","DOI":"10.1371\/journal.pcbi.1000385","volume":"5","author":"S Klamt","year":"2009","unstructured":"Klamt, S, Haus U-U, Theis F (2009) Hypergraphs and cellular networks. PLoS Comput Biol 5(5):1000385.","journal-title":"PLoS Comput Biol"},{"key":"252_CR35","doi-asserted-by":"crossref","unstructured":"Klimt, B, Yang Y (2004) The enron corpus: A new dataset for email classification research In: European Conference on Machine Learning, 217\u2013226.. Springer.","DOI":"10.1007\/978-3-540-30115-8_22"},{"issue":"45","key":"252_CR36","doi-asserted-by":"publisher","first-page":"18070","DOI":"10.1073\/pnas.1307941110","volume":"110","author":"L Kovanen","year":"2013","unstructured":"Kovanen, L, Kaski K, Kert\u00e9sz J, Saram\u00e4ki J (2013) Temporal motifs reveal homophily, gender-specific patterns, and group talk in call sequences. Proc Natl Acad Sci 110(45):18070\u201318075.","journal-title":"Proc Natl Acad Sci"},{"key":"252_CR37","unstructured":"Kumar, T, Vaidyanathan S, Ananthapadmanabhan H, Parthasarathy S, Ravindran B (2018) Hypergraph clustering: a modularity maximization approach. arXiv:1812.10869."},{"issue":"11","key":"252_CR38","doi-asserted-by":"publisher","first-page":"118703","DOI":"10.1103\/PhysRevLett.100.118703","volume":"100","author":"EA Leicht","year":"2008","unstructured":"Leicht, EA, Newman ME (2008) Community structure in directed networks. Phys Rev Lett 100(11):118703.","journal-title":"Phys Rev Lett"},{"key":"252_CR39","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-1-4615-5757-9_9","volume-title":"Equilibrium and Advanced Transportation Modelling","author":"Patrice Marcotte","year":"1998","unstructured":"Marcotte, P, Nguyen S (1998) Hyperpath formulations of traffic assignment problems In: Equilibrium and Advanced Transportation Modelling, 175\u2013200.. Springer. https:\/\/doi.org\/10.1007\/978-1-4615-5757-9_9."},{"issue":"2","key":"252_CR40","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0895480192229273","volume":"7","author":"FR McMorris","year":"1994","unstructured":"McMorris, FR, Warnow TJ, Wimer T (1994) Triangulating vertex-colored graphs. SIAM J Discret Math 7(2):296\u2013306.","journal-title":"SIAM J Discret Math"},{"key":"252_CR41","unstructured":"Mellor, A (2018) Event Graphs: Advances and Applications of Second-order Time-unfolded Temporal Network Models. arXiv preprint arXiv:1809.03457."},{"issue":"2-3","key":"252_CR42","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1002\/rsa.3240060204","volume":"6","author":"M Molloy","year":"1995","unstructured":"Molloy, M, Reed B (1995) A critical point for random graphs with a given degree sequence. Random Struct Algoritm 6(2-3):161\u2013180.","journal-title":"Random Struct Algoritm"},{"issue":"3","key":"252_CR43","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1017\/S0963548398003526","volume":"7","author":"M Molloy","year":"1998","unstructured":"Molloy, M, Reed B (1998) The size of the giant component of a random graph with a given degree sequence. Comb Probab Comput 7(3):295\u2013305.","journal-title":"Comb Probab Comput"},{"issue":"5980","key":"252_CR44","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1126\/science.1184819","volume":"328","author":"PJ Mucha","year":"2010","unstructured":"Mucha, PJ, Richardson T, Macon K, Porter MA, Onnela J-P (2010) Community structure in time-dependent, multiscale, and multiplex networks. Science 328(5980):876\u2013878.","journal-title":"Science"},{"issue":"23","key":"252_CR45","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"MEJ Newman","year":"2006","unstructured":"Newman, MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103(23):8577\u20138582.","journal-title":"Proc Natl Acad Sci"},{"key":"252_CR46","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"M Newman","year":"2010","unstructured":"Newman, M (2010) Networks: An Introduction. Oxford University Press, Oxford."},{"key":"252_CR47","doi-asserted-by":"publisher","first-page":"052315","DOI":"10.1103\/PhysRevE.94.052315","volume":"94","author":"MEJ Newman","year":"2016","unstructured":"Newman, MEJ (2016) Equivalence between modularity optimization and maximum likelihood methods for community detection. Phys Rev E 94:052315. https:\/\/doi.org\/10.1103\/PhysRevE.94.052315.","journal-title":"Phys Rev E"},{"key":"252_CR48","doi-asserted-by":"publisher","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman, MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69:026113. https:\/\/doi.org\/10.1103\/PhysRevE.69.026113.","journal-title":"Phys Rev E"},{"issue":"1-7","key":"252_CR49","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin, S, Page L (1998) \u201cThe anatomy of a large-scale hypertextual Web search engine\u201d\u0103(PDF). Comput Netw ISDN Syst 30(1-7):107\u2013117. https:\/\/doi.org\/10.1016\/S0169-7552(98)00110-X.","journal-title":"Comput Netw ISDN Syst"},{"issue":"5","key":"252_CR50","doi-asserted-by":"publisher","first-page":"1602548","DOI":"10.1126\/sciadv.1602548","volume":"3","author":"L Peel","year":"2017","unstructured":"Peel, L, Larremore DB, Clauset A (2017) The ground truth about metadata and community detection in networks. Sci Adv 3(5):1602548.","journal-title":"Sci Adv"},{"key":"252_CR51","doi-asserted-by":"crossref","unstructured":"Rotabi, R, Danescu-Niculescu-Mizil C, Kleinberg J (2017) Tracing the use of practices through networks of collaboration In: Eleventh International AAAI Conference on Web and Social Media.","DOI":"10.1609\/icwsm.v11i1.14870"},{"issue":"6","key":"252_CR52","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1090\/S0002-9904-1960-10494-6","volume":"66","author":"HJ Ryser","year":"1960","unstructured":"Ryser, HJ (1960) Matrices of zeros and ones. Bull Am Math Soc 66(6):442\u2013464.","journal-title":"Bull Am Math Soc"},{"key":"252_CR53","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-0-8176-4842-8_18","volume-title":"Classic Papers in Combinatorics","author":"H. J. Ryser","year":"2009","unstructured":"Ryser, HJ (2009) Combinatorial properties of matrices of zeros and ones In: Classic Papers in Combinatorics, 269\u2013275.. Springer. https:\/\/doi.org\/10.1007\/978-0-8176-4842-8_18."},{"issue":"1","key":"252_CR54","doi-asserted-by":"publisher","first-page":"015102","DOI":"10.1103\/PhysRevE.68.015102","volume":"68","author":"B S\u00f6derberg","year":"2003","unstructured":"S\u00f6derberg, B (2003) Random graphs with hidden color. Phys Rev E 68(1):015102.","journal-title":"Phys Rev E"},{"issue":"2","key":"252_CR55","doi-asserted-by":"publisher","first-page":"026107","DOI":"10.1103\/PhysRevE.68.026107","volume":"68","author":"B S\u00f6derberg","year":"2003","unstructured":"S\u00f6derberg, B (2003) Properties of random graphs with hidden color. Phys Rev E 68(2):026107.","journal-title":"Phys Rev E"},{"issue":"21","key":"252_CR56","doi-asserted-by":"publisher","first-page":"8601","DOI":"10.1073\/pnas.0903019106","volume":"106","author":"CE Tarnita","year":"2009","unstructured":"Tarnita, CE, Antal T, Ohtsuki H, Nowak MA (2009) Evolutionary dynamics in set structured populations. Proc Natl Acad Sci 106(21):8601\u20138604.","journal-title":"Proc Natl Acad Sci"},{"issue":"4","key":"252_CR57","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1080\/03081087.2015.1125838","volume":"64","author":"J Xie","year":"2016","unstructured":"Xie, J, Qi L (2016) Spectral directed hypergraph theory via tensors. Linear Multilinear Algebra 64(4):780\u2013794.","journal-title":"Linear Multilinear Algebra"},{"issue":"3","key":"252_CR58","first-page":"1","volume":"96","author":"JG Young","year":"2017","unstructured":"Young, JG, Petri G, Vaccarino F, Patania A (2017) Construction of and efficient sampling from the simplicial configuration model. Phys Rev E 96(3):1\u20136.","journal-title":"Phys Rev E"},{"issue":"5","key":"252_CR59","doi-asserted-by":"publisher","first-page":"052808","DOI":"10.1103\/PhysRevE.92.052808","volume":"92","author":"X Zhang","year":"2015","unstructured":"Zhang, X, Newman ME (2015) Multiway spectral community detection in networks. Phys Rev E 92(5):052808.","journal-title":"Phys Rev E"},{"key":"252_CR60","doi-asserted-by":"crossref","unstructured":"Zhou, D, Huang J, Sch\u00f6lkopf B (2007) Learning with hypergraphs: Clustering, classification, and embedding In: Advances in Neural Information Processing Systems, 1601\u20131608.","DOI":"10.7551\/mitpress\/7503.003.0205"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-020-0252-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41109-020-0252-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-020-0252-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T22:26:05Z","timestamp":1695680765000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-020-0252-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,30]]},"references-count":60,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["252"],"URL":"https:\/\/doi.org\/10.1007\/s41109-020-0252-y","relation":{},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,30]]},"assertion":[{"value":"8 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"9"}}