{"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/load-logs","entry":"load_logs","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":7,"n_papers_ran":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":2,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":7},"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","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2742cbcb630d6851","mcp_get_code":{"code_sha256":"2742cbcb630d6851"}},{"arxiv_id":"2606.31191","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9f4d444f18a67841","mcp_get_code":{"code_sha256":"9f4d444f18a67841"}},{"arxiv_id":"2202.03259","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a2c08b6d66b99285","mcp_get_code":{"code_sha256":"a2c08b6d66b99285"}},{"arxiv_id":"2106.02734","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,"code_sha256_prefix":"355b1a5db8ec0a0d","mcp_get_code":{"code_sha256":"355b1a5db8ec0a0d"}},{"arxiv_id":"2105.08541","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"20a71e68acc4ed60","mcp_get_code":{"code_sha256":"20a71e68acc4ed60"}},{"arxiv_id":"2007.12770","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,"code_sha256_prefix":"683df5640b690d89","mcp_get_code":{"code_sha256":"683df5640b690d89"}},{"arxiv_id":"1810.08272","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,"code_sha256_prefix":"484714bc81b02a0b","mcp_get_code":{"code_sha256":"484714bc81b02a0b"}},{"arxiv_id":"1810.08272","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,"code_sha256_prefix":"5cbb697c6e6e1cf2","mcp_get_code":{"code_sha256":"5cbb697c6e6e1cf2"}},{"arxiv_id":"1012.2599","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9ea6221c39391f78","mcp_get_code":{"code_sha256":"9ea6221c39391f78"}}]}