{"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 (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":28,"of":28,"tagged_in_all":54,"items":[{"url":"/paper/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_unverified":0,"n_pointer_only":0}},{"url":"/paper/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","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":3,"n_unverified":7,"n_pointer_only":0}},{"url":"/paper/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","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_unverified":4,"n_pointer_only":0}},{"url":"/paper/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":1,"n_unverified":4,"n_pointer_only":0}},{"url":"/paper/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":0,"n_unverified":7,"n_pointer_only":0}},{"url":"/paper/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_unverified":1,"n_pointer_only":3}},{"url":"/paper/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","title":"Graph Generation with Diffusion Mixture","date":"2023-02-07","arxiv_id":"2302.03596","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_unverified":2,"n_pointer_only":4}},{"url":"/paper/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","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_unverified":1,"n_pointer_only":0}},{"url":"/paper/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","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":1,"n_unverified":12,"n_pointer_only":0}},{"url":"/paper/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","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","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","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_unverified":3,"n_pointer_only":6}},{"url":"/paper/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_unverified":9,"n_pointer_only":0}},{"url":"/paper/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","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","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","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","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","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":2,"n_unverified":4,"n_pointer_only":4}},{"url":"/paper/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":0,"n_unverified":17,"n_pointer_only":0}},{"url":"/paper/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","title":"Objective-Reinforced Generative Adversarial Networks (ORGAN) for Sequence Generation Models","date":"2017-05-30","arxiv_id":"1705.10843","repositories_listed":1,"syntology":null}],"syntology_records":13,"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"}}