{"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-csv-result-dict","entry":"get_csv_result_dict","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":5,"n_papers_ran":2,"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":5,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":3},"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":"2406.12241","paper":"/paper/more-efficient-randomized-exploration-for","title":"More Efficient Randomized Exploration for Reinforcement Learning via Approximate Sampling","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"panxulab/lsvi-ase","path":"atari_analysis.py","file_url":"https://github.com/panxulab/lsvi-ase/blob/HEAD/atari_analysis.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d3ea6d1370050c52","mcp_get_code":{"code_sha256":"d3ea6d1370050c52"}},{"arxiv_id":"2305.18246","paper":"/paper/provable-and-practical-efficient-exploration","title":"Provable and Practical: Efficient Exploration in Reinforcement Learning via Langevin Monte Carlo","date":"2023-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hmishfaq/lmc-lsvi","path":"analysis.py","file_url":"https://github.com/hmishfaq/lmc-lsvi/blob/HEAD/analysis.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":"1088b057a72c9b1c","mcp_get_code":{"code_sha256":"1088b057a72c9b1c"}},{"arxiv_id":"2302.01470","paper":"/paper/learning-to-optimize-for-reinforcement","title":"Learning to Optimize for Reinforcement Learning","date":"2023-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sail-sg/optim4rl","path":"analysis_brax.py","file_url":"https://github.com/sail-sg/optim4rl/blob/HEAD/analysis_brax.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":"ec52772b6db9638a","mcp_get_code":{"code_sha256":"ec52772b6db9638a"}},{"arxiv_id":"2205.10868","paper":"/paper/memory-efficient-reinforcement-learning-with","title":"Memory-efficient Reinforcement Learning with Value-based Knowledge Consolidation","date":"2022-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qlan3/MeDQN","path":"analysis.py","file_url":"https://github.com/qlan3/MeDQN/blob/HEAD/analysis.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c8b9b4e53bd8c1ec","mcp_get_code":{"code_sha256":"c8b9b4e53bd8c1ec"}},{"arxiv_id":"2106.07841","paper":"/paper/randomized-exploration-for-reinforcement","title":"Randomized Exploration for Reinforcement Learning with General Value Function Approximation","date":"2021-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qlan3/Explorer","path":"analysis.py","file_url":"https://github.com/qlan3/Explorer/blob/HEAD/analysis.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"11ed4906b14eda12","mcp_get_code":{"code_sha256":"11ed4906b14eda12"}}]}