{"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/constrained-graph-variational-autoencoders","title":"Constrained Graph Variational Autoencoders for Molecule Design","arxiv_id":"1805.09076","date":"2018-05-23","proceeding":"NeurIPS 2018 12","authors":["Qi Liu","Miltiadis Allamanis","Marc Brockschmidt","Alexander L. Gaunt"],"abstract":"Graphs are ubiquitous data structures for representing interactions between\nentities. With an emphasis on the use of graphs to represent chemical\nmolecules, we explore the task of learning to generate graphs that conform to a\ndistribution observed in training data. We propose a variational autoencoder\nmodel in which both encoder and decoder are graph-structured. Our decoder\nassumes a sequential ordering of graph extension steps and we discuss and\nanalyze design choices that mitigate the potential downsides of this\nlinearization. Experiments compare our approach with a wide range of baselines\non the molecule generation task and show that our method is more successful at\nmatching the statistics of the original dataset on semantically important\nmetrics. Furthermore, we show that by using appropriate shaping of the latent\nspace, our model allows us to design molecules that are (locally) optimal in\ndesired properties.","url_abs":"http://arxiv.org/abs/1805.09076v2","url_pdf":"http://arxiv.org/pdf/1805.09076v2.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":[{"paper_slug":"constrained-graph-variational-autoencoders","repo_url":"https://github.com/Microsoft/constrained-graph-variational-autoencoder","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"decoder","task_name":"Decoder"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1805.09076","atlas_url":"https://app.syntology.ai/?focus=1805.09076","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":"1805.09076"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1805.09076\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1805.09076"},"call":"get_concepts_for_paper(arxiv_id=\"1805.09076\")"}],"by_repo":[{"repo":"Microsoft/constrained-graph-variational-autoencoder","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1809.02630"],"harvested_for_calls":[{"arxiv_id":"1809.02630","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1809.02630"},"call":"get_harvested_code_for_paper(arxiv_id=\"1809.02630\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"bf6343aed70c7f2bcae8483fd6d7b5b1e37ed7351f191079d392267bd2f01440","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}