{"author_name":"Paper Radio","author_url":"https://montaan.com/","height":480,"html":"<iframe src=\"https://montaan.com/embed/episode/ea9bea2a-ab67-4f31-92cf-4cef7d5c1b03\" width=\"1280\" height=\"480\" title=\"Towards sparse optimization over convex loops: Equivalence of Square Root Velocity distance and Wasserstein-Fisher-Rao — 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/ea9bea2a-ab67-4f31-92cf-4cef7d5c1b03/episode.poster.webp","title":"Towards sparse optimization over convex loops: Equivalence of Square Root Velocity distance and Wasserstein-Fisher-Rao","type":"rich","version":"1.0","width":1280}