{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/mars-a-motif-based-autoregressive-model-for","title":"MARS: A Motif-based Autoregressive Model for Retrosynthesis Prediction","arxiv_id":"2209.13178","date":"2022-09-27","proceeding":null,"authors":["Jiahan Liu","Chaochao Yan","Yang Yu","Chan Lu","Junzhou Huang","Le Ou-Yang","Peilin Zhao"],"abstract":"Retrosynthesis is a major task for drug discovery. It is formulated as a graph-generating problem by many existing approaches. Specifically, these methods firstly identify the reaction center, and break target molecule accordingly to generate synthons. Reactants are generated by either adding atoms sequentially to synthon graphs or directly adding proper leaving groups. However, both two strategies suffer since adding atoms results in a long prediction sequence which increases generation difficulty, while adding leaving groups can only consider the ones in the training set which results in poor generalization. In this paper, we propose a novel end-to-end graph generation model for retrosynthesis prediction, which sequentially identifies the reaction center, generates the synthons, and adds motifs to the synthons to generate reactants. Since chemically meaningful motifs are bigger than atoms and smaller than leaving groups, our method enjoys lower prediction complexity than adding atoms and better generalization than adding leaving groups. Experiments on a benchmark dataset show that the proposed model significantly outperforms previous state-of-the-art algorithms.","url_abs":"https://arxiv.org/abs/2209.13178v1","url_pdf":"https://arxiv.org/pdf/2209.13178v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[],"tasks":[{"task_slug":"drug-discovery","task_name":"Drug Discovery"},{"task_slug":"graph-generation","task_name":"Graph Generation"},{"task_slug":"prediction","task_name":"Prediction"},{"task_slug":"retrosynthesis","task_name":"Retrosynthesis"},{"task_slug":"single-step-retrosynthesis","task_name":"Single-step retrosynthesis"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/single-step-retrosynthesis-on-uspto-50k","task":"Single-step retrosynthesis","dataset":"USPTO-50k","model":"MARS (reaction class as prior)","rank_in_archive_order":3,"of":35,"metrics":{"Top-1 accuracy":"66.2","Top-10 accuracy":"92.9","Top-3 accuracy":"85.8","Top-5 accuracy":"90.2"},"uses_additional_data":false},{"leaderboard":"/sota/single-step-retrosynthesis-on-uspto-50k","task":"Single-step retrosynthesis","dataset":"USPTO-50k","model":"MARS (reaction class unknown)","rank_in_archive_order":15,"of":35,"metrics":{"Top-1 accuracy":"54.6","Top-10 accuracy":"88.5","Top-3 accuracy":"76.4","Top-5 accuracy":"83.3"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2209.13178","atlas_url":"https://app.syntology.ai/?focus=2209.13178","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2209.13178"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2209.13178\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2209.13178"},"call":"get_concepts_for_paper(arxiv_id=\"2209.13178\")"}],"by_repo":[],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"7316c09138146855334f5babc039a350c97b24021fb19c9f1adf088aec2ae813","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}