{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T06:12:43Z","timestamp":1763705563858,"version":"3.37.3"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1526736"],"award-info":[{"award-number":["1526736"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Networked Systems Fellowship at UCI"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1109\/tnet.2019.2895853","type":"journal-article","created":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T21:06:27Z","timestamp":1553634387000},"page":"591-606","source":"Crossref","is-referenced-by-count":7,"title":["2K+ Graph Construction Framework: Targeting Joint Degree Matrix and Beyond"],"prefix":"10.1109","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6492-7145","authenticated-orcid":false,"given":"Balint","family":"Tillman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Athina","family":"Markopoulou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minas","family":"Gjoka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carter T.","family":"Buttsc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"D2K simple implementation","year":"2019","author":"tillman","key":"ref39"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"ref33","first-page":"11","article-title":"Exploring network structure, dynamics, and function using NetworkX","author":"hagberg","year":"2008","journal-title":"Proc 7th Python Sci Conf (SciPy)"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2567993"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v024.i03"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/11533719_45"},{"journal-title":"SNAP Datasets Stanford large network dataset collection","year":"2014","author":"leskovec","key":"ref37"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1592665.1592675"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.1470768"},{"journal-title":"2K Simple Implementation in Network","year":"2016","author":"gjoka","key":"ref34"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218534"},{"journal-title":"NetworkX Software for complex networks","year":"0","key":"ref40"},{"article-title":"The computational hardness of dk-series","year":"0","author":"devanny","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1957.7.1073"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1960.10.831"},{"journal-title":"Networks with desired correlations","year":"2003","author":"dorogovtsev","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335326"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2010.557277"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0010012"},{"journal-title":"Graphic realizations of joint-degree matrices","year":"2015","author":"amanatidis","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2133803.2330086"},{"article-title":"On the number of connected components of joint degree matrix realizations","year":"0","author":"tillman","key":"ref28"},{"journal-title":"Constrained Switchings in Graphs","year":"1980","author":"taylor","key":"ref4"},{"key":"ref27","first-page":"1","article-title":"Efficient construction of 2k+ graphs","author":"gjoka","year":"2014","journal-title":"Proc NetSciCom"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/0110037"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms9627"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098119"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1151659.1159930"},{"journal-title":"Graphic realizations of joint-degree matrices","year":"2008","author":"amanatidis","key":"ref8"},{"journal-title":"Graph realizations constrained by skeleton graphs","year":"2015","author":"erd?s","key":"ref7"},{"key":"ref2","first-page":"477","article-title":"Poznámka o existenci kone?ných graf?","volume":"80","author":"havel","year":"1955","journal-title":"? Casopis Pro P?stování Mate"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.dam.2014.10.012","article-title":"On realizations of a joint degree matrix","volume":"181","author":"dutle","year":"2015","journal-title":"Discrete Appl Math"},{"key":"ref1","first-page":"264","article-title":"Grafók el?írt fokú pontokkal","volume":"11","author":"erd?s","year":"1960","journal-title":"Mat Lapok"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/17\/8\/083052"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/130929874"},{"journal-title":"New classes of degree sequences with fast mixing swap Markov chain sampling","year":"0","author":"erd?s","key":"ref21"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.65.026107"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1596519.1596522"},{"journal-title":"Simple Graph","year":"2019","key":"ref41"},{"key":"ref23","first-page":"1968","article-title":"2.5 K-graphs: From sampling to generation","author":"gjoka","year":"2013","journal-title":"Proc IEEE InfoCom"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9531.2006.00176.x"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/14\/2\/023012"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548313000096"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.2307\/270703"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/90\/8692734\/8674808-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/8692734\/08674808.pdf?arnumber=8674808","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:44:25Z","timestamp":1657745065000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8674808\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":44,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2019.2895853","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"type":"print","value":"1063-6692"},{"type":"electronic","value":"1558-2566"}],"subject":[],"published":{"date-parts":[[2019,4]]}}}