{"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/pre-processing","entry":"pre_processing","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":4,"n_samples_ran":2,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"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":"2606.22314","paper":"/paper/arxiv-2606-22314","title":"Diffusion Integrated Gradients: Controllable Path Generation for Flexible Feature Attribution","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"pd90506/AGI","path":"utils.py","file_url":"https://github.com/pd90506/AGI/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b3bf35112d317c46","mcp_get_code":{"code_sha256":"b3bf35112d317c46"}},{"arxiv_id":"2312.13630","paper":"/paper/mfaba-a-more-faithful-and-accelerated","title":"MFABA: A More Faithful and Accelerated Boundary-based Attribution Method for Deep Neural Networks","date":"2023-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lmbtough/mfaba","path":"utils.py","file_url":"https://github.com/lmbtough/mfaba/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b3bf35112d317c46","mcp_get_code":{"code_sha256":"b3bf35112d317c46"}},{"arxiv_id":"1911.08085","paper":"/paper/outlier-robust-high-dimensional-sparse-1","title":"Outlier-Robust High-Dimensional Sparse Estimation via Iterative Filtering","date":"2019-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huihui0902/robust_mean_estimation","path":"robust_mean_estimate_acc.py","file_url":"https://github.com/huihui0902/robust_mean_estimation/blob/HEAD/robust_mean_estimate_acc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3e161617d69a519f","mcp_get_code":{"code_sha256":"3e161617d69a519f"}},{"arxiv_id":"1807.11164","paper":"/paper/shufflenet-v2-practical-guidelines-for","title":"ShuffleNet V2: Practical Guidelines for Efficient CNN Architecture Design","date":"2018-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mnicnc404/CartoonGan-tensorflow","path":"cartoonize.py","file_url":"https://github.com/mnicnc404/CartoonGan-tensorflow/blob/HEAD/cartoonize.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":"ef3323039d6f13b6","mcp_get_code":{"code_sha256":"ef3323039d6f13b6"}},{"arxiv_id":"1703.01365","paper":"/paper/axiomatic-attribution-for-deep-networks","title":"Axiomatic Attribution for Deep Networks","date":"2017-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TianhongDai/integrated-gradient-pytorch","path":"integrated_gradients.py","file_url":"https://github.com/TianhongDai/integrated-gradient-pytorch/blob/HEAD/integrated_gradients.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f4fdca61674e575a","mcp_get_code":{"code_sha256":"f4fdca61674e575a"}}]}