{"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/configure","entry":"configure","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":6,"n_papers_ran":0,"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":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":6},"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":"2609.00759","paper":"/paper/arxiv-2609-00759","title":"Compile, Don't Memorize: A Context Compilation Architecture (CCA) for In-Context Learning","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"TonyQJH/cca-emnlp2026","path":"code/cca_core.py","file_url":"https://github.com/TonyQJH/cca-emnlp2026/blob/HEAD/code/cca_core.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":"ba03e63e6f137cc9","mcp_get_code":{"code_sha256":"ba03e63e6f137cc9"}},{"arxiv_id":"2304.01203","paper":"/paper/optimal-goal-reaching-reinforcement-learning","title":"Optimal Goal-Reaching Reinforcement Learning via Quasimetric Learning","date":"2023-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"quasimetric-learning/quasimetric-rl","path":"quasimetric_rl/utils/logging.py","file_url":"https://github.com/quasimetric-learning/quasimetric-rl/blob/HEAD/quasimetric_rl/utils/logging.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0746ec5ce635962b","mcp_get_code":{"code_sha256":"0746ec5ce635962b"}},{"arxiv_id":"2101.08152","paper":"/paper/rank-the-episodes-a-simple-approach-for-1","title":"Rank the Episodes: A Simple Approach for Exploration in Procedurally-Generated Environments","date":"2021-01-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aklein1995/exploration_sil_im","path":"rapid/rapid_agent.py","file_url":"https://github.com/aklein1995/exploration_sil_im/blob/HEAD/rapid/rapid_agent.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"819a51a05cef8459","mcp_get_code":{"code_sha256":"819a51a05cef8459"}},{"arxiv_id":"2006.13560","paper":"/paper/learning-for-video-compression-with-recurrent","title":"Learning for Video Compression with Recurrent Auto-Encoder and Recurrent Probability Model","date":"2020-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RenYang-home/RLVC","path":"helper.py","file_url":"https://github.com/RenYang-home/RLVC/blob/HEAD/helper.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":"473ddad861178c87","mcp_get_code":{"code_sha256":"473ddad861178c87"}},{"arxiv_id":"2004.14309","paper":"/paper/how-to-learn-a-useful-critic-model-based","title":"How to Learn a Useful Critic? Model-based Action-Gradient-Estimator Policy Optimization","date":"2020-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"angelolovatto/raylab","path":"raylab/options.py","file_url":"https://github.com/angelolovatto/raylab/blob/HEAD/raylab/options.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5bd21b59b9184273","mcp_get_code":{"code_sha256":"5bd21b59b9184273"}},{"arxiv_id":"1811.10959","paper":"/paper/dataset-distillation","title":"Dataset Distillation","date":"2018-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SsnL/dataset-distillation","path":"utils/logging.py","file_url":"https://github.com/SsnL/dataset-distillation/blob/HEAD/utils/logging.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2e1c63c03170fa89","mcp_get_code":{"code_sha256":"2e1c63c03170fa89"}}]}