{"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":"/paper/inversion-based-latent-bayesian-optimization","title":"Inversion-based Latent Bayesian Optimization","arxiv_id":"2411.05330","date":"2024-11-08","proceeding":null,"authors":["Jaewon Chu","Jinyoung Park","Seunghun Lee","Hyunwoo J. Kim"],"abstract":"Latent Bayesian optimization (LBO) approaches have successfully adopted Bayesian optimization over a continuous latent space by employing an encoder-decoder architecture to address the challenge of optimization in a high dimensional or discrete input space. LBO learns a surrogate model to approximate the black-box objective function in the latent space. However, we observed that most LBO methods suffer from the `misalignment problem`, which is induced by the reconstruction error of the encoder-decoder architecture. It hinders learning an accurate surrogate model and generating high-quality solutions. In addition, several trust region-based LBO methods select the anchor, the center of the trust region, based solely on the objective function value without considering the trust region`s potential to enhance the optimization process. To address these issues, we propose Inversion-based Latent Bayesian Optimization (InvBO), a plug-and-play module for LBO. InvBO consists of two components: an inversion method and a potential-aware trust region anchor selection. The inversion method searches the latent code that completely reconstructs the given target data. The potential-aware trust region anchor selection considers the potential capability of the trust region for better local optimization. Experimental results demonstrate the effectiveness of InvBO on nine real-world benchmarks, such as molecule design and arithmetic expression fitting tasks. Code is available at https://github.com/mlvlab/InvBO.","url_abs":"https://arxiv.org/abs/2411.05330v1","url_pdf":"https://arxiv.org/pdf/2411.05330v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"inversion-based-latent-bayesian-optimization","repo_url":"https://github.com/mlvlab/invbo","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"bayesian-optimization","task_name":"Bayesian Optimization"},{"task_slug":"decoder","task_name":"Decoder"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2411.05330","atlas_url":"https://app.syntology.ai/?focus=2411.05330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.05330"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2411.05330"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_reference_implementation","arguments":{"name":"Inversion-based Latent Bayesian Optimization (InvBO)"},"call":"get_reference_implementation(name='Inversion-based Latent Bayesian Optimization (InvBO)')","min_level":{"quoted_from_server_card":["It REFUSES rather than serving below min_level, and the refusal names the highest level that exists","so lowering min_level is a deliberate, informed choice, not a guess."],"default_on_card":2,"server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","this_implementation_level":3}},{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2411.05330"},"call":"get_harvested_code_for_paper(arxiv_id=\"2411.05330\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2411.05330"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2411.05330\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2411.05330"},"call":"get_concepts_for_paper(arxiv_id=\"2411.05330\")"}],"reference_implementation":[{"method_name":"Inversion-based Latent Bayesian Optimization (InvBO)","assembly_sha256":"a70a8cc1b5453960","source":"generated from the paper text (not the authors' code)","level":3,"level_is_quoted_from_server_card":[{"level":"V2","quoted":["two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs","neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","v3_tests_passed_both_sides":5,"no_rung":"No rung compares this code against the authors' implementation","no_rung_quoted_from_server_card":"No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results.","retrieve_with":"get_reference_implementation(name='Inversion-based Latent Bayesian Optimization (InvBO)')","have_check":{"url":"https://syntology.ai/api/graph/have?x=2411.05330","call":"have('2411.05330')","in_build_sample":false}}],"reference_implementation_is":"Syntology's reference implementation of this paper's method: code Syntology generated from the paper text (not the authors' code), at the level its own end-to-end run recorded (the assembly's own level, never averaged); the level's meaning is quoted from Syntology's server card, and nothing here says the code is correct or reproduces the paper's results","by_repo":[{"repo":"mlvlab/invbo","kind":"official","samples":9,"ran":5,"instrument":0,"unverified":4}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","assemblies":[{"assembly_sha256":"a70a8cc1b5453960","source_kind":"generated","method_name":"Inversion-based Latent Bayesian Optimization (InvBO)","realizes_method":"Inversion-based Latent Bayesian Optimization (InvBO)","graph_method":"Inversion-based Latent Bayesian Optimization (InvBO)","realizes_severed":false,"claim":"Performs one gradient descent step of the inversion procedure to find latent code z that reconstructs x_target. Given current latent z_current (shape [d_z]), target observation x_target (shape [d_x]), the decoded output decoded_x = decoder(z_current) (shape [d_x]), and the gradient of the decoder ou","centrality":"contribution","entry":"inversion_step","entry_sha256":"a6dd450b00079c4d79d0101167ec51b1bbdb8a5d146c1e9d816d785959653050","n_bricks":1,"bricks":[{"entry":"inversion_step","code_sha256":"a6dd450b00079c4d79d0101167ec51b1bbdb8a5d146c1e9d816d785959653050","role":"entry","order":0,"level":3,"status":"ran_violates"}],"ran_individually":1,"ran_individually_constructed":null,"ran_individually_by_status":{"ran_violates":1},"end_to_end":{"ran":true,"level":3,"against_independent_peer":true,"n_peers":1,"v3_tests_passed_both_sides":5,"means":"this assembly is a single routine, so the entry brick's verification IS the assembly's: it executed and two family-independent implementations agreed"},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"construction","claim_match_judges":["construction:spec_drafted_for_this_method"],"label_verdict":"matches","label_verdict_judged":false,"suggested_method":null,"batch_at":"2026-09-07T20:44:12+00:00","sibling_group":"bb443b766d5d","n_siblings":0,"retention":"keep","provenance":"assembly:generated_reference_impl_v1","attached_at":"2026-09-07T20:44:12+00:00","attached_provenance":"assembly:generated_reference_impl_v1"},{"assembly_sha256":"2dedca43d64c3e44","source_kind":"harvested","method_name":"Inversion-based Latent Bayesian Optimization (InvBO)","realizes_method":"Inversion-based Latent Bayesian Optimization (InvBO)","graph_method":"Inversion-based Latent Bayesian Optimization (InvBO)","realizes_severed":false,"claim":"The code implements a base class for latent space optimization tasks using a VAE, where latent points are decoded to original input space points for evaluation during Bayesian optimization.","centrality":"contribution","entry":"LatentSpaceObjective","entry_sha256":"56ff38263af0c676","n_bricks":1,"bricks":[{"entry":"LatentSpaceObjective","code_sha256":"56ff38263af0c676","role":"entry","order":0,"level":0,"status":"unverified"}],"ran_individually":0,"ran_individually_constructed":0,"ran_individually_by_status":{},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"judge:global.anthropic.claude-sonnet-4-5-20250929-v1:0","claim_match_judges":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"label_verdict":"matches","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"6365ceda9853","n_siblings":0,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"}],"assembly_sibling_groups":[{"group":"6365ceda9853","realizes_method":"Inversion-based Latent Bayesian Optimization (InvBO)","source_kind":"harvested","batch_at":"2026-09-09T22:44:46+00:00","members":["2dedca43d64c3e44"]},{"group":"bb443b766d5d","realizes_method":"Inversion-based Latent Bayesian Optimization (InvBO)","source_kind":"generated","batch_at":"2026-09-07T20:44:12+00:00","members":["a70a8cc1b5453960"]}],"assemblies_is":{"about":"What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results.","harvested":"assembled from code harvested from a repository linked to the paper","generated":"generated from the paper text, not the repository's code","end_to_end":"for a harvested assembly, the assembly has not been run end-to-end; for a generated one, end_to_end.level is the assembly's own level and against_independent_peer says whether it ran against a peer: an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists","bricks_level":"each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level","ran_individually":"a COUNT of bricks that ran on their own on a fixture (split by status in ran_individually_by_status), not a level; instrument statuses are failures of Syntology's instrument, not of the code","siblings":"assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another","judged":"Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as \"by construction\" or \"not judged by a model\"","level_lowered":"a generated assembly whose level Syntology's graph lowered, with the level it had, the recorded reason and when","retention":"Syntology's spending triage for further verification, not a verdict","claim_match":"the claim_match vote: IMPLEMENTS, COMPONENT or UNCLEAR. Where claim_match_basis is \"judge:<model>\", it is one model's judgement of the assembly's label against the paper's claim (claim_match_rule single_judge, the model in claim_match_judges): not a verification and not a run. Where it is \"construction\", the value was set when the code was generated for this method and no model judged it, whatever claim_match_rule says. The page prints no claim match for any assembly","label_verdict":"whether the assembly's code is the method it is labelled with: matches, cannot_tell, mislabelled (suggested_method names what it looks like instead) or not_the_method; label_verdict_judged is true only when a model read the code (claim_match_basis \"judge:<model>\")","label_verdict_judged":"where true (claim_match_basis \"judge:<model>\"), label_verdict is a single model's judgement; not calibrated; not printed on the page; where false, it was set by construction, and the page prints it unless the node is shared with another paper (node_properties_written_for)","claim":"the claim text stored on the assembly node: for a harvested assembly, what the paper claims the code implements, as the lifting model wrote it; for a generated one, the specification the code was generated from. Not verified text","centrality":"how central the lifted method is to the paper, as the lifting step recorded it: contribution, component or incidental","v3_tests_passed_both_sides":"end_to_end.v3_tests_passed_both_sides: the number of property tests derived from the paper that passed on both implementations, as the attached report lists them; a level 3 card with 0 says its report lists none","ran_individually_constructed":"ran_individually_constructed: of the bricks counted in ran_individually, how many constructed an object rather than computing a result (Syntology's RAN record's rule, read from the graph-layer sample with the brick's code_sha256); a part of ran_individually, never subtracted from it and never a failure; null where a brick that ran has no sample in the graph layer this build read, so the figure was not counted"},"assemblies_call":{"tool":"assembly","arguments":{"arxiv_id":"2411.05330"},"call":"assembly(arxiv_id=\"2411.05330\")"},"read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2411.05330.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2411.05330.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"deterministic:regex_extraction","url":"https://github.com/mlvlab/InvBO","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/mlvlab/invbo","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":5,"unverified":4},"n_samples":9,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":4,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_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_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)"},"by_repo_kind":{"official":{"samples":9,"ran":5,"n_ran_checked":5,"n_instrument":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":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_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":5,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-25","last":"2026-09-25","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"01631f8f50a4bb6a","code_sha256_prefix":"01631f8f50a4bb6a","entry":"TS","repo":"mlvlab/InvBO","repo_kind":"official","path":"invbo/utils/bo_utils/turbo.py","file_url":"https://github.com/mlvlab/InvBO/blob/HEAD/invbo/utils/bo_utils/turbo.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"X_cand:Tensor/2/float, model:callable/0/?, batch_size:int/0/int","fixture_out_type":"tuple","level_recorded_at":"2026-09-25T22:52:16.269482+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"01631f8f50a4bb6a"}},{"code_sha256":"98cfe3d3a797ae62","code_sha256_prefix":"98cfe3d3a797ae62","entry":"lipschitz_loss","repo":"mlvlab/InvBO","repo_kind":"official","path":"invbo/utils/utils.py","file_url":"https://github.com/mlvlab/InvBO/blob/HEAD/invbo/utils/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"z:Tensor/2/float, y:Tensor/2/float, recon_weight:Tensor/1/float","fixture_out_type":"tuple","level_recorded_at":"2026-09-25T15:11:32.249708+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"98cfe3d3a797ae62"}},{"code_sha256":"e00ccb61913dc9fb","code_sha256_prefix":"e00ccb61913dc9fb","entry":"load_train_z","repo":"mlvlab/InvBO","repo_kind":"official","path":"invbo/utils/mol_utils/load_data.py","file_url":"https://github.com/mlvlab/InvBO/blob/HEAD/invbo/utils/mol_utils/load_data.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"num_initialization_points:int/0/int, path_to_vae_statedict:str/0/str","fixture_out_type":"Tensor","level_recorded_at":"2026-09-25T22:52:16.269482+00:00","retrieve_with":{"tool":"get_code","code_sha256":"e00ccb61913dc9fb"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"e00ccb61913dc9fb"}},{"code_sha256":"0935ed12b60eb28d","code_sha256_prefix":"0935ed12b60eb28d","entry":"update_models_end_to_end","repo":"mlvlab/InvBO","repo_kind":"official","path":"invbo/utils/utils.py","file_url":"https://github.com/mlvlab/InvBO/blob/HEAD/invbo/utils/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"train_x:list/1/str, train_y_scores:ndarray/1/float, objective:MinimalObjective/0/?, model:callable/0/?, mll:callable/0/?, learning_rte:float/0/float, num_update_epochs:int/0/int, track_with_wandb:bool/0/bool, tracker:MinimalTracker/0/?, alpha:float/0/float, beta:float/0/float, gamma:float/0/float, delta:float/0/float","fixture_out_type":"tuple","level_recorded_at":"2026-09-25T15:11:32.249708+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"0935ed12b60eb28d"}},{"code_sha256":"ba51f9dac22959af","code_sha256_prefix":"ba51f9dac22959af","entry":"update_state","repo":"mlvlab/InvBO","repo_kind":"official","path":"invbo/utils/bo_utils/turbo.py","file_url":"https://github.com/mlvlab/InvBO/blob/HEAD/invbo/utils/bo_utils/turbo.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"state:State/0/?, Y_next:Tensor/1/float","fixture_out_type":"State","level_recorded_at":"2026-09-25T15:11:32.249708+00:00","code_page":"/code/update-state","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"ba51f9dac22959af"}},{"code_sha256":"56ff38263af0c676","code_sha256_prefix":"56ff38263af0c676","entry":"LatentSpaceObjective","repo":"mlvlab/invbo","repo_kind":"official","path":"invbo/latent_space_objective.py","file_url":"https://github.com/mlvlab/invbo/blob/HEAD/invbo/latent_space_objective.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"56ff38263af0c676"}},{"code_sha256":"27be588cbcdb4733","code_sha256_prefix":"27be588cbcdb4733","entry":"generate_batch","repo":"mlvlab/InvBO","repo_kind":"official","path":"invbo/utils/bo_utils/turbo.py","file_url":"https://github.com/mlvlab/InvBO/blob/HEAD/invbo/utils/bo_utils/turbo.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/generate-batch","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"27be588cbcdb4733"}},{"code_sha256":"70bc126cfa970aa5","code_sha256_prefix":"70bc126cfa970aa5","entry":"load_molecule_train_data","repo":"mlvlab/InvBO","repo_kind":"official","path":"invbo/utils/mol_utils/load_data.py","file_url":"https://github.com/mlvlab/InvBO/blob/HEAD/invbo/utils/mol_utils/load_data.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"70bc126cfa970aa5"}},{"code_sha256":"0dda692b10a19709","code_sha256_prefix":"0dda692b10a19709","entry":"update_surr_model","repo":"mlvlab/InvBO","repo_kind":"official","path":"invbo/utils/utils.py","file_url":"https://github.com/mlvlab/InvBO/blob/HEAD/invbo/utils/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"0dda692b10a19709"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"3777484513d115e4eb8d8cf2ab60180fd29a7895cade8c83aca2c705d500137f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}