{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T05:06:44Z","timestamp":1768108004844,"version":"3.49.0"},"publisher-location":"Republic and Canton of Geneva, Switzerland","reference-count":43,"publisher":"International World Wide Web Conferences Steering Committee","license":[{"start":{"date-parts":[[2015,5,18]],"date-time":"2015-05-18T00:00:00Z","timestamp":1431907200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"GRAPHS Program at DARPA"},{"name":"Applied Mathematics Program at the U.S. Department of Energy"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,5,18]]},"DOI":"10.1145\/2736277.2741101","type":"proceedings-article","created":{"date-parts":[[2016,2,5]],"date-time":"2016-02-05T20:37:12Z","timestamp":1454704632000},"page":"495-505","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":93,"title":["Path Sampling"],"prefix":"10.1145","author":[{"given":"Madhav","family":"Jha","sequence":"first","affiliation":[{"name":"Zenefits, San Francisco, CA, USA"}]},{"given":"C.","family":"Seshadhri","sequence":"additional","affiliation":[{"name":"University of California, Santa Cruz, Santa Cruz, CA, USA"}]},{"given":"Ali","family":"Pinar","sequence":"additional","affiliation":[{"name":"Sandia National Laboratories, Livermore, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2015,5,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195179"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401898"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2554797.2554819"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2011.19"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.87"},{"key":"e_1_3_2_1_6_1","unstructured":"M. A. Bhuiyan and M. A. Hasan. Mirage: An iterative mapreduce based frequent subgraph mining algorithm. Technical report arXiv 2013. http:\/\/arxiv.org\/pdf\/1307.5894.pdf.  M. A. Bhuiyan and M. A. Hasan. Mirage: An iterative mapreduce based frequent subgraph mining algorithm. Technical report arXiv 2013. http:\/\/arxiv.org\/pdf\/1307.5894.pdf."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1086\/421787"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"H. Chernoff. A measure of asymptotic efficiency for test of a hypothesis based on the sum of observations. Annals of mathematical statistics 23:493--507 1952.  H. Chernoff. A measure of asymptotic efficiency for test of a hypothesis based on the sum of observations. Annals of mathematical statistics 23:493--507 1952.","DOI":"10.1214\/aoms\/1177729330"},{"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":"publisher","DOI":"10.1086\/228943"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1568639"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398503"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.026107"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2010.03.004"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10390645"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.3934\/nhm.2008.3.239"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1086\/224954"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.0030118"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"S. Itzkovitz R. Levitt N. Kashtan R. Milo M. Itzkovitz and U. Alon. Coarse-graining and self-dissimilarity of complex networks. 71(016127) January 2005.  S. Itzkovitz R. Levitt N. Kashtan R. Milo M. Itzkovitz and U. Alon. Coarse-graining and self-dissimilarity of complex networks. 71(016127) January 2005.","DOI":"10.1103\/PhysRevE.71.016127"},{"key":"e_1_3_2_1_21_1","volume-title":"SIAM Journal of Scientific Computing","author":"Kolda T. G.","year":"2013"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCSW.2010.41"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.298.5594.824"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2012.10.005"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.soc.24.1.1"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth436"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.2297929"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00108"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/11427186_54"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.85.056109"},{"key":"e_1_3_2_1_31_1","volume-title":"Proceedings of the SIAM Conference on Data Mining","author":"Seshadhri C.","year":"2013"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0033918"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2010.06.001"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2009.32"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00245"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557111"},{"key":"e_1_3_2_1_37_1","first-page":"1307","volume-title":"WWW","author":"Ugander J.","year":"2013"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/355744.355749"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1753846.1754097"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1093\/bib\/bbr033"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2012.44"},{"key":"e_1_3_2_1_43_1","unstructured":"Stanford Network Analysis Project (SNAP). Available at http:\/\/snap.stanford.edu\/.  Stanford Network Analysis Project (SNAP). Available at http:\/\/snap.stanford.edu\/."}],"event":{"name":"WWW '15: 24th International World Wide Web Conference","location":"Florence Italy","acronym":"WWW '15","sponsor":["IW3C2 International World Wide Web Conference Committee","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the 24th International Conference on World Wide Web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2736277.2741101","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2736277.2741101","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:37Z","timestamp":1750227397000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2736277.2741101"}},"subtitle":["A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts"],"short-title":[],"issued":{"date-parts":[[2015,5,18]]},"references-count":43,"alternative-id":["10.1145\/2736277.2741101","10.5555\/2736277"],"URL":"https:\/\/doi.org\/10.1145\/2736277.2741101","relation":{},"subject":[],"published":{"date-parts":[[2015,5,18]]},"assertion":[{"value":"2015-05-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}