{"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-module-by-name","entry":"get_module_by_name","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":"2606.03465","paper":"/paper/arxiv-2606-03465","title":"Rethinking the Role of Tensor Decompositions in Post-Training LLM Compression","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"brain-lab-research/TT-LLM","path":"src/tt_llm/llama_tt.py","file_url":"https://github.com/brain-lab-research/TT-LLM/blob/HEAD/src/tt_llm/llama_tt.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"54053c7ed589cd79","mcp_get_code":{"code_sha256":"54053c7ed589cd79"}},{"arxiv_id":"2410.14470","paper":"/paper/how-do-training-methods-influence-the","title":"How Do Training Methods Influence the Utilization of Vision Models?","date":"2024-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"paulgavrikov/layer_criticality","path":"code/utils.py","file_url":"https://github.com/paulgavrikov/layer_criticality/blob/HEAD/code/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC-BY-SA-4.0","inline_ok":false,"code_sha256_prefix":"ca195b048639186f","mcp_get_code":{"code_sha256":"ca195b048639186f"}},{"arxiv_id":"2410.05583","paper":"/paper/negmerge-consensual-weight-negation-for","title":"NegMerge: Consensual Weight Negation for Strong Machine Unlearning","date":"2024-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"naver-ai/negmerge","path":"CLIP_MU/src/modeling.py","file_url":"https://github.com/naver-ai/negmerge/blob/HEAD/CLIP_MU/src/modeling.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"23886ccd64a06f48","mcp_get_code":{"code_sha256":"23886ccd64a06f48"}},{"arxiv_id":"2204.04516","paper":"/paper/uncertainty-informed-deep-learning-models","title":"Uncertainty-Informed Deep Learning Models Enable High-Confidence Predictions for Digital Histopathology","date":"2022-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jamesdolezal/slideflow","path":"slideflow/model/torch_utils.py","file_url":"https://github.com/jamesdolezal/slideflow/blob/HEAD/slideflow/model/torch_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"09dddb2a3dd86eec","mcp_get_code":{"code_sha256":"09dddb2a3dd86eec"}},{"arxiv_id":"2106.10860","paper":"/paper/multiplying-matrices-without-multiplying","title":"Multiplying Matrices Without Multiplying","date":"2021-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joennlae/halutmatmul","path":"src/python/halutmatmul/model.py","file_url":"https://github.com/joennlae/halutmatmul/blob/HEAD/src/python/halutmatmul/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"423bc966744f4f58","mcp_get_code":{"code_sha256":"423bc966744f4f58"}}]}