{"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/branin","entry":"branin","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":6,"n_samples_ran":2,"n_samples_fingerprinted":2,"n_places":10,"n_places_pointer_only":4,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":0,"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":"2310.00386","paper":"/paper/order-preserving-gflownets","title":"Order-Preserving GFlowNets","date":"2023-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yhangchen/op-gfn","path":"multi/grid_cond_gfn.py","file_url":"https://github.com/yhangchen/op-gfn/blob/HEAD/multi/grid_cond_gfn.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b8e02a8995424b4e","mcp_get_code":{"code_sha256":"b8e02a8995424b4e"}},{"arxiv_id":"2302.01687","paper":"/paper/better-training-of-gflownets-with-local","title":"Better Training of GFlowNets with Local Credit and Incomplete Trajectories","date":"2023-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gfnorg/gflownet","path":"grid/cond_grid_dag.py","file_url":"https://github.com/gfnorg/gflownet/blob/HEAD/grid/cond_grid_dag.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8e02a8995424b4e","mcp_get_code":{"code_sha256":"b8e02a8995424b4e"}},{"arxiv_id":"2302.01687","paper":"/paper/better-training-of-gflownets-with-local","title":"Better Training of GFlowNets with Local Credit and Incomplete Trajectories","date":"2023-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"e81128bd6b1cab12","mcp_get_code":{"code_sha256":"e81128bd6b1cab12"}},{"arxiv_id":"2201.13259","paper":"/paper/trajectory-balance-improved-credit-assignment","title":"Trajectory balance: Improved credit assignment in GFlowNets","date":"2022-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gfnorg/gflownet","path":"grid/cond_grid_dag.py","file_url":"https://github.com/gfnorg/gflownet/blob/HEAD/grid/cond_grid_dag.py","status":"unverified","verification_level":0,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e81128bd6b1cab12","mcp_get_code":{"code_sha256":"e81128bd6b1cab12"}},{"arxiv_id":"2110.06980","paper":"/paper/output-space-entropy-search-framework-for","title":"Output Space Entropy Search Framework for Multi-Objective Bayesian Optimization","date":"2021-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"belakaria/MESMO","path":"benchmark_functions.py","file_url":"https://github.com/belakaria/MESMO/blob/HEAD/benchmark_functions.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"763cb91090843c8f","mcp_get_code":{"code_sha256":"763cb91090843c8f"}},{"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":"grid/cond_grid_dag.py","file_url":"https://github.com/bengioe/gflownet/blob/HEAD/grid/cond_grid_dag.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8e02a8995424b4e","mcp_get_code":{"code_sha256":"b8e02a8995424b4e"}},{"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":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"e81128bd6b1cab12","mcp_get_code":{"code_sha256":"e81128bd6b1cab12"}},{"arxiv_id":"2009.01721","paper":"/paper/max-value-entropy-search-for-multi-objective-1","title":"Max-value Entropy Search for Multi-Objective Bayesian Optimization with Constraints","date":"2020-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dancewithDianTong/COMBOO","path":"experiments_benchmarks/MESMOC/branin_currin_MESMOC/benchmark_functions.py","file_url":"https://github.com/dancewithDianTong/COMBOO/blob/HEAD/experiments_benchmarks/MESMOC/branin_currin_MESMOC/benchmark_functions.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"caa8f35ec6d45f99","mcp_get_code":{"code_sha256":"caa8f35ec6d45f99"}},{"arxiv_id":"2006.07368","paper":"/paper/uncertainty-quantification-using-martingales","title":"Uncertainty quantification using martingales for misspecified Gaussian processes","date":"2020-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"willieneis/gp-martingales","path":"src/branin.py","file_url":"https://github.com/willieneis/gp-martingales/blob/HEAD/src/branin.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7437e0f18c2fdb52","mcp_get_code":{"code_sha256":"7437e0f18c2fdb52"}},{"arxiv_id":"1806.01619","paper":"/paper/bock-bayesian-optimization-with-cylindrical","title":"BOCK : Bayesian Optimization with Cylindrical Kernels","date":"2018-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChangYong-Oh/HyperSphere","path":"HyperSphere/test_functions/benchmarks.py","file_url":"https://github.com/ChangYong-Oh/HyperSphere/blob/HEAD/HyperSphere/test_functions/benchmarks.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"0254ed856ad95cda","mcp_get_code":{"code_sha256":"0254ed856ad95cda"}}]}