{"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/ei-2","entry":"ei","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":5,"n_samples_ran":5,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":2,"ran":1,"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":"2608.17567","paper":"/paper/arxiv-2608-17567","title":"Domain-Adapted Molecular Language Models for Efficient Search of Make-on-Demand Libraries","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"fsk-lab/bayleys","path":"src/bayleys/acquisition/acquisition_function.py","file_url":"https://github.com/fsk-lab/bayleys/blob/HEAD/src/bayleys/acquisition/acquisition_function.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a2d00bf30f1c5b44","mcp_get_code":{"code_sha256":"a2d00bf30f1c5b44"}},{"arxiv_id":"2510.21153","paper":"/paper/arxiv-2510-21153","title":"Uncertainty-Aware Multi-Objective Reinforcement Learning-Guided Diffusion Models for 3D De Novo Molecular Design","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"Kyle4490/RL-Diffusion","path":"uncertainty/get_dist.py","file_url":"https://github.com/Kyle4490/RL-Diffusion/blob/HEAD/uncertainty/get_dist.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"548ebe17c3ad0c18","mcp_get_code":{"code_sha256":"548ebe17c3ad0c18"}},{"arxiv_id":"2204.05944","paper":"/paper/uncertainty-aware-search-framework-for-multi-1","title":"Uncertainty-Aware Search Framework for Multi-Objective Bayesian Optimization","date":"2022-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"belakaria/usemo","path":"acquisitions.py","file_url":"https://github.com/belakaria/usemo/blob/HEAD/acquisitions.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d277362f7210e5ef","mcp_get_code":{"code_sha256":"d277362f7210e5ef"}},{"arxiv_id":"2103.00349","paper":"/paper/high-dimensional-bayesian-optimization-with-2","title":"High-Dimensional Bayesian Optimization with Sparse Axis-Aligned Subspaces","date":"2021-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"martinjankowiak/saasbo","path":"saasbo.py","file_url":"https://github.com/martinjankowiak/saasbo/blob/HEAD/saasbo.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8ba5cf3cb6e6ca73","mcp_get_code":{"code_sha256":"8ba5cf3cb6e6ca73"}},{"arxiv_id":"1705.05355","paper":"/paper/probabilistic-matrix-factorization-for","title":"Probabilistic Matrix Factorization for Automated Machine Learning","date":"2017-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rsheth80/pmf-automl","path":"bo.py","file_url":"https://github.com/rsheth80/pmf-automl/blob/HEAD/bo.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"889249dd2949f7d8","mcp_get_code":{"code_sha256":"889249dd2949f7d8"}}]}