{"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/preactresnet34","entry":"PreActResNet34","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":6,"n_papers_ran":4,"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":6,"n_samples_ran":4,"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":3,"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":"2406.01494","paper":"/paper/robust-classification-by-coupling-data","title":"Robust Classification by Coupling Data Mollification with Label Smoothing","date":"2024-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"markusheinonen/supervised-mollification","path":"src/networks/presnet.py","file_url":"https://github.com/markusheinonen/supervised-mollification/blob/HEAD/src/networks/presnet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"13ae2d9448f36c6c","mcp_get_code":{"code_sha256":"13ae2d9448f36c6c"}},{"arxiv_id":"2311.07444","paper":"/paper/on-the-robustness-of-neural-collapse-and-the","title":"On the Robustness of Neural Collapse and the Neural Collapse of Robustness","date":"2023-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jingtongsu/robust_neural_collapse","path":"preactresnet.py","file_url":"https://github.com/jingtongsu/robust_neural_collapse/blob/HEAD/preactresnet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5cda73c5f37181b9","mcp_get_code":{"code_sha256":"5cda73c5f37181b9"}},{"arxiv_id":"2308.12857","paper":"/paper/fast-adversarial-training-with-smooth","title":"Fast Adversarial Training with Smooth Convergence","date":"2023-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FAT-CS/ConvergeSmooth","path":"models/preact_resnet.py","file_url":"https://github.com/FAT-CS/ConvergeSmooth/blob/HEAD/models/preact_resnet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"47a2475271fa32cc","mcp_get_code":{"code_sha256":"47a2475271fa32cc"}},{"arxiv_id":"2202.14026","paper":"/paper/robust-training-under-label-noise-by-over","title":"Robust Training under Label Noise by Over-parameterization","date":"2022-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shengliu66/sop","path":"model/PreResNet.py","file_url":"https://github.com/shengliu66/sop/blob/HEAD/model/PreResNet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"02b18cf6e0d7cce3","mcp_get_code":{"code_sha256":"02b18cf6e0d7cce3"}},{"arxiv_id":"2003.04887","paper":"/paper/rezero-is-all-you-need-fast-convergence-at","title":"ReZero is All You Need: Fast Convergence at Large Depth","date":"2020-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"statsu1990/ReZero-Cifar100","path":"src/model/rezero_preact_resnet.py","file_url":"https://github.com/statsu1990/ReZero-Cifar100/blob/HEAD/src/model/rezero_preact_resnet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"228f5abb7a7bf1c7","mcp_get_code":{"code_sha256":"228f5abb7a7bf1c7"}},{"arxiv_id":"1905.11926","paper":"/paper/190511926","title":"Network Deconvolution","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deconvolutionpaper/deconvolution","path":"models/preact_resnet.py","file_url":"https://github.com/deconvolutionpaper/deconvolution/blob/HEAD/models/preact_resnet.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":"7f45dc0097346174","mcp_get_code":{"code_sha256":"7f45dc0097346174"}}]}