{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/preactresnet34","entry":"PreActResNet34","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":2,"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":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":4,"unverified":0},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, markusheinonen/supervised-mollification when it was checked","code_sha256":"13ae2d9448f36c6c","code_sha256_prefix":"13ae2d9448f36c6c","mcp_get_code":{"code_sha256":"13ae2d9448f36c6c"}},{"arxiv_id":"2311.07444","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jingtongsu/robust_neural_collapse when it was checked","code_sha256":"5cda73c5f37181b9","code_sha256_prefix":"5cda73c5f37181b9","mcp_get_code":{"code_sha256":"5cda73c5f37181b9"}},{"arxiv_id":"2308.12857","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, FAT-CS/ConvergeSmooth when it was checked","code_sha256":"47a2475271fa32cc","code_sha256_prefix":"47a2475271fa32cc","mcp_get_code":{"code_sha256":"47a2475271fa32cc"}},{"arxiv_id":"2202.14026","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"02b18cf6e0d7cce3","code_sha256_prefix":"02b18cf6e0d7cce3","mcp_get_code":{"code_sha256":"02b18cf6e0d7cce3"}},{"arxiv_id":"2003.04887","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"228f5abb7a7bf1c7","code_sha256_prefix":"228f5abb7a7bf1c7","mcp_get_code":{"code_sha256":"228f5abb7a7bf1c7"}},{"arxiv_id":"1905.11926","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7f45dc0097346174","code_sha256_prefix":"7f45dc0097346174","mcp_get_code":{"code_sha256":"7f45dc0097346174"}}],"record_sha256":"ee54a5f0a417ab22121250a874ff749b5c6d4824504cb9987d107dc6b1779e07","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}