{"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/to-unit-cube","entry":"to_unit_cube","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":8,"n_papers_ran":4,"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":7,"n_samples_ran":3,"n_samples_fingerprinted":2,"n_places":8,"n_places_pointer_only":2,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":4},"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":"2609.15555","paper":"/paper/arxiv-2609-15555","title":"Bayesian Optimisation Using Product-of-Experts Gaussian Process Models with Uncertainty Calibration","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"yhong123/bo-pro-c","path":"src/bo_pro/utils.py","file_url":"https://github.com/yhong123/bo-pro-c/blob/HEAD/src/bo_pro/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"05aff6a609448b1f","mcp_get_code":{"code_sha256":"05aff6a609448b1f"}},{"arxiv_id":"2605.23473","paper":"/paper/arxiv-2605-23473","title":"Automated Random Embedding for Practical Bayesian Optimization with Unknown Effective Dimension","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"uber-research/TuRBO","path":"turbo/utils.py","file_url":"https://github.com/uber-research/TuRBO/blob/HEAD/turbo/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"05aff6a609448b1f","mcp_get_code":{"code_sha256":"05aff6a609448b1f"}},{"arxiv_id":"2510.20872","paper":"/paper/arxiv-2510-20872","title":"MOBO-OSD: Batch Multi-Objective Bayesian Optimization via Orthogonal Search Directions","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"LamNgo1/mobo-osd","path":"mobo_osd/helper.py","file_url":"https://github.com/LamNgo1/mobo-osd/blob/HEAD/mobo_osd/helper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2e9112577ee9230e","mcp_get_code":{"code_sha256":"2e9112577ee9230e"}},{"arxiv_id":"2501.14997","paper":"/paper/causal-discovery-via-bayesian-optimization","title":"Causal Discovery via Bayesian Optimization","date":"2025-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"baosws/drbo","path":"drbo/drbo.py","file_url":"https://github.com/baosws/drbo/blob/HEAD/drbo/drbo.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"8e72d61d7ebc713f","mcp_get_code":{"code_sha256":"8e72d61d7ebc713f"}},{"arxiv_id":"2412.12918","paper":"/paper/boids-high-dimensional-bayesian-optimization","title":"BOIDS: High-dimensional Bayesian Optimization via Incumbent-guided Direction Lines and Subspace Embeddings","date":"2024-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LamNgo1/boids","path":"baxus_embedding/utils.py","file_url":"https://github.com/LamNgo1/boids/blob/HEAD/baxus_embedding/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fd482e1d259adbd4","mcp_get_code":{"code_sha256":"fd482e1d259adbd4"}},{"arxiv_id":"2310.03515","paper":"/paper/high-dimensional-bayesian-optimization-with-6","title":"High-dimensional Bayesian Optimization with Group Testing","date":"2023-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gtboauthors/gtbo","path":"gtbo/util.py","file_url":"https://github.com/gtboauthors/gtbo/blob/HEAD/gtbo/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"65b9eafb4f6a28f9","mcp_get_code":{"code_sha256":"65b9eafb4f6a28f9"}},{"arxiv_id":"2307.00618","paper":"/paper/bounce-a-reliable-bayesian-optimization","title":"Bounce: Reliable High-Dimensional Bayesian Optimization for Combinatorial and Mixed Spaces","date":"2023-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leoiv/bounce","path":"bounce/util/data_handling.py","file_url":"https://github.com/leoiv/bounce/blob/HEAD/bounce/util/data_handling.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5e41e7778bc4909b","mcp_get_code":{"code_sha256":"5e41e7778bc4909b"}},{"arxiv_id":"2006.11267","paper":"/paper/fast-matrix-square-roots-with-applications-to","title":"Fast Matrix Square Roots with Applications to Gaussian Processes and Bayesian Optimization","date":"2020-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gpleiss/ciq_experiments","path":"bayesopt/ciq_bo/utils.py","file_url":"https://github.com/gpleiss/ciq_experiments/blob/HEAD/bayesopt/ciq_bo/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"d4f3607c98798b5f","mcp_get_code":{"code_sha256":"d4f3607c98798b5f"}}]}