{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:21:58Z","timestamp":1750220518422,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,4,19]],"date-time":"2021-04-19T00:00:00Z","timestamp":1618790400000},"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":[[2021,4,19]]},"DOI":"10.1145\/3442442.3458604","type":"proceedings-article","created":{"date-parts":[[2021,6,3]],"date-time":"2021-06-03T15:56:42Z","timestamp":1622735802000},"page":"680-684","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["FastSNG: The Fastest Social Network Dataset Generator"],"prefix":"10.1145","author":[{"given":"Binbin","family":"Wang","sequence":"first","affiliation":[{"name":"Tsinghua University, China"}]},{"given":"Chaokun","family":"Wang","sequence":"additional","affiliation":[{"name":"Tsinghua University, China"}]},{"given":"Hao","family":"Feng","sequence":"additional","affiliation":[{"name":"Tsinghua University, China"}]}],"member":"320","published-online":{"date-parts":[[2021,6,3]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"856","article-title":"gMark: Schema-driven generation of graphs and queries","volume":"29","author":"Bagan Guillaume","year":"2017","unstructured":"Guillaume Bagan , Angela Bonifati , Radu Ciucanu , George\u00a0 HL Fletcher , Aur\u00e9lien Lemay , and Nicky Advokaat . 2017 . gMark: Schema-driven generation of graphs and queries . IEEE TKDE 29 , 4(2017), 856 \u2013 869 . Guillaume Bagan, Angela Bonifati, Radu Ciucanu, George\u00a0HL Fletcher, Aur\u00e9lien Lemay, and Nicky Advokaat. 2017. gMark: Schema-driven generation of graphs and queries. IEEE TKDE 29, 4(2017), 856\u2013869.","journal-title":"IEEE TKDE"},{"volume-title":"R-MAT: A recursive model for graph mining","author":"Chakrabarti Deepayan","key":"e_1_3_2_1_2_1","unstructured":"Deepayan Chakrabarti , Yiping Zhan , and Christos Faloutsos . 2004. R-MAT: A recursive model for graph mining . In SDM. SIAM , 442\u2013446. Deepayan Chakrabarti, Yiping Zhan, and Christos Faloutsos. 2004. R-MAT: A recursive model for graph mining. In SDM. SIAM, 442\u2013446."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159287"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.016118"},{"key":"e_1_3_2_1_5_1","first-page":"985","article-title":"Kronecker graphs: An approach to modeling networks","author":"Leskovec Jure","year":"2010","unstructured":"Jure Leskovec , Deepayan Chakrabarti , Jon Kleinberg , Christos Faloutsos , and Zoubin Ghahramani . 2010 . Kronecker graphs: An approach to modeling networks . Journal of Machine Learning Research 11 , Feb (2010), 985 \u2013 1042 . Jure Leskovec, Deepayan Chakrabarti, Jon Kleinberg, Christos Faloutsos, and Zoubin Ghahramani. 2010. Kronecker graphs: An approach to modeling networks. Journal of Machine Learning Research 11, Feb (2010), 985\u20131042.","journal-title":"Journal of Machine Learning Research 11"},{"key":"e_1_3_2_1_6_1","volume-title":"General Generator for Attributed Graphs with Community Structure. ECML\/PKDD GEM workshop (9","author":"Maekawa Seiji","year":"2019","unstructured":"Seiji Maekawa , Jianpeng Zhang , George H.\u00a0L. Fletcher , and Makoto Onizuka . 2019 . General Generator for Attributed Graphs with Community Structure. ECML\/PKDD GEM workshop (9 2019). Seiji Maekawa, Jianpeng Zhang, George H.\u00a0L. Fletcher, and Makoto Onizuka. 2019. General Generator for Attributed Graphs with Community Structure. ECML\/PKDD GEM workshop (9 2019)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Himchan Park and Min-Soo Kim. 2017. TrillionG: A trillion-scale synthetic graph generator using a recursive vector model. In SIGMOD. ACM 913\u2013928.  Himchan Park and Min-Soo Kim. 2017. TrillionG: A trillion-scale synthetic graph generator using a recursive vector model. In SIGMOD. ACM 913\u2013928.","DOI":"10.1145\/3035918.3064014"},{"volume-title":"FastSGG: Efficient Social Graph Generation Using a Degree Distribution Generation Model","author":"Wang Chaokun","key":"e_1_3_2_1_8_1","unstructured":"Chaokun Wang , Binbin Wang , Bingyang Huang , Shaoxu Song , and Zai Li. 2021. FastSGG: Efficient Social Graph Generation Using a Degree Distribution Generation Model . In ICDE. IEEE. Chaokun Wang, Binbin Wang, Bingyang Huang, Shaoxu Song, and Zai Li. 2021. FastSGG: Efficient Social Graph Generation Using a Degree Distribution Generation Model. In ICDE. IEEE."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.3390\/s19020260"},{"key":"e_1_3_2_1_10_1","first-page":"2277","article-title":"Deepdirect: Learning directions of social ties with edge-based network embedding","volume":"31","author":"Wang Chaokun","year":"2019","unstructured":"Chaokun Wang , Changping Wang , Zheng Wang , Xiaojun Ye , Jeffrey\u00a0Xu Yu , and Bin Wang . 2019 . Deepdirect: Learning directions of social ties with edge-based network embedding . IEEE TKDE 31 , 12(2019), 2277 \u2013 2291 . Chaokun Wang, Changping Wang, Zheng Wang, Xiaojun Ye, Jeffrey\u00a0Xu Yu, and Bin Wang. 2019. Deepdirect: Learning directions of social ties with edge-based network embedding. IEEE TKDE 31, 12(2019), 2277\u20132291.","journal-title":"IEEE TKDE"}],"event":{"name":"WWW '21: The Web Conference 2021","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Ljubljana Slovenia","acronym":"WWW '21"},"container-title":["Companion Proceedings of the Web Conference 2021"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3442442.3458604","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3442442.3458604","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:36Z","timestamp":1750195476000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3442442.3458604"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,19]]},"references-count":10,"alternative-id":["10.1145\/3442442.3458604","10.1145\/3442442"],"URL":"https:\/\/doi.org\/10.1145\/3442442.3458604","relation":{},"subject":[],"published":{"date-parts":[[2021,4,19]]},"assertion":[{"value":"2021-06-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}