{"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/random-search","entry":"random_search","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":8,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":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":8,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":0,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":6,"unverified":2},"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":"2510.24826","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-24826","title":"Augmenting Biological Fitness Prediction Benchmarks with Landscapes Features from GraphFLA","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"COLA-Laboratory/GraphFLA","path":"graphfla/sampling.py","file_url":"https://github.com/COLA-Laboratory/GraphFLA/blob/HEAD/graphfla/sampling.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"55e7ecf3dec6315a","code_sha256_prefix":"55e7ecf3dec6315a","mcp_get_code":{"code_sha256":"55e7ecf3dec6315a"}},{"arxiv_id":"2207.03084","arxiv_id_is_arxiv":true,"paper":"/paper/pre-training-helps-bayesian-optimization-too","title":"Pre-training helps Bayesian optimization too","date":"2022-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/hyperbo","path":"hyperbo/bo_utils/acfun.py","file_url":"https://github.com/google-research/hyperbo/blob/HEAD/hyperbo/bo_utils/acfun.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ed6ff476d6215244","code_sha256_prefix":"ed6ff476d6215244","mcp_get_code":{"code_sha256":"ed6ff476d6215244"}},{"arxiv_id":"2206.02063","arxiv_id_is_arxiv":true,"paper":"/paper/active-bayesian-causal-inference","title":"Active Bayesian Causal Inference","date":"2022-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chritoth/active-bayesian-causal-inference","path":"src/experimental_design/optimization.py","file_url":"https://github.com/chritoth/active-bayesian-causal-inference/blob/HEAD/src/experimental_design/optimization.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5111c6b718a44d5b","code_sha256_prefix":"5111c6b718a44d5b","mcp_get_code":{"code_sha256":"5111c6b718a44d5b"}},{"arxiv_id":"2111.06537","arxiv_id_is_arxiv":true,"paper":"/paper/multi-step-budgeted-bayesian-optimization","title":"Multi-Step Budgeted Bayesian Optimization with Unknown Evaluation Costs","date":"2021-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raulastudillo06/budgetedbo","path":"experiments/make_rfboston_surrogate.py","file_url":"https://github.com/raulastudillo06/budgetedbo/blob/HEAD/experiments/make_rfboston_surrogate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dbcf1d52ee9084a3","code_sha256_prefix":"dbcf1d52ee9084a3","mcp_get_code":{"code_sha256":"dbcf1d52ee9084a3"}},{"arxiv_id":"2109.08215","arxiv_id_is_arxiv":true,"paper":"/paper/automatic-prior-selection-for-meta-bayesian","title":"Pre-trained Gaussian Processes for Bayesian Optimization","date":"2021-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"evensgn/hyperbo-mphd","path":"hyperbo/bo_utils/acfun.py","file_url":"https://github.com/evensgn/hyperbo-mphd/blob/HEAD/hyperbo/bo_utils/acfun.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"53142f6caf250a8e","code_sha256_prefix":"53142f6caf250a8e","mcp_get_code":{"code_sha256":"53142f6caf250a8e"}},{"arxiv_id":"2001.00326","arxiv_id_is_arxiv":true,"paper":"/paper/nas-bench-102-extending-the-scope-of","title":"NAS-Bench-201: Extending the Scope of Reproducible Neural Architecture Search","date":"2020-01-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yoichii/nashpobench2api","path":"bench_algos/random_search.py","file_url":"https://github.com/yoichii/nashpobench2api/blob/HEAD/bench_algos/random_search.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c3d41c2247ba9310","code_sha256_prefix":"c3d41c2247ba9310","mcp_get_code":{"code_sha256":"c3d41c2247ba9310"}},{"arxiv_id":"1910.11858","arxiv_id_is_arxiv":true,"paper":"/paper/bananas-bayesian-optimization-with-neural","title":"BANANAS: Bayesian Optimization with Neural Architectures for Neural Architecture Search","date":"2019-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"naszilla/bananas","path":"nas_algorithms.py","file_url":"https://github.com/naszilla/bananas/blob/HEAD/nas_algorithms.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8e77afefdb71320a","code_sha256_prefix":"8e77afefdb71320a","mcp_get_code":{"code_sha256":"8e77afefdb71320a"}},{"arxiv_id":"Arican_ISNAS-DIP_Image-Specific_Neural_Architecture_Search_for_Deep_Image_Prior_CVPR_2022_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Arican_ISNAS-DIP_Image-Specific_Neural_Architecture_Search_for_Deep_Image_Prior_CVPR_2022_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ozgurkara99/ISNAS-DIP","path":"NAS/model_gen.py","file_url":"https://github.com/ozgurkara99/ISNAS-DIP/blob/HEAD/NAS/model_gen.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a6e6c721f9211c87","code_sha256_prefix":"a6e6c721f9211c87","mcp_get_code":{"code_sha256":"a6e6c721f9211c87"}}],"record_sha256":"51a4bbc6498b224ab04eed3f6e43623f3da60f060bef697c4b418db11554ef07","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}