{"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/resnet20","entry":"resnet20","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":42,"n_papers_ran":38,"n_papers_ran_no_instrument_failure":24,"n_papers_ran_instrument_only":14,"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":39,"n_samples_ran":35,"n_samples_constructed":0,"n_samples_ran_checked":24,"n_samples_instrument":11,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":44,"n_places_pointer_only":10,"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":10,"ran_fixture":1,"ran":24,"unverified":4},"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":"682ea0b23a9b9564","code_sha256_prefix":"682ea0b23a9b9564","mcp_get_code":{"code_sha256":"682ea0b23a9b9564"}},{"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_eurosat.py","file_url":"https://github.com/YuanjieSh/CMRM/blob/HEAD/Multi_code_synthetic_noise/models/resnet_eurosat.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":"f332591908476ccc","code_sha256_prefix":"f332591908476ccc","mcp_get_code":{"code_sha256":"f332591908476ccc"}},{"arxiv_id":"2506.14582","arxiv_id_is_arxiv":true,"paper":"/paper/busting-the-paper-ballot-voting-meets","title":"Busting the Paper Ballot: Voting Meets Adversarial Machine Learning","date":"2025-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VoterCenter/Busting-the-Ballot","path":"Models/ResNet.py","file_url":"https://github.com/VoterCenter/Busting-the-Ballot/blob/HEAD/Models/ResNet.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"12689be989900b1f","code_sha256_prefix":"12689be989900b1f","mcp_get_code":{"code_sha256":"12689be989900b1f"}},{"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":"778abcf319b959d2","code_sha256_prefix":"778abcf319b959d2","mcp_get_code":{"code_sha256":"778abcf319b959d2"}},{"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":"a10d10e7bcf4cb4a","code_sha256_prefix":"a10d10e7bcf4cb4a","mcp_get_code":{"code_sha256":"a10d10e7bcf4cb4a"}},{"arxiv_id":"2408.01978","arxiv_id_is_arxiv":true,"paper":"/paper/2408-01978","title":"AdvQDet: Detecting Query-Based Adversarial Attacks with Adversarial Contrastive Prompt Tuning","date":"2024-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xinwong/advqdet","path":"models/resnet.py","file_url":"https://github.com/xinwong/advqdet/blob/HEAD/models/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, xinwong/advqdet when it was checked","code_sha256":"8cdd577ff58690f6","code_sha256_prefix":"8cdd577ff58690f6","mcp_get_code":{"code_sha256":"8cdd577ff58690f6"}},{"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":"a10d10e7bcf4cb4a","code_sha256_prefix":"a10d10e7bcf4cb4a","mcp_get_code":{"code_sha256":"a10d10e7bcf4cb4a"}},{"arxiv_id":"2407.08536","arxiv_id_is_arxiv":true,"paper":"/paper/exemplar-free-continual-representation","title":"Exemplar-free Continual Representation Learning via Learnable Drift Compensation","date":"2024-07-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alviur/ldc","path":"LDC_supervised/utils/inc_net.py","file_url":"https://github.com/alviur/ldc/blob/HEAD/LDC_supervised/utils/inc_net.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, alviur/ldc when it was checked","code_sha256":"5ef4da296d6ae98f","code_sha256_prefix":"5ef4da296d6ae98f","mcp_get_code":{"code_sha256":"5ef4da296d6ae98f"}},{"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":"682ea0b23a9b9564","code_sha256_prefix":"682ea0b23a9b9564","mcp_get_code":{"code_sha256":"682ea0b23a9b9564"}},{"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_eurosat.py","file_url":"https://github.com/yuanjiesh/rc3p/blob/HEAD/models/resnet_eurosat.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":"f332591908476ccc","code_sha256_prefix":"f332591908476ccc","mcp_get_code":{"code_sha256":"f332591908476ccc"}},{"arxiv_id":"2403.19863","arxiv_id_is_arxiv":true,"paper":"/paper/denetdm-debiasing-by-network-depth-modulation","title":"DeNetDM: Debiasing by Network Depth Modulation","date":"2024-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kadarsh22/DeNetDM","path":"module/resnet.py","file_url":"https://github.com/kadarsh22/DeNetDM/blob/HEAD/module/resnet.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":"01565f5f63507277","code_sha256_prefix":"01565f5f63507277","mcp_get_code":{"code_sha256":"01565f5f63507277"}},{"arxiv_id":"2402.00411","arxiv_id_is_arxiv":true,"paper":"/paper/lm-ht-snn-enhancing-the-performance-of-snn-to","title":"LM-HT SNN: Enhancing the Performance of SNN to ANN Counterpart through Learnable Multi-hierarchical Threshold Model","date":"2024-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hzc1208/LMHT_SNN","path":"ann_models/ResNet.py","file_url":"https://github.com/hzc1208/LMHT_SNN/blob/HEAD/ann_models/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, hzc1208/LMHT_SNN when it was checked","code_sha256":"70470a857f93b627","code_sha256_prefix":"70470a857f93b627","mcp_get_code":{"code_sha256":"70470a857f93b627"}},{"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":"ff484a1ce7b2b244","code_sha256_prefix":"ff484a1ce7b2b244","mcp_get_code":{"code_sha256":"ff484a1ce7b2b244"}},{"arxiv_id":"2311.09266","arxiv_id_is_arxiv":true,"paper":"/paper/adversarially-robust-spiking-neural-networks","title":"Adversarially Robust Spiking Neural Networks Through Conversion","date":"2023-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"igitugraz/robustsnnconversion","path":"models/ResNet.py","file_url":"https://github.com/igitugraz/robustsnnconversion/blob/HEAD/models/ResNet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"61ca6746fd2cf62d","code_sha256_prefix":"61ca6746fd2cf62d","mcp_get_code":{"code_sha256":"61ca6746fd2cf62d"}},{"arxiv_id":"2309.02995","arxiv_id_is_arxiv":true,"paper":"/paper/continual-evidential-deep-learning-for-out-of","title":"Continual Evidential Deep Learning for Out-of-Distribution Detection","date":"2023-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eaaguilart/cedl","path":"resnet.py","file_url":"https://github.com/eaaguilart/cedl/blob/HEAD/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, eaaguilart/cedl when it was checked","code_sha256":"abad9efb299cab1c","code_sha256_prefix":"abad9efb299cab1c","mcp_get_code":{"code_sha256":"abad9efb299cab1c"}},{"arxiv_id":"2308.07934","arxiv_id_is_arxiv":true,"paper":"/paper/one-bit-flip-is-all-you-need-when-bit-flip","title":"One-bit Flip is All You Need: When Bit-flip Attack Meets Model Training","date":"2023-08-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jianshuod/tba","path":"models/vanilla_resnet.py","file_url":"https://github.com/jianshuod/tba/blob/HEAD/models/vanilla_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":"182a7f2d3cc58f1f","code_sha256_prefix":"182a7f2d3cc58f1f","mcp_get_code":{"code_sha256":"182a7f2d3cc58f1f"}},{"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":"ef2cb901ccb65deb","code_sha256_prefix":"ef2cb901ccb65deb","mcp_get_code":{"code_sha256":"ef2cb901ccb65deb"}},{"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":"1671b368a1ab2ab0","code_sha256_prefix":"1671b368a1ab2ab0","mcp_get_code":{"code_sha256":"1671b368a1ab2ab0"}},{"arxiv_id":"2306.02368","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-data-free-knowledge-distillation","title":"Revisiting Data-Free Knowledge Distillation with Poisoned Teachers","date":"2023-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"illidanlab/abd","path":"zskt/models/shufl_resnet.py","file_url":"https://github.com/illidanlab/abd/blob/HEAD/zskt/models/shufl_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":"42e550398c376b37","code_sha256_prefix":"42e550398c376b37","mcp_get_code":{"code_sha256":"42e550398c376b37"}},{"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":"140905d48b761a27","code_sha256_prefix":"140905d48b761a27","mcp_get_code":{"code_sha256":"140905d48b761a27"}},{"arxiv_id":"2305.18497","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2305.18497","date":null,"month_inferred_from_arxiv_id":"2023-05","title_source":null,"repo":"fan1dy/collaboration-consensus","path":"models/resnet.py","file_url":"https://github.com/fan1dy/collaboration-consensus/blob/HEAD/models/resnet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"01565f5f63507277","code_sha256_prefix":"01565f5f63507277","mcp_get_code":{"code_sha256":"01565f5f63507277"}},{"arxiv_id":"2304.13098","arxiv_id_is_arxiv":true,"paper":"/paper/uncovering-the-representation-of-spiking","title":"Uncovering the Representation of Spiking Neural Networks Trained with Surrogate Gradient","date":"2023-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intelligent-computing-lab-yale/snncka","path":"models/ann_resnet.py","file_url":"https://github.com/intelligent-computing-lab-yale/snncka/blob/HEAD/models/ann_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":"9828e98d9495e916","code_sha256_prefix":"9828e98d9495e916","mcp_get_code":{"code_sha256":"9828e98d9495e916"}},{"arxiv_id":"2304.03094","arxiv_id_is_arxiv":true,"paper":"/paper/population-parameter-averaging-papa","title":"PopulAtion Parameter Averaging (PAPA)","date":"2023-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samsungsailmontreal/papa","path":"models/resnet20.py","file_url":"https://github.com/samsungsailmontreal/papa/blob/HEAD/models/resnet20.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":"5ec019fd36dd68e8","code_sha256_prefix":"5ec019fd36dd68e8","mcp_get_code":{"code_sha256":"5ec019fd36dd68e8"}},{"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":"e58bdb43e48b0fd1","code_sha256_prefix":"e58bdb43e48b0fd1","mcp_get_code":{"code_sha256":"e58bdb43e48b0fd1"}},{"arxiv_id":"2212.01433","arxiv_id_is_arxiv":true,"paper":"/paper/avoiding-spurious-correlations-via-logit","title":"Avoiding spurious correlations via logit correction","date":"2022-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shengliu66/lc","path":"module/resnet.py","file_url":"https://github.com/shengliu66/lc/blob/HEAD/module/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":"2204ec00fcf92209","code_sha256_prefix":"2204ec00fcf92209","mcp_get_code":{"code_sha256":"2204ec00fcf92209"}},{"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":"a10d10e7bcf4cb4a","code_sha256_prefix":"a10d10e7bcf4cb4a","mcp_get_code":{"code_sha256":"a10d10e7bcf4cb4a"}},{"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":"f5fef6bc2b7e1e49","code_sha256_prefix":"f5fef6bc2b7e1e49","mcp_get_code":{"code_sha256":"f5fef6bc2b7e1e49"}},{"arxiv_id":"2206.08464","arxiv_id_is_arxiv":true,"paper":"/paper/pranc-pseudo-random-networks-for-compacting","title":"PRANC: Pseudo RAndom Networks for Compacting deep models","date":"2022-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucdvision/pranc","path":"models.py","file_url":"https://github.com/ucdvision/pranc/blob/HEAD/models.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":"ee582e3134b37493","code_sha256_prefix":"ee582e3134b37493","mcp_get_code":{"code_sha256":"ee582e3134b37493"}},{"arxiv_id":"2202.12002","arxiv_id_is_arxiv":true,"paper":"/paper/rare-gems-finding-lottery-tickets-at","title":"Rare Gems: Finding Lottery Tickets at Initialization","date":"2022-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ksreenivasan/pruning_is_enough","path":"IMP_codebase/cifar_model_resnet.py","file_url":"https://github.com/ksreenivasan/pruning_is_enough/blob/HEAD/IMP_codebase/cifar_model_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":"8d4c82954b75940e","code_sha256_prefix":"8d4c82954b75940e","mcp_get_code":{"code_sha256":"8d4c82954b75940e"}},{"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":"d475032f6599d6a2","code_sha256_prefix":"d475032f6599d6a2","mcp_get_code":{"code_sha256":"d475032f6599d6a2"}},{"arxiv_id":"2105.09369","arxiv_id_is_arxiv":true,"paper":"/paper/user-label-leakage-from-gradients-in","title":"User-Level Label Leakage from Gradients in Federated Learning","date":"2021-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tklab-tud/llg","path":"Code/model.py","file_url":"https://github.com/tklab-tud/llg/blob/HEAD/Code/model.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":"aec3de1f6493541c","code_sha256_prefix":"aec3de1f6493541c","mcp_get_code":{"code_sha256":"aec3de1f6493541c"}},{"arxiv_id":"2104.14575","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-layered-image-decomposition-into","title":"Unsupervised Layered Image Decomposition into Object Prototypes","date":"2021-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"monniert/dti-sprites","path":"src/model/mini_resnet.py","file_url":"https://github.com/monniert/dti-sprites/blob/HEAD/src/model/mini_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":"b69e0b94664e5634","code_sha256_prefix":"b69e0b94664e5634","mcp_get_code":{"code_sha256":"b69e0b94664e5634"}},{"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":"b3920efd145667ac","code_sha256_prefix":"b3920efd145667ac","mcp_get_code":{"code_sha256":"b3920efd145667ac"}},{"arxiv_id":"2006.11132","arxiv_id_is_arxiv":true,"paper":"/paper/deep-transformation-invariant-clustering","title":"Deep Transformation-Invariant Clustering","date":"2020-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"monniert/dti-clustering","path":"src/model/mini_resnet.py","file_url":"https://github.com/monniert/dti-clustering/blob/HEAD/src/model/mini_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":"a869ef73c638e65a","code_sha256_prefix":"a869ef73c638e65a","mcp_get_code":{"code_sha256":"a869ef73c638e65a"}},{"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":"ced375c8bbba0283","code_sha256_prefix":"ced375c8bbba0283","mcp_get_code":{"code_sha256":"ced375c8bbba0283"}},{"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":"025a0fa4b9bd03c4","code_sha256_prefix":"025a0fa4b9bd03c4","mcp_get_code":{"code_sha256":"025a0fa4b9bd03c4"}},{"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":"fe525ef6a5d1473a","code_sha256_prefix":"fe525ef6a5d1473a","mcp_get_code":{"code_sha256":"fe525ef6a5d1473a"}},{"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":"d759ea54f50325b0","code_sha256_prefix":"d759ea54f50325b0","mcp_get_code":{"code_sha256":"d759ea54f50325b0"}},{"arxiv_id":"1606.06160","arxiv_id_is_arxiv":true,"paper":"/paper/dorefa-net-training-low-bitwidth","title":"DoReFa-Net: Training Low Bitwidth Convolutional Neural Networks with Low Bitwidth Gradients","date":"2016-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zzzxxxttt/Pytorch_DoReFaNet","path":"nets/cifar_resnet.py","file_url":"https://github.com/zzzxxxttt/Pytorch_DoReFaNet/blob/HEAD/nets/cifar_resnet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ce5d6e10ff074840","code_sha256_prefix":"ce5d6e10ff074840","mcp_get_code":{"code_sha256":"ce5d6e10ff074840"}},{"arxiv_id":"1511.00561","arxiv_id_is_arxiv":true,"paper":"/paper/segnet-a-deep-convolutional-encoder-decoder","title":"SegNet: A Deep Convolutional Encoder-Decoder Architecture for Image Segmentation","date":"2015-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhuotongchen/self-healing-robust-neural-networks-via-closed-loop-control","path":"models/model_resnet.py","file_url":"https://github.com/zhuotongchen/self-healing-robust-neural-networks-via-closed-loop-control/blob/HEAD/models/model_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":"788ec85b5552dcd3","code_sha256_prefix":"788ec85b5552dcd3","mcp_get_code":{"code_sha256":"788ec85b5552dcd3"}},{"arxiv_id":"1506.01186","arxiv_id_is_arxiv":true,"paper":"/paper/cyclical-learning-rates-for-training-neural","title":"Cyclical Learning Rates for Training Neural Networks","date":"2015-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"davidtvs/pytorch-lr-finder","path":"examples/cifar10_resnet.py","file_url":"https://github.com/davidtvs/pytorch-lr-finder/blob/HEAD/examples/cifar10_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":"e5d7185b6cba3126","code_sha256_prefix":"e5d7185b6cba3126","mcp_get_code":{"code_sha256":"e5d7185b6cba3126"}},{"arxiv_id":"aaai_29231","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_29231","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"MIV-XJTU/EvoPrompt","path":"inclearn/convnet/cifar_resnet.py","file_url":"https://github.com/MIV-XJTU/EvoPrompt/blob/HEAD/inclearn/convnet/cifar_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":"4c4881e69064c66b","code_sha256_prefix":"4c4881e69064c66b","mcp_get_code":{"code_sha256":"4c4881e69064c66b"}},{"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":"2db68232cb92a106","code_sha256_prefix":"2db68232cb92a106","mcp_get_code":{"code_sha256":"2db68232cb92a106"}},{"arxiv_id":"Caldarola_Beyond_Local_Sharpness_Communication-Efficient_Global_Sharpness-aware_Minimization_for_Federated_Learning_CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Caldarola_Beyond_Local_Sharpness_Communication-Efficient_Global_Sharpness-aware_Minimization_for_Federated_Learning_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"pietrocagnasso/fedgloss","path":"codebase/eigenthings/models.py","file_url":"https://github.com/pietrocagnasso/fedgloss/blob/HEAD/codebase/eigenthings/models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5524a3828930adb6","code_sha256_prefix":"5524a3828930adb6","mcp_get_code":{"code_sha256":"5524a3828930adb6"}}],"record_sha256":"c27b540a29bda016ce8e50a8c15ab7c293059feb765cfe78d2b24642904bc0d5","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}