{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T20:22:00Z","timestamp":1751660520369,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1109\/lics.2019.8785762","type":"proceedings-article","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T01:15:55Z","timestamp":1565054155000},"page":"1-13","source":"Crossref","is-referenced-by-count":1,"title":["Algorithmic barriers to representing conditional independence"],"prefix":"10.1109","author":[{"given":"Nathanael L.","family":"Ackerman","sequence":"first","affiliation":[]},{"given":"Jeremy","family":"Avigad","sequence":"additional","affiliation":[]},{"given":"Cameron E.","family":"Freer","sequence":"additional","affiliation":[]},{"given":"Daniel M.","family":"Roy","sequence":"additional","affiliation":[]},{"given":"Jason M.","family":"Rute","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"318","article-title":"Computing over the reals: foundations for scientific computing","volume":"53","author":"braverman","year":"2006","journal-title":"Notices Amer Math Soc"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2008.12.009"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.2178\/bsl\/1294186663"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0047-259X(81)90099-3"},{"journal-title":"Relations on probability spaces and arrays of random variables","year":"1979","author":"hoover","key":"ref15"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"15","DOI":"10.3233\/COM-13015","article-title":"L1-computability, layerwise computability and Solovay reducibility","volume":"2","author":"miyabe","year":"2013","journal-title":"Computability"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021692202530"},{"key":"ref18","volume":"4","author":"janson","year":"2013","journal-title":"Graphons cut norm and distance couplings and rearrangements ser New York J Math Monographs"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1214\/08-PS124"},{"key":"ref4","first-page":"220","article-title":"Church: A language for generative models","author":"goodman","year":"2008","journal-title":"Proc Conf on Uncertainty in Artificial Intelligence (UAI 2008)"},{"key":"ref3","first-page":"141: 1","article-title":"The Beta-Bernoulli process and algebraic effects","volume":"107","author":"staton","year":"2018","journal-title":"45th Int Colloq Automata Languages and Programming (ICALP 2018)"},{"key":"ref6","article-title":"On computable representations of exchangeable data","author":"ackerman","year":"2017","journal-title":"Workshop on Probabilistic Programming Semantics (PPS 2017)"},{"journal-title":"Venture a higher-order probabilistic programming platform with programmable inference","year":"2014","author":"mansinghka","key":"ref5"},{"key":"ref8","volume":"60","author":"lovasz","year":"2012","journal-title":"Large Networks and Graph Limits"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2011.06.011"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2593882.2593900"},{"journal-title":"Bayesian Data Analysis","year":"2014","author":"gelman","key":"ref1"},{"journal-title":"Probabilistic Symmetries and Invariance Principles","year":"2005","author":"kallenberg","key":"ref9"},{"key":"ref20","first-page":"33","article-title":"Graph limits and exchangeable random graphs","volume":"28","author":"diaconis","year":"2008","journal-title":"Rend Mat Appl (7)"},{"journal-title":"On coprime percolation the visibility graphon and the local limit of the GCD profile","year":"2018","author":"martineau","key":"ref21"}],"event":{"name":"2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2019,6,24]]},"location":"Vancouver, BC, Canada","end":{"date-parts":[[2019,6,27]]}},"container-title":["2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8765678\/8785654\/08785762.pdf?arnumber=8785762","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T20:20:37Z","timestamp":1658262037000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8785762\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/lics.2019.8785762","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}