{"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/attrdict","entry":"AttrDict","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":3,"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":"2605.26990","paper":"/paper/arxiv-2605-26990","title":"Constrained Bayesian Experimental Design via Online Planning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"yujiag21/COPEx","path":"acquisition_functions/multi_step_lookahead.py","file_url":"https://github.com/yujiag21/COPEx/blob/HEAD/acquisition_functions/multi_step_lookahead.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1bad66b74e632492","mcp_get_code":{"code_sha256":"1bad66b74e632492"}},{"arxiv_id":"2210.05409","paper":"/paper/leco-learnable-episodic-count-for-task","title":"LECO: Learnable Episodic Count for Task-Specific Intrinsic Reward","date":"2022-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kakaobrain/leco","path":"sample_factory/algorithms/appo/intrinsic.py","file_url":"https://github.com/kakaobrain/leco/blob/HEAD/sample_factory/algorithms/appo/intrinsic.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"992553c7fdf8d531","mcp_get_code":{"code_sha256":"992553c7fdf8d531"}},{"arxiv_id":"2204.01446","paper":"/paper/wildnet-learning-domain-generalized-semantic","title":"WildNet: Learning Domain Generalized Semantic Segmentation from the Wild","date":"2022-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"suhyeonlee/WildNet","path":"network/deepv3.py","file_url":"https://github.com/suhyeonlee/WildNet/blob/HEAD/network/deepv3.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5904b95e70b5177a","mcp_get_code":{"code_sha256":"5904b95e70b5177a"}},{"arxiv_id":"1912.01603","paper":"/paper/dream-to-control-learning-behaviors-by-latent","title":"Dream to Control: Learning Behaviors by Latent Imagination","date":"2019-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhixuan-lin/dreamer-pytorch","path":"dreamer.py","file_url":"https://github.com/zhixuan-lin/dreamer-pytorch/blob/HEAD/dreamer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4000edd2f154ac83","mcp_get_code":{"code_sha256":"4000edd2f154ac83"}},{"arxiv_id":"1603.09246","paper":"/paper/unsupervised-learning-of-visual-1","title":"Unsupervised Learning of Visual Representations by Solving Jigsaw Puzzles","date":"2016-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/vissl","path":"vissl/models/trunks/alexnet_jigsaw.py","file_url":"https://github.com/facebookresearch/vissl/blob/HEAD/vissl/models/trunks/alexnet_jigsaw.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6663d33830e09bae","mcp_get_code":{"code_sha256":"6663d33830e09bae"}}]}