{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,6]],"date-time":"2026-08-06T11:38:17Z","timestamp":1786016297734,"version":"3.56.0"},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.ins.2026.123495","type":"journal-article","created":{"date-parts":[[2026,4,12]],"date-time":"2026-04-12T16:58:18Z","timestamp":1776013098000},"page":"123495","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Taming model multiplicity: A unified framework for delay-FPT enumeration of smallest interpretable models"],"prefix":"10.1016","volume":"748","author":[{"given":"Zhigao","family":"Huang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shifa","family":"Pan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Quanfa","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2026.123495_bib0005","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1038\/s42256-019-0048-x","article-title":"Stop explaining black-box machine learning models for high stakes decisions and use interpretable models instead","volume":"1","author":"Rudin","year":"2019","journal-title":"Nat. Mach. Intell."},{"key":"10.1016\/j.ins.2026.123495_bib0010","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","first-page":"10662","article-title":"A general theoretical framework for learning smallest interpretable models","volume":"vol. 38","author":"Ordyniak","year":"2024"},{"key":"10.1016\/j.ins.2026.123495_bib0015","series-title":"Proceedings of the 2022 ACM Conference on Fairness, Accountability, and Transparency (FAccT)","first-page":"850","article-title":"Model multiplicity: opportunities, concerns, and solutions","author":"Black","year":"2022"},{"key":"10.1016\/j.ins.2026.123495_bib0020","series-title":"Proceedings of the 2022 ACM Conference on Fairness, Accountability, and Transparency (FAccT)","first-page":"1827","article-title":"On the existence of simpler machine learning models","author":"Semenova","year":"2022"},{"issue":"1","key":"10.1016\/j.ins.2026.123495_bib0025","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0020-0190(76)90095-8","article-title":"Constructing optimal binary decision trees is np-complete","volume":"5","author":"Hyafil","year":"1976","journal-title":"Inf. Process. Lett."},{"issue":"7","key":"10.1016\/j.ins.2026.123495_bib0030","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1007\/s10994-017-5633-9","article-title":"Optimal classification trees","volume":"106","author":"Bertsimas","year":"2017","journal-title":"Mach. Learn."},{"key":"10.1016\/j.ins.2026.123495_bib0035","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","first-page":"3146","article-title":"Learning optimal decision trees using constraint programming","volume":"vol. 34","author":"Aglin","year":"2020"},{"key":"10.1016\/j.ins.2026.123495_bib0040","series-title":"Advances in Neural Information Processing Systems","first-page":"4655","article-title":"Boolean decision rules via column generation","volume":"vol. 31","author":"Dash","year":"2018"},{"key":"10.1016\/j.ins.2026.123495_bib0045","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1613\/jair.989","article-title":"A knowledge compilation map","volume":"17","author":"Darwiche","year":"2002","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.ins.2026.123495_bib0050","first-page":"1519","article-title":"Compiling oblique decision trees into sentential decision diagrams","volume":"74","author":"Shi","year":"2022","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.ins.2026.123495_bib0055","article-title":"The complexity of explaining decision trees","volume":"313","author":"Arenas","year":"2022","journal-title":"Artif. Intell."},{"key":"10.1016\/j.ins.2026.123495_bib0060","series-title":"Parameterized Algorithms","author":"Cygan","year":"2015"},{"key":"10.1016\/j.ins.2026.123495_bib0065","series-title":"Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"35","article-title":"Learning certifiably optimal rule lists for categorical data","author":"Angelino","year":"2017"},{"issue":"8","key":"10.1016\/j.ins.2026.123495_bib0070","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","article-title":"Graph-based algorithms for boolean function manipulation","volume":"C-35","author":"Bryant","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.ins.2026.123495_bib0075","series-title":"Branching Programs and Binary Decision Diagrams: Theory and Applications","author":"Wegener","year":"2000"},{"issue":"2","key":"10.1016\/j.ins.2026.123495_bib0080","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1006\/jcss.2000.1727","article-title":"On the complexity of K-Sat","volume":"62","author":"Impagliazzo","year":"2001","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526004263?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526004263?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T04:06:21Z","timestamp":1779422781000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025526004263"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":16,"alternative-id":["S0020025526004263"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2026.123495","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Taming model multiplicity: A unified framework for delay-FPT enumeration of smallest interpretable models","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2026.123495","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"123495"}}