{"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/wide-resnet","entry":"Wide_ResNet","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":5,"n_samples_ran":5,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":5,"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":"2303.10353","paper":"/paper/sharpness-aware-gradient-matching-for-domain","title":"Sharpness-Aware Gradient Matching for Domain Generalization","date":"2023-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wang-pengfei/sagm","path":"domainbed/algorithms/algorithms.py","file_url":"https://github.com/wang-pengfei/sagm/blob/HEAD/domainbed/algorithms/algorithms.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6a63af402870932f","mcp_get_code":{"code_sha256":"6a63af402870932f"}},{"arxiv_id":"2110.14577","paper":"/paper/a-geometric-perspective-towards-neural","title":"A Geometric Perspective towards Neural Calibration via Sensitivity Decomposition","date":"2021-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gt-ripl/geometric-sensitivity-decomposition","path":"models/wide_resnet.py","file_url":"https://github.com/gt-ripl/geometric-sensitivity-decomposition/blob/HEAD/models/wide_resnet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e98762c2e70fc081","mcp_get_code":{"code_sha256":"e98762c2e70fc081"}},{"arxiv_id":"2006.14154","paper":"/paper/strictly-batch-imitation-learning-by-energy","title":"Strictly Batch Imitation Learning by Energy-based Distribution Matching","date":"2020-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wgrathwohl/JEM","path":"train_wrn_ebm.py","file_url":"https://github.com/wgrathwohl/JEM/blob/HEAD/train_wrn_ebm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"84de817b353f7c2c","mcp_get_code":{"code_sha256":"84de817b353f7c2c"}},{"arxiv_id":"1905.02249","paper":"/paper/mixmatch-a-holistic-approach-to-semi","title":"MixMatch: A Holistic Approach to Semi-Supervised Learning","date":"2019-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"atinghosh/mixmatch_pytorch","path":"network_mod.py","file_url":"https://github.com/atinghosh/mixmatch_pytorch/blob/HEAD/network_mod.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8608707dd0f937bd","mcp_get_code":{"code_sha256":"8608707dd0f937bd"}},{"arxiv_id":"1605.07146","paper":"/paper/wide-residual-networks","title":"Wide Residual Networks","date":"2016-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"giannifranchi/LP_BNN","path":"networks/wide_resnet.py","file_url":"https://github.com/giannifranchi/LP_BNN/blob/HEAD/networks/wide_resnet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b21f570ed5dc6476","mcp_get_code":{"code_sha256":"b21f570ed5dc6476"}}]}