{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T00:16:24Z","timestamp":1782519384156,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,19]],"date-time":"2018-07-19T00:00:00Z","timestamp":1531958400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1527541 1725702"],"award-info":[{"award-number":["1527541 1725702"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,19]]},"DOI":"10.1145\/3219819.3220097","type":"proceedings-article","created":{"date-parts":[[2018,7,19]],"date-time":"2018-07-19T13:05:12Z","timestamp":1532005512000},"page":"2150-2159","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":93,"title":["Butterfly Counting in Bipartite Networks"],"prefix":"10.1145","author":[{"given":"Seyed-Vahid","family":"Sanei-Mehri","sequence":"first","affiliation":[{"name":"Iowa State University, Ames, IA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ahmet Erdem","family":"Sariyuce","sequence":"additional","affiliation":[{"name":"University at Buffalo, Buffalo, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Srikanta","family":"Tirthapura","sequence":"additional","affiliation":[{"name":"Iowa State University, Ames, IA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,7,19]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2017. GNIP. (https:\/\/gnip.com\/about\/ ).  2017. GNIP. (https:\/\/gnip.com\/about\/ )."},{"key":"e_1_3_2_1_2_1","unstructured":"2017. The Graph API for the Facebook Social Graph. (https:\/\/developers.facebook.com\/docs\/graph-api).  2017. The Graph API for the Facebook Social Graph. (https:\/\/developers.facebook.com\/docs\/graph-api)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0965-5"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnx001"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523189"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(96)00301-2"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018732"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939771"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.860472"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/0207033"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052636"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741101"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2007.04.006"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783285"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.72.056127"},{"key":"e_1_3_2_1_16_1","volume-title":"Network Motifs: Simple Building Blocks of Complex Networks. Science 298, 5594","author":"Milo R.","year":"2002","unstructured":"R. Milo , S. Shen-Orr , S. Itzkovitz , N. Kashtan , D. Chklovskii , and U. Alon . 2002 . Network Motifs: Simple Building Blocks of Complex Networks. Science 298, 5594 (2002), 824--827. R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon. 2002. Network Motifs: Simple Building Blocks of Complex Networks. Science 298, 5594 (2002), 824--827."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.016132"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.016131"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2011.07.001"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.12.007"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556569"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052597"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:CMOT.0000032580.12184.c0"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"S.-V. Sanei-Mehri A. Erdem Sariyuce and S. Tirthapura. 2018. Butterfly Counting in Bipartite Networks. https:\/\/github.com\/beginner1010\/butterfly-counting.  S.-V. Sanei-Mehri A. Erdem Sariyuce and S. Tirthapura. 2018. Butterfly Counting in Bipartite Networks. https:\/\/github.com\/beginner1010\/butterfly-counting.","DOI":"10.1145\/3219819.3220097"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"S.-V. Sanei-Mehri A. Erdem Sariyuce and S. Tirthapura. 2018. Butterfly Counting in Bipartite Networks. ArXiv e-prints (Dec. 2018). arXiv:1801.00338  S.-V. Sanei-Mehri A. Erdem Sariyuce and S. Tirthapura. 2018. Butterfly Counting in Bipartite Networks. ArXiv e-prints (Dec. 2018). arXiv:1801.00338","DOI":"10.1145\/3219819.3220097"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159678"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1002\/sam.11224"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505741"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557111"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"D. Turkoglu and A. Turk. 2017. Edge-BasedWedge Sampling to Estimate Triangle Counts in Very Large Graphs. In 2017 IEEE ICDM. 455--464.  D. Turkoglu and A. Turk. 2017. Edge-BasedWedge Sampling to Estimate Triangle Counts in Very Large Graphs. In 2017 IEEE ICDM. 455--464.","DOI":"10.1109\/ICDM.2017.55"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.Congress.2014.13"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2556663"}],"event":{"name":"KDD '18: The 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"London United Kingdom","acronym":"KDD '18","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 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3219819.3220097","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3219819.3220097","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3219819.3220097","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:30Z","timestamp":1750212450000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3219819.3220097"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,19]]},"references-count":32,"alternative-id":["10.1145\/3219819.3220097","10.1145\/3219819"],"URL":"https:\/\/doi.org\/10.1145\/3219819.3220097","relation":{},"subject":[],"published":{"date-parts":[[2018,7,19]]},"assertion":[{"value":"2018-07-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}