{"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-all-datasets","entry":"get_all_datasets","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":8,"n_papers_ran":4,"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":7,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":5},"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":"2605.11975","paper":"/paper/arxiv-2605-11975","title":"Stochastic Minimum-Cost Reach-Avoid Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"milanganai/milanganai.github.io","path":"NeurIPS2023/code/utils/plot.py","file_url":"https://github.com/milanganai/milanganai.github.io/blob/HEAD/NeurIPS2023/code/utils/plot.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"62314e3b8ca6edfc","mcp_get_code":{"code_sha256":"62314e3b8ca6edfc"}},{"arxiv_id":"2502.05163","paper":"/paper/duoguard-a-two-player-rl-driven-framework-for","title":"DuoGuard: A Two-Player RL-Driven Framework for Multilingual LLM Guardrails","date":"2025-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yihedeng9/duoguard","path":"classifier/process_dataset.py","file_url":"https://github.com/yihedeng9/duoguard/blob/HEAD/classifier/process_dataset.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":"6e59a73fec2ef5e7","mcp_get_code":{"code_sha256":"6e59a73fec2ef5e7"}},{"arxiv_id":"2310.13230","paper":"/paper/absolute-policy-optimization","title":"Absolute Policy Optimization","date":"2023-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intelligent-control-lab/absolute-policy-optimization","path":"rl_lib/utils/plot.py","file_url":"https://github.com/intelligent-control-lab/absolute-policy-optimization/blob/HEAD/rl_lib/utils/plot.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4074c0844f42d37f","mcp_get_code":{"code_sha256":"4074c0844f42d37f"}},{"arxiv_id":"2304.01922","paper":"/paper/resources-and-few-shot-learners-for-in","title":"Resources and Few-shot Learners for In-context Learning in Slavic Languages","date":"2023-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fewshot-goes-multilingual/slavic-incontext-learning","path":"evaluation/tasks/cs/customized_datasets.py","file_url":"https://github.com/fewshot-goes-multilingual/slavic-incontext-learning/blob/HEAD/evaluation/tasks/cs/customized_datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b7c782c23bb027ff","mcp_get_code":{"code_sha256":"b7c782c23bb027ff"}},{"arxiv_id":"2304.01922","paper":"/paper/resources-and-few-shot-learners-for-in","title":"Resources and Few-shot Learners for In-context Learning in Slavic Languages","date":"2023-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fewshot-goes-multilingual/slavic-incontext-learning","path":"evaluation/tasks/pl/customized_datasets.py","file_url":"https://github.com/fewshot-goes-multilingual/slavic-incontext-learning/blob/HEAD/evaluation/tasks/pl/customized_datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"eff18344e49fbec0","mcp_get_code":{"code_sha256":"eff18344e49fbec0"}},{"arxiv_id":"2106.09110","paper":"/paper/safe-reinforcement-learning-using-advantage","title":"Safe Reinforcement Learning Using Advantage-Based Intervention","date":"2021-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nolanwagener/safe_rl","path":"safe_rl/utils/plot.py","file_url":"https://github.com/nolanwagener/safe_rl/blob/HEAD/safe_rl/utils/plot.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"db18a597508be1d7","mcp_get_code":{"code_sha256":"db18a597508be1d7"}},{"arxiv_id":"2006.07442","paper":"/paper/self-imitation-learning-via-generalized-lower","title":"Self-Imitation Learning via Generalized Lower Bound Q-learning","date":"2020-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openai/spinningup","path":"spinup/utils/plot.py","file_url":"https://github.com/openai/spinningup/blob/HEAD/spinup/utils/plot.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"62314e3b8ca6edfc","mcp_get_code":{"code_sha256":"62314e3b8ca6edfc"}},{"arxiv_id":"1812.02690","paper":"/paper/provably-efficient-maximum-entropy","title":"Provably Efficient Maximum Entropy Exploration","date":"2018-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abbyvansoest/maxent","path":"plot.py","file_url":"https://github.com/abbyvansoest/maxent/blob/HEAD/plot.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cfce41fe4e302f84","mcp_get_code":{"code_sha256":"cfce41fe4e302f84"}},{"arxiv_id":"1802.09477","paper":"/paper/addressing-function-approximation-error-in","title":"Addressing Function Approximation Error in Actor-Critic Methods","date":"2018-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"robintyh1/icml2021-pengqlambda","path":"spinup/utils/plot.py","file_url":"https://github.com/robintyh1/icml2021-pengqlambda/blob/HEAD/spinup/utils/plot.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"62314e3b8ca6edfc","mcp_get_code":{"code_sha256":"62314e3b8ca6edfc"}}]}