{"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/get-render-func","entry":"get_render_func","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":7,"n_papers_ran_no_instrument_failure":7,"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":1,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":7,"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":1,"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":"2210.03104","arxiv_id_is_arxiv":true,"paper":"/paper/distributionally-adaptive-meta-reinforcement","title":"Distributionally Adaptive Meta Reinforcement Learning","date":"2022-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ikostrikov/pytorch-a2c-ppo-acktr-gail","path":"a2c_ppo_acktr/utils.py","file_url":"https://github.com/ikostrikov/pytorch-a2c-ppo-acktr-gail/blob/HEAD/a2c_ppo_acktr/utils.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":"108dc9c41448855e","code_sha256_prefix":"108dc9c41448855e","mcp_get_code":{"code_sha256":"108dc9c41448855e"}},{"arxiv_id":"2206.09314","arxiv_id_is_arxiv":true,"paper":"/paper/robust-imitation-learning-against-variations","title":"Robust Imitation Learning against Variations in Environment Dynamics","date":"2022-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JongseongChae/RIME","path":"algorithm/utils.py","file_url":"https://github.com/JongseongChae/RIME/blob/HEAD/algorithm/utils.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":"108dc9c41448855e","code_sha256_prefix":"108dc9c41448855e","mcp_get_code":{"code_sha256":"108dc9c41448855e"}},{"arxiv_id":"2104.07495","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-exploration-via-latent","title":"Curiosity-Driven Exploration via Latent Bayesian Surprise","date":"2021-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mazpie/lbs-exploration","path":"exploration/utils.py","file_url":"https://github.com/mazpie/lbs-exploration/blob/HEAD/exploration/utils.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":"108dc9c41448855e","code_sha256_prefix":"108dc9c41448855e","mcp_get_code":{"code_sha256":"108dc9c41448855e"}},{"arxiv_id":"2009.01439","arxiv_id_is_arxiv":true,"paper":"/paper/dexterous-robotic-grasping-with-object","title":"Learning Dexterous Grasping with Object-Centric Visual Affordances","date":"2020-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"priyankamandikal/graff","path":"a2c_ppo_acktr/utils.py","file_url":"https://github.com/priyankamandikal/graff/blob/HEAD/a2c_ppo_acktr/utils.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":"108dc9c41448855e","code_sha256_prefix":"108dc9c41448855e","mcp_get_code":{"code_sha256":"108dc9c41448855e"}},{"arxiv_id":"2006.09447","arxiv_id_is_arxiv":true,"paper":"/paper/opponent-modelling-with-local-information","title":"Agent Modelling under Partial Observability for Deep Reinforcement Learning","date":"2020-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uoe-agents/LIAM","path":"double_speaker_listener/utils.py","file_url":"https://github.com/uoe-agents/LIAM/blob/HEAD/double_speaker_listener/utils.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":"108dc9c41448855e","code_sha256_prefix":"108dc9c41448855e","mcp_get_code":{"code_sha256":"108dc9c41448855e"}},{"arxiv_id":"2003.04108","arxiv_id_is_arxiv":true,"paper":"/paper/stable-policy-optimization-via-off-policy","title":"Stable Policy Optimization via Off-Policy Divergence Regularization","date":"2020-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/ppo-dice","path":"agents/utils.py","file_url":"https://github.com/facebookresearch/ppo-dice/blob/HEAD/agents/utils.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":"108dc9c41448855e","code_sha256_prefix":"108dc9c41448855e","mcp_get_code":{"code_sha256":"108dc9c41448855e"}},{"arxiv_id":"1905.04640","arxiv_id_is_arxiv":true,"paper":"/paper/mega-reward-achieving-human-level-play","title":"Mega-Reward: Achieving Human-Level Play without Extrinsic Rewards","date":"2019-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YuhangSong/Mega-Reward","path":"a2c_ppo_acktr/utils.py","file_url":"https://github.com/YuhangSong/Mega-Reward/blob/HEAD/a2c_ppo_acktr/utils.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":"108dc9c41448855e","code_sha256_prefix":"108dc9c41448855e","mcp_get_code":{"code_sha256":"108dc9c41448855e"}}],"record_sha256":"7f3388cb7369b213c65c3130a4ec9946236f31a14d005f558068a612ce5e6967","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}