{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:59:52Z","timestamp":1774990792924,"version":"3.50.1"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"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":[],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541853","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"3018-3022","source":"Crossref","is-referenced-by-count":0,"title":["Cutsize distributions of balanced hypergraph bipartitions for random hypergraphs"],"prefix":"10.1109","author":[{"given":"Takayuki","family":"Nozaki","sequence":"first","affiliation":[{"name":"Yamaguchi University, JAPAN"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","author":"lengauer","year":"1990","journal-title":"Combinatorial Algorithms for Integrated Circuit Layout"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.910579"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1109\/71.780863","article-title":"Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication","volume":"10","author":"\u00e7ataly\u00fcrek","year":"1999","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"ref6","first-page":"332","article-title":"A coding theoretic approach for evaluating accumulate distribution on minimum cut capacity of weighted random graphs","author":"fujii","year":"2012","journal-title":"Proc Intern Symp on Inf Theory and Its Application"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828064"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620755"},{"key":"ref7","first-page":"327","article-title":"Probabilistic analysis of the network reliability problem on a random graph ensemble","author":"yano","year":"2012","journal-title":"Proc Intern Symp on Inf Theory and Its Application"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282788"},{"key":"ref9","article-title":"Extremal cuts of sparse random graphs","author":"dembo","year":"2015","journal-title":"arXiv preprint arXiv 1503 03998vl"},{"key":"ref1","article-title":"Low Density Parity Check Codes","author":"gallager","year":"1963","journal-title":"research monograph series"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541853.pdf?arnumber=7541853","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:51:40Z","timestamp":1774986700000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541853\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541853","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}