{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T19:31:47Z","timestamp":1773775907537,"version":"3.50.1"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1109\/tnnls.2025.3540392","type":"journal-article","created":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:49:23Z","timestamp":1743126563000},"page":"14258-14268","source":"Crossref","is-referenced-by-count":2,"title":["A Framework for Large-Scale Synthetic Graph Dataset Generation"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2187-8379","authenticated-orcid":false,"given":"Sajad","family":"Darabi","sequence":"first","affiliation":[{"name":"NVIDIA, Santa Clara, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-9680-4223","authenticated-orcid":false,"given":"Piotr","family":"Bigaj","sequence":"additional","affiliation":[{"name":"NVIDIA, Santa Clara, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-8992-9187","authenticated-orcid":false,"given":"Dawid","family":"Majchrowski","sequence":"additional","affiliation":[{"name":"NVIDIA, Santa Clara, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0677-0017","authenticated-orcid":false,"given":"Artur","family":"Kasymov","sequence":"additional","affiliation":[{"name":"NVIDIA, Santa Clara, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4734-966X","authenticated-orcid":false,"given":"Pawel","family":"Morkisz","sequence":"additional","affiliation":[{"name":"NVIDIA, Santa Clara, CA, USA"}]},{"given":"Alex","family":"Fit-Florea","sequence":"additional","affiliation":[{"name":"NVIDIA, Santa Clara, CA, USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1609.02907"},{"key":"ref3","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107","year":"2017","journal-title":"arXiv:1710.10903"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/asi.20591"},{"key":"ref5","article-title":"Representation learning on graphs: Methods and applications","author":"Hamilton","year":"2017","journal-title":"arXiv:1709.05584"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2693418"},{"key":"ref7","article-title":"OGB-LSC: A large-scale challenge for machine learning on graphs","author":"Hu","year":"2021","journal-title":"arXiv:2103.09430"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313446"},{"key":"ref10","first-page":"22118","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume-title":"Proc. Conf. Neural Inf. Process. Syst. (NeurIPS)","volume":"33","author":"Hu"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1049\/iet-syb:20070036"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.85.5234"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"issue":"1","key":"ref16","first-page":"6446","article-title":"Community detection and stochastic block models: Recent developments","volume":"18","author":"Abbe","year":"2017","journal-title":"J. Mach. Learn. Res."},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/11564126_17"},{"key":"ref18","first-page":"5708","article-title":"GraphRNN: Generating realistic graphs with deep auto-regressive models","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"You"},{"key":"ref19","first-page":"4255","article-title":"Efficient graph generation with graph recurrent attention networks","volume-title":"Proc. NeurIPS","volume":"32","author":"Liao"},{"key":"ref20","article-title":"SPECTRE: Spectral conditioning helps to overcome the expressivity limits of one-shot graph generators","author":"Martinkus","year":"2022","journal-title":"arXiv:2204.01613"},{"key":"ref21","article-title":"Variational graph auto-encoders","author":"Kipf","year":"2016","journal-title":"arXiv:1611.07308"},{"key":"ref22","first-page":"2434","article-title":"Graphite: Iterative generative modeling of graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"97","author":"Grover"},{"key":"ref23","article-title":"Deep graph generators: A survey","author":"Faez","year":"2020","journal-title":"arXiv:2012.15544"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1312.6114"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.5555\/2969033.2969125"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177728190"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177704472"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2022.3229161"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0228728"},{"key":"ref30","article-title":"Modeling tabular data using conditional GAN","volume-title":"Advances in Neural Information Processing Systems","volume":"32","author":"Xu","year":"2019"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939785"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539203"},{"key":"ref33","article-title":"Evaluation metrics for graph generative models: Problems, pitfalls, and practical solutions","author":"O\u2019Bray","year":"2021","journal-title":"arXiv:2106.01098"},{"key":"ref34","first-page":"7783","article-title":"Evaluating graph generative models with contrastively learned features","volume-title":"Advances in Neural Information Processing Systems","volume":"35","author":"Shirzad","year":"2022"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4380-9_6"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref37","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014","journal-title":"arXiv:1412.6980"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064014"},{"key":"ref39","article-title":"NetGAN: Generating graphs via random walks","author":"Bojchevski","year":"2018","journal-title":"arXiv:1803.00816"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1162\/qss_a_00021"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00055"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719918.ch9"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/5962385\/11114436\/10943225.pdf?arnumber=10943225","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T18:00:57Z","timestamp":1754503257000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10943225\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8]]},"references-count":43,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2025.3540392","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8]]}}}