{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/from-unit-cube","entry":"from_unit_cube","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":3,"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":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":7,"n_places":8,"n_places_pointer_only":4,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":3,"ran":3,"unverified":0},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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","arxiv_id_is_arxiv":true,"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yhong123/bo-pro-c when it was checked","code_sha256":"76c02cee5568f926","code_sha256_prefix":"76c02cee5568f926","mcp_get_code":{"code_sha256":"76c02cee5568f926"}},{"arxiv_id":"2605.23473","arxiv_id_is_arxiv":true,"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":"lamda-bbo/MCTS-VS","path":"utils.py","file_url":"https://github.com/lamda-bbo/MCTS-VS/blob/HEAD/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lamda-bbo/MCTS-VS when it was checked","code_sha256":"465deea065c51f94","code_sha256_prefix":"465deea065c51f94","mcp_get_code":{"code_sha256":"465deea065c51f94"}},{"arxiv_id":"2605.23473","arxiv_id_is_arxiv":true,"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, uber-research/TuRBO (NOASSERTION)","code_sha256":"76c02cee5568f926","code_sha256_prefix":"76c02cee5568f926","mcp_get_code":{"code_sha256":"76c02cee5568f926"}},{"arxiv_id":"2501.14997","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7f54d13b09d03e90","code_sha256_prefix":"7f54d13b09d03e90","mcp_get_code":{"code_sha256":"7f54d13b09d03e90"}},{"arxiv_id":"2412.12918","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ec3344b3381a5d8","code_sha256_prefix":"3ec3344b3381a5d8","mcp_get_code":{"code_sha256":"3ec3344b3381a5d8"}},{"arxiv_id":"2412.07186","arxiv_id_is_arxiv":true,"paper":"/paper/monte-carlo-tree-search-based-space-transfer","title":"Monte Carlo Tree Search based Space Transfer for Black-box Optimization","date":"2024-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lamda-bbo/mcts-transfer","path":"mcts/MCTS.py","file_url":"https://github.com/lamda-bbo/mcts-transfer/blob/HEAD/mcts/MCTS.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lamda-bbo/mcts-transfer when it was checked","code_sha256":"3ba380d745085a84","code_sha256_prefix":"3ba380d745085a84","mcp_get_code":{"code_sha256":"3ba380d745085a84"}},{"arxiv_id":"2310.03515","arxiv_id_is_arxiv":true,"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":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d2fca1095f8184f4","code_sha256_prefix":"d2fca1095f8184f4","mcp_get_code":{"code_sha256":"d2fca1095f8184f4"}},{"arxiv_id":"2006.11267","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4882830652616cef","code_sha256_prefix":"4882830652616cef","mcp_get_code":{"code_sha256":"4882830652616cef"}}],"record_sha256":"76e95fc409ec5ef4658b50b6b72de060602e31704273af26447672d546382bac","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}