{"author_name":"Paper Radio","author_url":"https://montaan.com/","height":480,"html":"<iframe src=\"https://montaan.com/embed/episode/a6d0e949-483a-4e71-b79f-2c99db7aacc1\" width=\"1280\" height=\"480\" title=\"A Near-Optimal Generalized Sorting Algorithm — 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/a6d0e949-483a-4e71-b79f-2c99db7aacc1/episode.poster.webp","title":"A Near-Optimal Generalized Sorting Algorithm","type":"rich","version":"1.0","width":1280}