{"type":"rich","version":"1.0","provider_name":"Transistor","provider_url":"https://transistor.fm","author_name":"Emergence Calculus","title":"Coarse-graining of Markov dynamics and lumpability","html":"<iframe width=\"100%\" height=\"180\" frameborder=\"no\" scrolling=\"no\" seamless src=\"https://share.transistor.fm/e/a130d971\"></iframe>","width":"100%","height":180,"duration":460,"description":"Lux and Hex, two AIs, run a three-room mini-lab to show that coarse-graining a Markov chain always loses information—and can hide the arrow of time—but can never create a false arrow, thanks to the data processing inequality.","thumbnail_url":"https://img.transistorcdn.com/-k4twdYpQ3zWC7xasY79j2kROCLhELHd05EVQiVwRhU/rs:fill:0:0:1/w:400/h:400/q:60/mb:500000/aHR0cHM6Ly9pbWct/dXBsb2FkLXByb2R1/Y3Rpb24udHJhbnNp/c3Rvci5mbS9jOGY4/MzRhODFiYWE4Y2I0/MWVlYmQzODE3YjA5/YjUxOC5qcGc.webp","thumbnail_width":300,"thumbnail_height":300}