{"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/dict-to-cpu","entry":"dict_to_cpu","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":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":3,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":1,"unverified":0},"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":"2602.12162","paper":"/paper/arxiv-2602-12162","title":"Amortized Molecular Optimization via Group Relative Policy Optimization","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Hash-hh/AMORTIX","path":"model/molecule_transformer.py","file_url":"https://github.com/Hash-hh/AMORTIX/blob/HEAD/model/molecule_transformer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"88b04eafd87435f2","mcp_get_code":{"code_sha256":"88b04eafd87435f2"}},{"arxiv_id":"2404.03482","paper":"/paper/adaglimpse-active-visual-exploration-with","title":"AdaGlimpse: Active Visual Exploration with Arbitrary Glimpse Position and Scale","date":"2024-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apardyl/adaglimpse","path":"architectures/utils.py","file_url":"https://github.com/apardyl/adaglimpse/blob/HEAD/architectures/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"637b7997112a2f31","mcp_get_code":{"code_sha256":"637b7997112a2f31"}},{"arxiv_id":"2303.06457","paper":"/paper/active-visual-exploration-based-on-attention","title":"Active Visual Exploration Based on Attention-Map Entropy","date":"2023-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apardyl/AME","path":"architectures/selectors.py","file_url":"https://github.com/apardyl/AME/blob/HEAD/architectures/selectors.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"afe739802249075b","mcp_get_code":{"code_sha256":"afe739802249075b"}},{"arxiv_id":"2210.09598","paper":"/paper/planning-for-sample-efficient-imitation","title":"Planning for Sample Efficient Imitation Learning","date":"2022-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaohengyin/EfficientImitate","path":"algo/obs_ei/model.py","file_url":"https://github.com/zhaohengyin/EfficientImitate/blob/HEAD/algo/obs_ei/model.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":"88b04eafd87435f2","mcp_get_code":{"code_sha256":"88b04eafd87435f2"}},{"arxiv_id":"2111.00210","paper":"/paper/mastering-atari-games-with-limited-data","title":"Mastering Atari Games with Limited Data","date":"2021-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"werner-duvaud/muzero-general","path":"models.py","file_url":"https://github.com/werner-duvaud/muzero-general/blob/HEAD/models.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":"88b04eafd87435f2","mcp_get_code":{"code_sha256":"88b04eafd87435f2"}}]}