{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T05:40:09Z","timestamp":1747806009676,"version":"3.41.0"},"reference-count":37,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"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":[[2019,11]]},"DOI":"10.1109\/focs.2019.000-3","type":"proceedings-article","created":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T18:49:16Z","timestamp":1578422956000},"page":"1434-1445","source":"Crossref","is-referenced-by-count":7,"title":["A Tight Analysis of Bethe Approximation for Permanent"],"prefix":"10.1109","author":[{"given":"Nima","family":"Anari","sequence":"first","affiliation":[{"name":"Stanford University"}]},{"given":"Alireza","family":"Rezaei","sequence":"additional","affiliation":[{"name":"University of Washington"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993682"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.26421\/QIC14.7-8-1"},{"key":"ref3","first-page":"11","article-title":"A unified maximum likelihood approach for estimating symmetric properties of discrete distributions","volume-title":"International Conference on Machine Learning.","author":"Acharya"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/focs.2017.89"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055469"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2017.36"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00013"},{"key":"ref8","article-title":"Computing permanents of complex diagonally dominant matrices and tensors","author":"Barvinok","year":"2018","journal-title":"arXiv preprint arXiv:1801.04191"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-014-9243-7"},{"issue":"4","key":"ref10","first-page":"945","article-title":"Some properties of nonnegative matrices and their permanents","volume":"14","author":"M Bregman","year":"1973","journal-title":"Soviet Math. Dokl."},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12136"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.96.022329"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316398"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1214\/17-AAP1326"},{"key":"ref15","article-title":"Belief propagation and beyond for particle tracking","author":"Chertkov","year":"2008","journal-title":"arXiv preprint arXiv:0806.1199"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.4171\/jems\/706"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-59204-5_6"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/focs.2018.00012"},{"key":"ref19","article-title":"New hardness results for the permanent using linear optics","author":"Grier","year":"2016","journal-title":"arXiv preprint arXiv:1610.04670"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/11549345_39"},{"key":"ref21","article-title":"Unleashing the power of Schrijver\u2019s permanental inequality with the help of the Bethe approximation","author":"Gurvits","year":"2011","journal-title":"arXiv preprint arXiv:1106.2844"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.18"},{"key":"ref23","article-title":"Approximating the permanent with belief propagation","author":"Huang","year":"2009","journal-title":"arXiv preprint arXiv:0908.1769"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008738"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s004930070007"},{"volume-title":"Information theory, inference and learning algorithms.","year":"2003","author":"JC MacKay","key":"ref26"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1963-11031-9"},{"key":"ref28","article-title":"Approximate profile maximum likelihood","author":"Pavlichin","year":"2017","journal-title":"arXiv preprint arXiv:1712.07177"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1996.2727"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90036-5"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1997.1798"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262801"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90044-6"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2014.6804280"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227109"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850085"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-8438-9_1"}],"event":{"name":"2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)","start":{"date-parts":[[2019,11,9]]},"location":"Baltimore, MD, USA","end":{"date-parts":[[2019,11,12]]}},"container-title":["2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8936052\/8948505\/08948682.pdf?arnumber=8948682","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T05:04:27Z","timestamp":1747803867000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8948682\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/focs.2019.000-3","relation":{},"subject":[],"published":{"date-parts":[[2019,11]]}}}