{"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","entry":"dict_to","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":2,"ran_fixture":0,"ran":1,"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":"2412.03439","paper":"/paper/cleandift-diffusion-features-without-noise","title":"CleanDIFT: Diffusion Features without Noise","date":"2024-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CompVis/cleandift","path":"src/utils.py","file_url":"https://github.com/CompVis/cleandift/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f52ee5efbe477940","mcp_get_code":{"code_sha256":"f52ee5efbe477940"}},{"arxiv_id":"2409.19872","paper":"/paper/towards-unified-multimodal-editing-with","title":"Towards Unified Multimodal Editing with Enhanced Knowledge Collaboration","date":"2024-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"beepkh/unike","path":"easyeditor/models/unike/unike_main.py","file_url":"https://github.com/beepkh/unike/blob/HEAD/easyeditor/models/unike/unike_main.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f2d353335799ab77","mcp_get_code":{"code_sha256":"f2d353335799ab77"}},{"arxiv_id":"2404.12843","paper":"/paper/towards-logically-consistent-language-models","title":"Towards Logically Consistent Language Models via Probabilistic Reasoning","date":"2024-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eric-mitchell/concord","path":"qa_conversion/fine_tune_t5.py","file_url":"https://github.com/eric-mitchell/concord/blob/HEAD/qa_conversion/fine_tune_t5.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"64b8712ec11eb61b","mcp_get_code":{"code_sha256":"64b8712ec11eb61b"}},{"arxiv_id":"2310.16795","paper":"/paper/qmoe-practical-sub-1-bit-compression-of","title":"QMoE: Practical Sub-1-Bit Compression of Trillion-Parameter Models","date":"2023-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ist-daslab/qmoe","path":"switch.py","file_url":"https://github.com/ist-daslab/qmoe/blob/HEAD/switch.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":"00ce9d8c2cca6542","mcp_get_code":{"code_sha256":"00ce9d8c2cca6542"}},{"arxiv_id":"2107.00717","paper":"/paper/similar-submodular-information-measures-based","title":"SIMILAR: Submodular Information Measures Based Active Learning In Realistic Scenarios","date":"2021-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"decile-team/distil","path":"distil/active_learning_strategies/batch_bald.py","file_url":"https://github.com/decile-team/distil/blob/HEAD/distil/active_learning_strategies/batch_bald.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"78ff6678d2342591","mcp_get_code":{"code_sha256":"78ff6678d2342591"}}]}