{"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/normalize-flatten-features","entry":"normalize_flatten_features","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":5,"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":3,"n_samples_ran":3,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":0},"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":"2406.03143","paper":"/paper/zeropur-succinct-training-free-adversarial","title":"ZeroPur: Succinct Training-Free Adversarial Purification","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"erhul/ZeroPur","path":"peceptual/distances.py","file_url":"https://github.com/erhul/ZeroPur/blob/HEAD/peceptual/distances.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"096fecc8a890169a","mcp_get_code":{"code_sha256":"096fecc8a890169a"}},{"arxiv_id":"2211.00824","paper":"/paper/adversarial-auto-augment-with-label","title":"Adversarial Auto-Augment with Label Preservation: A Representation Learning Principle Guided Approach","date":"2022-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kai-wen-yang/lpa3","path":"PES/PES_LPA3.py","file_url":"https://github.com/kai-wen-yang/lpa3/blob/HEAD/PES/PES_LPA3.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5fdd95c30251abf7","mcp_get_code":{"code_sha256":"5fdd95c30251abf7"}},{"arxiv_id":"2210.09852","paper":"/paper/scaling-adversarial-training-to-large","title":"Scaling Adversarial Training to Large Perturbation Bounds","date":"2022-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"val-iisc/OAAT","path":"perceptual_advex/distances.py","file_url":"https://github.com/val-iisc/OAAT/blob/HEAD/perceptual_advex/distances.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"096fecc8a890169a","mcp_get_code":{"code_sha256":"096fecc8a890169a"}},{"arxiv_id":"2209.05785","paper":"/paper/adversarial-coreset-selection-for-efficient","title":"Adversarial Coreset Selection for Efficient Robust Training","date":"2022-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hmdolatabadi/acs","path":"perceptual_advex/distances.py","file_url":"https://github.com/hmdolatabadi/acs/blob/HEAD/perceptual_advex/distances.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"096fecc8a890169a","mcp_get_code":{"code_sha256":"096fecc8a890169a"}},{"arxiv_id":"2006.12655","paper":"/paper/perceptual-adversarial-robustness-defense","title":"Perceptual Adversarial Robustness: Defense Against Unseen Threat Models","date":"2020-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cassidylaidlaw/perceptual-advex","path":"perceptual_advex/perceptual_attacks.py","file_url":"https://github.com/cassidylaidlaw/perceptual-advex/blob/HEAD/perceptual_advex/perceptual_attacks.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"016b0a2f3d92b2bd","mcp_get_code":{"code_sha256":"016b0a2f3d92b2bd"}}]}