{"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/cwloss","entry":"cwloss","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":1,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":0,"unverified":3},"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":"2507.12843","paper":null,"title":"arXiv:2507.12843","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"zhijianzhouml/NAMMD","path":"ADV_exp/attack_generator.py","file_url":"https://github.com/zhijianzhouml/NAMMD/blob/HEAD/ADV_exp/attack_generator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9813b7acd483544c","mcp_get_code":{"code_sha256":"9813b7acd483544c"}},{"arxiv_id":"2309.05145","paper":"/paper/outlier-robust-adversarial-training","title":"Outlier Robust Adversarial Training","date":"2023-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"discovershu/orat","path":"attack_generator.py","file_url":"https://github.com/discovershu/orat/blob/HEAD/attack_generator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fe7eaae3746b472c","mcp_get_code":{"code_sha256":"fe7eaae3746b472c"}},{"arxiv_id":"2309.05145","paper":"/paper/outlier-robust-adversarial-training","title":"Outlier Robust Adversarial Training","date":"2023-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"discovershu/orat","path":"attack_generator_for_cifar100.py","file_url":"https://github.com/discovershu/orat/blob/HEAD/attack_generator_for_cifar100.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"46dd15a24372e042","mcp_get_code":{"code_sha256":"46dd15a24372e042"}},{"arxiv_id":"2306.03726","paper":"/paper/exploring-model-dynamics-for-accumulative","title":"Exploring Model Dynamics for Accumulative Poisoning Discovery","date":"2023-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmlr-group/memorization-discrepancy","path":"attack_generator.py","file_url":"https://github.com/tmlr-group/memorization-discrepancy/blob/HEAD/attack_generator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9813b7acd483544c","mcp_get_code":{"code_sha256":"9813b7acd483544c"}},{"arxiv_id":"2210.03543","paper":"/paper/a2-efficient-automated-attacker-for-boosting","title":"A2: Efficient Automated Attacker for Boosting Adversarial Training","date":"2022-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alipay/A2-efficient-automated-attacker-for-boosting-adversarial-training","path":"attack_generator.py","file_url":"https://github.com/alipay/A2-efficient-automated-attacker-for-boosting-adversarial-training/blob/HEAD/attack_generator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"9813b7acd483544c","mcp_get_code":{"code_sha256":"9813b7acd483544c"}},{"arxiv_id":"2106.04928","paper":"/paper/reliable-adversarial-distillation-with","title":"Reliable Adversarial Distillation with Unreliable Teachers","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zfancy/iad","path":"attack_generator.py","file_url":"https://github.com/zfancy/iad/blob/HEAD/attack_generator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d2682eaa7c907946","mcp_get_code":{"code_sha256":"d2682eaa7c907946"}}]}