{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:11:32Z","timestamp":1740100292107,"version":"3.37.3"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,10,6]],"date-time":"2021-10-06T00:00:00Z","timestamp":1633478400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,6]],"date-time":"2021-10-06T00:00:00Z","timestamp":1633478400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,6]],"date-time":"2021-10-06T00:00:00Z","timestamp":1633478400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS 2046086"],"award-info":[{"award-number":["IIS 2046086"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,10,6]]},"DOI":"10.1109\/dsaa53316.2021.9564202","type":"proceedings-article","created":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T22:54:28Z","timestamp":1634770468000},"page":"1-8","source":"Crossref","is-referenced-by-count":2,"title":["Adversarially Generating Rank-Constrained Graphs"],"prefix":"10.1109","author":[{"given":"William","family":"Shiao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelos E.","family":"Papalexakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/1099-128X(200005\/06)14:3<105::AID-CEM582>3.0.CO;2-I"},{"journal-title":"Wasserstein GAN","year":"2017","author":"arjovsky","key":"ref11"},{"journal-title":"Improved training of wasserstein gans","year":"2017","author":"gulrajani","key":"ref12"},{"journal-title":"Improving the improved training of Wasserstein GANs A consistency term and its dual effect","year":"2018","author":"wei","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref15","article-title":"Lecture 6a- overview of mini-batch gradient descent","author":"hinton","year":"2012","journal-title":"COURSERA Neural Networks for Machine Learning"},{"journal-title":"Adam A method for stochastic optimization","year":"0","author":"kingma","key":"ref16"},{"key":"ref17","article-title":"A kernel method for the two-sample-problem","author":"gretton","year":"0","journal-title":"Advances in neural information processing systems"},{"key":"ref18","article-title":"On random graphs","author":"erd?s","year":"1959","journal-title":"Publicationes Mathematicae"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706098"},{"journal-title":"GraphGAN Graph representation learning with generative adversarial nets","year":"2017","author":"wang","key":"ref28"},{"journal-title":"Labeled Graph Generative Adversarial Networks","year":"2019","author":"fan","key":"ref4"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01418-6_41"},{"journal-title":"Generative adversarial networks","year":"2014","author":"goodfellow","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371789"},{"journal-title":"Semi-supervised classification with graph convolutional networks","year":"2016","author":"kipf","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974348.80"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90014-6"},{"journal-title":"Graphrnn Generating realistic graphs with deep auto-regressive models","year":"2018","author":"you","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976236.75"},{"journal-title":"Statistical mechanics of complex networks","year":"2001","author":"albert","key":"ref1"},{"journal-title":"A Survey of Statistical Network Models","year":"2009","author":"goldenberg","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1986.10478342"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1198\/016214501753208735"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1198\/106186006X133069"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF02294547"},{"journal-title":"MolGAN An implicit generative model for small molecular graphs","year":"2018","author":"de cao","key":"ref26"},{"journal-title":"Netgan Generating graphs via random walks","year":"2018","author":"bojchevski","key":"ref25"}],"event":{"name":"2021 IEEE 8th International Conference on Data Science and Advanced Analytics (DSAA)","start":{"date-parts":[[2021,10,6]]},"location":"Porto, Portugal","end":{"date-parts":[[2021,10,9]]}},"container-title":["2021 IEEE 8th International Conference on Data Science and Advanced Analytics (DSAA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9564091\/9564109\/09564202.pdf?arnumber=9564202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:47:23Z","timestamp":1652197643000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9564202\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,6]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/dsaa53316.2021.9564202","relation":{},"subject":[],"published":{"date-parts":[[2021,10,6]]}}}