{"author_name":"Paper Radio","author_url":"https://montaan.com/","height":480,"html":"<iframe src=\"https://montaan.com/embed/episode/40b0e93c-12b8-47eb-bd3c-363088fd7954\" width=\"1280\" height=\"480\" title=\"On the Minimal Controllability of Boolean Networks With k-Regular Dependency Graphs — Paper Radio\" frameborder=\"0\" allow=\"autoplay; fullscreen; picture-in-picture\" allowfullscreen loading=\"lazy\" style=\"border:0;display:block;max-width:100%;\"></iframe>","provider_name":"Paper Radio","provider_url":"https://montaan.com/","thumbnail_url":"https://montaan.com/media/episodes/40b0e93c-12b8-47eb-bd3c-363088fd7954/episode.poster.webp","title":"On the Minimal Controllability of Boolean Networks With k-Regular Dependency Graphs","type":"rich","version":"1.0","width":1280}