{"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/papers/ran/1","list_of":"/task/molecular-graph-generation","task":"Molecular Graph Generation","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,14],"of":14,"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"},"first_page":"/task/molecular-graph-generation/papers/ran/1","prev":null,"next":null,"papers":[{"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":"/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":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"phrase":"3 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; 0 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":3,"n_unverified":3,"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/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/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":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 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":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"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/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/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/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/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/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":6,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":5,"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) · 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":6,"n_unverified":7,"ran_from_kinds":["official"]}}},{"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"]}}}],"record_sha256":"6c6e07a792d4348a6bca6d624443a7ddc947eb7d859a16efe5278b7f0356d170","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}