{"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":"/task/single-step-retrosynthesis/papers/ran/1","list_of":"/task/single-step-retrosynthesis","task":"Single-step retrosynthesis","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,7],"of":7,"counts":{"archive_papers_tagged":34,"with_a_code_link":22,"where_syntology_ran_a_sample":7,"not_listed_spam_title":0,"listed":34,"listed_where_code_ran":7,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":6,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":6,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/single-step-retrosynthesis/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/node-aligned-graph-to-graph-generation-for","slug":"node-aligned-graph-to-graph-generation-for","title":"Node-Aligned Graph-to-Graph (NAG2G): Elevating Template-Free Deep Learning Approaches in Single-Step Retrosynthesis","date":"2023-09-27","arxiv_id":"2309.15798","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/node-aligned-graph-to-graph-generation-for#ran","syntology_url":"https://syntology.ai/paper/2309.15798","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.15798"}},"official":{"repos":["dptech-corp/nag2g"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/retrobridge-modeling-retrosynthesis-with","slug":"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_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":8,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/retrobridge-modeling-retrosynthesis-with#ran","syntology_url":"https://syntology.ai/paper/2308.16212","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.16212"}},"official":{"repos":["igashov/retrobridge"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/metro-memory-enhanced-transformer-for","slug":"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_constructed":3,"n_ran_checked":3,"n_instrument":2,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":16,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/metro-memory-enhanced-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2209.15315","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.15315"}},"official":{"repos":["songtaoliu0823/fusionretro"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":11,"ran_from_kinds":["official"]}}},{"url":"/paper/root-aligned-smiles-for-molecular","slug":"root-aligned-smiles-for-molecular","title":"Root-aligned SMILES: A Tight Representation for Chemical Reaction Prediction","date":"2022-03-22","arxiv_id":"2203.11444","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/root-aligned-smiles-for-molecular#ran","syntology_url":"https://syntology.ai/paper/2203.11444","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.11444"}},"official":{"repos":["otori-bird/retrosynthesis"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/permutation-invariant-graph-to-sequence-model-1","slug":"permutation-invariant-graph-to-sequence-model-1","title":"Permutation invariant graph-to-sequence model for template-free retrosynthesis and reaction prediction","date":"2021-10-19","arxiv_id":"2110.09681","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/permutation-invariant-graph-to-sequence-model-1#ran","syntology_url":"https://syntology.ai/paper/2110.09681","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.09681"}},"official":{"repos":["coleygroup/graph2smiles"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/molecule-edit-graph-attention-network","slug":"molecule-edit-graph-attention-network","title":"Molecule Edit Graph Attention Network: Modeling Chemical Reactions as Sequences of Graph Edits","date":"2020-06-27","arxiv_id":"2006.15426","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/molecule-edit-graph-attention-network#ran","syntology_url":"https://syntology.ai/paper/2006.15426","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.15426"}},"official":{"repos":["molecule-one/megan"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/retrosynthesis-prediction-with-conditional-1","slug":"retrosynthesis-prediction-with-conditional-1","title":"Retrosynthesis Prediction with Conditional Graph Logic Network","date":"2020-01-06","arxiv_id":"2001.01408","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/retrosynthesis-prediction-with-conditional-1#ran","syntology_url":"https://syntology.ai/paper/2001.01408","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.01408"}},"official":{"repos":["Hanjun-Dai/GLN"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}}],"record_sha256":"00fbf1f48054bf9f3ae0e0a57d3503eb1f7bb63ba637cbb9382c040573e7c199","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}