{"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-file-hash","entry":"get_file_hash","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":1,"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":1,"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":1,"unverified":4},"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":"2607.23545","paper":"/paper/arxiv-2607-23545","title":"Language Shapes Instruction Hierarchy Compliance in Multilingual LLMs","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"g1moon/Language-Shapes-IH","path":"src/model/aggregate_matrix_scores.py","file_url":"https://github.com/g1moon/Language-Shapes-IH/blob/HEAD/src/model/aggregate_matrix_scores.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"cc06dc4b0c96fde0","mcp_get_code":{"code_sha256":"cc06dc4b0c96fde0"}},{"arxiv_id":"2510.22851","paper":"/paper/arxiv-2510-22851","title":"Semantic Surgery: Zero-Shot Concept Erasure in Diffusion Models","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"Lexiang-Xiong/Semantic-Surgery","path":"evaluation/eval_nudity.py","file_url":"https://github.com/Lexiang-Xiong/Semantic-Surgery/blob/HEAD/evaluation/eval_nudity.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4dd56ebd3bab6032","mcp_get_code":{"code_sha256":"4dd56ebd3bab6032"}},{"arxiv_id":"2506.20629","paper":"/paper/plop-precise-lora-placement-for-efficient","title":"PLoP: Precise LoRA Placement for Efficient Finetuning of Large Models","date":"2025-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"soufiane001/plop","path":"sft/dataset_transformation.py","file_url":"https://github.com/soufiane001/plop/blob/HEAD/sft/dataset_transformation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"26e5bf7cdee2b82e","mcp_get_code":{"code_sha256":"26e5bf7cdee2b82e"}},{"arxiv_id":"2506.01853","paper":"/paper/shapellm-omni-a-native-multimodal-llm-for-3d","title":"ShapeLLM-Omni: A Native Multimodal LLM for 3D Generation and Understanding","date":"2025-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jamesyjl/shapellm-omni","path":"dataset_toolkits/utils.py","file_url":"https://github.com/jamesyjl/shapellm-omni/blob/HEAD/dataset_toolkits/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a691824c3709ab59","mcp_get_code":{"code_sha256":"a691824c3709ab59"}},{"arxiv_id":"2206.13424","paper":"/paper/benchopt-reproducible-efficient-and","title":"Benchopt: Reproducible, efficient and collaborative optimization benchmarks","date":"2022-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"benchopt/benchopt","path":"benchopt/utils/dynamic_modules.py","file_url":"https://github.com/benchopt/benchopt/blob/HEAD/benchopt/utils/dynamic_modules.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"91a5c920fcf2ab00","mcp_get_code":{"code_sha256":"91a5c920fcf2ab00"}}]}