{"url":"/task/multi-step-retrosynthesis","name":"Multi-step retrosynthesis","slug":"multi-step-retrosynthesis","description_markdown":"These leaderboards are used to track progress in Multi-step retrosynthesis.","categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":15,"papers_with_code":11,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":1,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/multi-step-retrosynthesis-on-uspto-190","slug":"multi-step-retrosynthesis-on-uspto-190","dataset":"USPTO-190","dataset_url":"/dataset/uspto-190","rows_in_archive":5,"metrics":["Success Rate (100 model calls)","Success Rate (500 model calls)"],"first_row_in_archive_order":{"model":"PDVN","paper_title":"Retrosynthetic Planning with Dual Value Networks","paper_url":"/paper/retrosynthetic-planning-with-dual-value","paper_date":"2023-01-31","arxiv_id":"2301.13755","code_links":[{"title":"DiXue98/PDVN","url":"https://github.com/DiXue98/PDVN"}],"syntology":{"n":8,"n_ran":4,"n_unverified":4,"n_pointer_only":8}}}],"datasets":[{"url":"/dataset/uspto-190","name":"USPTO-190","full_name":"","num_papers_in_archive":7}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":11,"of":11,"tagged_in_all":15,"items":[{"url":"/paper/directmultistep-direct-route-generation-for","title":"DirectMultiStep: Direct Route Generation for Multi-Step Retrosynthesis","date":"2024-05-22","arxiv_id":"2405.13983","repositories_listed":1,"syntology":null},{"url":"/paper/re-evaluating-retrosynthesis-algorithms-with","title":"Re-evaluating Retrosynthesis Algorithms with Syntheseus","date":"2023-10-30","arxiv_id":"2310.19796","repositories_listed":1,"syntology":null},{"url":"/paper/evolutionary-retrosynthetic-route-planning","title":"Evolutionary Retrosynthetic Route Planning","date":"2023-10-08","arxiv_id":"2310.05186","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_unverified":0,"n_pointer_only":5}},{"url":"/paper/retrobridge-modeling-retrosynthesis-with","title":"RetroBridge: Modeling Retrosynthesis with Markov Bridges","date":"2023-08-30","arxiv_id":"2308.16212","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_unverified":2,"n_pointer_only":8}},{"url":"/paper/retrosynthetic-planning-with-dual-value","title":"Retrosynthetic Planning with Dual Value Networks","date":"2023-01-31","arxiv_id":"2301.13755","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_unverified":4,"n_pointer_only":8}},{"url":"/paper/mechretro-is-a-chemical-mechanism-driven","title":"MechRetro is a chemical-mechanism-driven graph learning framework for interpretable retrosynthesis prediction and pathway planning","date":"2022-10-06","arxiv_id":"2210.02630","repositories_listed":1,"syntology":null},{"url":"/paper/metro-memory-enhanced-transformer-for","title":"FusionRetro: Molecule Representation Fusion via In-Context Learning for Retrosynthetic Planning","date":"2022-09-30","arxiv_id":"2209.15315","repositories_listed":1,"syntology":{"n":16,"n_ran":5,"n_unverified":11,"n_pointer_only":16}},{"url":"/paper/retrograph-retrosynthetic-planning-with-graph","title":"RetroGraph: Retrosynthetic Planning with Graph Search","date":"2022-06-23","arxiv_id":"2206.11477","repositories_listed":1,"syntology":null},{"url":"/paper/retrosynthetic-planning-with-experience","title":"Retrosynthetic Planning with Experience-Guided Monte Carlo Tree Search","date":"2021-12-11","arxiv_id":"2112.06028","repositories_listed":1,"syntology":{"n":4,"n_ran":0,"n_unverified":4,"n_pointer_only":0}},{"url":"/paper/self-improved-retrosynthetic-planning","title":"Self-Improved Retrosynthetic Planning","date":"2021-06-09","arxiv_id":"2106.04880","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_unverified":2,"n_pointer_only":0}},{"url":"/paper/retro-learning-retrosynthetic-planning-with","title":"Retro*: Learning Retrosynthetic Planning with Neural Guided A* Search","date":"2020-06-29","arxiv_id":"2006.15820","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":0}}],"syntology_records":7,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}