{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:57Z","timestamp":1750306977706,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,8,25]],"date-time":"2013-08-25T00:00:00Z","timestamp":1377388800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,8,25]]},"DOI":"10.1145\/2492517.2500333","type":"proceedings-article","created":{"date-parts":[[2014,1,14]],"date-time":"2014-01-14T13:40:06Z","timestamp":1389706806000},"page":"1096-1099","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["What do large networks look like?"],"prefix":"10.1145","author":[{"given":"Hao","family":"Wang","sequence":"first","affiliation":[{"name":"University of Windsor, Windsor, Ontario, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianguo","family":"Lu","sequence":"additional","affiliation":[{"name":"University of Windsor, Windsor, Ontario, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,8,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/0403039"},{"key":"e_1_3_2_1_2_1","first-page":"67","volume-title":"Information Visualization, 2003. INFOVIS 2003. IEEE Symposium on","author":"Chen C.","year":"2003"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/2945.841119"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150479"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_3_2_1_7_1","unstructured":"L. Lov\u00e1sz. Random walks on graphs: A survey. Combinatorics Paul Erdos is Eighty 2(1): 1--46 1993.  L. Lov\u00e1sz. Random walks on graphs: A survey. Combinatorics Paul Erdos is Eighty 2(1): 1--46 1993."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/647550.757116"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62234"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592665.1592675"}],"event":{"name":"ASONAM '13: Advances in Social Networks Analysis and Mining 2013","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","IEEE CS"],"location":"Niagara Ontario Canada","acronym":"ASONAM '13"},"container-title":["Proceedings of the 2013 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2492517.2500333","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2492517.2500333","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:33Z","timestamp":1750235973000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2492517.2500333"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,25]]},"references-count":11,"alternative-id":["10.1145\/2492517.2500333","10.1145\/2492517"],"URL":"https:\/\/doi.org\/10.1145\/2492517.2500333","relation":{},"subject":[],"published":{"date-parts":[[2013,8,25]]},"assertion":[{"value":"2013-08-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}