{"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/get-generic-path-information","entry":"get_generic_path_information","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":5,"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":3,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":1},"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":"2502.03752","paper":"/paper/prism-a-robust-framework-for-skill-based-meta","title":"PRISM: A Robust Framework for Skill-based Meta-Reinforcement Learning with Noisy Demonstrations","date":"2025-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"katerakelly/oyster","path":"rlkit/core/eval_util.py","file_url":"https://github.com/katerakelly/oyster/blob/HEAD/rlkit/core/eval_util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c809703793017cd2","mcp_get_code":{"code_sha256":"c809703793017cd2"}},{"arxiv_id":"2312.06348","paper":"/paper/diffail-diffusion-adversarial-imitation","title":"DiffAIL: Diffusion Adversarial Imitation Learning","date":"2023-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ml-group-sdu/diffail","path":"rlkit/core/eval_util.py","file_url":"https://github.com/ml-group-sdu/diffail/blob/HEAD/rlkit/core/eval_util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5319d16fbb6eeb71","mcp_get_code":{"code_sha256":"5319d16fbb6eeb71"}},{"arxiv_id":"2311.03695","paper":"/paper/context-shift-reduction-for-offline-meta-1","title":"Context Shift Reduction for Offline Meta-Reinforcement Learning","date":"2023-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"moreanp/csro","path":"rlkit/core/eval_util.py","file_url":"https://github.com/moreanp/csro/blob/HEAD/rlkit/core/eval_util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c809703793017cd2","mcp_get_code":{"code_sha256":"c809703793017cd2"}},{"arxiv_id":"2206.03023","paper":"/paper/how-far-i-ll-go-offline-goal-conditioned","title":"How Far I'll Go: Offline Goal-Conditioned Reinforcement Learning via $f$-Advantage Regression","date":"2022-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jasonma2016/gofar","path":"envs/env_util.py","file_url":"https://github.com/jasonma2016/gofar/blob/HEAD/envs/env_util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c809703793017cd2","mcp_get_code":{"code_sha256":"c809703793017cd2"}},{"arxiv_id":"1912.11032","paper":"/paper/towards-practical-multi-object-manipulation","title":"Towards Practical Multi-Object Manipulation using Relational Reinforcement Learning","date":"2019-12-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"richardrl/rlkit-relational","path":"rlkit/core/eval_util.py","file_url":"https://github.com/richardrl/rlkit-relational/blob/HEAD/rlkit/core/eval_util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3b6d4f75ccbcf9d4","mcp_get_code":{"code_sha256":"3b6d4f75ccbcf9d4"}},{"arxiv_id":"1903.08254","paper":"/paper/efficient-off-policy-meta-reinforcement","title":"Efficient Off-Policy Meta-Reinforcement Learning via Probabilistic Context Variables","date":"2019-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lujiayou123/Off-Policy-Meta-Reinforcement-Learning-via-Unsupervised-Domain-Translation","path":"rlkit/core/eval_util.py","file_url":"https://github.com/lujiayou123/Off-Policy-Meta-Reinforcement-Learning-via-Unsupervised-Domain-Translation/blob/HEAD/rlkit/core/eval_util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c809703793017cd2","mcp_get_code":{"code_sha256":"c809703793017cd2"}}]}