{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:32:10Z","timestamp":1740169930870,"version":"3.37.3"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61462001","61650206","61762019","61762002","61402017","61563001"],"award-info":[{"award-number":["61462001","61650206","61762019","61762002","61402017","61563001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012490","name":"North Minzu University","doi-asserted-by":"publisher","award":["2017KJ24"],"award-info":[{"award-number":["2017KJ24"]}],"id":[{"id":"10.13039\/501100012490","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Computer application technology of Ningxia"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Emerg. Topics Comput."],"published-print":{"date-parts":[[2019,10,1]]},"DOI":"10.1109\/tetc.2017.2736504","type":"journal-article","created":{"date-parts":[[2017,8,7]],"date-time":"2017-08-07T18:11:13Z","timestamp":1502129473000},"page":"578-584","source":"Crossref","is-referenced-by-count":4,"title":["Warning Propagation Algorithm for the MAX-3-SAT Problem"],"prefix":"10.1109","volume":"7","author":[{"given":"Xiaofeng","family":"Wang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1399-1678","authenticated-orcid":false,"given":"Jiulei","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20057"},{"key":"ref11","first-page":"239","article-title":"Understanding belief propagation and its generalizations","volume":"8","author":"yedidia","year":"0","journal-title":"Artif Intell"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24605-3_38"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1162\/089976600300015880"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1162\/089976601750541769"},{"key":"ref15","first-page":"493","article-title":"Loopy belief propagation and Gibbs measure","author":"tatikonda","year":"0","journal-title":"Proc 18th Conf Uncertainty Artif Intell"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1162\/0899766041941943"},{"key":"ref17","first-page":"905","article-title":"Loopy belief propagation: Convergence and effects of message errors","volume":"6","year":"2005","journal-title":"J Mach Learn Res"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909166"},{"key":"ref19","first-page":"1","article-title":"Message error analysis of loopy belief propagation for the sum-product algorithm","volume":"1009","author":"shi","year":"2010","journal-title":"Comput Inf Sci"},{"key":"ref4","first-page":"1","article-title":"Typical random 3-sat formulae and the satisfiability threshold","volume":"10","author":"dubois","year":"2003","journal-title":"Electronic Colloq on Computational Complexity"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20104"},{"key":"ref6","first-page":"1","article-title":"Comparing beliefs, surveys, and random walks","volume":"17","author":"aurell","year":"2004","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/378239.379017"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.66.056126"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022221005097"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20090"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1255443.1255445"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1126\/science.264.5163.1297"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1110.1025"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2231464"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00310"},{"key":"ref24","first-page":"84","article-title":"Existential arc consistency: Getting closer to ful arc consistency in weighted CSPs.","author":"de givry","year":"0","journal-title":"Proc 19th Int Joint Conf Artif Intell"},{"key":"ref23","first-page":"306","article-title":"UBCSAT: An implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT","author":"tompking","year":"0","journal-title":"Proc Int Conf Theory and Appl Satisfiability Testing"},{"key":"ref26","first-page":"2155","article-title":"Clustering and partition based divide and conquer for SAT solving","volume":"26","author":"fan","year":"2015","journal-title":"J SOFT"},{"key":"ref25","first-page":"86","article-title":"Detecting disjoint inconsistent subformulas for computing lower bounds for max-sat","author":"li","year":"0","journal-title":"Proc 21st AAAI Conf Artif Intell"}],"container-title":["IEEE Transactions on Emerging Topics in Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6245516\/8922818\/08003327.pdf?arnumber=8003327","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:55:47Z","timestamp":1657745747000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8003327\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,1]]},"references-count":26,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tetc.2017.2736504","relation":{},"ISSN":["2168-6750","2376-4562"],"issn-type":[{"type":"electronic","value":"2168-6750"},{"type":"electronic","value":"2376-4562"}],"subject":[],"published":{"date-parts":[[2019,10,1]]}}}