{"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-resnet18","entry":"get_resnet18","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":9,"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":7,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":6},"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":"2c22c149a0985110","mcp_get_code":{"code_sha256":"2c22c149a0985110"}},{"arxiv_id":"2406.11711","paper":"/paper/ogni-dc-robust-depth-completion-with","title":"OGNI-DC: Robust Depth Completion with Optimization-Guided Neural Iterations","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-vl/OGNI-DC","path":"src/model/pvt.py","file_url":"https://github.com/princeton-vl/OGNI-DC/blob/HEAD/src/model/pvt.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":"d3f8a892fddc538a","mcp_get_code":{"code_sha256":"d3f8a892fddc538a"}},{"arxiv_id":"2405.11867","paper":"/paper/depth-prompting-for-sensor-agnostic-depth","title":"Depth Prompting for Sensor-Agnostic Depth Estimation","date":"2024-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JinhwiPark/DepthPrompting","path":"model/common.py","file_url":"https://github.com/JinhwiPark/DepthPrompting/blob/HEAD/model/common.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"12f94342fa3f1938","mcp_get_code":{"code_sha256":"12f94342fa3f1938"}},{"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":"f8a98d97abed03ba","mcp_get_code":{"code_sha256":"f8a98d97abed03ba"}},{"arxiv_id":"2303.05021","paper":"/paper/diffusiondepth-diffusion-denoising-approach","title":"DiffusionDepth: Diffusion Denoising Approach for Monocular Depth Estimation","date":"2023-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"duanyiqun/diffusiondepth","path":"src/model/common.py","file_url":"https://github.com/duanyiqun/diffusiondepth/blob/HEAD/src/model/common.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"d3f8a892fddc538a","mcp_get_code":{"code_sha256":"d3f8a892fddc538a"}},{"arxiv_id":"2207.06267","paper":"/paper/task-agnostic-representation-consolidation-a","title":"Task Agnostic Representation Consolidation: a Self-supervised based Continual Learning Approach","date":"2022-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neurai-lab/tarc","path":"backbone/ResNet18.py","file_url":"https://github.com/neurai-lab/tarc/blob/HEAD/backbone/ResNet18.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"08b2cc137f0a6c40","mcp_get_code":{"code_sha256":"08b2cc137f0a6c40"}},{"arxiv_id":"2207.04998","paper":"/paper/consistency-is-the-key-to-further-mitigating","title":"Consistency is the key to further mitigating catastrophic forgetting in continual learning","date":"2022-07-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neurai-lab/consistencycl","path":"backbone/ResNet18.py","file_url":"https://github.com/neurai-lab/consistencycl/blob/HEAD/backbone/ResNet18.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5eb0a5255bcf3849","mcp_get_code":{"code_sha256":"5eb0a5255bcf3849"}},{"arxiv_id":"2007.10042","paper":"/paper/non-local-spatial-propagation-network-for","title":"Non-Local Spatial Propagation Network for Depth Completion","date":"2020-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zzangjinsun/NLSPN_ECCV20","path":"src/model/common.py","file_url":"https://github.com/zzangjinsun/NLSPN_ECCV20/blob/HEAD/src/model/common.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d3f8a892fddc538a","mcp_get_code":{"code_sha256":"d3f8a892fddc538a"}},{"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":"510a5423eca7824c","mcp_get_code":{"code_sha256":"510a5423eca7824c"}}]}