{"author_name":"Paper Radio","author_url":"https://montaan.com/","height":720,"html":"<iframe src=\"https://montaan.com/embed/video/5d79c444-a066-4bc1-8df6-5daf2005a4c7\" width=\"1280\" height=\"720\" title=\"On the Computational Complexity of Hidden Markov Model Identification — 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/5d79c444-a066-4bc1-8df6-5daf2005a4c7/episode.poster.webp","title":"On the Computational Complexity of Hidden Markov Model Identification","type":"video","version":"1.0","width":1280}