{"author_name":"Paper Radio","author_url":"https://montaan.com/","height":480,"html":"<iframe src=\"https://montaan.com/embed/episode/076e0da4-0ac7-4473-b2cf-8e39f58caea2\" width=\"1280\" height=\"480\" title=\"On the Approximability of Max-Cut on 3-Colorable Graphs and Graphs with Large Independent Sets — 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/076e0da4-0ac7-4473-b2cf-8e39f58caea2/episode.poster.webp","title":"On the Approximability of Max-Cut on 3-Colorable Graphs and Graphs with Large Independent Sets","type":"rich","version":"1.0","width":1280}