{"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/safe","entry":"safe","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":5,"n_papers_ran":5,"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":2,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":1,"ran_draft_wrong":1,"ran_fixture":0,"ran":0,"unverified":0},"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":"2602.04119","paper":"/paper/arxiv-2602-04119","title":"Synthesizable Molecular Generation via Soft-constrained GFlowNets with Rich Chemical Priors","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"hyeonahkimm/s3gfn","path":"src/s3gfn/scoring_function.py","file_url":"https://github.com/hyeonahkimm/s3gfn/blob/HEAD/src/s3gfn/scoring_function.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1061c8464b631df1","mcp_get_code":{"code_sha256":"1061c8464b631df1"}},{"arxiv_id":"2506.06866","paper":"/paper/safe-finding-sparse-and-flat-minima-to","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","date":"2025-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"log-postech/safe-jax","path":"sparsify/safe.py","file_url":"https://github.com/log-postech/safe-jax/blob/HEAD/sparsify/safe.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"5c2d5462f95decf7","mcp_get_code":{"code_sha256":"5c2d5462f95decf7"}},{"arxiv_id":"2410.04542","paper":"/paper/generative-flows-on-synthetic-pathway-for","title":"Generative Flows on Synthetic Pathway for Drug Design","date":"2024-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SeonghwanSeo/RxnFlow","path":"scripts/examples/opt_mogfn.py","file_url":"https://github.com/SeonghwanSeo/RxnFlow/blob/HEAD/scripts/examples/opt_mogfn.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1061c8464b631df1","mcp_get_code":{"code_sha256":"1061c8464b631df1"}},{"arxiv_id":"2310.03223","paper":"/paper/tacogfn-target-conditioned-gflownet-for","title":"TacoGFN: Target-conditioned GFlowNet for Structure-based Drug Design","date":"2023-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"1061c8464b631df1","mcp_get_code":{"code_sha256":"1061c8464b631df1"}},{"arxiv_id":"2106.04399","paper":"/paper/flow-network-based-generative-models-for-non","title":"Flow Network based Generative Models for Non-Iterative Diverse Candidate Generation","date":"2021-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"1061c8464b631df1","mcp_get_code":{"code_sha256":"1061c8464b631df1"}}]}