{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T13:47:35Z","timestamp":1756993655970,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":3,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:00:00Z","timestamp":1587340800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,4,20]]},"DOI":"10.1145\/3366424.3382683","type":"proceedings-article","created":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T08:10:56Z","timestamp":1588579856000},"page":"32-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Fast and Accurate Estimation of Typed Graphlets"],"prefix":"10.1145","author":[{"given":"Ryan A.","family":"Rossi","sequence":"first","affiliation":[{"name":"Adobe Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anup","family":"Rao","sequence":"additional","affiliation":[{"name":"Adobe Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tung","family":"Mai","sequence":"additional","affiliation":[{"name":"Adobe Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nesreen K.","family":"Ahmed","sequence":"additional","affiliation":[{"name":"Intel Labs"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,4,20]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Aldo\u00a0G. Carranza Ryan\u00a0A. Rossi Anup Rao and Eunyee Koh. 2018. Higher-order Spectral Clustering for Heterogeneous Graphs. In arXiv:1810.02959. 15.  Aldo\u00a0G. Carranza Ryan\u00a0A. Rossi Anup Rao and Eunyee Koh. 2018. Higher-order Spectral Clustering for Heterogeneous Graphs. In arXiv:1810.02959. 15."},{"key":"e_1_3_2_1_2_1","unstructured":"Madhav Jha C Seshadhri and Ali Pinar. 2015. Path sampling: A fast and provable method for estimating 4-vertex subgraph counts. In WWW. 495\u2013505.  Madhav Jha C Seshadhri and Ali Pinar. 2015. Path sampling: A fast and provable method for estimating 4-vertex subgraph counts. In WWW. 495\u2013505."},{"key":"e_1_3_2_1_3_1","unstructured":"Ryan\u00a0A. Rossi Nesreen\u00a0K. Ahmed Aldo Carranza David Arbour Anup Rao Sungchul Kim and Eunyee Koh. 2019. Heterogeneous Network Motifs. In arXiv:1901.10026. 18.  Ryan\u00a0A. Rossi Nesreen\u00a0K. Ahmed Aldo Carranza David Arbour Anup Rao Sungchul Kim and Eunyee Koh. 2019. Heterogeneous Network Motifs. In arXiv:1901.10026. 18."}],"event":{"name":"WWW '20: The Web Conference 2020","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Taipei Taiwan","acronym":"WWW '20"},"container-title":["Companion Proceedings of the Web Conference 2020"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3366424.3382683","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3366424.3382683","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:33:11Z","timestamp":1750199591000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3366424.3382683"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,20]]},"references-count":3,"alternative-id":["10.1145\/3366424.3382683","10.1145\/3366424"],"URL":"https:\/\/doi.org\/10.1145\/3366424.3382683","relation":{},"subject":[],"published":{"date-parts":[[2020,4,20]]},"assertion":[{"value":"2020-04-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}