{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:51:14Z","timestamp":1730274674966,"version":"3.28.0"},"reference-count":33,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1109\/isit.2012.6284033","type":"proceedings-article","created":{"date-parts":[[2012,8,30]],"date-time":"2012-08-30T16:57:57Z","timestamp":1346345877000},"page":"279-283","source":"Crossref","is-referenced-by-count":4,"title":["Approximately counting the number of constrained arrays via the sum-product algorithm"],"prefix":"10.1109","author":[{"given":"Farzad","family":"Parvaresh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal O.","family":"Vontobel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","article-title":"Approximating the permanent with belief propagation","author":"huang","year":"2009","journal-title":"CoRR"},{"key":"17","article-title":"A rigorous proof of the cavity method for counting matchings","author":"bayati","year":"0","journal-title":"Proc 44th Allerton Conf on Communications Control and Computing Allerton House Monticello IL USA Sep 27-29 2006"},{"key":"18","article-title":"Belief propagation and beyond for particle tracking","author":"chertkov","year":"2008","journal-title":"CoRR"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548302005229"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1137\/090767145"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1162\/089976601750541769"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2004.1267047"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2010\/11\/P11007"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850085"},{"key":"21","article-title":"The Bethe permanent of a non-negative matrix","author":"vontobel","year":"2012","journal-title":"IEEE Trans Inf Theory"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0910994107"},{"key":"22","article-title":"Loop series and Bethe variational bounds in attractive graphical models","author":"sudderth","year":"0","journal-title":"Proc Neural Information Processing Systems Conference Vancouver Canada Dec 3-8 2007"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2006\/06\/P06009"},{"key":"24","article-title":"The Bethe partition function of log-supermodular graphical models","volume":"2012","author":"ruozzi","year":"0","journal-title":"CoRR"},{"key":"25","article-title":"Counting in graph covers: A combinatorial characterization of the Bethe entropy function","author":"vontobel","year":"2010","journal-title":"IEEE Trans Inf Theory"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.917638"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.122211.110026"},{"key":"28","article-title":"Unleashing the power of Schrijver's permanental inequality with the help of the Bethe approximation","author":"gurvits","year":"2011","journal-title":"Elec Coll Comp Compl"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1109\/18.910573"},{"key":"3","article-title":"Coding for limiting current in memristor crossbar memories","author":"ordentlich","year":"0","journal-title":"Proc 2nd Annual Non-Volatile Memories Workshop UC San Diego la Jolla CA USA Mar 6-8 2011"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1088\/0957-4484\/20\/42\/425204"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033792"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/18.720539"},{"key":"30","first-page":"209","article-title":"The number of stable points of an infinite-range spin glass memory","volume":"42 83","author":"posner","year":"1985","journal-title":"TDA Progress Report"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033804"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2007.03.009"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300004491"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb00917.x"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(13)80042-X"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0906949106"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033792"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033804"}],"event":{"name":"2012 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2012,7,1]]},"location":"Cambridge, MA, USA","end":{"date-parts":[[2012,7,6]]}},"container-title":["2012 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6268627\/6281806\/06284033.pdf?arnumber=6284033","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T18:04:58Z","timestamp":1490119498000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6284033\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/isit.2012.6284033","relation":{},"subject":[],"published":{"date-parts":[[2012,7]]}}}