{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/get-resnet50","entry":"get_resnet50","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":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":5,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":4},"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.04518","paper":"/paper/arxiv-2604-04518","title":"Reproducibility study on how to find Spurious Correlations, Shortcut Learning, Clever Hans or Group-Distributional nonrobustness and how to fix them","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"frederikpahde/rrclarc","path":"models/resnet.py","file_url":"https://github.com/frederikpahde/rrclarc/blob/HEAD/models/resnet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"997028fdd788415d","mcp_get_code":{"code_sha256":"997028fdd788415d"}},{"arxiv_id":"2406.02354","paper":"/paper/label-wise-aleatoric-and-epistemic","title":"Label-wise Aleatoric and Epistemic Uncertainty Quantification","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YSale/label-uq","path":"medical/models.py","file_url":"https://github.com/YSale/label-uq/blob/HEAD/medical/models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"4fd78ff184dad0c4","mcp_get_code":{"code_sha256":"4fd78ff184dad0c4"}},{"arxiv_id":"2405.04825","paper":"/paper/explanation-as-a-watermark-towards-harmless","title":"Explanation as a Watermark: Towards Harmless and Multi-bit Model Ownership Verification via Watermarking Feature Attribution","date":"2024-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shaoshuo-ss/eaaw","path":"image-classification/utils/models.py","file_url":"https://github.com/shaoshuo-ss/eaaw/blob/HEAD/image-classification/utils/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ef3f911aaa6673a2","mcp_get_code":{"code_sha256":"ef3f911aaa6673a2"}},{"arxiv_id":"2003.14052","paper":"/paper/3d-sketch-aware-semantic-scene-completion-via","title":"3D Sketch-aware Semantic Scene Completion via Semi-supervised Structure Prior","date":"2020-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"charlesCXK/3D-SketchAware-SSC","path":"model/sketch.nyu/resnet.py","file_url":"https://github.com/charlesCXK/3D-SketchAware-SSC/blob/HEAD/model/sketch.nyu/resnet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bdd94eaab631a1c1","mcp_get_code":{"code_sha256":"bdd94eaab631a1c1"}},{"arxiv_id":"aaai_26741","paper":null,"title":"arXiv:aaai_26741","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"lygjwy/READ","path":"models/resnet.py","file_url":"https://github.com/lygjwy/READ/blob/HEAD/models/resnet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"547c42e3a04af538","mcp_get_code":{"code_sha256":"547c42e3a04af538"}}]}