{"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/batch-2","entry":"Batch","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":3,"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":3,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":2},"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":"2402.02104","paper":"/paper/learning-structure-aware-representations-of","title":"Learning Structure-Aware Representations of Dependent Types","date":"2024-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"konstantinoskokos/quill","path":"src/quill/nn/model.py","file_url":"https://github.com/konstantinoskokos/quill/blob/HEAD/src/quill/nn/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ce485d6261d21166","mcp_get_code":{"code_sha256":"ce485d6261d21166"}},{"arxiv_id":"2309.15178","paper":"/paper/conservative-world-models","title":"Zero-Shot Reinforcement Learning from Low Quality Data","date":"2023-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"enjeeneer/conservative-world-models","path":"agents/cfb/agent.py","file_url":"https://github.com/enjeeneer/conservative-world-models/blob/HEAD/agents/cfb/agent.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b940ca501e37511f","mcp_get_code":{"code_sha256":"b940ca501e37511f"}},{"arxiv_id":"2110.01528","paper":"/paper/large-batch-experience-replay","title":"Large Batch Experience Replay","date":"2021-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xavierchanglingli/regularized-optimal-experience-replay","path":"sac_learner.py","file_url":"https://github.com/xavierchanglingli/regularized-optimal-experience-replay/blob/HEAD/sac_learner.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f9a1b229fd3fdc31","mcp_get_code":{"code_sha256":"f9a1b229fd3fdc31"}},{"arxiv_id":"2109.00859","paper":"/paper/codet5-identifier-aware-unified-pre-trained","title":"CodeT5: Identifier-aware Unified Pre-trained Encoder-Decoder Models for Code Understanding and Generation","date":"2021-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jetbrains-research/commit_message_generation","path":"src/model/configurations/encoder_decoder_wrapper.py","file_url":"https://github.com/jetbrains-research/commit_message_generation/blob/HEAD/src/model/configurations/encoder_decoder_wrapper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"71f1a07d4d450ff9","mcp_get_code":{"code_sha256":"71f1a07d4d450ff9"}},{"arxiv_id":"1801.01290","paper":"/paper/soft-actor-critic-off-policy-maximum-entropy","title":"Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor","date":"2018-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yhisaki/average-reward-drl","path":"average_reward_drl/algorithms/sac.py","file_url":"https://github.com/yhisaki/average-reward-drl/blob/HEAD/average_reward_drl/algorithms/sac.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6bb425a4771dc88f","mcp_get_code":{"code_sha256":"6bb425a4771dc88f"}}]}