{"author_name":"Paper Radio","author_url":"https://montaan.com/","height":720,"html":"<iframe src=\"https://montaan.com/embed/video/b89f859f-8474-4952-a851-8f703cefda50\" width=\"1280\" height=\"720\" title=\"On the Approximation Complexity of Matrix Product Operator (MPO) Born Machines — 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/b89f859f-8474-4952-a851-8f703cefda50/episode.poster.webp","title":"On the Approximation Complexity of Matrix Product Operator (MPO) Born Machines","type":"video","version":"1.0","width":1280}