{"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/configure","entry":"configure","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":6,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":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":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":6,"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":0,"ran_fixture":0,"ran":4,"unverified":2},"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":"2609.00759","arxiv_id_is_arxiv":true,"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":"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":"ba03e63e6f137cc9","code_sha256_prefix":"ba03e63e6f137cc9","mcp_get_code":{"code_sha256":"ba03e63e6f137cc9"}},{"arxiv_id":"2304.01203","arxiv_id_is_arxiv":true,"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":"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":"0746ec5ce635962b","code_sha256_prefix":"0746ec5ce635962b","mcp_get_code":{"code_sha256":"0746ec5ce635962b"}},{"arxiv_id":"2101.08152","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"819a51a05cef8459","code_sha256_prefix":"819a51a05cef8459","mcp_get_code":{"code_sha256":"819a51a05cef8459"}},{"arxiv_id":"2006.13560","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"473ddad861178c87","code_sha256_prefix":"473ddad861178c87","mcp_get_code":{"code_sha256":"473ddad861178c87"}},{"arxiv_id":"2004.14309","arxiv_id_is_arxiv":true,"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":"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":"5bd21b59b9184273","code_sha256_prefix":"5bd21b59b9184273","mcp_get_code":{"code_sha256":"5bd21b59b9184273"}},{"arxiv_id":"1811.10959","arxiv_id_is_arxiv":true,"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":"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":"2e1c63c03170fa89","code_sha256_prefix":"2e1c63c03170fa89","mcp_get_code":{"code_sha256":"2e1c63c03170fa89"}}],"record_sha256":"ecff5e9eac1d9089b39f3a170a12ec1eacc0672ea774213d65df3ca22b49eafb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}