{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:36:14Z","timestamp":1740177374576,"version":"3.37.3"},"reference-count":13,"publisher":"The Open Journal","issue":"24","license":[{"start":{"date-parts":[[2018,4,26]],"date-time":"2018-04-26T00:00:00Z","timestamp":1524700800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2018,4,26]],"date-time":"2018-04-26T00:00:00Z","timestamp":1524700800000},"content-version":"am","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2018,4,26]],"date-time":"2018-04-26T00:00:00Z","timestamp":1524700800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JOSS"],"published-print":{"date-parts":[[2018,4,26]]},"DOI":"10.21105\/joss.00639","type":"journal-article","created":{"date-parts":[[2018,4,26]],"date-time":"2018-04-26T12:35:15Z","timestamp":1524746115000},"page":"639","source":"Crossref","is-referenced-by-count":0,"title":["LearnSAT: A SAT Solver for Education"],"prefix":"10.21105","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2091-5107","authenticated-orcid":false,"given":"Mordechai","family":"(Moti) Ben-Ari","sequence":"first","affiliation":[]}],"member":"8722","reference":[{"key":"ref1","unstructured":"Miller, J.E., Langford\u2019s Problem, \\urlhttp:\/\/dialectrix.com\/langford.html"},{"key":"ref2","unstructured":"Knuth, D.E., The Art of Computer Programming, Volume 4, Fascicle 6: Satisfiability, Pearson, ISBN 978-0-1343-9760-3, 2015"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3107239"},{"key":"ref4","unstructured":"Handbook of Satisfiability, Biere, A. and Heule, M. and Maaren, H. Van and Walsh, T., 2009, ISBN 978-1-60750-376-7, IOS Press"},{"key":"ref5","unstructured":"Mathematical Logic for Computer Science (Third Edition), Ben-Ari, M., Springer, ISBN\t978-1-4471-4129-7, 2012"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.3233\/978-1-58603-929-5-131"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.3233\/978-1-58603-929-5-155"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.3233\/978-1-58603-929-5-457"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.3233\/978-1-58603-929-5-75"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1536616.1536637"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/12.769433"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/64.54670"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1721933.1721950"}],"container-title":["Journal of Open Source Software"],"original-title":[],"link":[{"URL":"http:\/\/www.theoj.org\/joss-papers\/joss.00639\/10.21105.joss.00639.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,4,26]],"date-time":"2018-04-26T12:35:16Z","timestamp":1524746116000},"score":1,"resource":{"primary":{"URL":"http:\/\/joss.theoj.org\/papers\/10.21105\/joss.00639"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,26]]},"references-count":13,"journal-issue":{"issue":"24","published-online":{"date-parts":[[2018,4]]}},"alternative-id":["10.21105\/joss.00639"],"URL":"https:\/\/doi.org\/10.21105\/joss.00639","relation":{"has-review":[{"id-type":"uri","id":"https:\/\/github.com\/openjournals\/joss-reviews\/issues\/639","asserted-by":"subject"}],"references":[{"id-type":"doi","id":"http:\/\/dx.doi.org\/10.5281\/zenodo.1230536","asserted-by":"subject"}]},"ISSN":["2475-9066"],"issn-type":[{"type":"electronic","value":"2475-9066"}],"subject":[],"published":{"date-parts":[[2018,4,26]]}}}