{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T04:42:15Z","timestamp":1773895335142,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,1,20]],"date-time":"2020-01-20T00:00:00Z","timestamp":1579478400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF1910294"],"award-info":[{"award-number":["W911NF1910294"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1740850, CCF-1813165"],"award-info":[{"award-number":["CCF-1740850, CCF-1813165"]}],"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":[[2020,1,20]]},"DOI":"10.1145\/3336191.3371839","type":"proceedings-article","created":{"date-parts":[[2020,1,22]],"date-time":"2020-01-22T19:08:16Z","timestamp":1579720096000},"page":"268-276","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":39,"title":["The Power of Pivoting for Exact Clique Counting"],"prefix":"10.1145","author":[{"given":"Shweta","family":"Jain","sequence":"first","affiliation":[{"name":"University of California, Santa Cruz, Santa Cruz, CA, USA"}]},{"given":"C.","family":"Seshadhri","sequence":"additional","affiliation":[{"name":"University of California, Santa Cruz, SANTA CRUZ, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2020,1,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.141"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/0202001"},{"key":"e_1_3_2_1_3_1","volume-title":"Cycles and Other Small Subgraphs Within Large Graphs. In Symposium on the Theory of Computing (STOC). 326--335","author":"Alon Noga","year":"1994"},{"key":"e_1_3_2_1_4_1","volume-title":"Science","volume":"353","author":"Benson A.","year":"2016"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.056119"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2014670.2014681"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007391"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214017"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Maximilien Danisch Oana Denisa Balalau and Mauro Sozio. 2018. Listing k-cliques in Sparse Real-World Graphs. In World Wide Web (WWW). 589--598. https:\/\/doi.org\/10.1145\/3178876.3186125  Maximilien Danisch Oana Denisa Balalau and Mauro Sozio. 2018. Listing k-cliques in Sparse Real-World Graphs. In World Wide Web (WWW). 589--598. https:\/\/doi.org\/10.1145\/3178876.3186125","DOI":"10.1145\/3178876.3186125"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17517-6_36"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2543629"},{"key":"e_1_3_2_1_13_1","volume-title":"Clique Counting in MapReduce: Algorithms and Experiments. ACM Journal of Experimental Algorithmics","volume":"20","author":"Finocchi Irene","year":"2015"},{"key":"e_1_3_2_1_14_1","unstructured":"Robert A. Hanneman and Mark Riddle. 2005. Introduction to social network methods.University of California Riverside. http:\/\/faculty.ucr.edu\/ hanneman\/nettext\/.  Robert A. Hanneman and Mark Riddle. 2005. Introduction to social network methods.University of California Riverside. http:\/\/faculty.ucr.edu\/ hanneman\/nettext\/."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Matthew O. Jackson. 2010. Social and Economic Networks.Princeton University Press.  Matthew O. Jackson. 2010. Social and Economic Networks.Princeton University Press.","DOI":"10.2307\/j.ctvcm4gh1"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052636"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741101"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Zhenqi Lu Johan Wahlstr\u00f6m and Arye Nehorai. 2018. Community detection in complex networks via clique conductance. Scientific reports Vol. 8 1 (2018) 5982.  Zhenqi Lu Johan Wahlstr\u00f6m and Arye Nehorai. 2018. Community detection in complex networks via clique conductance. Scientific reports Vol. 8 1 (2018) 5982.","DOI":"10.1038\/s41598-018-23932-z"},{"key":"e_1_3_2_1_19_1","volume-title":"Efficient Counting of Network Motifs. In ICDCS Workshops. IEEE Computer Society, 92--98","author":"Marcus Dror","year":"2010"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322385"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052597"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl301"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Rahmtin Rotabi Krishna Kamath Jon M. Kleinberg and Aneesh Sharma. 2017. Detecting Strong Ties Using Network Motifs. In World Wide Web (WWW). 983--992. https:\/\/doi.org\/10.1145\/3041021.3055139  Rahmtin Rotabi Krishna Kamath Jon M. Kleinberg and Aneesh Sharma. 2017. Detecting Strong Ties Using Network Motifs. In World Wide Web (WWW). 983--992. https:\/\/doi.org\/10.1145\/3041021.3055139","DOI":"10.1145\/3041021.3055139"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Ahmet Erdem Sariy\u00fc ce C. Seshadhri Ali Pinar and \u00dc mit V. cC ataly\u00fc rek. 2015. Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions. In World Wide Web (WWW). ACM 927--937.  Ahmet Erdem Sariy\u00fc ce C. Seshadhri Ali Pinar and \u00dc mit V. cC ataly\u00fc rek. 2015. Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions. In World Wide Web (WWW). ACM 927--937.","DOI":"10.1145\/2736277.2741640"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1002\/sam.11224"},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of the Web Conference (WWW).","author":"Seshadhri C.","year":"2019"},{"key":"e_1_3_2_1_27_1","article-title":"Classification of weighted networks through mesoscale homological features","volume":"10","author":"Sizemore Ann","year":"2016","journal-title":"Journal of Complex Networks"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1402008"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.06.015"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741098"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Charalampos E. Tsourakakis Jakub Pachocki and Michael Mitzenmacher. 2017. Scalable Motif-aware Graph Clustering. In World Wide Web (WWW). 1451--1460. https:\/\/doi.org\/10.1145\/3038912.3052653  Charalampos E. Tsourakakis Jakub Pachocki and Michael Mitzenmacher. 2017. Scalable Motif-aware Graph Clustering. In World Wide Web (WWW). 1451--1460. https:\/\/doi.org\/10.1145\/3038912.3052653","DOI":"10.1145\/3038912.3052653"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Johan Ugander Lars Backstrom and Jon M. Kleinberg. 2013. Subgraph frequencies: mapping the empirical and extremal geography of large graph collections. In WWW. 1307--1318.  Johan Ugander Lars Backstrom and Jon M. Kleinberg. 2013. Subgraph frequencies: mapping the empirical and extremal geography of large graph collections. In WWW. 1307--1318.","DOI":"10.1145\/2488388.2488502"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.10.014"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Pinghui Wang Junzhou Zhao Xiangliang Zhang Zhenguo Li Jiefeng Cheng John C. S. Lui Don Towsley Jing Tao and Xiaohong Guan. 2018. MOSS-5: A Fast Method of Approximating Counts of 5-Node Graphlets in Large Graphs. Vol. 30 1 (2018) 73--86. https:\/\/doi.org\/10.1109\/TKDE.2017.2756836  Pinghui Wang Junzhou Zhao Xiangliang Zhang Zhenguo Li Jiefeng Cheng John C. S. Lui Don Towsley Jing Tao and Xiaohong Guan. 2018. MOSS-5: A Fast Method of Approximating Counts of 5-Node Graphlets in Large Graphs. Vol. 30 1 (2018) 73--86. https:\/\/doi.org\/10.1109\/TKDE.2017.2756836","DOI":"10.1109\/TKDE.2017.2756836"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.97.052306"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Hao Yin Austin R. Benson and Jure Leskovec. 2019. The Local Closure Coefficient: A New Perspective On Network Clustering. 303--311. https:\/\/doi.org\/10.1145\/3289600.3290991  Hao Yin Austin R. Benson and Jure Leskovec. 2019. The Local Closure Coefficient: A New Perspective On Network Clustering. 303--311. https:\/\/doi.org\/10.1145\/3289600.3290991","DOI":"10.1145\/3289600.3290991"},{"key":"e_1_3_2_1_37_1","volume-title":"Proceedings of International Parallel and Distributed Processing Symposium (IPDPS). 390--401","author":"Zhao Z."}],"event":{"name":"WSDM '20: The Thirteenth ACM International Conference on Web Search and Data Mining","location":"Houston TX USA","acronym":"WSDM '20","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 13th International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3336191.3371839","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3336191.3371839","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3336191.3371839","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:14Z","timestamp":1750202594000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3336191.3371839"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,20]]},"references-count":37,"alternative-id":["10.1145\/3336191.3371839","10.1145\/3336191"],"URL":"https:\/\/doi.org\/10.1145\/3336191.3371839","relation":{},"subject":[],"published":{"date-parts":[[2020,1,20]]},"assertion":[{"value":"2020-01-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}