{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:30:46Z","timestamp":1772119846857,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":54,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T00:00:00Z","timestamp":1691107200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["2020R1C1C1008296"],"award-info":[{"award-number":["2020R1C1C1008296"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Institute of Information & Communications Technology Planning & Evaluation","award":["2022-0-00871"],"award-info":[{"award-number":["2022-0-00871"]}]},{"name":"Institute of Information & Communications Technology Planning & Evaluation","award":["2019-0-00075"],"award-info":[{"award-number":["2019-0-00075"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,8,6]]},"DOI":"10.1145\/3580305.3599382","type":"proceedings-article","created":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T18:10:58Z","timestamp":1691172658000},"page":"1132-1143","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["How Transitive Are Real-World Group Interactions? - Measurement and Reproduction"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-6002-169X","authenticated-orcid":false,"given":"Sunwoo","family":"Kim","sequence":"first","affiliation":[{"name":"KAIST, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0497-3902","authenticated-orcid":false,"given":"Fanchen","family":"Bu","sequence":"additional","affiliation":[{"name":"KAIST, Daejeon, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0819-7923","authenticated-orcid":false,"given":"Minyoung","family":"Choe","sequence":"additional","affiliation":[{"name":"KAIST, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7237-5117","authenticated-orcid":false,"given":"Jaemin","family":"Yoo","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Piitsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2872-1526","authenticated-orcid":false,"given":"Kijung","family":"Shin","sequence":"additional","affiliation":[{"name":"KAIST, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,8,4]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Science","volume":"286","author":"Barab\u00e1si Albert-L\u00e1szl\u00f3","year":"1999","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si and R\u00e9ka Albert . 1999 . Emergence of scaling in random networks . Science , Vol. 286 , 5439 (1999), 509--512. Albert-L\u00e1szl\u00f3 Barab\u00e1si and R\u00e9ka Albert. 1999. Emergence of scaling in random networks. Science, Vol. 286, 5439 (1999), 509--512."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0400087101"},{"key":"e_1_3_2_2_3_1","volume-title":"Efficient algorithms for large-scale local triangle counting. ACM Transactions on Knowledge Discovery from Data","author":"Becchetti Luca","year":"2010","unstructured":"Luca Becchetti , Paolo Boldi , Carlos Castillo , and Aristides Gionis . 2010. Efficient algorithms for large-scale local triangle counting. ACM Transactions on Knowledge Discovery from Data , Vol. 4 , 3 ( 2010 ), 1--28. Luca Becchetti, Paolo Boldi, Carlos Castillo, and Aristides Gionis. 2010. Efficient algorithms for large-scale local triangle counting. ACM Transactions on Knowledge Discovery from Data, Vol. 4, 3 (2010), 1--28."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2023.04.006"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1800683115"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Austin R Benson Ravi Kumar and Andrew Tomkins. 2018b. Sequences of sets. In KDD.  Austin R Benson Ravi Kumar and Andrew Tomkins. 2018b. Sequences of sets. In KDD.","DOI":"10.1145\/3219819.3220100"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Karl Bringmann and Konstantinos Panagiotou. 2012. Efficient sampling methods for discrete distributions. In ICALP.  Karl Bringmann and Konstantinos Panagiotou. 2012. Efficient sampling methods for discrete distributions. In ICALP.","DOI":"10.1007\/978-3-642-31594-7_12"},{"key":"e_1_3_2_2_8_1","volume-title":"Algorithms, Observations, and Applications. ArXiv","author":"Bu Fanchen","year":"2023","unstructured":"Fanchen Bu , Geon Lee , and Kijung Shin . 2023. Hypercore Decomposition for Non-Fragile Hyperedges: Concepts , Algorithms, Observations, and Applications. ArXiv ( 2023 ). Fanchen Bu, Geon Lee, and Kijung Shin. 2023. Hypercore Decomposition for Non-Fragile Hyperedges: Concepts, Algorithms, Observations, and Applications. ArXiv (2023)."},{"key":"e_1_3_2_2_9_1","volume-title":"Temporal properties of higher-order interactions in social networks. Scientific reports","author":"Cencetti Giulia","year":"2021","unstructured":"Giulia Cencetti , Federico Battiston , Bruno Lepri , and M\u00e1rton Karsai . 2021. Temporal properties of higher-order interactions in social networks. Scientific reports , Vol. 11 , 1 ( 2021 ), 1--10. Giulia Cencetti, Federico Battiston, Bruno Lepri, and M\u00e1rton Karsai. 2021. Temporal properties of higher-order interactions in social networks. Scientific reports, Vol. 11, 1 (2021), 1--10."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-020-03525-8"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Deepayan Chakrabarti Yiping Zhan and Christos Faloutsos. 2004. R-MAT: A recursive model for graph mining. In SDM.  Deepayan Chakrabarti Yiping Zhan and Christos Faloutsos. 2004. R-MAT: A recursive model for graph mining. In SDM.","DOI":"10.1137\/1.9781611972740.43"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.5029866"},{"key":"e_1_3_2_2_13_1","volume-title":"Midas: Representative sampling from real-world hypergraphs. In WWW.","author":"Choe Minyoung","year":"2022","unstructured":"Minyoung Choe , Jaemin Yoo , Geon Lee , Woonsung Baek , U Kang , and Kijung Shin . 2022 . Midas: Representative sampling from real-world hypergraphs. In WWW. Minyoung Choe, Jaemin Yoo, Geon Lee, Woonsung Baek, U Kang, and Kijung Shin. 2022. Midas: Representative sampling from real-world hypergraphs. In WWW."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Hyunjin Choo and Kijung Shin. 2022. On the persistence of higher-order interactions in real-world hypergraphs. In SDM.  Hyunjin Choo and Kijung Shin. 2022. On the persistence of higher-order interactions in real-world hypergraphs. In SDM.","DOI":"10.1137\/1.9781611977172.19"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Cazamere Comrie and Jon Kleinberg. 2021. Hypergraph Ego-networks and Their Temporal Evolution. In ICDM.  Cazamere Comrie and Jon Kleinberg. 2021. Hypergraph Ego-networks and Their Temporal Evolution. In ICDM.","DOI":"10.1109\/ICDM51629.2021.00019"},{"key":"e_1_3_2_2_16_1","unstructured":"Manh Tuan Do Se-eun Yoon Bryan Hooi and Kijung Shin. 2020. Structural patterns and generative models of real-world hypergraphs. In KDD.  Manh Tuan Do Se-eun Yoon Bryan Hooi and Kijung Shin. 2020. Structural patterns and generative models of real-world hypergraphs. In KDD."},{"key":"e_1_3_2_2_17_1","volume-title":"Complex networks as hypergraphs. ArXiv","author":"Estrada Ernesto","year":"2005","unstructured":"Ernesto Estrada and Juan A Rodriguez-Velazquez . 2005. Complex networks as hypergraphs. ArXiv ( 2005 ). Ernesto Estrada and Juan A Rodriguez-Velazquez. 2005. Complex networks as hypergraphs. ArXiv (2005)."},{"key":"e_1_3_2_2_18_1","volume-title":"On power-law relationships of the internet topology. ACM SIGCOMM computer communication review","author":"Faloutsos Michalis","year":"1999","unstructured":"Michalis Faloutsos , Petros Faloutsos , and Christos Faloutsos . 1999. On power-law relationships of the internet topology. ACM SIGCOMM computer communication review , Vol. 29 , 4 ( 1999 ), 251--262. Michalis Faloutsos, Petros Faloutsos, and Christos Faloutsos. 1999. On power-law relationships of the internet topology. ACM SIGCOMM computer communication review, Vol. 29, 4 (1999), 251--262."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/44.3-4.470"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Suzanne Renick Gallagher and Debra S Goldberg. 2013. Clustering coefficients in protein interaction hypernetworks. In BCB.  Suzanne Renick Gallagher and Debra S Goldberg. 2013. Clustering coefficients in protein interaction hypernetworks. In BCB.","DOI":"10.1145\/2506583.2506635"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1017\/nws.2022.35"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"Lilith Orion Hafner Chase Holdener and Nicole Eikmeier. 2022. Functional Ball Dropping: A superfast hypergraph generation scheme. In BigData.  Lilith Orion Hafner Chase Holdener and Nicole Eikmeier. 2022. Functional Ball Dropping: A superfast hypergraph generation scheme. In BigData.","DOI":"10.1109\/BigData55660.2022.10020506"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.20517\/2347-8659.2018.03"},{"key":"e_1_3_2_2_25_1","volume-title":"Austin R Benson, and Jon Kleinberg","author":"Juul Jonas L","year":"2022","unstructured":"Jonas L Juul , Austin R Benson, and Jon Kleinberg . 2022 . Hypergraph patterns and collaboration structure. arXiv preprint arXiv:2210.02163 (2022). Jonas L Juul, Austin R Benson, and Jon Kleinberg. 2022. Hypergraph patterns and collaboration structure. arXiv preprint arXiv:2210.02163 (2022)."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1365534.1365536"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Sunwoo Kim Fanchen Bu Minyoung Choe Jaemin Yoo and Kijung Shin. 2023. How Transitive Are Real-World Group Interactions? - Measurement and Reproduction (Code Datasets and Online Appendix). https:\/\/github.com\/kswoo97\/hypertrans  Sunwoo Kim Fanchen Bu Minyoung Choe Jaemin Yoo and Kijung Shin. 2023. How Transitive Are Real-World Group Interactions? - Measurement and Reproduction (Code Datasets and Online Appendix). https:\/\/github.com\/kswoo97\/hypertrans","DOI":"10.1145\/3580305.3599382"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Sunwoo Kim Minyoung Choe Jaemin Yoo and Kijung Shin. 2022. Reciprocity in Directed Hypergraphs: Measures Findings and Generators. In ICDM.  Sunwoo Kim Minyoung Choe Jaemin Yoo and Kijung Shin. 2022. Reciprocity in Directed Hypergraphs: Measures Findings and Generators. In ICDM.","DOI":"10.1109\/ICDM54844.2022.00122"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1000385"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-022-01739-9"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"crossref","unstructured":"Konstantin Kutzkov and Rasmus Pagh. 2013. On the streaming complexity of computing local clustering coefficients. In WSDM.  Konstantin Kutzkov and Rasmus Pagh. 2013. On the streaming complexity of computing local clustering coefficients. In WSDM.","DOI":"10.1145\/2433396.2433480"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0122777"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Geon Lee Minyoung Choe and Kijung Shin. 2021. How do hyperedges overlap in real-world hypergraphs?-patterns measures and generators. In WWW.  Geon Lee Minyoung Choe and Kijung Shin. 2021. How do hyperedges overlap in real-world hypergraphs?-patterns measures and generators. In WWW.","DOI":"10.1145\/3442381.3450010"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407823"},{"key":"e_1_3_2_2_35_1","volume-title":"Thyme: Temporal hypergraph motifs and fast algorithms for exact counting. In ICDM.","author":"Lee Geon","year":"2021","unstructured":"Geon Lee and Kijung Shin . 2021 . Thyme: Temporal hypergraph motifs and fast algorithms for exact counting. In ICDM. Geon Lee and Kijung Shin. 2021. Thyme: Temporal hypergraph motifs and fast algorithms for exact counting. In ICDM."},{"key":"e_1_3_2_2_36_1","volume-title":"Dynamics of large networks","author":"Leskovec Jurij","unstructured":"Jurij Leskovec . 2008. Dynamics of large networks . In Carnegie Mellon University . Jurij Leskovec. 2008. Dynamics of large networks. In Carnegie Mellon University."},{"key":"e_1_3_2_2_37_1","article-title":"Kronecker graphs: an approach to modeling networks","volume":"11","author":"Leskovec Jure","year":"2010","unstructured":"Jure Leskovec , Deepayan Chakrabarti , Jon Kleinberg , Christos Faloutsos , and Zoubin Ghahramani . 2010 . Kronecker graphs: an approach to modeling networks . Journal of Machine Learning Research , Vol. 11 , 2 (2010). Jure Leskovec, Deepayan Chakrabarti, Jon Kleinberg, Christos Faloutsos, and Zoubin Ghahramani. 2010. Kronecker graphs: an approach to modeling networks. Journal of Machine Learning Research, Vol. 11, 2 (2010).","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_2_38_1","volume-title":"Sarah Powers, Mallikarjun Shankar, and Neena Imam.","author":"Lim Seung-Hwan","year":"2015","unstructured":"Seung-Hwan Lim , Sangkeun Matt Lee , Sarah Powers, Mallikarjun Shankar, and Neena Imam. 2015 . Survey of approaches to generate realistic synthetic graphs. Oak Ridge National Laboratory ( 2015). Seung-Hwan Lim, Sangkeun Matt Lee, Sarah Powers, Mallikarjun Shankar, and Neena Imam. 2015. Survey of approaches to generate realistic synthetic graphs. Oak Ridge National Laboratory (2015)."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.3389\/fnins.2020.00184"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1038\/s42005-022-00858-7"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.3389\/fninf.2018.00007"},{"key":"e_1_3_2_2_42_1","volume-title":"Random graphs with arbitrary degree distributions and their applications. Physical review E","author":"Newman Mark EJ","year":"2001","unstructured":"Mark EJ Newman , Steven H Strogatz , and Duncan J Watts . 2001. Random graphs with arbitrary degree distributions and their applications. Physical review E , Vol. 64 , 2 ( 2001 ), 026118. Mark EJ Newman, Steven H Strogatz, and Duncan J Watts. 2001. Random graphs with arbitrary degree distributions and their applications. Physical review E, Vol. 64, 2 (2001), 026118."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"crossref","unstructured":"Sadegh Nobari Xuesong Lu Panagiotis Karras and St\u00e9phane Bressan. 2011. Fast random graph generation. In EDBT.  Sadegh Nobari Xuesong Lu Panagiotis Karras and St\u00e9phane Bressan. 2011. Fast random graph generation. In EDBT.","DOI":"10.1145\/1951365.1951406"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.67.026112"},{"key":"e_1_3_2_2_45_1","first-page":"2012","article-title":"Darts, dice, and coins: Sampling from a discrete distribution","volume":"3","author":"Schwarz Keith","year":"2011","unstructured":"Keith Schwarz . 2011 . Darts, dice, and coins: Sampling from a discrete distribution . Retrieved , Vol. 3 , 28 (2011), 2012 . Keith Schwarz. 2011. Darts, dice, and coins: Sampling from a discrete distribution. Retrieved, Vol. 3, 28 (2011), 2012.","journal-title":"Retrieved"},{"key":"e_1_3_2_2_46_1","volume-title":"Daniel O Cajueiro, and Sergio RS Souza.","author":"Tabak Benjamin M","year":"2014","unstructured":"Benjamin M Tabak , Marcelo Takami , Jadson MC Rocha , Daniel O Cajueiro, and Sergio RS Souza. 2014 . Directed clustering coefficient as a measure of systemic risk in complex banking networks. Physica A: Statistical Mechanics and its Applications , Vol. 394 (2014), 211--216. Benjamin M Tabak, Marcelo Takami, Jadson MC Rocha, Daniel O Cajueiro, and Sergio RS Souza. 2014. Directed clustering coefficient as a measure of systemic risk in complex banking networks. Physica A: Statistical Mechanics and its Applications, Vol. 394 (2014), 211--216."},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1355896"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1137\/22M1480926"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2011.147"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"crossref","unstructured":"Stanley Wasserman Katherine Faust etal 1994. Social network analysis: Methods and applications. (1994).  Stanley Wasserman Katherine Faust et al. 1994. Social network analysis: Methods and applications. (1994).","DOI":"10.1017\/CBO9780511815478"},{"key":"e_1_3_2_2_51_1","volume-title":"Nature","volume":"393","author":"Watts Duncan J","year":"1998","unstructured":"Duncan J Watts and Steven H Strogatz . 1998 . Collective dynamics of ?small-world'networks . Nature , Vol. 393 , 6684 (1998), 440--442. Duncan J Watts and Steven H Strogatz. 1998. Collective dynamics of ?small-world'networks. Nature, Vol. 393, 6684 (1998), 440--442."},{"key":"e_1_3_2_2_52_1","volume-title":"Link prediction with node clustering coefficient. Physica A: Statistical Mechanics and its Applications","author":"Wu Zhihao","year":"2016","unstructured":"Zhihao Wu , Youfang Lin , Jing Wang , and Steve Gregory . 2016. Link prediction with node clustering coefficient. Physica A: Statistical Mechanics and its Applications , Vol. 452 ( 2016 ), 1--8. Zhihao Wu, Youfang Lin, Jing Wang, and Steve Gregory. 2016. Link prediction with node clustering coefficient. Physica A: Statistical Mechanics and its Applications, Vol. 452 (2016), 1--8."},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.71.046141"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-12-132"}],"event":{"name":"KDD '23: The 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Long Beach CA USA","acronym":"KDD '23","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599382","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580305.3599382","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:48Z","timestamp":1750178268000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599382"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,4]]},"references-count":54,"alternative-id":["10.1145\/3580305.3599382","10.1145\/3580305"],"URL":"https:\/\/doi.org\/10.1145\/3580305.3599382","relation":{},"subject":[],"published":{"date-parts":[[2023,8,4]]},"assertion":[{"value":"2023-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}