{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T01:20:19Z","timestamp":1775784019205,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T00:00:00Z","timestamp":1691452800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T00:00:00Z","timestamp":1691452800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["2020R1C1C1008296"],"award-info":[{"award-number":["2020R1C1C1008296"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100010418","name":"Institute for Information and Communications Technology Promotion","doi-asserted-by":"publisher","award":["2022-0-00871"],"award-info":[{"award-number":["2022-0-00871"]}],"id":[{"id":"10.13039\/501100010418","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010418","name":"Institute for Information and Communications Technology Promotion","doi-asserted-by":"publisher","award":["2019-0-00075"],"award-info":[{"award-number":["2019-0-00075"]}],"id":[{"id":"10.13039\/501100010418","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10618-023-00955-3","type":"journal-article","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T10:02:20Z","timestamp":1691488940000},"page":"2330-2388","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Reciprocity in directed hypergraphs: measures, findings, and generators"],"prefix":"10.1007","volume":"37","author":[{"given":"Sunwoo","family":"Kim","sequence":"first","affiliation":[]},{"given":"Minyoung","family":"Choe","sequence":"additional","affiliation":[]},{"given":"Jaemin","family":"Yoo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2872-1526","authenticated-orcid":false,"given":"Kijung","family":"Shin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,8]]},"reference":[{"key":"955_CR1","doi-asserted-by":"publisher","unstructured":"Akoglu L, Vaz\u00a0de Melo PO, Faloutsos C (2012) Quantifying reciprocity in large weighted communication networks. In: Advances in knowledge discovery and data mining: 16th Pacific-Asia conference, PAKDD 2012, Kuala Lumpur, Malaysia, May 29\u2013June 1, 2012, Proceedings, Part II 16. Springer, pp 85\u201396. https:\/\/doi.org\/10.1007\/978-3-642-30220-6_8","DOI":"10.1007\/978-3-642-30220-6_8"},{"issue":"1","key":"955_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert R, Barab\u00e1si AL (2002) Statistical mechanics of complex networks. Rev Mod Phys 74(1):47. https:\/\/doi.org\/10.1103\/RevModPhys.74.47","journal-title":"Rev Mod Phys"},{"key":"955_CR3","unstructured":"Archive I (2022) Stack exchange data dump question answering dataset of stack exchange inc. https:\/\/archive.org\/details\/stackexchange"},{"issue":"48","key":"955_CR4","doi-asserted-by":"publisher","first-page":"E11,221","DOI":"10.1073\/pnas.1800683115","volume":"115","author":"AR Benson","year":"2018","unstructured":"Benson AR, Abebe R, Schaub MT et al (2018a) Simplicial closure and higher-order link prediction. Proc Natl Acad Sci 115(48):E11,221-E11,230. https:\/\/doi.org\/10.1073\/pnas.1800683115","journal-title":"Proc Natl Acad Sci"},{"key":"955_CR5","doi-asserted-by":"publisher","unstructured":"Benson AR, Kumar R, Tomkins A (2018b) Sequences of sets. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining, pp 1148\u20131157. https:\/\/doi.org\/10.1145\/3219819.3220100","DOI":"10.1145\/3219819.3220100"},{"key":"955_CR6","doi-asserted-by":"publisher","unstructured":"Bu F, Lee G, Shin K (2023) Hypercore decomposition for non-fragile hyperedges: concepts, algorithms, observations, and applications. arXiv preprint arXiv:2301.08440. https:\/\/doi.org\/10.48550\/arXiv.2301.08440","DOI":"10.48550\/arXiv.2301.08440"},{"key":"955_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-020-0252-y","volume":"5","author":"P Chodrow","year":"2020","unstructured":"Chodrow P, Mellor A (2020) Annotated hypergraphs: models and applications. Appl Netw Sci 5:1\u201325. https:\/\/doi.org\/10.1007\/s41109-020-0252-y","journal-title":"Appl Netw Sci"},{"key":"955_CR8","doi-asserted-by":"publisher","unstructured":"Choo H, Shin K (2022) On the persistence of higher-order interactions in real-world hypergraphs. In: Proceedings of the 2022 SIAM international conference on data mining (SDM). SIAM, pp 163\u2013171. https:\/\/doi.org\/10.1137\/1.9781611977172.19","DOI":"10.1137\/1.9781611977172.19"},{"key":"955_CR9","doi-asserted-by":"publisher","unstructured":"Cirkovic D, Wang T, Resnick S (2022) Preferential attachment with reciprocity: properties and estimation. arXiv preprint arXiv:2201.03769. https:\/\/doi.org\/10.48550\/arXiv.2201.03769","DOI":"10.48550\/arXiv.2201.03769"},{"key":"955_CR10","doi-asserted-by":"publisher","unstructured":"Comrie C, Kleinberg J (2021) Hypergraph ego-networks and their temporal evolution. In: 2021 IEEE international conference on data mining (ICDM). IEEE, pp 91\u2013100. https:\/\/doi.org\/10.1109\/ICDM51629.2021.00019","DOI":"10.1109\/ICDM51629.2021.00019"},{"key":"955_CR11","doi-asserted-by":"publisher","unstructured":"Do MT, Yoon Se, Hooi B et\u00a0al (2020) Structural patterns and generative models of real-world hypergraphs. In: Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining, pp 176\u2013186. https:\/\/doi.org\/10.1145\/3394486.3403060","DOI":"10.1145\/3394486.3403060"},{"key":"955_CR12","doi-asserted-by":"publisher","unstructured":"Dong Y, Sawin W, Bengio Y (2020) Hnhn: hypergraph networks with hyperedge neurons. arXiv preprint arXiv:2006.12278. https:\/\/doi.org\/10.48550\/arXiv.2006.12278","DOI":"10.48550\/arXiv.2006.12278"},{"issue":"18","key":"955_CR13","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.93.188701","volume":"93","author":"D Garlaschelli","year":"2004","unstructured":"Garlaschelli D, Loffredo MI (2004) Fitness-dependent topological properties of the world trade web. Phys Rev Lett 93(18):188,701. https:\/\/doi.org\/10.1103\/PhysRevLett.93.188701","journal-title":"Phys Rev Lett"},{"issue":"12","key":"955_CR14","doi-asserted-by":"publisher","first-page":"3017","DOI":"10.1016\/j.physa.2008.01.073","volume":"387","author":"CA Hidalgo","year":"2008","unstructured":"Hidalgo CA, Rodr\u00edguez-Sickert C (2008) The dynamics of a mobile phone network. Phys A Stat Mech Appl 387(12):3017\u20133024. https:\/\/doi.org\/10.1016\/j.physa.2008.01.073","journal-title":"Phys A Stat Mech Appl"},{"key":"955_CR15","doi-asserted-by":"publisher","unstructured":"Kim S, Choe M, Yoo J et\u00a0al (2022) Reciprocity in directed hypergraphs: measures, findings, and generators. In: The 22nd IEEE international conference on data mining, ICDM 2022. IEEE Computer Society. https:\/\/doi.org\/10.1109\/ICDM54844.2022.00122","DOI":"10.1109\/ICDM54844.2022.00122"},{"key":"955_CR16","doi-asserted-by":"publisher","unstructured":"Kook Y, Ko J, Shin K (2020) Evolution of real-world hypergraphs: patterns and models without oracles. In: 2020 IEEE international conference on data mining (ICDM). IEEE, pp 272\u2013281. https:\/\/doi.org\/10.1109\/ICDM50108.2020.00036","DOI":"10.1109\/ICDM50108.2020.00036"},{"key":"955_CR17","doi-asserted-by":"publisher","unstructured":"Lee G, Shin K (2021) Thyme+: temporal hypergraph motifs and fast algorithms for exact counting. In: 2021 IEEE international conference on data mining (ICDM). IEEE, pp 310\u2013319. https:\/\/doi.org\/10.1109\/ICDM51629.2021.00042","DOI":"10.1109\/ICDM51629.2021.00042"},{"issue":"12","key":"955_CR18","doi-asserted-by":"publisher","first-page":"2256","DOI":"10.14778\/3407790.3407823","volume":"13","author":"G Lee","year":"2020","unstructured":"Lee G, Ko J, Shin K (2020) Hypergraph motifs: concepts, algorithms, and discoveries. PVLDB 13(12):2256\u20132269. https:\/\/doi.org\/10.14778\/3407790.3407823","journal-title":"PVLDB"},{"key":"955_CR19","doi-asserted-by":"publisher","first-page":"3396","DOI":"10.1145\/3442381.3450010","volume":"2021","author":"G Lee","year":"2021","unstructured":"Lee G, Choe M, Shin K (2021) How do hyperedges overlap in real-world hypergraphs? Patterns, measures, and generators. Proc Web Conf 2021:3396\u20133407. https:\/\/doi.org\/10.1145\/3442381.3450010","journal-title":"Proc Web Conf"},{"key":"955_CR20","volume-title":"Dynamics of large networks","author":"J Leskovec","year":"2008","unstructured":"Leskovec J (2008) Dynamics of large networks. Carnegie Mellon University, Pittsburgh"},{"key":"955_CR21","unstructured":"Leskovec J, Krevl A (2014) SNAP datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data"},{"issue":"1","key":"955_CR22","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1109\/18.61115","volume":"37","author":"J Lin","year":"1991","unstructured":"Lin J (1991) Divergence measures based on the Shannon entropy. IEEE Trans Inf Theory 37(1):145\u2013151. https:\/\/doi.org\/10.1109\/18.61115","journal-title":"IEEE Trans Inf Theory"},{"issue":"1","key":"955_CR23","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1049\/itr2.12130","volume":"16","author":"X Luo","year":"2022","unstructured":"Luo X, Peng J, Liang J (2022) Directed hypergraph attention network for traffic forecasting. IET Intell Transport Syst 16(1):85\u201398. https:\/\/doi.org\/10.1049\/itr2.12130","journal-title":"IET Intell Transport Syst"},{"issue":"3","key":"955_CR24","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.66.035101","volume":"66","author":"ME Newman","year":"2002","unstructured":"Newman ME, Forrest S, Balthrop J (2002) Email networks and the spread of computer viruses. Phys Rev E 66(3):035,101. https:\/\/doi.org\/10.1103\/PhysRevE.66.035101","journal-title":"Phys Rev E"},{"key":"955_CR25","doi-asserted-by":"publisher","unstructured":"Nguyen VA, Lim EP, Tan HH et\u00a0al (2010) Do you trust to get trust? A study of trust reciprocity behaviors and reciprocal trust prediction. In: Proceedings of the 2010 SIAM international conference on data mining. SIAM, pp 72\u201383. https:\/\/doi.org\/10.1137\/1.9781611972801.7","DOI":"10.1137\/1.9781611972801.7"},{"issue":"8","key":"955_CR26","doi-asserted-by":"publisher","first-page":"752","DOI":"10.5281\/zenodo.1094247","volume":"8","author":"N Pearcy","year":"2014","unstructured":"Pearcy N, Crofts JJ, Chuzhanova N (2014) Hypergraph models of metabolism. Int J Biol Vet Agric Food Eng 8(8):752\u2013756. https:\/\/doi.org\/10.5281\/zenodo.1094247","journal-title":"Int J Biol Vet Agric Food Eng"},{"key":"955_CR27","doi-asserted-by":"publisher","unstructured":"Ranshous S, Joslyn CA, Kreyling S et\u00a0al (2017) Exchange pattern mining in the bitcoin transaction directed hypergraph. In: Financial cryptography and data security: FC 2017 international workshops, WAHC, BITCOIN, VOTING, WTSC, and TA, Sliema, Malta, April 7, 2017, Revised Selected Papers 21. Springer, pp 248\u2013263. https:\/\/doi.org\/10.1007\/978-3-319-70278-0_16","DOI":"10.1007\/978-3-319-70278-0_16"},{"issue":"8","key":"955_CR28","doi-asserted-by":"publisher","first-page":"1627","DOI":"10.1021\/ac60214a047","volume":"36","author":"A Savitzky","year":"1964","unstructured":"Savitzky A, Golay MJ (1964) Smoothing and differentiation of data by simplified least squares procedures. Anal Chem 36(8):1627\u20131639. https:\/\/doi.org\/10.1021\/ac60214a047","journal-title":"Anal Chem"},{"key":"955_CR29","doi-asserted-by":"publisher","unstructured":"Sinha A, Shen Z, Song Y et\u00a0al (2015) An overview of microsoft academic service (mas) and applications. In: Proceedings of the 24th international conference on world wide web, pp 243\u2013246. https:\/\/doi.org\/10.1145\/2740908.2742839","DOI":"10.1145\/2740908.2742839"},{"issue":"1","key":"955_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/srep02729","volume":"3","author":"T Squartini","year":"2013","unstructured":"Squartini T, Picciolo F, Ruzzenenti F et al (2013) Reciprocity of weighted networks. Sci Rep 3(1):1\u20139. https:\/\/doi.org\/10.1038\/srep02729","journal-title":"Sci Rep"},{"key":"955_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/s10687-022-00439-5","author":"T Wang","year":"2022","unstructured":"Wang T, Resnick SI (2022) Asymptotic dependence of in-and out-degrees in a preferential attachment model with reciprocity. Extremes. https:\/\/doi.org\/10.1007\/s10687-022-00439-5","journal-title":"Extremes"},{"key":"955_CR32","unstructured":"Wikipedia (2022) Computer science conference Wikipedia. https:\/\/en.wikipedia.org\/wiki\/List_of_computer_science_conferences"},{"issue":"4","key":"955_CR33","doi-asserted-by":"publisher","first-page":"2237","DOI":"10.1109\/TSMC.2021.3049278","volume":"52","author":"J Wu","year":"2021","unstructured":"Wu J, Liu J, Chen W et al (2021) Detecting mixing services via mining bitcoin transaction network with hybrid motifs. IEEE Trans Syst Man Cybern Syst 52(4):2237\u20132249. https:\/\/doi.org\/10.1109\/TSMC.2021.3049278","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"955_CR34","doi-asserted-by":"publisher","unstructured":"Yadati N, Nitin V, Nimishakavi M et\u00a0al (2020) Nhp: neural hypergraph link prediction. In: Proceedings of the 29th ACM international conference on information & knowledge management, pp 1705\u20131714. https:\/\/doi.org\/10.1145\/3340531.3411870","DOI":"10.1145\/3340531.3411870"},{"key":"955_CR35","doi-asserted-by":"publisher","unstructured":"Yadati N, Gao T, Asoodeh S et\u00a0al (2021) Graph neural networks for soft semi-supervised learning on hypergraphs. In: Advances in knowledge discovery and data mining: 25th Pacific-Asia conference, PAKDD 2021, Virtual Event, May 11\u201314, 2021, Proceedings, Part I. Springer, pp 447\u2013458. https:\/\/doi.org\/10.1007\/978-3-030-75762-5_36","DOI":"10.1007\/978-3-030-75762-5_36"},{"key":"955_CR36","doi-asserted-by":"publisher","first-page":"2627","DOI":"10.1145\/3366423.3380016","volume":"2020","author":"S Yoon","year":"2020","unstructured":"Yoon S, Song H, Shin K et al (2020) How much and when do we need higher-order information in hypergraphs? A case study on hyperedge prediction. Proc Web Conf 2020:2627\u20132633. https:\/\/doi.org\/10.1145\/3366423.3380016","journal-title":"Proc Web Conf"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-023-00955-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-023-00955-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-023-00955-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,13]],"date-time":"2023-10-13T09:23:23Z","timestamp":1697189003000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-023-00955-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,8]]},"references-count":36,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["955"],"URL":"https:\/\/doi.org\/10.1007\/s10618-023-00955-3","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,8]]},"assertion":[{"value":"20 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 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":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}