{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/atom-features","entry":"atom_features","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","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)"},"n_papers":6,"n_papers_ran":1,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":6,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":0,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":5},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2502.15805","paper":"/paper/fragfm-efficient-fragment-based-molecular","title":"FragFM: Hierarchical Framework for Efficient Molecule Generation via Fragment-Level Discrete Flow Matching","date":"2025-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wengong-jin/icml18-jtnn","path":"fast_jtnn/jtmpn.py","file_url":"https://github.com/wengong-jin/icml18-jtnn/blob/HEAD/fast_jtnn/jtmpn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ce9a23f3afe1e874","mcp_get_code":{"code_sha256":"ce9a23f3afe1e874"}},{"arxiv_id":"2502.15805","paper":"/paper/fragfm-efficient-fragment-based-molecular","title":"FragFM: Hierarchical Framework for Efficient Molecule Generation via Fragment-Level Discrete Flow Matching","date":"2025-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wengong-jin/icml18-jtnn","path":"fast_jtnn/mpn.py","file_url":"https://github.com/wengong-jin/icml18-jtnn/blob/HEAD/fast_jtnn/mpn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dd7d3d25a676ebb4","mcp_get_code":{"code_sha256":"dd7d3d25a676ebb4"}},{"arxiv_id":"2107.00096","paper":"/paper/improving-black-box-optimization-in-vae","title":"Improving black-box optimization in VAE latent space using decoder uncertainty","date":"2021-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pascalnotin/uncertainty_guided_optimization","path":"JTVAE/fast_jtnn/jtmpn.py","file_url":"https://github.com/pascalnotin/uncertainty_guided_optimization/blob/HEAD/JTVAE/fast_jtnn/jtmpn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8defa56cfba45b58","mcp_get_code":{"code_sha256":"8defa56cfba45b58"}},{"arxiv_id":"2010.03951","paper":"/paper/moldesigner-interactive-design-of-efficacious","title":"MolDesigner: Interactive Design of Efficacious Drugs with Deep Learning","date":"2020-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kexinhuang12345/DeepPurpose","path":"DeepPurpose/chemutils.py","file_url":"https://github.com/kexinhuang12345/DeepPurpose/blob/HEAD/DeepPurpose/chemutils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"e02b192caba1c5f2","mcp_get_code":{"code_sha256":"e02b192caba1c5f2"}},{"arxiv_id":"2006.07078","paper":"/paper/torsionnet-a-reinforcement-learning-approach","title":"TorsionNet: A Reinforcement Learning Approach to Sequential Conformer Search","date":"2020-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yashpatel5400/clean_idp_rl","path":"main/environments/graphenvironments.py","file_url":"https://github.com/yashpatel5400/clean_idp_rl/blob/HEAD/main/environments/graphenvironments.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"41cb8890a8451eca","mcp_get_code":{"code_sha256":"41cb8890a8451eca"}},{"arxiv_id":"1812.01070","paper":"/paper/learning-multimodal-graph-to-graph-1","title":"Learning Multimodal Graph-to-Graph Translation for Molecular Optimization","date":"2018-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wengong-jin/iclr19-graph2graph","path":"fast_jtnn/jtmpn.py","file_url":"https://github.com/wengong-jin/iclr19-graph2graph/blob/HEAD/fast_jtnn/jtmpn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ce9a23f3afe1e874","mcp_get_code":{"code_sha256":"ce9a23f3afe1e874"}},{"arxiv_id":"1509.09292","paper":"/paper/convolutional-networks-on-graphs-for-learning","title":"Convolutional Networks on Graphs for Learning Molecular Fingerprints","date":"2015-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"debbiemarkslab/neural-fingerprint-theano","path":"code/rdkit_preprocessing/neuralFingerprintUtils.py","file_url":"https://github.com/debbiemarkslab/neural-fingerprint-theano/blob/HEAD/code/rdkit_preprocessing/neuralFingerprintUtils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"66d057a80a5ece1c","mcp_get_code":{"code_sha256":"66d057a80a5ece1c"}}]}