{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:44:27Z","timestamp":1773377067041,"version":"3.50.1"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-2415440"],"award-info":[{"award-number":["CCF-2415440"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195214","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs"],"prefix":"10.1109","author":[{"given":"Sheida","family":"Rabeti","sequence":"first","affiliation":[{"name":"Northeastern University,Department of Electrical and Computer Engineering,Boston,MA,USA,02115"}]},{"given":"Mohsen","family":"Moradi","sequence":"additional","affiliation":[{"name":"Northeastern University,Department of Electrical and Computer Engineering,Boston,MA,USA,02115"}]},{"given":"Hessam","family":"Mahdavifar","sequence":"additional","affiliation":[{"name":"Northeastern University,Department of Electrical and Computer Engineering,Boston,MA,USA,02115"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref4","article-title":"A survey on trapping sets and stopping sets","author":"Price","year":"2017","journal-title":"arXiv preprint"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3170331"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173244"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.901193"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2523979"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100023720"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s003730200002"},{"key":"ref11","first-page":"29","article-title":"Extremal problems in graph theory","author":"Erd\u00f6s","year":"1964","journal-title":"Publ. House Cszechoslovak Acad. Sci., Prague"},{"key":"ref12","volume-title":"The maximum size of 4-and 6-cycle free bipartite graphs on m, n vertices","author":"De Caen","year":"1991"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/S0004972700019511"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICC51166.2024.10622808"},{"key":"ref15","article-title":"Constructions for cubic graphs with large girth","volume":"5","author":"Biggs","year":"1998","journal-title":"Electron. J. Comb."},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1033"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2001.965567"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.32.12.331"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.37236\/2061"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.06.002"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.28.12.561"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195214.pdf?arnumber=11195214","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:28Z","timestamp":1773347428000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195214\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195214","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}