{"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/resnet44","entry":"resnet44","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":19,"n_papers_ran":18,"n_papers_ran_no_instrument_failure":10,"n_papers_ran_instrument_only":8,"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":16,"n_samples_ran":15,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":5,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":19,"n_places_pointer_only":6,"n_places_pointer_only_link_open":1,"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":5,"ran_fixture":0,"ran":10,"unverified":1},"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":"2604.06468","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-06468","title":"Conformal Margin Risk Minimization: An Envelope Framework for Robust Learning under Label Noise","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"YuanjieSh/CMRM","path":"Multi_code_synthetic_noise/models/resnet_cifar.py","file_url":"https://github.com/YuanjieSh/CMRM/blob/HEAD/Multi_code_synthetic_noise/models/resnet_cifar.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"06958241b55ab4aa","code_sha256_prefix":"06958241b55ab4aa","mcp_get_code":{"code_sha256":"06958241b55ab4aa"}},{"arxiv_id":"2412.00544","arxiv_id_is_arxiv":true,"paper":"/paper/robo6-standardized-mmt-light-curve-dataset","title":"RoBo6: Standardized MMT Light Curve Dataset for Rocket Body Classification","date":"2024-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kyselica12/RoBo6_Model_Comparison","path":"modules/resnet.py","file_url":"https://github.com/kyselica12/RoBo6_Model_Comparison/blob/HEAD/modules/resnet.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, kyselica12/RoBo6_Model_Comparison when it was checked","code_sha256":"c7b0f8beba25b340","code_sha256_prefix":"c7b0f8beba25b340","mcp_get_code":{"code_sha256":"c7b0f8beba25b340"}},{"arxiv_id":"2410.10683","arxiv_id_is_arxiv":true,"paper":"/paper/sampa-sharpness-aware-minimization","title":"SAMPa: Sharpness-aware Minimization Parallelized","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LIONS-EPFL/SAMPa","path":"model/resnet.py","file_url":"https://github.com/LIONS-EPFL/SAMPa/blob/HEAD/model/resnet.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, LIONS-EPFL/SAMPa when it was checked","code_sha256":"cd8b7f0a3a1b23f4","code_sha256_prefix":"cd8b7f0a3a1b23f4","mcp_get_code":{"code_sha256":"cd8b7f0a3a1b23f4"}},{"arxiv_id":"2407.12543","arxiv_id_is_arxiv":true,"paper":"/paper/abstraction-alignment-comparing-model-and","title":"Abstraction Alignment: Comparing Model-Learned and Human-Encoded Conceptual Relationships","date":"2024-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mitvis/abstraction-alignment","path":"util/cifar/resnet.py","file_url":"https://github.com/mitvis/abstraction-alignment/blob/HEAD/util/cifar/resnet.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, mitvis/abstraction-alignment when it was checked","code_sha256":"cd8b7f0a3a1b23f4","code_sha256_prefix":"cd8b7f0a3a1b23f4","mcp_get_code":{"code_sha256":"cd8b7f0a3a1b23f4"}},{"arxiv_id":"2406.06818","arxiv_id_is_arxiv":true,"paper":"/paper/conformal-prediction-for-class-wise-coverage","title":"Conformal Prediction for Class-wise Coverage via Augmented Label Rank Calibration","date":"2024-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuanjiesh/rc3p","path":"models/resnet_cifar.py","file_url":"https://github.com/yuanjiesh/rc3p/blob/HEAD/models/resnet_cifar.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"06958241b55ab4aa","code_sha256_prefix":"06958241b55ab4aa","mcp_get_code":{"code_sha256":"06958241b55ab4aa"}},{"arxiv_id":"2312.17369","arxiv_id_is_arxiv":true,"paper":"/paper/sania-polyak-type-optimization-framework","title":"SANIA: Polyak-type Optimization Framework Leads to Scale Invariant Stochastic Algorithms","date":"2023-12-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fxrshed/sania","path":"experiments/cifar_resnet.py","file_url":"https://github.com/fxrshed/sania/blob/HEAD/experiments/cifar_resnet.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, fxrshed/sania when it was checked","code_sha256":"65164998e66af8ac","code_sha256_prefix":"65164998e66af8ac","mcp_get_code":{"code_sha256":"65164998e66af8ac"}},{"arxiv_id":"2307.07873","arxiv_id_is_arxiv":true,"paper":"/paper/towards-understanding-adversarial","title":"Why Does Little Robustness Help? A Further Step Towards Understanding Adversarial Transferability","date":"2023-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cgcl-codes/transferattacksurrogates","path":"TransferAttack/models/resnet_cifar.py","file_url":"https://github.com/cgcl-codes/transferattacksurrogates/blob/HEAD/TransferAttack/models/resnet_cifar.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":"7a0631b66b62efa7","code_sha256_prefix":"7a0631b66b62efa7","mcp_get_code":{"code_sha256":"7a0631b66b62efa7"}},{"arxiv_id":"2306.12625","arxiv_id_is_arxiv":true,"paper":"/paper/communication-efficient-federated-learning-20","title":"Adaptive Compression in Federated Learning via Side Information","date":"2023-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"francescopase/federated-klms","path":"flower_fl/models/resnet.py","file_url":"https://github.com/francescopase/federated-klms/blob/HEAD/flower_fl/models/resnet.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":"b37b467a20738989","code_sha256_prefix":"b37b467a20738989","mcp_get_code":{"code_sha256":"b37b467a20738989"}},{"arxiv_id":"2306.02210","arxiv_id_is_arxiv":true,"paper":"/paper/gpt-fl-generative-pre-trained-model-assisted","title":"GPT-FL: Generative Pre-trained Model-Assisted Federated Learning","date":"2023-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AvestimehrResearchGroup/GPT-FL","path":"synthetic_data_generation/resnet.py","file_url":"https://github.com/AvestimehrResearchGroup/GPT-FL/blob/HEAD/synthetic_data_generation/resnet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, AvestimehrResearchGroup/GPT-FL, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"45360a9cb0aa934f","code_sha256_prefix":"45360a9cb0aa934f","mcp_get_code":{"code_sha256":"45360a9cb0aa934f"}},{"arxiv_id":"2301.07969","arxiv_id_is_arxiv":true,"paper":"/paper/fast-inference-in-denoising-diffusion-models","title":"Fast Inference in Denoising Diffusion Models via MMD Finetuning","date":"2023-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"diegovalsesia/mmd-ddm","path":"models/resnet.py","file_url":"https://github.com/diegovalsesia/mmd-ddm/blob/HEAD/models/resnet.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":"487643556106dfaa","code_sha256_prefix":"487643556106dfaa","mcp_get_code":{"code_sha256":"487643556106dfaa"}},{"arxiv_id":"2211.16274","arxiv_id_is_arxiv":true,"paper":"/paper/nctv-neural-clamping-toolkit-and","title":"NCTV: Neural Clamping Toolkit and Visualization for Neural Network Calibration","date":"2022-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yungchentang/NCToolkit","path":"neural_clamping/models/resnet_cifar10.py","file_url":"https://github.com/yungchentang/NCToolkit/blob/HEAD/neural_clamping/models/resnet_cifar10.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from LIONS-EPFL/SAMPa, and GitHub detected no licence in that repository when it was checked","code_sha256":"cd8b7f0a3a1b23f4","code_sha256_prefix":"cd8b7f0a3a1b23f4","mcp_get_code":{"code_sha256":"cd8b7f0a3a1b23f4"}},{"arxiv_id":"2206.11488","arxiv_id_is_arxiv":true,"paper":"/paper/on-pre-training-for-federated-learning","title":"On the Importance and Applicability of Pre-Training for Federated Learning","date":"2022-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andytu28/fps_pre-training","path":"resnet_cifar.py","file_url":"https://github.com/andytu28/fps_pre-training/blob/HEAD/resnet_cifar.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"930fbc89011b6494","code_sha256_prefix":"930fbc89011b6494","mcp_get_code":{"code_sha256":"930fbc89011b6494"}},{"arxiv_id":"2108.13446","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-the-accuracy-and-robustness-of","title":"Benchmarking the Accuracy and Robustness of Feedback Alignment Algorithms","date":"2021-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jsalbert/biotorch","path":"biotorch/models/small_resnet.py","file_url":"https://github.com/jsalbert/biotorch/blob/HEAD/biotorch/models/small_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":"f136cbda7347a42f","code_sha256_prefix":"f136cbda7347a42f","mcp_get_code":{"code_sha256":"f136cbda7347a42f"}},{"arxiv_id":"2103.15798","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-neural-operations-for-diverse","title":"Rethinking Neural Operations for Diverse Tasks","date":"2021-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mkhodak/relax","path":"examples/resnet/resnet.py","file_url":"https://github.com/mkhodak/relax/blob/HEAD/examples/resnet/resnet.py","status":"unverified","verification_level":0,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"595fe4a7995fd021","code_sha256_prefix":"595fe4a7995fd021","mcp_get_code":{"code_sha256":"595fe4a7995fd021"}},{"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":"fabio-deep/ReZero-ResNet","path":"src/resnet.py","file_url":"https://github.com/fabio-deep/ReZero-ResNet/blob/HEAD/src/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":"7377861df3c47980","code_sha256_prefix":"7377861df3c47980","mcp_get_code":{"code_sha256":"7377861df3c47980"}},{"arxiv_id":"1909.08174","arxiv_id_is_arxiv":true,"paper":"/paper/gate-decorator-global-filter-pruning-method","title":"Gate Decorator: Global Filter Pruning Method for Accelerating Deep Convolutional Neural Networks","date":"2019-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"youzhonghui/gate-decorator-pruning","path":"models/cifar/resnet56.py","file_url":"https://github.com/youzhonghui/gate-decorator-pruning/blob/HEAD/models/cifar/resnet56.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":"5cdc625b5824a25a","code_sha256_prefix":"5cdc625b5824a25a","mcp_get_code":{"code_sha256":"5cdc625b5824a25a"}},{"arxiv_id":"1908.08681","arxiv_id_is_arxiv":true,"paper":"/paper/mish-a-self-regularized-non-monotonic-neural","title":"Mish: A Self Regularized Non-Monotonic Activation Function","date":"2019-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"digantamisra98/Mish","path":"exps/resnet.py","file_url":"https://github.com/digantamisra98/Mish/blob/HEAD/exps/resnet.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":"6d73f5ab551aef6b","code_sha256_prefix":"6d73f5ab551aef6b","mcp_get_code":{"code_sha256":"6d73f5ab551aef6b"}},{"arxiv_id":"1902.08153","arxiv_id_is_arxiv":true,"paper":"/paper/learned-step-size-quantization","title":"Learned Step Size Quantization","date":"2019-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhutmost/lsq-net","path":"model/resnet_cifar.py","file_url":"https://github.com/zhutmost/lsq-net/blob/HEAD/model/resnet_cifar.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":"1db27ae5efae49cc","code_sha256_prefix":"1db27ae5efae49cc","mcp_get_code":{"code_sha256":"1db27ae5efae49cc"}},{"arxiv_id":"aaai_16351","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_16351","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"taoxvzi/DPFPS","path":"models/resnet_cifar.py","file_url":"https://github.com/taoxvzi/DPFPS/blob/HEAD/models/resnet_cifar.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":"bb3bf65816684193","code_sha256_prefix":"bb3bf65816684193","mcp_get_code":{"code_sha256":"bb3bf65816684193"}}],"record_sha256":"6d2af2d5e52d31002d03e2f930a88a107a37215ea17ac04bc783fd1cedf03d7d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}