{"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/vgg16-bn","entry":"vgg16_bn","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":9,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":4,"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":9,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":4,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":2,"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":4,"ran_fixture":0,"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":"2605.25616","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-25616","title":"Courtroom Analogy: New Perspective on Uncertainty-Aware Classification","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"TaeseongYoon/MoDEX","path":"models.py","file_url":"https://github.com/TaeseongYoon/MoDEX/blob/HEAD/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cb5c87eee11f563b","code_sha256_prefix":"cb5c87eee11f563b","mcp_get_code":{"code_sha256":"cb5c87eee11f563b"}},{"arxiv_id":"2510.18322","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-18322","title":"Uncertainty Estimation by Flexible Evidential Deep Learning","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"TaeseongYoon/F-EDL","path":"models.py","file_url":"https://github.com/TaeseongYoon/F-EDL/blob/HEAD/models.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, TaeseongYoon/F-EDL when it was checked","code_sha256":"63c79d0830eea773","code_sha256_prefix":"63c79d0830eea773","mcp_get_code":{"code_sha256":"63c79d0830eea773"}},{"arxiv_id":"2402.17726","arxiv_id_is_arxiv":true,"paper":"/paper/vrp-sam-sam-with-visual-reference-prompt","title":"VRP-SAM: SAM with Visual Reference Prompt","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"syp2ysy/VRP-SAM","path":"model/VRP_encoder.py","file_url":"https://github.com/syp2ysy/VRP-SAM/blob/HEAD/model/VRP_encoder.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"af7ae822405c0966","code_sha256_prefix":"af7ae822405c0966","mcp_get_code":{"code_sha256":"af7ae822405c0966"}},{"arxiv_id":"2311.13091","arxiv_id_is_arxiv":true,"paper":"/paper/stable-unlearnable-example-enhancing-the","title":"Stable Unlearnable Example: Enhancing the Robustness of Unlearnable Examples via Stable Error-Minimizing Noise","date":"2023-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuyixin-louis/stable-unlearnable-example","path":"models/vgg.py","file_url":"https://github.com/liuyixin-louis/stable-unlearnable-example/blob/HEAD/models/vgg.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, liuyixin-louis/stable-unlearnable-example (NOASSERTION)","code_sha256":"0064d52081541e1e","code_sha256_prefix":"0064d52081541e1e","mcp_get_code":{"code_sha256":"0064d52081541e1e"}},{"arxiv_id":"2302.12828","arxiv_id_is_arxiv":true,"paper":"/paper/splinecam-exact-visualization-and","title":"SplineCam: Exact Visualization and Characterization of Deep Network Geometry and Decision Boundaries","date":"2023-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ahmedimtiazprio/splinecam","path":"splinecam/models.py","file_url":"https://github.com/ahmedimtiazprio/splinecam/blob/HEAD/splinecam/models.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":"af5f5c8e7c5775d4","code_sha256_prefix":"af5f5c8e7c5775d4","mcp_get_code":{"code_sha256":"af5f5c8e7c5775d4"}},{"arxiv_id":"2204.09903","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-the-prototype-divide-and-conquer","title":"Beyond the Prototype: Divide-and-conquer Proxies for Few-shot Segmentation","date":"2022-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chunbolang/DCP","path":"model/DCP.py","file_url":"https://github.com/chunbolang/DCP/blob/HEAD/model/DCP.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7495062bfa6820b8","code_sha256_prefix":"7495062bfa6820b8","mcp_get_code":{"code_sha256":"7495062bfa6820b8"}},{"arxiv_id":"1911.07205","arxiv_id_is_arxiv":true,"paper":"/paper/refit-a-unified-watermark-removal-framework","title":"REFIT: A Unified Watermark Removal Framework For Deep Learning Systems With Limited Data","date":"2019-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunblaze-ucb/REFIT","path":"models/vgg.py","file_url":"https://github.com/sunblaze-ucb/REFIT/blob/HEAD/models/vgg.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":"03738bb3906b9d93","code_sha256_prefix":"03738bb3906b9d93","mcp_get_code":{"code_sha256":"03738bb3906b9d93"}},{"arxiv_id":"1803.06791","arxiv_id_is_arxiv":true,"paper":"/paper/depth-aware-cnn-for-rgb-d-segmentation","title":"Depth-aware CNN for RGB-D Segmentation","date":"2018-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"laughtervv/DepthAwareCNN","path":"models/VGG_Deeplab.py","file_url":"https://github.com/laughtervv/DepthAwareCNN/blob/HEAD/models/VGG_Deeplab.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":"fa8c10bd6c94939c","code_sha256_prefix":"fa8c10bd6c94939c","mcp_get_code":{"code_sha256":"fa8c10bd6c94939c"}},{"arxiv_id":"Li_PSBD_Prediction_Shift_Uncertainty_Unlocks_Backdoor_Detection_CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Li_PSBD_Prediction_Shift_Uncertainty_Unlocks_Backdoor_Detection_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"WL-619/PSBD","path":"models/vgg.py","file_url":"https://github.com/WL-619/PSBD/blob/HEAD/models/vgg.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":"2df9cfc314fd94ca","code_sha256_prefix":"2df9cfc314fd94ca","mcp_get_code":{"code_sha256":"2df9cfc314fd94ca"}}],"record_sha256":"5290628cd6c35fa856ad159124c5942631b9e766f307f33d5406f095e7e955f1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}