{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:18:01Z","timestamp":1740122281180,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,2,8]],"date-time":"2019-02-08T00:00:00Z","timestamp":1549584000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s10601-018-9296-3","type":"journal-article","created":{"date-parts":[[2019,2,7]],"date-time":"2019-02-07T22:06:13Z","timestamp":1549577173000},"page":"162-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Model counting with error-correcting codes"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2349-822X","authenticated-orcid":false,"given":"Dimitris","family":"Achlioptas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos","family":"Theodoropoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,8]]},"reference":[{"key":"9296_CR1","unstructured":"Achim, T., Sabharwal, A., Ermon, S. (2016). Beyond parity constraints: Fourier analysis of hash functions for inference. In M. Balcan, & K.Q. Weinberger (Eds.) Proceedings of the 33nd International Conference on Machine Learning, ICML 2016, New York City, NY, USA, June 19-24, 2016, JMLR Workshop and Conference Proceedings. JMLR.org. \n                    http:\/\/jmlr.org\/proceedings\/papers\/v48\/achim16.html\n                    \n                  , (Vol. 48 pp. 2254\u20132262)."},{"key":"9296_CR2","unstructured":"Chakraborty, S., Fremont, D.J., Meel, K.S., Seshia, S.A., Vardi, M.Y. (2014). Distribution-aware sampling and weighted model counting for SAT. In Brodley, C.E., & Stone, P. (Eds.) Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence. \n                    http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI14\/paper\/view\/8364\n                    \n                   (pp. 1722\u20131730). Qu\u00e9bec City: AAAI Press."},{"key":"9296_CR3","doi-asserted-by":"publisher","unstructured":"Chakraborty, S., Meel, K.S., Vardi, M.Y. (2013). A scalable approximate model counter. In Schulte, C. (Ed.) Principles and Practice of Constraint Programming - 19th International Conference, CP 2013, Uppsala, Proceedings, Lecture Notes in Computer Science. \n                    https:\/\/doi.org\/10.1007\/978-3-642-40627-0_18\n                    \n                  , (Vol. 8124 pp. 200\u2013216): Springer.","DOI":"10.1007\/978-3-642-40627-0_18"},{"key":"9296_CR4","unstructured":"Chakraborty, S., Meel, K.S., Vardi, M.Y. (2016). Algorithmic improvements in approximate counting for probabilistic inference: From linear to logarithmic SAT calls. In Kambhampati, S. (Ed.) Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016. \n                    http:\/\/www.ijcai.org\/Abstract\/16\/503\n                    \n                   (pp. 3569\u20133576). New York: IJCAI\/AAAI Press."},{"key":"9296_CR5","unstructured":"Ermon, S., Gomes, C.P., Sabharwal, A., Selman, B. (2013). Taming the curse of dimensionality: Discrete integration by hashing and optimization. In Proceedings of the 30th international conference on machine learning (ICML)."},{"key":"9296_CR6","unstructured":"Ermon, S., Gomes, C.P., Sabharwal, A., Selman, B. (2014). Low-density parity constraints for hashing-based discrete integration. In Proceedings of the 31st international conference on machine learning (ICML) (pp. 271\u2013279)."},{"key":"9296_CR7","doi-asserted-by":"crossref","unstructured":"Gomes, C.P., Hoffmann, J., Sabharwal, A., Selman, B. (2007). Short XORs for model counting: From theory to practice. In Theory and applications of satisfiability testing (SAT) (pp. 100\u2013106).","DOI":"10.1007\/978-3-540-72788-0_13"},{"key":"9296_CR8","unstructured":"Gomes, C.P., Sabharwal, A., Selman, B. (2006). Model counting: a new strategy for obtaining good bounds. In Proceedings of the 21st national conference on artificial intelligence (AAAI) (pp 54\u201361)."},{"issue":"1","key":"9296_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10601-015-9204-z","volume":"21","author":"A Ivrii","year":"2016","unstructured":"Ivrii, A., Malik, S., Meel, K.S., Vardi, M.Y. (2016). On computing minimal independent support and its applications to sampling and counting. Constraints, 21(1), 41\u201358. \n                    https:\/\/doi.org\/10.1007\/s10601-015-9204-z\n                    \n                  .","journal-title":"Constraints"},{"key":"9296_CR10","unstructured":"Meel, K.S., Vardi, M.Y., Chakraborty, S., Fremont, D.J., Seshia, S.A., Fried, D., Ivrii, A., Malik, S. (2016). Constrained sampling and counting: Universal hashing meets sat solving. In Workshops at the thirtieth AAAI conference on artificial intelligence."},{"key":"9296_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338","volume-title":"Modern coding theory","author":"T Richardson","year":"2008","unstructured":"Richardson, T., & Urbanke, R. (2008). Modern coding theory. New York: Cambridge University Press."},{"key":"9296_CR12","doi-asserted-by":"crossref","unstructured":"Sipser, M. (1983). A complexity theoretic approach to randomness. In Proceedings of the 15th ACM symposium on theory of computing (STOC) (pp 330\u2013335).","DOI":"10.1145\/800061.808762"},{"issue":"6","key":"9296_CR13","doi-asserted-by":"publisher","first-page":"1710","DOI":"10.1109\/18.556667","volume":"42","author":"M Sipser","year":"1996","unstructured":"Sipser, M., & Spielman, D.A. (1996). Expander codes. IEEE Transactions on Information Theory, 42(6), 1710\u20131722. \n                    https:\/\/doi.org\/10.1109\/18.556667\n                    \n                  .","journal-title":"IEEE Transactions on Information Theory"},{"key":"9296_CR14","unstructured":"Soos, M. (2009). Cryptominisat\u2013a sat solver for cryptographic problems. \n                    http:\/\/www.msoos.org\/cryptominisat4\n                    \n                  ."},{"issue":"4","key":"9296_CR15","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1137\/0214060","volume":"14","author":"L Stockmeyer","year":"1985","unstructured":"Stockmeyer, L. (1985). On approximation algorithms for P\u0307. SIAM Journal on Computing, 14(4), 849\u2013861.","journal-title":"SIAM Journal on Computing"},{"key":"9296_CR16","doi-asserted-by":"publisher","unstructured":"Thurley, M. (2006). Sharpsat: Counting models with advanced component caching and implicit bcp. In Proceedings of the 9th International Conference on Theory and Applications of Satisfiability Testing, SAT\u201906. \n                    https:\/\/doi.org\/10.1007\/11814948_38\n                    \n                  (pp. 424\u2013429). Berlin: Springer.","DOI":"10.1007\/11814948_38"},{"key":"9296_CR17","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(86)90135-0","volume":"47","author":"L Valiant","year":"1986","unstructured":"Valiant, L., & Vazirani, V. (1986). NP is as easy as detecting unique solutions. Theoretical Computer Science, 47, 85\u201393.","journal-title":"Theoretical Computer Science"},{"key":"9296_CR18","unstructured":"Zhao, S., Chaturapruek, S., Sabharwal, A., Ermon, S. (2016). Closing the gap between short and long xors for model counting. In Schuurmans, D., & Wellman, M.P. (Eds.) Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. \n                    http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI16\/paper\/view\/12546\n                    \n                   (pp. 3322\u20133329). Phoenix: AAAI Press."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-018-9296-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-018-9296-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-018-9296-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,7]],"date-time":"2020-02-07T19:18:58Z","timestamp":1581103138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-018-9296-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,8]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["9296"],"URL":"https:\/\/doi.org\/10.1007\/s10601-018-9296-3","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"type":"print","value":"1383-7133"},{"type":"electronic","value":"1572-9354"}],"subject":[],"published":{"date-parts":[[2019,2,8]]},"assertion":[{"value":"8 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}