{"author_name":"Paper Radio","author_url":"https://m.montaan.com/","height":720,"html":"<iframe src=\"https://m.montaan.com/embed/video/34052bf0-1e51-471a-8690-bd3c3509985a\" width=\"1280\" height=\"720\" title=\"MechMath: Sorrifier-Driven Formal Decomposition Workflow for Automated Theorem Proving — 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://m.montaan.com/","thumbnail_url":"https://m.montaan.com/media/episodes/34052bf0-1e51-471a-8690-bd3c3509985a/episode.poster.webp","title":"MechMath: Sorrifier-Driven Formal Decomposition Workflow for Automated Theorem Proving","type":"video","version":"1.0","width":1280}