{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,13]],"date-time":"2026-08-13T06:28:00Z","timestamp":1786602480620,"version":"build-2736575974"},"reference-count":54,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1109\/icde65706.2026.00012","type":"proceedings-article","created":{"date-parts":[[2026,8,12]],"date-time":"2026-08-12T19:16:26Z","timestamp":1786562186000},"page":"58-71","source":"Crossref","is-referenced-by-count":0,"title":["Approximate Butterfly Counting in Sublinear Time"],"prefix":"10.1109","author":[{"given":"Chi","family":"Luo","sequence":"first","affiliation":[{"name":"Antai College of Economics and Management, Shanghai Jiao Tong University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiaxin","family":"Song","sequence":"additional","affiliation":[{"name":"University of Illinois","place":["Urbana-Champaign"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuhao","family":"Zhang","sequence":"additional","affiliation":[{"name":"John Hopcroft Center, Shanghai Jiao Tong University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai","family":"Wang","sequence":"additional","affiliation":[{"name":"Antai College of Economics and Management, Shanghai Jiao Tong University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhixing","family":"He","sequence":"additional","affiliation":[{"name":"John Hopcroft Center, Shanghai Jiao Tong University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kuan","family":"Yang","sequence":"additional","affiliation":[{"name":"John Hopcroft Center, Shanghai Jiao Tong University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnx001"},{"issue":"Pt 2","key":"ref2","doi-asserted-by":"crossref","first-page":"056127","DOI":"10.1103\/PhysRevE.72.056127","article-title":"Cycles and clustering in bipartite networks","volume":"725","author":"Lind","year":"2005","journal-title":"Physical review. E, Statistical, nonlinear, and soft matter physics"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2011.07.001"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1023\/b:cmot.0000032580.12184.c0"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159678"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-32049-6_14"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2021.3062987"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnx001"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.72.056127"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2011.07.001"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1023\/b:cmot.0000032580.12184.c0"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.5220\/0011854700003485"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-024-00882-9"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1155\/2009\/421425"},{"key":"ref15","first-page":"721","article-title":"Discovering large dense subgraphs in massive graphs","volume-title":"Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30 - September 2","author":"Gibson","year":"2005"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00658-5"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2021.3111349"},{"issue":"9","key":"ref18","first-page":"1359","article-title":"Maximum biclique search at billion scale","volume-title":"Proc. VLDB Endow.","volume":"13","author":"Lyu","year":"2020"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/bigdata.congress.2014.13"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220097"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.14778\/3339490.3339497"},{"issue":"12","key":"ref22","doi-asserted-by":"crossref","first-page":"2170","DOI":"10.14778\/3352063.3352133","article-title":"Choosing A cloud DBMS: architectures and tradeoffs","volume":"12","author":"Tan","year":"2019","journal-title":"Proc. VLDB Endow."},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/focs.2015.44"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188810"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/s0097539702403244"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007386"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/focs.2009.77"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.88"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3626753"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2021.3062987"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/focs.2018.00059"},{"issue":"2","key":"ref32","first-page":"162","article-title":"Approximately counting triangles in large graph streams including edge duplicates with a fixed memory usage","volume-title":"Proc. VLDB Endow.","volume":"11","author":"Wang","year":"2017"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-022-00746-0"},{"issue":"2","key":"ref34","first-page":"211","article-title":"Butterfly counting on uncertain bipartite networks","volume-title":"Proc. VLDB Endow.","volume":"15","author":"Zhou","year":"2021"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.14778\/3636218.3636223"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/tpds.2022.3221821"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-024-00856-x"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357983"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3495011"},{"key":"ref40","first-page":"7:1","article-title":"On sampling edges almost uniformly","volume-title":"1st Symposium on Simplicity in Algorithms, SOSA 2018, January 7\u201310, 2018, New Orleans, LA, USA, ser. OASIcs","volume":"61","author":"Eden"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0287-3"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977585.ch23"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/15m1054389"},{"key":"ref44","volume-title":"Approximate butterfly counting in sublinear time[technique report]","author":"Luo","year":"2025"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007443"},{"key":"ref46","first-page":"1343","article-title":"KONECT - The Koblenz Network Collection","volume-title":"Proc. Int. Conf. on World Wide Web Companion","author":"Kunegis","year":"2013"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976021.2"},{"issue":"11","key":"ref48","first-page":"2450","article-title":"Efficient load-balanced butterfly counting on GPU","volume-title":"Proc. VLDB Endow.","volume":"15","author":"Xu","year":"2022"},{"key":"ref49","article-title":"Butterfly counting in bipartite networks","author":"Sanei-Mehri","year":"2017","journal-title":"Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/11830924_34"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.10"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883045"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2568019"},{"key":"ref54","article-title":"Faster sublinear approximations of k-cliques for low arboricity graphs","volume-title":"CoRR","author":"Eden","year":"2018"}],"event":{"name":"2026 IEEE 42nd International Conference on Data Engineering (ICDE)","location":"Montreal, QC, Canada","start":{"date-parts":[[2026,5,4]]},"end":{"date-parts":[[2026,5,8]]}},"container-title":["2026 IEEE 42nd International Conference on Data Engineering (ICDE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11629178\/11629165\/11629336.pdf?arnumber=11629336","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,13]],"date-time":"2026-08-13T05:49:25Z","timestamp":1786600165000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11629336\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":54,"URL":"https:\/\/doi.org\/10.1109\/icde65706.2026.00012","relation":{},"subject":[],"published":{"date-parts":[[2026,5]]}}}