{"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/molecular-graph-generation","name":"Molecular Graph Generation","slug":"molecular-graph-generation","description_markdown":null,"categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":54,"papers_with_code":28,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"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":3,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/zinc","name":"ZINC","full_name":"ZINC","num_papers_in_archive":251},{"url":"/dataset/moses","name":"MOSES","full_name":"Molecular sets (MOSES)","num_papers_in_archive":79},{"url":"/dataset/qm9","name":"QM9","full_name":"","num_papers_in_archive":76}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":54,"of":54,"of_with_code":28,"tagged_in_all":54,"counts":{"archive_papers_tagged":54,"with_a_code_link":28,"where_syntology_ran_a_sample":14,"not_listed_spam_title":0,"listed":54,"listed_where_code_ran":14,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":11,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":11,"listed_every_run_a_failure_of_syntologys_instrument":3,"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"},"items":[{"url":"/paper/junction-tree-variational-autoencoder-for","slug":"junction-tree-variational-autoencoder-for","title":"Junction Tree Variational Autoencoder for Molecular Graph Generation","date":"2018-02-12","arxiv_id":"1802.04364","repositories_listed":11,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/junction-tree-variational-autoencoder-for#ran","syntology_url":"https://syntology.ai/paper/1802.04364","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.04364"}},"official":{"repos":["wengong-jin/icml18-jtnn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/optimization-of-molecules-via-deep","slug":"optimization-of-molecules-via-deep","title":"Optimization of Molecules via Deep Reinforcement Learning","date":"2018-10-19","arxiv_id":"1810.08678","repositories_listed":7,"syntology":null},{"url":"/paper/geometry-complete-diffusion-for-3d-molecule","slug":"geometry-complete-diffusion-for-3d-molecule","title":"Geometry-Complete Diffusion for 3D Molecule Generation and Optimization","date":"2023-02-08","arxiv_id":"2302.04313","repositories_listed":3,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/geometry-complete-diffusion-for-3d-molecule#ran","syntology_url":"https://syntology.ai/paper/2302.04313","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.04313"}},"official":{"repos":["bioinfomachinelearning/bio-diffusion","bioinfomachinelearning/gcdm-sbdd"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/fastflows-flow-based-models-for-molecular","slug":"fastflows-flow-based-models-for-molecular","title":"FastFlows: Flow-Based Models for Molecular Graph Generation","date":"2022-01-28","arxiv_id":"2201.12419","repositories_listed":3,"syntology":null},{"url":"/paper/graphpiece-efficiently-generating-high","slug":"graphpiece-efficiently-generating-high","title":"Molecule Generation by Principal Subgraph Mining and Assembling","date":"2021-06-29","arxiv_id":"2106.15098","repositories_listed":3,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 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; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/graphpiece-efficiently-generating-high#ran","syntology_url":"https://syntology.ai/paper/2106.15098","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.15098"}},"official":{"repos":["kxz18/gp-vae","thunlp-mt/ps-vae"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/graphnvp-an-invertible-flow-model-for","slug":"graphnvp-an-invertible-flow-model-for","title":"GraphNVP: An Invertible Flow Model for Generating Molecular Graphs","date":"2019-05-28","arxiv_id":"1905.11600","repositories_listed":3,"syntology":{"n":5,"n_ran":5,"n_constructed":1,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graphnvp-an-invertible-flow-model-for#ran","syntology_url":"https://syntology.ai/paper/1905.11600","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11600"}},"official":{"repos":["pfnet-research/chainer-chemistry"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/molecular-sets-moses-a-benchmarking-platform","slug":"molecular-sets-moses-a-benchmarking-platform","title":"Molecular Sets (MOSES): A Benchmarking Platform for Molecular Generation Models","date":"2018-11-29","arxiv_id":"1811.12823","repositories_listed":3,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/molecular-sets-moses-a-benchmarking-platform#ran","syntology_url":"https://syntology.ai/paper/1811.12823","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.12823"}},"official":{"repos":["molecularsets/moses"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-joint-2d-3d-diffusion-models-for","slug":"learning-joint-2d-3d-diffusion-models-for","title":"Learning Joint 2D & 3D Diffusion Models for Complete Molecule Generation","date":"2023-05-21","arxiv_id":"2305.12347","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-joint-2d-3d-diffusion-models-for#ran","syntology_url":"https://syntology.ai/paper/2305.12347","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.12347"}},"official":{"repos":["graph-0/jodo"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/target-specific-de-novo-design-of-drug","slug":"target-specific-de-novo-design-of-drug","title":"Target Specific De Novo Design of Drug Candidate Molecules with Graph Transformer-based Generative Adversarial Networks","date":"2023-02-15","arxiv_id":"2302.07868","repositories_listed":2,"syntology":null},{"url":"/paper/graph-generation-with-destination-driven","slug":"graph-generation-with-destination-driven","title":"Graph Generation with Diffusion Mixture","date":"2023-02-07","arxiv_id":"2302.03596","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/graph-generation-with-destination-driven#ran","syntology_url":"https://syntology.ai/paper/2302.03596","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.03596"}},"official":{"repos":["harryjo97/drum","harryjo97/grum"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/high-dimensional-bayesian-optimisation-with","slug":"high-dimensional-bayesian-optimisation-with","title":"High-Dimensional Bayesian Optimisation with Variational Autoencoders and Deep Metric Learning","date":"2021-06-07","arxiv_id":"2106.03609","repositories_listed":2,"syntology":null},{"url":"/paper/moflow-an-invertible-flow-model-for","slug":"moflow-an-invertible-flow-model-for","title":"MoFlow: An Invertible Flow Model for Generating Molecular Graphs","date":"2020-06-17","arxiv_id":"2006.10137","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/moflow-an-invertible-flow-model-for#ran","syntology_url":"https://syntology.ai/paper/2006.10137","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.10137"}},"official":{"repos":["calvin-zcx/moflow"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/molecularrnn-generating-realistic-molecular","slug":"molecularrnn-generating-realistic-molecular","title":"MolecularRNN: Generating realistic molecular graphs with optimized properties","date":"2019-05-31","arxiv_id":"1905.13372","repositories_listed":2,"syntology":null},{"url":"/paper/graph-convolutional-policy-network-for-goal","slug":"graph-convolutional-policy-network-for-goal","title":"Graph Convolutional Policy Network for Goal-Directed Molecular Graph Generation","date":"2018-06-07","arxiv_id":"1806.02473","repositories_listed":2,"syntology":{"n":13,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":5,"phrase":"6 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; 1 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/graph-convolutional-policy-network-for-goal#ran","syntology_url":"https://syntology.ai/paper/1806.02473","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.02473"}},"official":{"repos":["bowenliu16/rl_graph_generation"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/instruction-based-molecular-graph-generation","slug":"instruction-based-molecular-graph-generation","title":"Instruction-Based Molecular Graph Generation with Unified Text-Graph Diffusion Model","date":"2024-08-19","arxiv_id":"2408.09896","repositories_listed":1,"syntology":null},{"url":"/paper/graphspns-sum-product-networks-benefit-from","slug":"graphspns-sum-product-networks-benefit-from","title":"GraphSPNs: Sum-Product Networks Benefit From Canonical Orderings","date":"2024-08-18","arxiv_id":"2408.09451","repositories_listed":1,"syntology":null},{"url":"/paper/3m-diffusion-latent-multi-modal-diffusion-for","slug":"3m-diffusion-latent-multi-modal-diffusion-for","title":"3M-Diffusion: Latent Multi-Modal Diffusion for Language-Guided Molecular Structure Generation","date":"2024-03-11","arxiv_id":"2403.07179","repositories_listed":1,"syntology":null},{"url":"/paper/a-simple-and-scalable-representation-for","slug":"a-simple-and-scalable-representation-for","title":"A Simple and Scalable Representation for Graph Generation","date":"2023-12-04","arxiv_id":"2312.02230","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":6,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/a-simple-and-scalable-representation-for#ran","syntology_url":"https://syntology.ai/paper/2312.02230","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.02230"}},"official":{"repos":["yunhuijang/geel"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/molhf-a-hierarchical-normalizing-flow-for","slug":"molhf-a-hierarchical-normalizing-flow-for","title":"MolHF: A Hierarchical Normalizing Flow for Molecular Graph Generation","date":"2023-05-15","arxiv_id":"2305.08457","repositories_listed":1,"syntology":{"n":23,"n_ran":14,"n_constructed":7,"n_ran_checked":12,"n_instrument":2,"n_unverified":9,"n_honours":1,"n_violates":1,"n_no_contract":10,"n_pointer_only":0,"phrase":"14 ran (of which 7 constructed an object rather than computing a result; 12 with no instrument failure: 1 honoured, 1 violated, 10 with no contract checked; 2 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/molhf-a-hierarchical-normalizing-flow-for#ran","syntology_url":"https://syntology.ai/paper/2305.08457","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.08457"}},"official":{"repos":["violet-sto/molhf"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":7,"n_ran_no_instrument_failure":12,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/conditional-diffusion-based-on-discrete-graph","slug":"conditional-diffusion-based-on-discrete-graph","title":"Conditional Diffusion Based on Discrete Graph Structures for Molecular Graph Generation","date":"2023-01-01","arxiv_id":"2301.00427","repositories_listed":1,"syntology":null},{"url":"/paper/hyfactor-hydrogen-count-labelled-graph-based","slug":"hyfactor-hydrogen-count-labelled-graph-based","title":"HyFactor: Hydrogen-count labelled graph-based defactorization Autoencoder","date":"2021-12-06","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/mars-markov-molecular-sampling-for-multi-1","slug":"mars-markov-molecular-sampling-for-multi-1","title":"MARS: Markov Molecular Sampling for Multi-objective Drug Discovery","date":"2021-03-18","arxiv_id":"2103.10432","repositories_listed":1,"syntology":null},{"url":"/paper/graphebm-molecular-graph-generation-with","slug":"graphebm-molecular-graph-generation-with","title":"GraphEBM: Molecular Graph Generation with Energy-Based Models","date":"2021-01-31","arxiv_id":"2102.00546","repositories_listed":1,"syntology":null},{"url":"/paper/reinforced-molecular-optimization-with-1","slug":"reinforced-molecular-optimization-with-1","title":"Reinforced Molecular Optimization with Neighborhood-Controlled Grammars","date":"2020-11-14","arxiv_id":"2011.07225","repositories_listed":1,"syntology":null},{"url":"/paper/sample-efficient-optimization-in-the-latent","slug":"sample-efficient-optimization-in-the-latent","title":"Sample-Efficient Optimization in the Latent Space of Deep Generative Models via Weighted Retraining","date":"2020-06-16","arxiv_id":"2006.09191","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/sample-efficient-optimization-in-the-latent#ran","syntology_url":"https://syntology.ai/paper/2006.09191","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.09191"}},"official":{"repos":["cambridge-mlg/weighted-retraining"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/the-general-theory-of-permutation-equivarant","slug":"the-general-theory-of-permutation-equivarant","title":"The general theory of permutation equivarant neural networks and higher order graph variational encoders","date":"2020-04-08","arxiv_id":"2004.03990","repositories_listed":1,"syntology":{"n":17,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/the-general-theory-of-permutation-equivarant#ran","syntology_url":"https://syntology.ai/paper/2004.03990","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.03990"}},"official":null}},{"url":"/paper/graphaf-a-flow-based-autoregressive-model-for-1","slug":"graphaf-a-flow-based-autoregressive-model-for-1","title":"GraphAF: a Flow-based Autoregressive Model for Molecular Graph Generation","date":"2020-01-26","arxiv_id":"2001.09382","repositories_listed":1,"syntology":null},{"url":"/paper/objective-reinforced-generative-adversarial","slug":"objective-reinforced-generative-adversarial","title":"Objective-Reinforced Generative Adversarial Networks (ORGAN) for Sequence Generation Models","date":"2017-05-30","arxiv_id":"1705.10843","repositories_listed":1,"syntology":null},{"url":null,"slug":"pretraining-generative-flow-networks-with","title":"Pretraining Generative Flow Networks with Inexpensive Rewards for Molecular Graph Generation","date":"2025-03-08","arxiv_id":"2503.06337","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-order-autoregressive-models-with","title":"Learning-Order Autoregressive Models with Application to Molecular Graph Generation","date":"2025-03-07","arxiv_id":"2503.05979","repositories_listed":0,"syntology":null},{"url":"/paper/fragfm-efficient-fragment-based-molecular","slug":"fragfm-efficient-fragment-based-molecular","title":"FragFM: Hierarchical Framework for Efficient Molecule Generation via Fragment-Level Discrete Flow Matching","date":"2025-02-19","arxiv_id":"2502.15805","repositories_listed":0,"syntology":{"n":14,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/fragfm-efficient-fragment-based-molecular#ran","syntology_url":"https://syntology.ai/paper/2502.15805","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.15805"}},"official":null}},{"url":null,"slug":"flatten-graphs-as-sequences-transformers-are","title":"Flatten Graphs as Sequences: Transformers are Scalable Graph Generators","date":"2025-02-04","arxiv_id":"2502.02216","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-molecular-graph-generation-with","title":"Improving Molecular Graph Generation with Flow Matching and Optimal Transport","date":"2024-11-08","arxiv_id":"2411.05676","repositories_listed":0,"syntology":null},{"url":null,"slug":"guise-graph-gaussian-shading-watermark","title":"GUISE: Graph GaUssIan Shading watErmark","date":"2024-10-14","arxiv_id":"2410.10178","repositories_listed":0,"syntology":null},{"url":null,"slug":"training-free-guidance-for-discrete-diffusion","title":"Training-Free Guidance for Discrete Diffusion Models for Molecular Generation","date":"2024-09-11","arxiv_id":"2409.07359","repositories_listed":0,"syntology":null},{"url":null,"slug":"lift-your-molecules-molecular-graph","title":"Lift Your Molecules: Molecular Graph Generation in Latent Euclidean Space","date":"2024-06-15","arxiv_id":"2406.10513","repositories_listed":0,"syntology":null},{"url":null,"slug":"overcoming-order-in-autoregressive-graph","title":"Overcoming Order in Autoregressive Graph Generation","date":"2024-02-04","arxiv_id":"2402.03387","repositories_listed":0,"syntology":null},{"url":null,"slug":"will-more-expressive-graph-neural-networks-do","title":"Will More Expressive Graph Neural Networks do Better on Generative Tasks?","date":"2023-08-23","arxiv_id":"2308.11978","repositories_listed":0,"syntology":null},{"url":null,"slug":"molecular-graph-generation-by-decomposition","title":"Molecular Graph Generation by Decomposition and Reassembling","date":"2022-12-11","arxiv_id":"2302.00587","repositories_listed":0,"syntology":null},{"url":null,"slug":"conditional-b-vae-for-de-novo-molecular","title":"Conditional β-VAE for De Novo Molecular Generation","date":"2022-05-02","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"interpretable-molecular-graph-generation-via","title":"Interpretable Molecular Graph Generation via Monotonic Constraints","date":"2022-02-28","arxiv_id":"2203.00412","repositories_listed":0,"syntology":null},{"url":null,"slug":"target-aware-molecular-graph-generation","title":"Target-aware Molecular Graph Generation","date":"2022-02-10","arxiv_id":"2202.04829","repositories_listed":0,"syntology":null},{"url":null,"slug":"molecular-graph-generation-via-geometric-1","title":"Molecular Graph Generation via Geometric Scattering","date":"2021-10-12","arxiv_id":"2110.06241","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphebm-towards-permutation-invariant-and","title":"GraphEBM: Towards Permutation Invariant and Multi-Objective Molecular Graph Generation","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"spanning-tree-based-graph-generation-for","title":"Spanning Tree-based Graph Generation for Molecules","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"realistic-molecule-optimization-on-a-learned","title":"Realistic molecule optimization on a learned graph manifold","date":"2021-06-03","arxiv_id":"2106.13318","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-energy-based-model-for-molecular-graph","title":"Graph Energy-based Model for Molecular Graph Generation","date":"2021-02-26","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graphdf-a-discrete-flow-model-for-molecular","title":"GraphDF: A Discrete Flow Model for Molecular Graph Generation","date":"2021-02-01","arxiv_id":"2102.01189","repositories_listed":0,"syntology":null},{"url":null,"slug":"molecular-graph-generation-with-graph-neural","title":"Molecular graph generation with Graph Neural Networks","date":"2020-12-14","arxiv_id":"2012.07397","repositories_listed":0,"syntology":null},{"url":null,"slug":"molecular-inverse-design-platform-for","title":"Molecular Inverse-Design Platform for Material Industries","date":"2020-04-24","arxiv_id":"2004.11521","repositories_listed":0,"syntology":null},{"url":null,"slug":"black-box-recursive-translations-for-1","title":"Black Box Recursive Translations for Molecular Optimization","date":"2019-12-21","arxiv_id":"1912.10156","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-residual-flow-for-molecular-graph","title":"Graph Residual Flow for Molecular Graph Generation","date":"2019-09-30","arxiv_id":"1909.13521","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphnvp-an-invertible-flow-based-model-for","title":"GraphNVP: an Invertible Flow-based Model for Generating Molecular Graphs","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/all-smiles-vae","slug":"all-smiles-vae","title":"All SMILES Variational Autoencoder","date":"2019-05-30","arxiv_id":"1905.13343","repositories_listed":0,"syntology":null}],"syntology_records":14,"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"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":14,"papers_where_code_ran_first_page":"/task/molecular-graph-generation/papers/ran/1","papers_where_code_ran_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.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/molecular-graph-generation/papers/ran/1","json":"/task/molecular-graph-generation/papers/ran/1.json","rows":14}],"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-10-05T00:36:11+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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"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"},"record_sha256":"d695842bec4a09dedc61a103fed3ad74680d3c41c94d6e6d9ef8983a31334159","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}