{"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/update-state","entry":"update_state","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":11,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":6,"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":2,"n_samples_instrument":5,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":3,"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":3,"ran_fixture":2,"ran":2,"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":"2608.15073","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-15073","title":"BOCoDe: Engineering-Centered Benchmarking for Bayesian Optimization","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"facebookresearch/bo_pr","path":"discrete_mixed_bo/trust_region.py","file_url":"https://github.com/facebookresearch/bo_pr/blob/HEAD/discrete_mixed_bo/trust_region.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9298d82ba1c4f7b3","code_sha256_prefix":"9298d82ba1c4f7b3","mcp_get_code":{"code_sha256":"9298d82ba1c4f7b3"}},{"arxiv_id":"2412.20375","arxiv_id_is_arxiv":true,"paper":"/paper/scalable-bayesian-optimization-via-focalized","title":"Scalable Bayesian Optimization via Focalized Sparse Gaussian Processes","date":"2024-12-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunyuewei/focalbo","path":"turbo_botorch.py","file_url":"https://github.com/yunyuewei/focalbo/blob/HEAD/turbo_botorch.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yunyuewei/focalbo when it was checked","code_sha256":"fb52e4b73de2fa11","code_sha256_prefix":"fb52e4b73de2fa11","mcp_get_code":{"code_sha256":"fb52e4b73de2fa11"}},{"arxiv_id":"2411.05330","arxiv_id_is_arxiv":true,"paper":"/paper/inversion-based-latent-bayesian-optimization","title":"Inversion-based Latent Bayesian Optimization","date":"2024-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlvlab/InvBO","path":"invbo/utils/bo_utils/turbo.py","file_url":"https://github.com/mlvlab/InvBO/blob/HEAD/invbo/utils/bo_utils/turbo.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":"ba51f9dac22959af","code_sha256_prefix":"ba51f9dac22959af","mcp_get_code":{"code_sha256":"ba51f9dac22959af"}},{"arxiv_id":"2409.09629","arxiv_id_is_arxiv":true,"paper":"/paper/confidence-estimation-for-llm-based-dialogue","title":"Confidence Estimation for LLM-Based Dialogue State Tracking","date":"2024-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jennycs0830/confidence_score_dst","path":"loaders.py","file_url":"https://github.com/jennycs0830/confidence_score_dst/blob/HEAD/loaders.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jennycs0830/confidence_score_dst when it was checked","code_sha256":"404e6fbaed85052c","code_sha256_prefix":"404e6fbaed85052c","mcp_get_code":{"code_sha256":"404e6fbaed85052c"}},{"arxiv_id":"2407.05996","arxiv_id_is_arxiv":true,"paper":"/paper/multimodal-diffusion-transformer-learning","title":"Multimodal Diffusion Transformer: Learning Versatile Behavior from Multimodal Goals","date":null,"month_inferred_from_arxiv_id":"2024-07","title_source":"archive","repo":"intuitive-robots/mdt_policy","path":"mdt/evaluation/multistep_sequences.py","file_url":"https://github.com/intuitive-robots/mdt_policy/blob/HEAD/mdt/evaluation/multistep_sequences.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"916d58d0838c488b","code_sha256_prefix":"916d58d0838c488b","mcp_get_code":{"code_sha256":"916d58d0838c488b"}},{"arxiv_id":"2406.05250","arxiv_id_is_arxiv":true,"paper":"/paper/llm-enhanced-bayesian-optimization-for","title":"LLM-Enhanced Bayesian Optimization for Efficient Analog Layout Constraint Generation","date":"2024-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dekura/llana","path":"exp_baselines/bo_models/bo_gp_turbo.py","file_url":"https://github.com/dekura/llana/blob/HEAD/exp_baselines/bo_models/bo_gp_turbo.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, dekura/llana when it was checked","code_sha256":"ba51f9dac22959af","code_sha256_prefix":"ba51f9dac22959af","mcp_get_code":{"code_sha256":"ba51f9dac22959af"}},{"arxiv_id":"2310.20258","arxiv_id_is_arxiv":true,"paper":"/paper/advancing-bayesian-optimization-via-learning-1","title":"Advancing Bayesian Optimization via Learning Correlated Latent Space","date":"2023-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlvlab/CoBO","path":"cobo/utils/bo_utils/turbo.py","file_url":"https://github.com/mlvlab/CoBO/blob/HEAD/cobo/utils/bo_utils/turbo.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":"ba51f9dac22959af","code_sha256_prefix":"ba51f9dac22959af","mcp_get_code":{"code_sha256":"ba51f9dac22959af"}},{"arxiv_id":"2201.11872","arxiv_id_is_arxiv":true,"paper":"/paper/local-latent-space-bayesian-optimization-over","title":"Local Latent Space Bayesian Optimization over Structured Inputs","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nataliemaus/lolbo","path":"lolbo/utils/bo_utils/turbo.py","file_url":"https://github.com/nataliemaus/lolbo/blob/HEAD/lolbo/utils/bo_utils/turbo.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":"ba51f9dac22959af","code_sha256_prefix":"ba51f9dac22959af","mcp_get_code":{"code_sha256":"ba51f9dac22959af"}},{"arxiv_id":"2112.03227","arxiv_id_is_arxiv":true,"paper":"/paper/calvin-a-benchmark-for-language-conditioned","title":"CALVIN: A Benchmark for Language-Conditioned Policy Learning for Long-Horizon Robot Manipulation Tasks","date":"2021-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mees/calvin","path":"calvin_models/calvin_agent/evaluation/multistep_sequences.py","file_url":"https://github.com/mees/calvin/blob/HEAD/calvin_models/calvin_agent/evaluation/multistep_sequences.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"916d58d0838c488b","code_sha256_prefix":"916d58d0838c488b","mcp_get_code":{"code_sha256":"916d58d0838c488b"}},{"arxiv_id":"2108.11417","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-reservoir-computing-for-solving","title":"Unsupervised Reservoir Computing for Solving Ordinary Differential Equations","date":"2021-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"blindedjoy/RcTorch","path":"RcTorch/rc_bayes.py","file_url":"https://github.com/blindedjoy/RcTorch/blob/HEAD/RcTorch/rc_bayes.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"175210759b585f0e","code_sha256_prefix":"175210759b585f0e","mcp_get_code":{"code_sha256":"175210759b585f0e"}},{"arxiv_id":"ijcai2025_0969","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2025_0969","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"DIDS-EI/BTPG","path":"btpg/algos/base/btp_base.py","file_url":"https://github.com/DIDS-EI/BTPG/blob/HEAD/btpg/algos/base/btp_base.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":"ec18497bf635bd2e","code_sha256_prefix":"ec18497bf635bd2e","mcp_get_code":{"code_sha256":"ec18497bf635bd2e"}}],"record_sha256":"47775ceaf5d777af9618339c2fc6ae38096b35bee38828d2211008668e91d771","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}