{"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/densenet161","entry":"densenet161","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":20,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":2,"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":15,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":2,"n_samples_unverified":12,"n_samples_fingerprinted":0,"n_places":20,"n_places_pointer_only":4,"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":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":1,"unverified":12},"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":"2505.05522","arxiv_id_is_arxiv":true,"paper":"/paper/continuous-thought-machines","title":"Continuous Thought Machines","date":"2025-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huyvnphan/PyTorch_CIFAR10","path":"cifar10_models/densenet.py","file_url":"https://github.com/huyvnphan/PyTorch_CIFAR10/blob/HEAD/cifar10_models/densenet.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":"2c599b41c3a242e3","code_sha256_prefix":"2c599b41c3a242e3","mcp_get_code":{"code_sha256":"2c599b41c3a242e3"}},{"arxiv_id":"2411.02853","arxiv_id_is_arxiv":true,"paper":"/paper/adopt-modified-adam-can-converge-with-any-b-2","title":"ADOPT: Modified Adam Can Converge with Any $β_2$ with the Optimal Rate","date":"2024-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UiPath/torchvision","path":"torchvision/models/densenet.py","file_url":"https://github.com/UiPath/torchvision/blob/HEAD/torchvision/models/densenet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e945c7af558f65a9","code_sha256_prefix":"e945c7af558f65a9","mcp_get_code":{"code_sha256":"e945c7af558f65a9"}},{"arxiv_id":"2406.15093","arxiv_id_is_arxiv":true,"paper":"/paper/eclipse-expunging-clean-label-indiscriminate","title":"ECLIPSE: Expunging Clean-label Indiscriminate Poisons via Sparse Diffusion Purification","date":"2024-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cgcl-codes/eclipse","path":"classifiers/densenet.py","file_url":"https://github.com/cgcl-codes/eclipse/blob/HEAD/classifiers/densenet.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":"aa4f379a20bcf1b5","code_sha256_prefix":"aa4f379a20bcf1b5","mcp_get_code":{"code_sha256":"aa4f379a20bcf1b5"}},{"arxiv_id":"2312.08898","arxiv_id_is_arxiv":true,"paper":"/paper/detection-and-defense-of-unlearnable-examples","title":"Detection and Defense of Unlearnable Examples","date":"2023-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hala64/udp","path":"model/DenseNet.py","file_url":"https://github.com/hala64/udp/blob/HEAD/model/DenseNet.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, hala64/udp when it was checked","code_sha256":"bc753ec83b73816f","code_sha256_prefix":"bc753ec83b73816f","mcp_get_code":{"code_sha256":"bc753ec83b73816f"}},{"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/densenet.py","file_url":"https://github.com/liuyixin-louis/stable-unlearnable-example/blob/HEAD/models/densenet.py","status":"unverified","verification_level":0,"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":"8fc5580681158f30","code_sha256_prefix":"8fc5580681158f30","mcp_get_code":{"code_sha256":"8fc5580681158f30"}},{"arxiv_id":"2311.06423","arxiv_id_is_arxiv":true,"paper":"/paper/flatness-aware-adversarial-attack","title":"Transferability Bound Theory: Exploring Relationship between Adversarial Transferability and Flatness","date":"2023-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fmy266/TPA","path":"FAA/densenet.py","file_url":"https://github.com/fmy266/TPA/blob/HEAD/FAA/densenet.py","status":"unverified","verification_level":0,"contract_check":null,"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, fmy266/TPA when it was checked","code_sha256":"4db35ea5c8cdf3e0","code_sha256_prefix":"4db35ea5c8cdf3e0","mcp_get_code":{"code_sha256":"4db35ea5c8cdf3e0"}},{"arxiv_id":"2308.06887","arxiv_id_is_arxiv":true,"paper":"/paper/robustified-anns-reveal-wormholes-between","title":"Robustified ANNs Reveal Wormholes Between Human Category Percepts","date":"2023-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ggaziv/Wormholes","path":"wormholes/imagenet_models/densenet.py","file_url":"https://github.com/ggaziv/Wormholes/blob/HEAD/wormholes/imagenet_models/densenet.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":"6b70762b5419b176","code_sha256_prefix":"6b70762b5419b176","mcp_get_code":{"code_sha256":"6b70762b5419b176"}},{"arxiv_id":"2307.07873","arxiv_id_is_arxiv":true,"paper":"/paper/towards-understanding-adversarial","title":"Why Does Little Robustness Help? A Further Step Towards Understanding Adversarial Transferability","date":"2023-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cgcl-codes/transferattacksurrogates","path":"TransferAttack/models/densenet.py","file_url":"https://github.com/cgcl-codes/transferattacksurrogates/blob/HEAD/TransferAttack/models/densenet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from liuyixin-louis/stable-unlearnable-example, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"8fc5580681158f30","code_sha256_prefix":"8fc5580681158f30","mcp_get_code":{"code_sha256":"8fc5580681158f30"}},{"arxiv_id":"2306.02913","arxiv_id_is_arxiv":true,"paper":"/paper/decentralized-sgd-and-average-direction-sam","title":"Decentralized SGD and Average-direction SAM are Asymptotically Equivalent","date":"2023-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raiden-zhu/icml-2023-dsgd-and-sam","path":"networks/densenet_micro.py","file_url":"https://github.com/raiden-zhu/icml-2023-dsgd-and-sam/blob/HEAD/networks/densenet_micro.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":"634e282335a81f1e","code_sha256_prefix":"634e282335a81f1e","mcp_get_code":{"code_sha256":"634e282335a81f1e"}},{"arxiv_id":"2305.19101","arxiv_id_is_arxiv":true,"paper":"/paper/which-models-have-perceptually-aligned","title":"Which Models have Perceptually-Aligned Gradients? An Explanation via Off-Manifold Robustness","date":"2023-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MadryLab/robustness","path":"robustness/imagenet_models/densenet.py","file_url":"https://github.com/MadryLab/robustness/blob/HEAD/robustness/imagenet_models/densenet.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":"6b70762b5419b176","code_sha256_prefix":"6b70762b5419b176","mcp_get_code":{"code_sha256":"6b70762b5419b176"}},{"arxiv_id":"2204.03714","arxiv_id_is_arxiv":true,"paper":"/paper/using-multiple-self-supervised-tasks-improves","title":"Using Multiple Self-Supervised Tasks Improves Model Robustness","date":"2022-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mattlawhon/SelfSupDefense","path":"learning/densenet.py","file_url":"https://github.com/mattlawhon/SelfSupDefense/blob/HEAD/learning/densenet.py","status":"ran","verification_level":1,"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":"ecc06aa5bb90a111","code_sha256_prefix":"ecc06aa5bb90a111","mcp_get_code":{"code_sha256":"ecc06aa5bb90a111"}},{"arxiv_id":"2111.13998","arxiv_id_is_arxiv":true,"paper":"/paper/targeted-supervised-contrastive-learning-for","title":"Targeted Supervised Contrastive Learning for Long-Tailed Recognition","date":"2021-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lth14/targeted-supcon","path":"moco_models/densenet.py","file_url":"https://github.com/lth14/targeted-supcon/blob/HEAD/moco_models/densenet.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":"e945c7af558f65a9","code_sha256_prefix":"e945c7af558f65a9","mcp_get_code":{"code_sha256":"e945c7af558f65a9"}},{"arxiv_id":"2110.03593","arxiv_id_is_arxiv":true,"paper":"/paper/transalnet-visual-saliency-prediction-using","title":"TranSalNet: Towards perceptually relevant visual saliency prediction","date":"2021-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ljovo/transalnet","path":"utils/densenet.py","file_url":"https://github.com/ljovo/transalnet/blob/HEAD/utils/densenet.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":"84c7817fbe252d76","code_sha256_prefix":"84c7817fbe252d76","mcp_get_code":{"code_sha256":"84c7817fbe252d76"}},{"arxiv_id":"2104.01231","arxiv_id_is_arxiv":true,"paper":"/paper/misclassification-aware-gaussian-smoothing","title":"Diverse Gaussian Noise Consistency Regularization for Robustness and Uncertainty Calibration","date":"2021-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TheoT1/DiGN","path":"imagenet_models/densenet.py","file_url":"https://github.com/TheoT1/DiGN/blob/HEAD/imagenet_models/densenet.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":"6b70762b5419b176","code_sha256_prefix":"6b70762b5419b176","mcp_get_code":{"code_sha256":"6b70762b5419b176"}},{"arxiv_id":"2010.11742","arxiv_id_is_arxiv":true,"paper":"/paper/learning-black-box-attackers-with","title":"Learning Black-Box Attackers with Transferable Priors and Query Feedback","date":"2020-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TrustworthyDL/LeBA","path":"imagenet/models/densenet.py","file_url":"https://github.com/TrustworthyDL/LeBA/blob/HEAD/imagenet/models/densenet.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":"fadea15ec7227c0d","code_sha256_prefix":"fadea15ec7227c0d","mcp_get_code":{"code_sha256":"fadea15ec7227c0d"}},{"arxiv_id":"1912.00385","arxiv_id_is_arxiv":true,"paper":"/paper/the-group-loss-for-deep-metric-learning","title":"The Group Loss for Deep Metric Learning","date":"2019-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"laurinwagner/grouploss_plus","path":"net/densenet.py","file_url":"https://github.com/laurinwagner/grouploss_plus/blob/HEAD/net/densenet.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":"a15fc654c671c2bf","code_sha256_prefix":"a15fc654c671c2bf","mcp_get_code":{"code_sha256":"a15fc654c671c2bf"}},{"arxiv_id":"1905.11926","arxiv_id_is_arxiv":true,"paper":"/paper/190511926","title":"Network Deconvolution","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deconvolutionpaper/deconvolution","path":"models/densenet_imagenet.py","file_url":"https://github.com/deconvolutionpaper/deconvolution/blob/HEAD/models/densenet_imagenet.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":"b2c7da0910c44182","code_sha256_prefix":"b2c7da0910c44182","mcp_get_code":{"code_sha256":"b2c7da0910c44182"}},{"arxiv_id":"1905.00641","arxiv_id_is_arxiv":true,"paper":"/paper/190500641","title":"RetinaFace: Single-stage Dense Face Localisation in the Wild","date":"2019-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sajjjadayobi/FaceLib","path":"facelib/FacialExpression/models/densenet.py","file_url":"https://github.com/sajjjadayobi/FaceLib/blob/HEAD/facelib/FacialExpression/models/densenet.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":"f93e948f2cfe6520","code_sha256_prefix":"f93e948f2cfe6520","mcp_get_code":{"code_sha256":"f93e948f2cfe6520"}},{"arxiv_id":"1802.10026","arxiv_id_is_arxiv":true,"paper":"/paper/loss-surfaces-mode-connectivity-and-fast","title":"Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNs","date":"2018-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tjwhitaker/prune-and-tune-ensembles","path":"src/models/densenet.py","file_url":"https://github.com/tjwhitaker/prune-and-tune-ensembles/blob/HEAD/src/models/densenet.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":"2c599b41c3a242e3","code_sha256_prefix":"2c599b41c3a242e3","mcp_get_code":{"code_sha256":"2c599b41c3a242e3"}},{"arxiv_id":"aaai_29231","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_29231","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"MIV-XJTU/EvoPrompt","path":"inclearn/convnet/densenet.py","file_url":"https://github.com/MIV-XJTU/EvoPrompt/blob/HEAD/inclearn/convnet/densenet.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":"03fc520ee2649d09","code_sha256_prefix":"03fc520ee2649d09","mcp_get_code":{"code_sha256":"03fc520ee2649d09"}}],"record_sha256":"c2ed0811965bbc08d02c9f1ad2c9dac2aca847ced792d6d75945a7563bc7aaf7","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}