{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T08:09:46Z","timestamp":1771056586891,"version":"3.50.1"},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T00:00:00Z","timestamp":1764806400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004359","name":"Vetenskapsr\u00e5det","doi-asserted-by":"publisher","award":["2022-03875"],"award-info":[{"award-number":["2022-03875"]}],"id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004063","name":"Knut och Alice Wallenbergs Stiftelse","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004063","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100016408","name":"Goran Gustafsson's Foundations","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100016408","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Approximate Reasoning"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1016\/j.ijar.2025.109606","type":"journal-article","created":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T16:08:15Z","timestamp":1765037295000},"page":"109606","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On the edges of characteristic imset polytopes"],"prefix":"10.1016","volume":"191","author":[{"given":"Svante","family":"Linusson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petter","family":"Restadh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liam","family":"Solus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.ijar.2025.109606_bib0001","series-title":"Causality","author":"Pearl","year":"2009"},{"key":"10.1016\/j.ijar.2025.109606_bib0002","series-title":"Graphical Models","author":"Lauritzen","year":"1996"},{"issue":"2","key":"10.1016\/j.ijar.2025.109606_bib0003","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1214\/aos\/1031833662","article-title":"A characterization of markov equivalence classes for acyclic digraphs","volume":"25","author":"Andersson","year":"1997","journal-title":"Ann. Statist."},{"issue":"1","key":"10.1016\/j.ijar.2025.109606_bib0004","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1177\/089443939100900106","article-title":"An algorithm for fast recovery of sparse causal graphs","volume":"9","author":"Spirtes","year":"1991","journal-title":"Soc. Sci. Comput. Rev."},{"issue":"2","key":"10.1016\/j.ijar.2025.109606_bib0005","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1080\/08839514.2018.1526760","article-title":"Bayesian network learning with the PC algorithm: an improved and correct variation","volume":"33","author":"Tsagris","year":"2019","journal-title":"Appl. Artif. Intell."},{"key":"10.1016\/j.ijar.2025.109606_bib0006","first-page":"507","article-title":"Optimal structure identification with greedy search","volume":"3","author":"Chickering","year":"2002","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"10.1016\/j.ijar.2025.109606_bib0007","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s10994-006-6889-7","article-title":"The max-min hill-climbing bayesian network structure learning algorithm","volume":"65","author":"Tsamardinos","year":"2006","journal-title":"Mach. Learn."},{"key":"10.1016\/j.ijar.2025.109606_bib0008","doi-asserted-by":"crossref","DOI":"10.1093\/biomet\/asaa104","article-title":"Consistency guarantees for greedy permutation-based causal inference algorithms","author":"Solus","year":"2021","journal-title":"Biometrika"},{"issue":"9","key":"10.1016\/j.ijar.2025.109606_bib0009","doi-asserted-by":"crossref","first-page":"1336","DOI":"10.1016\/j.ijar.2012.04.001","article-title":"Characteristic imsets for learning Bayesian network structure","volume":"53","author":"Hemmecke","year":"2012","journal-title":"Int. J. Approximate Reasoning"},{"key":"10.1016\/j.ijar.2025.109606_bib0010","article-title":"Probabilistic Conditional Independence Structures","author":"Studen\u00fd","year":"2005"},{"key":"10.1016\/j.ijar.2025.109606_bib0011","series-title":"Lectures on polytopes","volume":"152","author":"Ziegler","year":"2012"},{"issue":"1\u20132","key":"10.1016\/j.ijar.2025.109606_bib0012","first-page":"285","article-title":"Polyhedral aspects of score equivalence in Bayesian network structure learning","volume":"164","author":"Cussens","year":"2016","journal-title":"Math. Program"},{"issue":"1","key":"10.1016\/j.ijar.2025.109606_bib0013","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1137\/21M1457205","article-title":"Greedy causal discovery is geometric","volume":"37","author":"Linusson","year":"2023","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.ijar.2025.109606_bib0014","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","article-title":"On certain polytopes associated with graphs","volume":"18.2","author":"Chv\u00e1tal","year":"1975","journal-title":"J. Comb. Theory Ser. B"},{"key":"10.1016\/j.ijar.2025.109606_bib0015","series-title":"Proceedings of the Eighth International Conference on Uncertainty in Artificial Intelligence","first-page":"323","article-title":"An algorithm for deciding if a set of observed independencies has a causal explanation","author":"Verma","year":"1992"},{"key":"10.1016\/j.ijar.2025.109606_bib0016","series-title":"Discrete Optimisation in Machine Learning: Learning of Bayesian Network Structures and Conditional Independence Implication","author":"Lindner","year":"2012"},{"key":"10.1016\/j.ijar.2025.109606_bib0017","unstructured":"J. Xi, R. Yoshida, The characteristic imset polytope of Bayesian networks with ordered nodes (2013). 1206.0406>."},{"key":"10.1016\/j.ijar.2025.109606_bib0018","series-title":"Convex polytopes","volume":"Vol. 16","author":"Gr\u00fcnbaum","year":"1967"},{"issue":"3","key":"10.1016\/j.ijar.2025.109606_bib0019","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1109\/TIT.1968.1054142","article-title":"Approximating discrete probability distributions with dependence trees","volume":"14","author":"Chow","year":"1968","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ijar.2025.109606_bib0020","series-title":"Proc. of Workshop on Uncertainty in Artificial Intelligence","first-page":"222","article-title":"The recovery of causal ploy-trees from statistical data","author":"Rebane","year":"1987"},{"key":"10.1016\/j.ijar.2025.109606_bib0021","unstructured":"P. Restadh, L. Solus, causalCIM. GitHub Repository, 2021. https:\/\/github.com\/soluslab\/causalCIM."},{"issue":"1","key":"10.1016\/j.ijar.2025.109606_bib0022","first-page":"2409","article-title":"Characterization and greedy learning of interventional markov equivalence classes of directed acyclic graphs","volume":"13","author":"Hauser","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.ijar.2025.109606_bib0023","series-title":"Proceedings of the 31St International Conference on Neural Information Processing Systems","first-page":"5824","article-title":"Permutation-based causal inference algorithms with interventions","author":"Wang","year":"2017"},{"key":"10.1016\/j.ijar.2025.109606_bib0024","unstructured":"C. Squires, causaldag: creation, manipulation, and learning of causal models."},{"issue":"5721","key":"10.1016\/j.ijar.2025.109606_bib0025","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1126\/science.1105809","article-title":"Causal protein-signaling networks derived from multiparameter single-cell data","volume":"308","author":"Sachs","year":"2005","journal-title":"Science"},{"key":"10.1016\/j.ijar.2025.109606_bib0026","series-title":"Cambridge Studies in Advanced Mathematics","article-title":"Enumerative Combinatorics Volume 1 second edition","author":"Stanley","year":"2011"},{"key":"10.1016\/j.ijar.2025.109606_bib0027","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.dam.2018.03.015","article-title":"Counting Markov equivalence classes for DAG models on trees","volume":"244","author":"Radhakrishnan","year":"2018","journal-title":"Discrete Appl. Math."}],"container-title":["International Journal of Approximate Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0888613X25002476?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0888613X25002476?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T07:31:20Z","timestamp":1771054280000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0888613X25002476"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":27,"alternative-id":["S0888613X25002476"],"URL":"https:\/\/doi.org\/10.1016\/j.ijar.2025.109606","relation":{},"ISSN":["0888-613X"],"issn-type":[{"value":"0888-613X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the edges of characteristic imset polytopes","name":"articletitle","label":"Article Title"},{"value":"International Journal of Approximate Reasoning","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ijar.2025.109606","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Author(s). Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"109606"}}