{"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/passthrough","entry":"passthrough","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":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":5,"n_samples_ran":3,"n_samples_fingerprinted":2,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":2,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":0,"unverified":2},"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":"2311.07466","paper":"/paper/on-measuring-faithfulness-of-natural-language","title":"On Measuring Faithfulness or Self-consistency of Natural Language Explanations","date":"2023-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"heidelberg-nlp/cc-shap","path":"shap/explainers/_deep/deep_pytorch.py","file_url":"https://github.com/heidelberg-nlp/cc-shap/blob/HEAD/shap/explainers/_deep/deep_pytorch.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"30930885360cc5fc","mcp_get_code":{"code_sha256":"30930885360cc5fc"}},{"arxiv_id":"1804.08328","paper":"/paper/taskonomy-disentangling-task-transfer","title":"Taskonomy: Disentangling Task Transfer Learning","date":"2018-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"StanfordVL/taskonomy","path":"code/lib/models/transfer_models.py","file_url":"https://github.com/StanfordVL/taskonomy/blob/HEAD/code/lib/models/transfer_models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"876fa76111aafc8a","mcp_get_code":{"code_sha256":"876fa76111aafc8a"}},{"arxiv_id":"1704.02685","paper":"/paper/learning-important-features-through","title":"Learning Important Features Through Propagating Activation Differences","date":"2017-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shaoshanglqy/shap-shapley","path":"shap/explainers/deep/deep_tf.py","file_url":"https://github.com/shaoshanglqy/shap-shapley/blob/HEAD/shap/explainers/deep/deep_tf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"70789f676e5840c3","mcp_get_code":{"code_sha256":"70789f676e5840c3"}},{"arxiv_id":"1606.04797","paper":"/paper/v-net-fully-convolutional-neural-networks-for","title":"V-Net: Fully Convolutional Neural Networks for Volumetric Medical Image Segmentation","date":"2016-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"black0017/MedicalZooPytorch","path":"lib/medzoo/Vnet.py","file_url":"https://github.com/black0017/MedicalZooPytorch/blob/HEAD/lib/medzoo/Vnet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a8c5d37974c09442","mcp_get_code":{"code_sha256":"a8c5d37974c09442"}},{"arxiv_id":"1505.04597","paper":"/paper/u-net-convolutional-networks-for-biomedical","title":"U-Net: Convolutional Networks for Biomedical Image Segmentation","date":"2015-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bragancas/vnet_pytorch-atriaseg2018","path":"LASC18/model.py","file_url":"https://github.com/bragancas/vnet_pytorch-atriaseg2018/blob/HEAD/LASC18/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5feb269cff462270","mcp_get_code":{"code_sha256":"5feb269cff462270"}}]}