{"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/load-logs","entry":"load_logs","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":4,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":1,"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":9,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":4,"n_samples_fingerprinted":1,"n_places":9,"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":2,"ran_fixture":0,"ran":3,"unverified":4},"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":"2606.31191","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-31191","title":"ISM: Self-Improving Strategy Memory for Continual Mathematical Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"pdx97/ISM","path":"plot_results.py","file_url":"https://github.com/pdx97/ISM/blob/HEAD/plot_results.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2742cbcb630d6851","code_sha256_prefix":"2742cbcb630d6851","mcp_get_code":{"code_sha256":"2742cbcb630d6851"}},{"arxiv_id":"2606.31191","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-31191","title":"ISM: Self-Improving Strategy Memory for Continual Mathematical Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"pdx97/ISM","path":"qualitative_case_study.py","file_url":"https://github.com/pdx97/ISM/blob/HEAD/qualitative_case_study.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":"9f4d444f18a67841","code_sha256_prefix":"9f4d444f18a67841","mcp_get_code":{"code_sha256":"9f4d444f18a67841"}},{"arxiv_id":"2202.03259","arxiv_id_is_arxiv":true,"paper":"/paper/theory-inspired-parameter-control-benchmarks","title":"Theory-inspired Parameter Control Benchmarks for Dynamic Algorithm Configuration","date":"2022-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"caroladoerr/leadingonedac","path":"dacbench/logger.py","file_url":"https://github.com/caroladoerr/leadingonedac/blob/HEAD/dacbench/logger.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":"a2c08b6d66b99285","code_sha256_prefix":"a2c08b6d66b99285","mcp_get_code":{"code_sha256":"a2c08b6d66b99285"}},{"arxiv_id":"2106.02734","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-hilbert-schmidt-information","title":"Revisiting Hilbert-Schmidt Information Bottleneck for Adversarial Robustness","date":"2021-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neu-spiral/hbar","path":"source/hbar/utils/io.py","file_url":"https://github.com/neu-spiral/hbar/blob/HEAD/source/hbar/utils/io.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":"355b1a5db8ec0a0d","code_sha256_prefix":"355b1a5db8ec0a0d","mcp_get_code":{"code_sha256":"355b1a5db8ec0a0d"}},{"arxiv_id":"2105.08541","arxiv_id_is_arxiv":true,"paper":"/paper/dacbench-a-benchmark-library-for-dynamic","title":"DACBench: A Benchmark Library for Dynamic Algorithm Configuration","date":"2021-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"automl/DACBench","path":"dacbench/logger.py","file_url":"https://github.com/automl/DACBench/blob/HEAD/dacbench/logger.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":"20a71e68acc4ed60","code_sha256_prefix":"20a71e68acc4ed60","mcp_get_code":{"code_sha256":"20a71e68acc4ed60"}},{"arxiv_id":"2007.12770","arxiv_id_is_arxiv":true,"paper":"/paper/babyai-1-1","title":"BabyAI 1.1","date":"2020-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mila-udem/babyai","path":"babyai/plotting.py","file_url":"https://github.com/mila-udem/babyai/blob/HEAD/babyai/plotting.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"683df5640b690d89","code_sha256_prefix":"683df5640b690d89","mcp_get_code":{"code_sha256":"683df5640b690d89"}},{"arxiv_id":"1810.08272","arxiv_id_is_arxiv":true,"paper":"/paper/babyai-first-steps-towards-grounded-language","title":"BabyAI: A Platform to Study the Sample Efficiency of Grounded Language Learning","date":"2018-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MathijsMul/babyai-emergent-guidance","path":"babyai/plotting.py","file_url":"https://github.com/MathijsMul/babyai-emergent-guidance/blob/HEAD/babyai/plotting.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"484714bc81b02a0b","code_sha256_prefix":"484714bc81b02a0b","mcp_get_code":{"code_sha256":"484714bc81b02a0b"}},{"arxiv_id":"1810.08272","arxiv_id_is_arxiv":true,"paper":"/paper/babyai-first-steps-towards-grounded-language","title":"BabyAI: A Platform to Study the Sample Efficiency of Grounded Language Learning","date":"2018-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taungerine/babyai","path":"babyai/plotting.py","file_url":"https://github.com/taungerine/babyai/blob/HEAD/babyai/plotting.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5cbb697c6e6e1cf2","code_sha256_prefix":"5cbb697c6e6e1cf2","mcp_get_code":{"code_sha256":"5cbb697c6e6e1cf2"}},{"arxiv_id":"1012.2599","arxiv_id_is_arxiv":true,"paper":"/paper/a-tutorial-on-bayesian-optimization-of","title":"A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning","date":"2010-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanpei18345156216/BayesianOptimization","path":"bayes_opt/util.py","file_url":"https://github.com/yanpei18345156216/BayesianOptimization/blob/HEAD/bayes_opt/util.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":"9ea6221c39391f78","code_sha256_prefix":"9ea6221c39391f78","mcp_get_code":{"code_sha256":"9ea6221c39391f78"}}],"record_sha256":"919cb828003571fc6985cd499daa18560514341175bf12b9836329e707ec8f12","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}