{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T07:13:35Z","timestamp":1761549215785,"version":"build-2065373602"},"reference-count":0,"publisher":"SAGE Publications","issue":"1-3","license":[{"start":{"date-parts":[[2008,9,1]],"date-time":"2008-09-01T00:00:00Z","timestamp":1220227200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SAT"],"DOI":"10.3233\/sat190059","type":"journal-article","created":{"date-parts":[[2019,11,29]],"date-time":"2019-11-29T15:15:03Z","timestamp":1575040503000},"page":"1-12","source":"Crossref","is-referenced-by-count":7,"title":["Matched Formulas and Backdoor Sets1"],"prefix":"10.1177","volume":"6","author":[{"given":"Stefan","family":"Szeider","sequence":"first","affiliation":[{"name":"Department of Computer Science, Durham University, Durham DH1 3LE, England, United Kingdom. E-mail:\u00a0stefan.szeider@durham.ac.uk"}]}],"member":"179","published-online":{"date-parts":[[2008,9,1]]},"container-title":["Journal on Satisfiability, Boolean Modeling and Computation"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/SAT190059","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T07:08:35Z","timestamp":1761548915000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/SAT190059"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,1]]},"references-count":0,"journal-issue":{"issue":"1-3","published-online":{"date-parts":[[2008,9,1]]}},"URL":"https:\/\/doi.org\/10.3233\/sat190059","relation":{},"ISSN":["1574-0617"],"issn-type":[{"type":"electronic","value":"1574-0617"}],"subject":[],"published":{"date-parts":[[2008,9,1]]}}}