{"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/resnet56","entry":"resnet56","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":7,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":1,"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":7,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":1,"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":0,"ran_fixture":1,"ran":2,"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":"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":"2d34d118097b87ab","code_sha256_prefix":"2d34d118097b87ab","mcp_get_code":{"code_sha256":"2d34d118097b87ab"}},{"arxiv_id":"2412.05823","arxiv_id_is_arxiv":true,"paper":"/paper/dapperfl-domain-adaptive-federated-learning","title":"DapperFL: Domain Adaptive Federated Learning with Model Fusion Pruning for Edge Devices","date":"2024-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jyzgh/DapperFL","path":"fedml_api/standalone/domain_generalization/backbone/resnet_nefl.py","file_url":"https://github.com/jyzgh/DapperFL/blob/HEAD/fedml_api/standalone/domain_generalization/backbone/resnet_nefl.py","status":"unverified","verification_level":0,"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":"b030f88b1f067614","code_sha256_prefix":"b030f88b1f067614","mcp_get_code":{"code_sha256":"b030f88b1f067614"}},{"arxiv_id":"2309.07197","arxiv_id_is_arxiv":true,"paper":"/paper/mitigating-adversarial-attacks-in-federated","title":"Mitigating Adversarial Attacks in Federated Learning with Trusted Execution Environments","date":"2023-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"queyrusi/pelta","path":"ExtendedPelta/Classes/ResNetPytorch.py","file_url":"https://github.com/queyrusi/pelta/blob/HEAD/ExtendedPelta/Classes/ResNetPytorch.py","status":"unverified","verification_level":0,"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, queyrusi/pelta when it was checked","code_sha256":"843702af6684836b","code_sha256_prefix":"843702af6684836b","mcp_get_code":{"code_sha256":"843702af6684836b"}},{"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":"9f559415fc5c03d7","code_sha256_prefix":"9f559415fc5c03d7","mcp_get_code":{"code_sha256":"9f559415fc5c03d7"}},{"arxiv_id":"2104.02610","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-robustness-of-vision-transformers-to","title":"On the Robustness of Vision Transformers to Adversarial Examples","date":"2021-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MetaMain/ViTRobust","path":"VisionTransformersRobustness/VisionTransformersRobustness/ResNetPytorch.py","file_url":"https://github.com/MetaMain/ViTRobust/blob/HEAD/VisionTransformersRobustness/VisionTransformersRobustness/ResNetPytorch.py","status":"unverified","verification_level":0,"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":"881ff295da65733e","code_sha256_prefix":"881ff295da65733e","mcp_get_code":{"code_sha256":"881ff295da65733e"}},{"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":"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":"782db452fa8e9972","code_sha256_prefix":"782db452fa8e9972","mcp_get_code":{"code_sha256":"782db452fa8e9972"}},{"arxiv_id":"Mendieta_Local_Learning_Matters_Rethinking_Data_Heterogeneity_in_Federated_Learning_CVPR_2022_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Mendieta_Local_Learning_Matters_Rethinking_Data_Heterogeneity_in_Federated_Learning_CVPR_2022_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"mmendiet/FedAlign","path":"models/resnet.py","file_url":"https://github.com/mmendiet/FedAlign/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":"436aa490d67ea87e","code_sha256_prefix":"436aa490d67ea87e","mcp_get_code":{"code_sha256":"436aa490d67ea87e"}}],"record_sha256":"4a65bd07672c0ddf5825790bf63ba77bf6a528f0596c29064dc7182183fd01e7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}