{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T17:31:45Z","timestamp":1780075905938,"version":"3.54.0"},"reference-count":84,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2013,3,1]],"date-time":"2013-03-01T00:00:00Z","timestamp":1362096000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1109\/tit.2012.2227109","type":"journal-article","created":{"date-parts":[[2012,11,21]],"date-time":"2012-11-21T20:10:08Z","timestamp":1353528608000},"page":"1866-1901","source":"Crossref","is-referenced-by-count":59,"title":["The Bethe Permanent of a Nonnegative Matrix"],"prefix":"10.1109","volume":"59","author":[{"given":"Pascal O.","family":"Vontobel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref73","first-page":"438","volume":"15","author":"wiegerinck","year":"2003","journal-title":"Advances in neural information processing systems"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1007\/BF02170999"},{"key":"ref71","author":"marshall","year":"1979","journal-title":"Inequalities Theory of Majorization and Its Applications"},{"key":"ref70","article-title":"Ordering memoryless source alphabets using competitive lists","author":"sayir","year":"1996","journal-title":"1st INTAS Int Semin Coding Theory Combin"},{"key":"ref76","article-title":"MAP estimation, linear programming and belief propagation with convex free energies","author":"weiss","year":"2007","journal-title":"Conf Uncertainty Artif Intell"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2079014"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850091"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/18.910573"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1162\/0899766041941943"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"ref78","article-title":"Convergent and correct message passing schemes for optimization problems over graphical models","author":"ruozzi","year":"2010","journal-title":"JMLR"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205910"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548311000435"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2009.12.001"},{"key":"ref31","author":"wiberg","year":"1996","journal-title":"Codes and decoding on general graphs"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2110170"},{"key":"ref37","author":"horn","year":"1990","journal-title":"Matrix Analysis"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548309990654"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"21","DOI":"10.7551\/mitpress\/1100.003.0007","author":"yedidia","year":"2001","journal-title":"Advanced Mean Field Methods Theory and Practice"},{"key":"ref60","first-page":"75","article-title":"Graph covers and iterative decoding of finite-length codes","author":"koetter","year":"2003","journal-title":"Proc 3rd Int Symp Turbo Codes Related Topics"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1997.1798"},{"key":"ref61","article-title":"Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes","author":"vontobel","year":"2005","journal-title":"CoRR"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.37236\/790"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.915695"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.4169\/000298910x523380"},{"key":"ref27","article-title":"Loopy belief propagation for bipartite maximum weight b-matching","author":"huang","year":"2007","journal-title":"11th Int Conf Artif Intell Statist"},{"key":"ref65","article-title":"Partition functions of normal factor graphs","author":"forney jr","year":"2011","journal-title":"Inf Theory Appl Workshop"},{"key":"ref66","article-title":"The Bethe partition function of log-supermodular graphical models","author":"ruozzi","year":"2012","journal-title":"Neural Inf Proc Syst Conf"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/090753115"},{"key":"ref67","article-title":"Pattern maximum-likelihood","author":"viswanathan","year":"2009","journal-title":"Workshop Permanents Model Prob Distrib"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283654"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1145\/359997.360000"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.5948\/UPO9781614440147"},{"key":"ref1","author":"minc","year":"1978","journal-title":"Permanents"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0910994107"},{"key":"ref22","article-title":"Computing the permanent with belief propagation","author":"yedidia","year":"2011"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2006\/06\/P06009"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250809"},{"key":"ref23","article-title":"A rigorous proof of the cavity method for counting matchings","author":"bayati","year":"2006","journal-title":"44th Allerton Conf Commun Control Comput"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISSNIP.2010.5706750"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2010.05.002"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/18.910585"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1162\/089976601750541769"},{"key":"ref59","author":"biggs","year":"1989","journal-title":"Discrete Mathematics"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1006\/aima.1996.0050"},{"key":"ref57","author":"massey","year":"1977","journal-title":"Algebraic Topology An Introduction"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2011.5743617"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394484"},{"key":"ref54","first-page":"2031","article-title":"Walk-sums and belief propagation in Gaussian graphical models","volume":"7","author":"malioutov","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909166"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/18.910586"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s004930070007"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2004.1267047"},{"key":"ref11","article-title":"Belief propagation and beyond for particle rracking","author":"chertkov","year":"2008","journal-title":"CoRR"},{"key":"ref12","article-title":"Approximating the permanent with belief propagation","author":"huang","year":"2009","journal-title":"CoRR"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850085"},{"key":"ref14","article-title":"Unharnessing the power of Schrijver's permanental inequality","author":"gurvits","year":"2011","journal-title":"CoRR"},{"key":"ref15","article-title":"Unleashing the power of Schrijver's permanental inequality with the help of the Bethe approximation","author":"gurvits","year":"2011","journal-title":"Proc Electron Colloq Comput Complexity"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920243"},{"key":"ref16","article-title":"Counting in graph covers: A combinatorial characterization of the Bethe entropy function","author":"vontobel","year":"2012"},{"key":"ref81","article-title":"Permanents, transportation polytopes and positive definite kernels on histograms","author":"cuturi","year":"2007","journal-title":"Int Joint Conf Artif Intell"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4347.001.0001"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1109\/18.490550"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056939"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/43\/24\/242002"},{"key":"ref80","article-title":"Pseudocodewords from Bethe permanents","author":"smarandache","year":"2011"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12136"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90044-6"},{"key":"ref6","article-title":"Fast approximation of the permanent for very dense problems","author":"huber","year":"2008","journal-title":"5th ACM-SIAM Symp Discrete Algorithms"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008738"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(1999010)14:1<29::AID-RSA2>3.0.CO;2-X"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198570837.001.0001"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/0222021"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s004539900056"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094830"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536418"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2007.896495"},{"key":"ref47","author":"bertsekas","year":"1999","journal-title":"Nonlinear Programming"},{"key":"ref42","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref41","article-title":"Extropy: A complementary dual of entropy","author":"lad","year":"2011","journal-title":"CoRR"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2010.5454077"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513594"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6461106\/06352911.pdf?arnumber=6352911","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T16:18:53Z","timestamp":1714580333000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6352911\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3]]},"references-count":84,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2012.2227109","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3]]}}}