{"author_name":"Paper Radio","author_url":"https://montaan.com/","height":480,"html":"<iframe src=\"https://montaan.com/embed/episode/7a80c627-4263-4572-9fa2-f52b51cfc81c\" width=\"1280\" height=\"480\" title=\"A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization — 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/7a80c627-4263-4572-9fa2-f52b51cfc81c/episode.poster.webp","title":"A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization","type":"rich","version":"1.0","width":1280}