{"author_name":"Paper Radio","author_url":"https://m.montaan.com/","height":720,"html":"<iframe src=\"https://m.montaan.com/embed/video/3de46fb4-cb9a-4856-b3e8-2526ecce84f4\" width=\"1280\" height=\"720\" title=\"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference) — 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/3de46fb4-cb9a-4856-b3e8-2526ecce84f4/episode.poster.webp","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","type":"video","version":"1.0","width":1280}