{"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/mols2batch","entry":"mols2batch","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":0,"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":3,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":3},"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":"2510.00805","paper":"/paper/arxiv-2510-00805","title":"Planning-Augmented Sampling with Early Guidance for High-Reward Discovery","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"ZRNB/PLUS","path":"mols/model_atom.py","file_url":"https://github.com/ZRNB/PLUS/blob/HEAD/mols/model_atom.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"06477cbf36090384","mcp_get_code":{"code_sha256":"06477cbf36090384"}},{"arxiv_id":"2510.00805","paper":"/paper/arxiv-2510-00805","title":"Planning-Augmented Sampling with Early Guidance for High-Reward Discovery","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"ZRNB/PLUS","path":"mols/model_block.py","file_url":"https://github.com/ZRNB/PLUS/blob/HEAD/mols/model_block.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e2f61d62c1a23b4e","mcp_get_code":{"code_sha256":"e2f61d62c1a23b4e"}},{"arxiv_id":"2510.00805","paper":"/paper/arxiv-2510-00805","title":"Planning-Augmented Sampling with Early Guidance for High-Reward Discovery","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"ZRNB/PLUS","path":"mols/model_fingerprint.py","file_url":"https://github.com/ZRNB/PLUS/blob/HEAD/mols/model_fingerprint.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"32208d4977dcb086","mcp_get_code":{"code_sha256":"32208d4977dcb086"}},{"arxiv_id":"2310.12934","paper":"/paper/generative-flow-networks-as-entropy","title":"Generative Flow Networks as Entropy-Regularized RL","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"d-tiapkin/gflownet-rl","path":"mols/model_atom.py","file_url":"https://github.com/d-tiapkin/gflownet-rl/blob/HEAD/mols/model_atom.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"06477cbf36090384","mcp_get_code":{"code_sha256":"06477cbf36090384"}},{"arxiv_id":"2302.05793","paper":"/paper/distributional-gflownets-with-quantile-flows","title":"Distributional GFlowNets with Quantile Flows","date":"2023-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zdhnarsil/distributional-gflownets","path":"mols/model_atom.py","file_url":"https://github.com/zdhnarsil/distributional-gflownets/blob/HEAD/mols/model_atom.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"06477cbf36090384","mcp_get_code":{"code_sha256":"06477cbf36090384"}},{"arxiv_id":"2302.05793","paper":"/paper/distributional-gflownets-with-quantile-flows","title":"Distributional GFlowNets with Quantile Flows","date":"2023-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zdhnarsil/distributional-gflownets","path":"mols/model_block.py","file_url":"https://github.com/zdhnarsil/distributional-gflownets/blob/HEAD/mols/model_block.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e2f61d62c1a23b4e","mcp_get_code":{"code_sha256":"e2f61d62c1a23b4e"}},{"arxiv_id":"2302.04040","paper":"/paper/sample-efficient-multi-objective-molecular-1","title":"Sample-efficient Multi-objective Molecular Optimization with GFlowNets","date":"2023-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"violet-sto/HN-GFN","path":"model_atom.py","file_url":"https://github.com/violet-sto/HN-GFN/blob/HEAD/model_atom.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"06477cbf36090384","mcp_get_code":{"code_sha256":"06477cbf36090384"}},{"arxiv_id":"2302.04040","paper":"/paper/sample-efficient-multi-objective-molecular-1","title":"Sample-efficient Multi-objective Molecular Optimization with GFlowNets","date":"2023-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"violet-sto/HN-GFN","path":"model_block.py","file_url":"https://github.com/violet-sto/HN-GFN/blob/HEAD/model_block.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e2f61d62c1a23b4e","mcp_get_code":{"code_sha256":"e2f61d62c1a23b4e"}},{"arxiv_id":"2302.04040","paper":"/paper/sample-efficient-multi-objective-molecular-1","title":"Sample-efficient Multi-objective Molecular Optimization with GFlowNets","date":"2023-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"violet-sto/HN-GFN","path":"model_fingerprint.py","file_url":"https://github.com/violet-sto/HN-GFN/blob/HEAD/model_fingerprint.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"32208d4977dcb086","mcp_get_code":{"code_sha256":"32208d4977dcb086"}},{"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":"bengioe/gflownet","path":"mols/model_atom.py","file_url":"https://github.com/bengioe/gflownet/blob/HEAD/mols/model_atom.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"06477cbf36090384","mcp_get_code":{"code_sha256":"06477cbf36090384"}},{"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":"bengioe/gflownet","path":"mols/model_block.py","file_url":"https://github.com/bengioe/gflownet/blob/HEAD/mols/model_block.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e2f61d62c1a23b4e","mcp_get_code":{"code_sha256":"e2f61d62c1a23b4e"}},{"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":"bengioe/gflownet","path":"mols/model_fingerprint.py","file_url":"https://github.com/bengioe/gflownet/blob/HEAD/mols/model_fingerprint.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"32208d4977dcb086","mcp_get_code":{"code_sha256":"32208d4977dcb086"}}]}