{"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/resnet-layer","entry":"resnet_layer","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":10,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":3,"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":8,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":3,"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":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":3,"unverified":2},"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":"2011.01447","arxiv_id_is_arxiv":true,"paper":"/paper/a-two-stage-approach-to-device-robust","title":"A Two-Stage Approach to Device-Robust Acoustic Scene Classification","date":"2020-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MihawkHu/DCASE2020_task1","path":"other_TF2_format_pretrained/mobnet.py","file_url":"https://github.com/MihawkHu/DCASE2020_task1/blob/HEAD/other_TF2_format_pretrained/mobnet.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":"c27af96c652b89af","code_sha256_prefix":"c27af96c652b89af","mcp_get_code":{"code_sha256":"c27af96c652b89af"}},{"arxiv_id":"2008.06775","arxiv_id_is_arxiv":true,"paper":"/paper/model-patching-closing-the-subgroup","title":"Model Patching: Closing the Subgroup Performance Gap with Data Augmentation","date":"2020-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HazyResearch/model-patching","path":"augmentation/models/resnet.py","file_url":"https://github.com/HazyResearch/model-patching/blob/HEAD/augmentation/models/resnet.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c4bb2cc4f4fe1b02","code_sha256_prefix":"c4bb2cc4f4fe1b02","mcp_get_code":{"code_sha256":"c4bb2cc4f4fe1b02"}},{"arxiv_id":"2006.06643","arxiv_id_is_arxiv":true,"paper":"/paper/smoothed-geometry-for-robust-attribution","title":"Smoothed Geometry for Robust Attribution","date":"2020-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zifanw/smoothed_geometry","path":"models/keras_model.py","file_url":"https://github.com/zifanw/smoothed_geometry/blob/HEAD/models/keras_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":"7c10248ed4cd4926","code_sha256_prefix":"7c10248ed4cd4926","mcp_get_code":{"code_sha256":"7c10248ed4cd4926"}},{"arxiv_id":"2001.04694","arxiv_id_is_arxiv":true,"paper":"/paper/hydra-preserving-ensemble-diversity-for-model-1","title":"Hydra: Preserving Ensemble Diversity for Model Distillation","date":"2020-01-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaung-htet-myat/Multi-teachers-Knowledge-Distillation","path":"nets/student_model_multeacherKD.py","file_url":"https://github.com/kaung-htet-myat/Multi-teachers-Knowledge-Distillation/blob/HEAD/nets/student_model_multeacherKD.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, kaung-htet-myat/Multi-teachers-Knowledge-Distillation when it was checked","code_sha256":"5c2990f3e8d448d1","code_sha256_prefix":"5c2990f3e8d448d1","mcp_get_code":{"code_sha256":"5c2990f3e8d448d1"}},{"arxiv_id":"1912.12171","arxiv_id_is_arxiv":true,"paper":"/paper/so2sat-lcz42-a-benchmark-dataset-for-global","title":"So2Sat LCZ42: A Benchmark Dataset for Global Local Climate Zones Classification","date":"2019-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChunpingQiu/benchmark-on-So2SatLCZ42-dataset-a-simple-tour","path":"resnet.py","file_url":"https://github.com/ChunpingQiu/benchmark-on-So2SatLCZ42-dataset-a-simple-tour/blob/HEAD/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":"b7146d3f8eb014dd","code_sha256_prefix":"b7146d3f8eb014dd","mcp_get_code":{"code_sha256":"b7146d3f8eb014dd"}},{"arxiv_id":"1905.10626","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-softmax-cross-entropy-loss-for","title":"Rethinking Softmax Cross-Entropy Loss for Adversarial Robustness","date":"2019-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"P2333/Max-Mahalanobis-Training","path":"utils/model.py","file_url":"https://github.com/P2333/Max-Mahalanobis-Training/blob/HEAD/utils/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from kishanAk21/Skin-Cancer-Image-Classification, and GitHub detected no licence in that repository when it was checked","code_sha256":"8cba8aa8101c68d0","code_sha256_prefix":"8cba8aa8101c68d0","mcp_get_code":{"code_sha256":"8cba8aa8101c68d0"}},{"arxiv_id":"1902.06292","arxiv_id_is_arxiv":true,"paper":"/paper/attention-based-prototypical-learning-towards","title":"ProtoAttend: Attention-Based Prototypical Learning","date":"2019-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"si-qi/protoattend","path":"model.py","file_url":"https://github.com/si-qi/protoattend/blob/HEAD/model.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":"ae96c336f5bbf25c","code_sha256_prefix":"ae96c336f5bbf25c","mcp_get_code":{"code_sha256":"ae96c336f5bbf25c"}},{"arxiv_id":"1807.06521","arxiv_id_is_arxiv":true,"paper":"/paper/cbam-convolutional-block-attention-module","title":"CBAM: Convolutional Block Attention Module","date":"2018-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kobiso/CBAM-keras","path":"models/resnet_v1.py","file_url":"https://github.com/kobiso/CBAM-keras/blob/HEAD/models/resnet_v1.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":"7c10248ed4cd4926","code_sha256_prefix":"7c10248ed4cd4926","mcp_get_code":{"code_sha256":"7c10248ed4cd4926"}},{"arxiv_id":"1802.08530","arxiv_id_is_arxiv":true,"paper":"/paper/training-wide-residual-networks-for","title":"Training wide residual networks for deployment using a single bit for each weight","date":"2018-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"McDonnell-Lab/1-bit-per-weight","path":"ResNetModel.py","file_url":"https://github.com/McDonnell-Lab/1-bit-per-weight/blob/HEAD/ResNetModel.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":"433abcfe62c095dc","code_sha256_prefix":"433abcfe62c095dc","mcp_get_code":{"code_sha256":"433abcfe62c095dc"}},{"arxiv_id":"1512.03385","arxiv_id_is_arxiv":true,"paper":"/paper/deep-residual-learning-for-image-recognition","title":"Deep Residual Learning for Image Recognition","date":"2015-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KellyHwong/rethinking_generalization","path":"keras_fn/resnet.py","file_url":"https://github.com/KellyHwong/rethinking_generalization/blob/HEAD/keras_fn/resnet.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c4bb2cc4f4fe1b02","code_sha256_prefix":"c4bb2cc4f4fe1b02","mcp_get_code":{"code_sha256":"c4bb2cc4f4fe1b02"}},{"arxiv_id":"1512.03385","arxiv_id_is_arxiv":true,"paper":"/paper/deep-residual-learning-for-image-recognition","title":"Deep Residual Learning for Image Recognition","date":"2015-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kishanAk21/Skin-Cancer-Image-Classification","path":"resnet_v2.py","file_url":"https://github.com/kishanAk21/Skin-Cancer-Image-Classification/blob/HEAD/resnet_v2.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, kishanAk21/Skin-Cancer-Image-Classification when it was checked","code_sha256":"8cba8aa8101c68d0","code_sha256_prefix":"8cba8aa8101c68d0","mcp_get_code":{"code_sha256":"8cba8aa8101c68d0"}}],"record_sha256":"7f6e3f2d0003b40d02115e9a8b3175abb74ace083a4dd0a359a53456e923d921","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}