{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T05:35:43Z","timestamp":1768109743689,"version":"3.49.0"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2022YFB2702100"],"award-info":[{"award-number":["2022YFB2702100"]}]},{"name":"National Key Research and Development Program of China","award":["2020YFB1707900"],"award-info":[{"award-number":["2020YFB1707900"]}]},{"name":"National Key Research and Development Program of China","award":["2021YFB2700700"],"award-info":[{"award-number":["2021YFB2700700"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62072035"],"award-info":[{"award-number":["62072035"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Open Research Projects of Zhejiang Lab","award":["2020KE0AB04"],"award-info":[{"award-number":["2020KE0AB04"]}]},{"name":"CCF-Huawei Database System Innovation Research Plan","award":["CCF-HuaweiDBIR2021007B"],"award-info":[{"award-number":["CCF-HuaweiDBIR2021007B"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61932004"],"award-info":[{"award-number":["61932004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62225203"],"award-info":[{"award-number":["62225203"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U21A20516"],"award-info":[{"award-number":["U21A20516"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61732003"],"award-info":[{"award-number":["61732003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U2001211"],"award-info":[{"award-number":["U2001211"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2023,11,1]]},"DOI":"10.1109\/tkde.2023.3236335","type":"journal-article","created":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T21:27:15Z","timestamp":1673558835000},"page":"11328-11341","source":"Crossref","is-referenced-by-count":4,"title":["Efficiently Counting Triangles for Hypergraph Streams by Reservoir-Based Sampling"],"prefix":"10.1109","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8810-4995","authenticated-orcid":false,"given":"Lingling","family":"Zhang","sequence":"first","affiliation":[{"name":"Beijing Institute of Technology, Haidian, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3482-6831","authenticated-orcid":false,"given":"Zhiwei","family":"Zhang","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, Haidian, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0181-8379","authenticated-orcid":false,"given":"Guoren","family":"Wang","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, Haidian, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0247-9866","authenticated-orcid":false,"given":"Ye","family":"Yuan","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, Haidian, China"}]},{"given":"Kangfei","family":"Zhao","sequence":"additional","affiliation":[{"name":"Tencent AI Lab, Machine Learning Center, Bellevue, WA, USA"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-020-00694-z"},{"key":"ref35","author":"till\u00e9","year":"2006","journal-title":"Sampling Algorithms"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2824253"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512157"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2787507"},{"key":"ref37","first-page":"825","article-title":"TRIÈST: Counting local and global triangles in fully-dynamic streams with fixed memory size","volume":"11","author":"de stefani","year":"2016","journal-title":"ACM Trans Knowl Discov Data"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2018.2858815"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505741"},{"key":"ref31","first-page":"32:1","article-title":"Counting simplices in hypergraph streams","author":"chakrabarti","year":"2022","journal-title":"Proc 30th Annu Eur Symp Algorithms"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3059194"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311909"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1800683115"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610495"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380152"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380152"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM50108.2020.00036"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824077"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/2700395"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2627692.2627694"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783285"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-007-0065-y"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403057"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31235-9_13"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3375395.3387665"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1002\/sam.11224"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/11533719_72"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556569"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407823"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-00080-0_1"},{"key":"ref22","first-page":"623","article-title":"Reductions in streaming algorithms, with an application to counting triangles in graphs","author":"bar-yossef","year":"2002","journal-title":"Proc 13th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137651"},{"key":"ref43","doi-asserted-by":"crossref","first-page":"11221e","DOI":"10.1073\/pnas.1800683115","article-title":"Simplicial closure and higher-order link prediction","volume":"115","author":"benson","year":"2018","journal-title":"Proc Nat Acad Sci"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380016"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2601438"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623757"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403060"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00170"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2005.12.002"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnaa028"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2004.1303205"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/13090729X"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113280"},{"key":"ref40","first-page":"1601","article-title":"Learning with hypergraphs: Clustering, classification, and embedding","author":"zhou","year":"2006","journal-title":"Proc Adv Neural Inf Process Syst"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/10273671\/10015766.pdf?arnumber=10015766","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T19:31:33Z","timestamp":1698694293000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10015766\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,1]]},"references-count":43,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2023.3236335","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,1]]}}}