{"author_name":"Paper Radio","author_url":"https://montaan.com/","height":480,"html":"<iframe src=\"https://montaan.com/embed/episode/f172b987-2cee-44bd-8c49-369db2bb341e\" width=\"1280\" height=\"480\" title=\"Optimal analysis of Greedy for stochastic online Euclidean matching: flat torus to the rescue — 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/f172b987-2cee-44bd-8c49-369db2bb341e/episode.poster.webp","title":"Optimal analysis of Greedy for stochastic online Euclidean matching: flat torus to the rescue","type":"rich","version":"1.0","width":1280}