{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:53:02Z","timestamp":1773377582592,"version":"3.50.1"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"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":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9174508","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"1331-1336","source":"Crossref","is-referenced-by-count":0,"title":["Characterizing the Bethe Partition Function of Double-Edge Factor Graphs via Graph Covers"],"prefix":"10.1109","author":[{"given":"Yuwen","family":"Huang","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong,Department of Information Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal O.","family":"Vontobel","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong,Department of Information Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/SPCOM.2016.7746637"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2403239"},{"key":"ref11","first-page":"75","article-title":"Graph covers and iterative decoding of finite-length codes","author":"koetter","year":"2003","journal-title":"Proc 3rd Intern Symp on Turbo Codes and Related Topics"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2006.12.010"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2264715"},{"key":"ref14","first-page":"117","article-title":"The Bethe partition function of log-supermodular graphical models","author":"ruozzi","year":"2012","journal-title":"Proc Neural Information Processing Systems (NIPS)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849389"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394484"},{"key":"ref17","article-title":"Loop series and Bethe variational bounds in attractive graphical models","author":"sudderth","year":"2007","journal-title":"Proc Neural Inf Proc Sys Conf"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284284"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2716422"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1006\/aima.1996.0050"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198570837.001.0001"},{"key":"ref27","article-title":"Characterizing the Bethe partition function of double-edge factor graphs via graph covers (extended version)","author":"huang","year":"0"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2004.1267047"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511619199"},{"key":"ref29","first-page":"759","article-title":"Tensor networks and graphical calculus for open quantum systems","volume":"15","author":"wood","year":"2015","journal-title":"Quantum Info Comput"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2006\/06\/P06009"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850085"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.910573"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557245"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2961377"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8277985"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282625"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094870"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevB.41.9301"},{"key":"ref26","article-title":"Discrete geometric analysis of message passing algorithm on graphs","author":"watanabe","year":"2010","journal-title":"Ph D Dissertation"},{"key":"ref25","first-page":"359","article-title":"Stable fixed points of loopy belief propagation are local minima of the Bethe free energy","author":"heskes","year":"2003","journal-title":"Proc Neural Information Processing Systems (NIPS)"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09174508.pdf?arnumber=9174508","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:28Z","timestamp":1773347668000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174508\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174508","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}