{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:13:35Z","timestamp":1740100415000,"version":"3.37.3"},"reference-count":52,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004853","name":"Chinese University of Hong Kong","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004853","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,10,17]]},"DOI":"10.1109\/itw48936.2021.9611489","type":"proceedings-article","created":{"date-parts":[[2021,11,23]],"date-time":"2021-11-23T21:46:27Z","timestamp":1637703987000},"page":"1-6","source":"Crossref","is-referenced-by-count":7,"title":["The Undecidability of Conditional Affine Information Inequalities and Conditional Independence Implication with a Binary Constraint"],"prefix":"10.1109","author":[{"given":"Cheuk Ting","family":"Li","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90077-F"},{"key":"ref38","article-title":"Logical inference algorithms and matrix representations for probabilistic conditional independence","author":"niepert","year":"2012","journal-title":"arXiv preprint arXiv 1205 2621"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1979.tb01052.x"},{"key":"ref32","article-title":"Decision problems in information theory","author":"khamis","year":"2020","journal-title":"arXiv preprint arXiv 2004 06774"},{"key":"ref31","article-title":"Representability of matroids by c-arrangements is undecidable","author":"k\u00fchne","year":"2019","journal-title":"arXiv preprint arXiv 1912 06123"},{"journal-title":"On the theory of polynomial information inequalities","year":"2018","author":"g\u00f3mez r\u00edos","key":"ref30"},{"key":"ref37","first-page":"377","article-title":"Conditional independence relations have no finite complete characterization","author":"studen\u00fd","year":"1992","journal-title":"Information Theory Statistical Decision Functions and Random Processes"},{"key":"ref36","first-page":"3","article-title":"Multiinformation and the problem of characterization of conditional independence relations","author":"studen\u00fd","year":"1989","journal-title":"Problems of Control and Information Theory"},{"key":"ref35","first-page":"357","article-title":"Graphoids: a graph-based logic for reasoning about relevance relations","author":"pearl","year":"1987","journal-title":"Advances in Artificial Intelligence"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/BF00258078"},{"key":"ref28","article-title":"Is network coding undecidable?","author":"dougherty","year":"2009","journal-title":"in Applications of Matroid Theory and Combinatorial Optimization to Information and Coding Theory"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2982642"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1504\/IJICOT.2017.081456"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.641556"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.641561"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/ISIT.2007.4557201","article-title":"Infinitely many information inequalities","author":"mat\u00fa\u0161","year":"2007","journal-title":"in 2007 IEEE ISIT IEEE"},{"key":"ref22","article-title":"Non-Shannon information inequalities in four random variables","author":"dougherty","year":"2011","journal-title":"arXiv preprint arXiv 1104 3602"},{"key":"ref21","first-page":"2116","article-title":"A projection method for derivation of non-Shannon-type information inequalities","author":"xu","year":"2008","journal-title":"in 2008 IEEE ISIT IEEE"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2014.6892127"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.3390\/e10040765"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2274614"},{"journal-title":"Secret sharing and algorithmic information theory","year":"2012","author":"kaced","key":"ref25"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/BF00971620"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(98)00203-9"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0255(92)90042-7"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2011.01.003"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2500232"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176349407"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78381-9_22"},{"key":"ref13","first-page":"1377","article-title":"How to use undiscovered information inequalities: Direct applications of the copy lemma","author":"g\u00fcrp?nar","year":"2019","journal-title":"2019 IEEE ISIT"},{"journal-title":"ITIP - information theoretic inequality prover","year":"0","author":"yeung","key":"ref14"},{"key":"ref15","article-title":"Fourier-Motzkin elimination software for information theoretic inequalities","author":"gattegno","year":"2016","journal-title":"arXiv preprint arXiv 1610 03677"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517792"},{"key":"ref17","first-page":"3","article-title":"What are the laws of information theory","author":"pippenger","year":"1986","journal-title":"in 1986 Special Problems on Communication and Computation Conference"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.4310\/CIS.2002.v2.n2.a3"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261840"},{"article-title":"Information theory and network coding. Springer Science & Business Media","year":"2008","author":"yeung","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.681320"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2201340"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928963"},{"key":"ref8","article-title":"Explicit polyhedral bounds on network coding rate regions via entropy function region: Algorithms, symmetry, and computation","author":"apte","year":"2016","journal-title":"arXiv preprint arXiv 1607 06833"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875245"},{"journal-title":"The undecidability of the domino problem American Mathematical Soc","year":"1966","author":"berger","key":"ref49"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s001459900029"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611489"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018905100242"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1961.tb03975.x"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1148"},{"key":"ref42","first-page":"3453","article-title":"Efficient algorithms for conditional independence inference","volume":"11","author":"bouckaert","year":"2010","journal-title":"Journal of Machine Learning Research"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2010.01.011"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-111X(199801)13:1<83::AID-INT7>3.3.CO;2-F"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.06.005"}],"event":{"name":"2021 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2021,10,17]]},"location":"Kanazawa, Japan","end":{"date-parts":[[2021,10,21]]}},"container-title":["2021 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9611366\/9611357\/09611489.pdf?arnumber=9611489","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:52:05Z","timestamp":1652201525000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9611489\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,17]]},"references-count":52,"URL":"https:\/\/doi.org\/10.1109\/itw48936.2021.9611489","relation":{},"subject":[],"published":{"date-parts":[[2021,10,17]]}}}