{"author_name":"Paper Radio","author_url":"https://montaan.com/","height":480,"html":"<iframe src=\"https://montaan.com/embed/episode/c7d81450-761c-4373-8306-2bada6d3cdbc\" width=\"1280\" height=\"480\" title=\"An improved minimum degree threshold for fractional clique decompositions in partite 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/c7d81450-761c-4373-8306-2bada6d3cdbc/episode.poster.webp","title":"An improved minimum degree threshold for fractional clique decompositions in partite graphs","type":"rich","version":"1.0","width":1280}