{"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/wrn28-10","entry":"wrn28_10","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":0,"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":0,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":5},"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":"2106.01440","paper":"/paper/memory-wrap-a-data-efficient-and","title":"Memory Wrap: a Data-Efficient and Interpretable Extension to Image Classification Models","date":"2021-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KRLGroup/memory-wrap","path":"paper/architectures/wide_resnet.py","file_url":"https://github.com/KRLGroup/memory-wrap/blob/HEAD/paper/architectures/wide_resnet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7ac8b84a748525a0","mcp_get_code":{"code_sha256":"7ac8b84a748525a0"}},{"arxiv_id":"2103.15375","paper":"/paper/alignmix-improving-representation-by","title":"AlignMixup: Improving Representations By Interpolating Aligned Features","date":"2021-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shashankvkt/alignmixup_cvpr22","path":"cifar10_100/models/WideResnet.py","file_url":"https://github.com/shashankvkt/alignmixup_cvpr22/blob/HEAD/cifar10_100/models/WideResnet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1bcad658b2d372fc","mcp_get_code":{"code_sha256":"1bcad658b2d372fc"}},{"arxiv_id":"2010.04925","paper":"/paper/regularizing-neural-networks-via-adversarial","title":"Regularizing Neural Networks via Adversarial Model Perturbation","date":"2020-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hiyouga/AMP-Regularizer","path":"models/wide_resnet.py","file_url":"https://github.com/hiyouga/AMP-Regularizer/blob/HEAD/models/wide_resnet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fb3b654b466c7bbc","mcp_get_code":{"code_sha256":"fb3b654b466c7bbc"}},{"arxiv_id":"2004.11362","paper":"/paper/supervised-contrastive-learning","title":"Supervised Contrastive Learning","date":"2020-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XG293/SupConLoss","path":"networks/wide_resnet.py","file_url":"https://github.com/XG293/SupConLoss/blob/HEAD/networks/wide_resnet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"code_sha256_prefix":"5e3536a0b5948376","mcp_get_code":{"code_sha256":"5e3536a0b5948376"}},{"arxiv_id":"Lazarou_Iterative_Label_Cleaning_for_Transductive_and_Semi-Supervised_Few-Shot_Learning_ICCV_2021_paper","paper":null,"title":"arXiv:Lazarou_Iterative_Label_Cleaning_for_Transductive_and_Semi-Supervised_Few-Shot_Learning_ICCV_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"MichalisLazarou/iLPC","path":"wrn_mixup_model.py","file_url":"https://github.com/MichalisLazarou/iLPC/blob/HEAD/wrn_mixup_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"207d265eae73863b","mcp_get_code":{"code_sha256":"207d265eae73863b"}}]}