{"author_name":"Paper Radio","author_url":"https://m.montaan.com/","height":720,"html":"<iframe src=\"https://m.montaan.com/embed/video/007c6b0b-5b1e-4e5d-bd8e-9327ede4ef16\" width=\"1280\" height=\"720\" title=\"A gentle tutorial on Bock&#39;s algorithm for minimum directed spanning trees with a structured reformulation — 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://m.montaan.com/","thumbnail_url":"https://m.montaan.com/media/episodes/007c6b0b-5b1e-4e5d-bd8e-9327ede4ef16/episode.poster.webp","title":"A gentle tutorial on Bock's algorithm for minimum directed spanning trees with a structured reformulation","type":"video","version":"1.0","width":1280}