{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:55:01Z","timestamp":1740131701963,"version":"3.37.3"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000015","name":"National Nuclear Security Administration of the U.S. Department of Energy, Los Alamos National Laboratory","doi-asserted-by":"publisher","award":["DE-AC52-06NA25396"],"award-info":[{"award-number":["DE-AC52-06NA25396"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1109\/tit.2017.2788038","type":"journal-article","created":{"date-parts":[[2017,12,29]],"date-time":"2017-12-29T19:14:54Z","timestamp":1514574894000},"page":"1471-1480","source":"Crossref","is-referenced-by-count":3,"title":["Maximum Weight Matching Using Odd-Sized Cycles: Max-Product Belief Propagation and Half-Integrality"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9188-0415","authenticated-orcid":false,"given":"Sungsoo","family":"Ahn","sequence":"first","affiliation":[]},{"given":"Michael","family":"Chertkov","sequence":"additional","affiliation":[]},{"given":"Andrew E.","family":"Gelfand","sequence":"additional","affiliation":[]},{"given":"Sejun","family":"Park","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4313-4669","authenticated-orcid":false,"given":"Jinwoo","family":"Shin","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579206"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/090753115"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797655"},{"key":"ref12","first-page":"1281","article-title":"Message passing for max-weight independent set","author":"sanghavi","year":"2007","journal-title":"Proc Neural Inf Process Syst (NIPS)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.24"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856938"},{"key":"ref15","first-page":"316","article-title":"On the optimality of tree-reweighted max-product message passing","author":"kolmogorov","year":"2005","journal-title":"Proc Uncertainty Artif Intell (UAI)"},{"key":"ref16","first-page":"553","article-title":"Fixing max-product: Convergent message passing algorithms for MAP LP-relaxations","author":"globerson","year":"2008","journal-title":"Proc Neural Inf Process Syst (NIPS)"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1036"},{"key":"ref18","first-page":"393","article-title":"Convergent message passing algorithms: A unifying view","author":"meltzer","year":"2009","journal-title":"Proc Uncertainty Artif Intell (UAI)"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2.4.393"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/15M1042565"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000001","article-title":"Graphical models, exponential families, and variational inference","volume":"1","author":"wainwright","year":"2008","journal-title":"Found Trends Mach Learn"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/473\/1\/012007"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198570837.001.0001"},{"key":"ref6","first-page":"340","article-title":"GraphLab: A new framework for parallel machine learning","author":"low","year":"2010","journal-title":"Proc Uncertainty Artif Intell (UAI)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1965-045-4"},{"key":"ref5","first-page":"177","article-title":"Residual splash for optimally parallelizing belief propagation","author":"gonzalez","year":"2009","journal-title":"Proc Int Conf Artif Intell Stat"},{"key":"ref8","first-page":"1273","article-title":"Linear programming analysis of loopy belief propagation for weighted matching","author":"sanghavi","year":"2007","journal-title":"Proc Neural Inf Process Syst (NIPS)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.915695"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref9","first-page":"195","article-title":"Loopy belief propagation for bipartite maximum weight b-matching","author":"huang","year":"2007","journal-title":"Proc Artif Intell Stat (AISTATS)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850085"},{"key":"ref20","first-page":"1","article-title":"Efficiently searching for frustrated cycles in MAP inference","author":"sontag","year":"2012","journal-title":"Proc Uncertainty Artif Intell (UAI)"},{"key":"ref22","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low Density Parity Check Codes"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2015.0714"},{"key":"ref24","article-title":"Exact inference using the attenuated max-product algorithm","author":"frey","year":"2000","journal-title":"Advanced Mean Field Methods Theory and Practice"},{"article-title":"Belief propagation and revision in networks with loops","year":"1997","author":"weiss","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584376"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/18.910585"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/18\/8293743\/8241842-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8293743\/08241842.pdf?arnumber=8241842","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:53:14Z","timestamp":1649443994000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8241842\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":30,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2788038","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2018,3]]}}}