{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T16:37:11Z","timestamp":1772642231454,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":49,"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\/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"}]},{"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"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,1,20]]},"DOI":"10.1145\/3336191.3371773","type":"proceedings-article","created":{"date-parts":[[2020,1,22]],"date-time":"2020-01-22T19:08:16Z","timestamp":1579720096000},"page":"447-455","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Efficiently Counting Vertex Orbits of All 5-vertex Subgraphs, by EVOKE"],"prefix":"10.1145","author":[{"given":"Noujan","family":"Pashanasangi","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","unstructured":"Citation network dataset. Available at https:\/\/aminer.org\/citation.  Citation network dataset. Available at https:\/\/aminer.org\/citation."},{"key":"e_1_3_2_1_2_1","unstructured":"Evoke. https:\/\/bitbucket.org\/nojan-p\/orbit-counting.  Evoke. https:\/\/bitbucket.org\/nojan-p\/orbit-counting."},{"key":"e_1_3_2_1_3_1","unstructured":"The koblenz network collection. Available at http:\/\/konect.uni-koblenz.de\/.  The koblenz network collection. Available at http:\/\/konect.uni-koblenz.de\/."},{"key":"e_1_3_2_1_4_1","unstructured":"Wikipedia (en) network dataset -- KONECT Oct. 2016.  Wikipedia (en) network dataset -- KONECT Oct. 2016."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1142\/9789813235533_0011"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.141"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401898"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.aad9029"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.056119"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Bondy J. and Murty U. Graph theory (2008). Grad. Texts in Math (2008).  Bondy J. and Murty U. Graph theory (2008). Grad. Texts in Math (2008).","DOI":"10.1007\/978-1-84628-970-5"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1086\/421787"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214017"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1086\/228943"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783413"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883082"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.026107"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2010.03.004"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10390645"},{"key":"e_1_3_2_1_19_1","first-page":"71","article-title":"Computation of graphlet orbits for nodes and edges in sparse graphs","author":"Hovc","year":"2016","journal-title":"Journ. Stat. Soft"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1086\/224954"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.0030118"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741101"},{"key":"e_1_3_2_1_23_1","unstructured":"Leskovec J. and Krevl A. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data June 2014.  Leskovec J. and Krevl A. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data June 2014."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btx758"},{"key":"e_1_3_2_1_25_1","first-page":"1","article-title":"An algorithm to automatically generate the combinatorial orbit counting equations","volume":"11","author":"Melckenbeeck I.","journal-title":"PLoS ONE"},{"key":"e_1_3_2_1_26_1","unstructured":"O'Callaghan D. Harrigan M. Carthy J. and Cunningham P. Identifying discriminating network motifs in youtube spam. arXiv preprint arXiv:1202.5216 (2012).  O'Callaghan D. Harrigan M. Carthy J. and Cunningham P. Identifying discriminating network motifs in youtube spam. arXiv preprint arXiv:1202.5216 (2012)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Ortmann M. and Brandes U. Efficient orbit-aware triad and quad census in directed and undirected graphs. Applied network science 2 1 (2017) 13.  Ortmann M. and Brandes U. Efficient orbit-aware triad and quad census in directed and undirected graphs. Applied network science 2 1 (2017) 13.","DOI":"10.1007\/s41109-017-0027-2"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Pashanasangi N. and Seshadhri C. Efficiently counting vertex orbits of all 5-vertex subgraphs by evoke. arXiv preprint arXiv:1911.10616 (2019).  Pashanasangi N. and Seshadhri C. Efficiently counting vertex orbits of all 5-vertex subgraphs by evoke. arXiv preprint arXiv:1911.10616 (2019).","DOI":"10.1145\/3336191.3371773"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052597"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.soc.24.1.1"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl301"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth436"},{"key":"e_1_3_2_1_33_1","volume-title":"AAAI","author":"Rossi R. A.","year":"2015"},{"key":"e_1_3_2_1_34_1","unstructured":"Rossi R. A. Ahmed N. K. Carranza A. Arbour D. Rao A. Kim S. and Koh E. Heterogeneous network motifs. arXiv preprint arXiv:1901.10026 (2019).  Rossi R. A. Ahmed N. K. Carranza A. Arbour D. Rao A. Kim S. and Koh E. Heterogeneous network motifs. arXiv preprint arXiv:1901.10026 (2019)."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3041021.3055139"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741640"},{"key":"e_1_3_2_1_37_1","volume-title":"Proceedings of the Web Conference (WWW)","author":"Seshadhri C.","year":"2019"},{"key":"e_1_3_2_1_38_1","first-page":"488","volume-title":"AISTATS","author":"Shervashidze N.","year":"2009"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Son S. Kang A. Kim H. Kwon T. Park J. and Kim H. Analysis of context dependence in social interaction networks of a massively multiplayer online role-playing game. PLoS ONE 7 4 (04 2012) e33918.  Son S. Kang A. Kim H. Kwon T. Park J. and Kim H. Analysis of context dependence in social interaction networks of a massively multiplayer online role-playing game. PLoS ONE 7 4 (04 2012) e33918.","DOI":"10.1371\/journal.pone.0033918"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2010.06.001"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1402008"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741098"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052653"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488502"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2816018"},{"key":"e_1_3_2_1_46_1","first-page":"4027","volume-title":"CHI-EA'10","author":"Welles B.","year":"2010"},{"key":"e_1_3_2_1_47_1","unstructured":"Wikimedia Foundation . Wikimedia downloads. http:\/\/dumps.wikimedia.org\/ January 2010.  Wikimedia Foundation . Wikimedia downloads. http:\/\/dumps.wikimedia.org\/ January 2010."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.97.052306"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3290991"}],"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.3371773","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3336191.3371773","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3336191.3371773","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:26:10Z","timestamp":1750206370000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3336191.3371773"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,20]]},"references-count":49,"alternative-id":["10.1145\/3336191.3371773","10.1145\/3336191"],"URL":"https:\/\/doi.org\/10.1145\/3336191.3371773","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"}}]}}