{"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/densenet121-2","entry":"DenseNet121","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":32,"n_papers_ran":29,"n_papers_ran_no_instrument_failure":12,"n_papers_ran_instrument_only":17,"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":20,"n_samples_ran":17,"n_samples_constructed":0,"n_samples_ran_checked":12,"n_samples_instrument":5,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":34,"n_places_pointer_only":18,"n_places_pointer_only_link_open":8,"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":5,"ran_fixture":0,"ran":12,"unverified":3},"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":"2606.18209","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-18209","title":"Rethinking Dataset Distillation for Classification: Do Distilled Sets Outperform Coresets?","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"AyushRoy2001/ManifoldGD","path":"train_models/densenet_cifar.py","file_url":"https://github.com/AyushRoy2001/ManifoldGD/blob/HEAD/train_models/densenet_cifar.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, AyushRoy2001/ManifoldGD when it was checked","code_sha256":"19442a6a71144dbd","code_sha256_prefix":"19442a6a71144dbd","mcp_get_code":{"code_sha256":"19442a6a71144dbd"}},{"arxiv_id":"2606.18209","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-18209","title":"Rethinking Dataset Distillation for Classification: Do Distilled Sets Outperform Coresets?","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Jiacheng8/FADRM","path":"models/densenet.py","file_url":"https://github.com/Jiacheng8/FADRM/blob/HEAD/models/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":"3da7ee44118b27ad","code_sha256_prefix":"3da7ee44118b27ad","mcp_get_code":{"code_sha256":"3da7ee44118b27ad"}},{"arxiv_id":"2506.24125","arxiv_id_is_arxiv":true,"paper":"/paper/fadrm-fast-and-accurate-data-residual","title":"FADRM: Fast and Accurate Data Residual Matching for Dataset Distillation","date":"2025-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiacheng8/fadrm","path":"models/densenet.py","file_url":"https://github.com/jiacheng8/fadrm/blob/HEAD/models/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":"3da7ee44118b27ad","code_sha256_prefix":"3da7ee44118b27ad","mcp_get_code":{"code_sha256":"3da7ee44118b27ad"}},{"arxiv_id":"2501.07575","arxiv_id_is_arxiv":true,"paper":"/paper/dataset-distillation-via-committee-voting","title":"Dataset Distillation via Committee Voting","date":"2025-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiacheng8/cv-dd","path":"models/densenet.py","file_url":"https://github.com/jiacheng8/cv-dd/blob/HEAD/models/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":"3da7ee44118b27ad","code_sha256_prefix":"3da7ee44118b27ad","mcp_get_code":{"code_sha256":"3da7ee44118b27ad"}},{"arxiv_id":"2411.11924","arxiv_id_is_arxiv":true,"paper":"/paper/dataset-distillers-are-good-label-denoisers","title":"Dataset Distillers Are Good Label Denoisers In the Wild","date":"2024-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kciiiman/dd_lnl","path":"DANCE+ours/models/densenet_cifar.py","file_url":"https://github.com/kciiiman/dd_lnl/blob/HEAD/DANCE%2Bours/models/densenet_cifar.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, kciiiman/dd_lnl when it was checked","code_sha256":"19442a6a71144dbd","code_sha256_prefix":"19442a6a71144dbd","mcp_get_code":{"code_sha256":"19442a6a71144dbd"}},{"arxiv_id":"2410.12926","arxiv_id_is_arxiv":true,"paper":"/paper/deer-deviation-eliminating-and-noise","title":"DEeR: Deviation Eliminating and Noise Regulating for Privacy-preserving Federated Low-rank Adaptation","date":"2024-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cuhk-aim-group/deer","path":"models_dict/densenet.py","file_url":"https://github.com/cuhk-aim-group/deer/blob/HEAD/models_dict/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, cuhk-aim-group/deer when it was checked","code_sha256":"076b0d967ea9301b","code_sha256_prefix":"076b0d967ea9301b","mcp_get_code":{"code_sha256":"076b0d967ea9301b"}},{"arxiv_id":"2410.10683","arxiv_id_is_arxiv":true,"paper":"/paper/sampa-sharpness-aware-minimization","title":"SAMPa: Sharpness-aware Minimization Parallelized","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LIONS-EPFL/SAMPa","path":"model/densenet.py","file_url":"https://github.com/LIONS-EPFL/SAMPa/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, LIONS-EPFL/SAMPa when it was checked","code_sha256":"dfb395bae3d07d76","code_sha256_prefix":"dfb395bae3d07d76","mcp_get_code":{"code_sha256":"dfb395bae3d07d76"}},{"arxiv_id":"2407.01919","arxiv_id_is_arxiv":true,"paper":"/paper/a-method-to-facilitate-membership-inference","title":"A Method to Facilitate Membership Inference Attacks in Deep Learning Models","date":"2024-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DependableSystemsLab/code_poison_MIA","path":"networks/densenet.py","file_url":"https://github.com/DependableSystemsLab/code_poison_MIA/blob/HEAD/networks/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":"eddbdf4e2206ac0f","code_sha256_prefix":"eddbdf4e2206ac0f","mcp_get_code":{"code_sha256":"eddbdf4e2206ac0f"}},{"arxiv_id":"2406.01063","arxiv_id_is_arxiv":true,"paper":"/paper/dance-dual-view-distribution-alignment-for","title":"DANCE: Dual-View Distribution Alignment for Dataset Condensation","date":"2024-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Hansong-Zhang/DANCE","path":"models/densenet_cifar.py","file_url":"https://github.com/Hansong-Zhang/DANCE/blob/HEAD/models/densenet_cifar.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, Hansong-Zhang/DANCE when it was checked","code_sha256":"19442a6a71144dbd","code_sha256_prefix":"19442a6a71144dbd","mcp_get_code":{"code_sha256":"19442a6a71144dbd"}},{"arxiv_id":"2405.03316","arxiv_id_is_arxiv":true,"paper":"/paper/provably-unlearnable-examples","title":"Provably Unlearnable Data Examples","date":"2024-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neuralsec/certified-data-learnability","path":"models/DenseNet.py","file_url":"https://github.com/neuralsec/certified-data-learnability/blob/HEAD/models/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, neuralsec/certified-data-learnability when it was checked","code_sha256":"dfb395bae3d07d76","code_sha256_prefix":"dfb395bae3d07d76","mcp_get_code":{"code_sha256":"dfb395bae3d07d76"}},{"arxiv_id":"2405.01460","arxiv_id_is_arxiv":true,"paper":"/paper/purify-unlearnable-examples-via-rate","title":"Purify Unlearnable Examples via Rate-Constrained Variational Autoencoders","date":"2024-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuyi-sd/D-VAE","path":"models/DenseNet.py","file_url":"https://github.com/yuyi-sd/D-VAE/blob/HEAD/models/DenseNet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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 LIONS-EPFL/SAMPa, and GitHub detected no licence in that repository when it was checked","code_sha256":"dfb395bae3d07d76","code_sha256_prefix":"dfb395bae3d07d76","mcp_get_code":{"code_sha256":"dfb395bae3d07d76"}},{"arxiv_id":"2403.06075","arxiv_id_is_arxiv":true,"paper":"/paper/multisize-dataset-condensation","title":"Multisize Dataset Condensation","date":"2024-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"he-y/Multisize-Dataset-Condensation","path":"models/densenet_cifar.py","file_url":"https://github.com/he-y/Multisize-Dataset-Condensation/blob/HEAD/models/densenet_cifar.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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 AyushRoy2001/ManifoldGD, and GitHub detected no licence in that repository when it was checked","code_sha256":"19442a6a71144dbd","code_sha256_prefix":"19442a6a71144dbd","mcp_get_code":{"code_sha256":"19442a6a71144dbd"}},{"arxiv_id":"2312.12606","arxiv_id_is_arxiv":true,"paper":"/paper/optimizing-neural-networks-with-gradient-1","title":"Optimizing Neural Networks with Gradient Lexicase Selection","date":"2023-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ld-ing/gradient-lexicase","path":"models/densenet.py","file_url":"https://github.com/ld-ing/gradient-lexicase/blob/HEAD/models/densenet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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 LIONS-EPFL/SAMPa, and GitHub detected no licence in that repository when it was checked","code_sha256":"dfb395bae3d07d76","code_sha256_prefix":"dfb395bae3d07d76","mcp_get_code":{"code_sha256":"dfb395bae3d07d76"}},{"arxiv_id":"2310.14019","arxiv_id_is_arxiv":true,"paper":"/paper/you-only-condense-once-two-rules-for-pruning-1","title":"You Only Condense Once: Two Rules for Pruning Condensed Datasets","date":"2023-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"he-y/you-only-condense-once","path":"models/densenet_cifar.py","file_url":"https://github.com/he-y/you-only-condense-once/blob/HEAD/models/densenet_cifar.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, he-y/you-only-condense-once when it was checked","code_sha256":"19442a6a71144dbd","code_sha256_prefix":"19442a6a71144dbd","mcp_get_code":{"code_sha256":"19442a6a71144dbd"}},{"arxiv_id":"2308.10487","arxiv_id_is_arxiv":true,"paper":"/paper/deciphering-raw-data-in-neuro-symbolic","title":"Deciphering Raw Data in Neuro-Symbolic Learning with Provable Guarantees","date":"2023-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abductivelearning/abl-tl","path":"models/densenet.py","file_url":"https://github.com/abductivelearning/abl-tl/blob/HEAD/models/densenet.py","status":"ran","verification_level":1,"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, abductivelearning/abl-tl when it was checked","code_sha256":"e88abd65e3c98af7","code_sha256_prefix":"e88abd65e3c98af7","mcp_get_code":{"code_sha256":"e88abd65e3c98af7"}},{"arxiv_id":"2308.03258","arxiv_id_is_arxiv":true,"paper":"/paper/apbench-a-unified-benchmark-for-availability","title":"APBench: A Unified Benchmark for Availability Poisoning Attacks and Defenses","date":"2023-08-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lafeat/apbench","path":"nets/densenet.py","file_url":"https://github.com/lafeat/apbench/blob/HEAD/nets/densenet.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":"6cae1be82a92122d","code_sha256_prefix":"6cae1be82a92122d","mcp_get_code":{"code_sha256":"6cae1be82a92122d"}},{"arxiv_id":"2308.02533","arxiv_id_is_arxiv":true,"paper":"/paper/improving-generalization-of-adversarial","title":"Improving Generalization of Adversarial Training via Robust Critical Fine-Tuning","date":"2023-08-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Immortalise/RiFT","path":"models/densenet.py","file_url":"https://github.com/Immortalise/RiFT/blob/HEAD/models/densenet.py","status":"ran","verification_level":1,"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, Immortalise/RiFT when it was checked","code_sha256":"5b545f16f72c1645","code_sha256_prefix":"5b545f16f72c1645","mcp_get_code":{"code_sha256":"5b545f16f72c1645"}},{"arxiv_id":"2307.06306","arxiv_id_is_arxiv":true,"paper":"/paper/locally-adaptive-federated-learning-via","title":"Locally Adaptive Federated Learning","date":"2023-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IssamLaradji/sps","path":"src/base_classifiers.py","file_url":"https://github.com/IssamLaradji/sps/blob/HEAD/src/base_classifiers.py","status":"ran","verification_level":1,"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, IssamLaradji/sps when it was checked","code_sha256":"ea1e46ba1761264d","code_sha256_prefix":"ea1e46ba1761264d","mcp_get_code":{"code_sha256":"ea1e46ba1761264d"}},{"arxiv_id":"2306.03065","arxiv_id_is_arxiv":true,"paper":"/paper/libauc-a-deep-learning-library-for-x-risk","title":"LibAUC: A Deep Learning Library for X-Risk Optimization","date":"2023-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Optimization-AI/LibAUC","path":"libauc/models/densenet.py","file_url":"https://github.com/Optimization-AI/LibAUC/blob/HEAD/libauc/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":"8a4d4b5c6865a4b2","code_sha256_prefix":"8a4d4b5c6865a4b2","mcp_get_code":{"code_sha256":"8a4d4b5c6865a4b2"}},{"arxiv_id":"2304.02786","arxiv_id_is_arxiv":true,"paper":"/paper/unicorn-a-unified-backdoor-trigger-inversion","title":"UNICORN: A Unified Backdoor Trigger Inversion Framework","date":"2023-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ru-system-software-and-security/unicorn","path":"models/densenet.py","file_url":"https://github.com/ru-system-software-and-security/unicorn/blob/HEAD/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":"4642fceedc1f27a6","code_sha256_prefix":"4642fceedc1f27a6","mcp_get_code":{"code_sha256":"4642fceedc1f27a6"}},{"arxiv_id":"2303.08500","arxiv_id_is_arxiv":true,"paper":"/paper/the-devil-s-advocate-shattering-the-illusion","title":"The Devil's Advocate: Shattering the Illusion of Unexploitable Data using Diffusion Models","date":"2023-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hmdolatabadi/avatar","path":"models/DenseNet.py","file_url":"https://github.com/hmdolatabadi/avatar/blob/HEAD/models/DenseNet.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":"a3cedf1d509b37f2","code_sha256_prefix":"a3cedf1d509b37f2","mcp_get_code":{"code_sha256":"a3cedf1d509b37f2"}},{"arxiv_id":"2302.02607","arxiv_id_is_arxiv":true,"paper":"/paper/target-based-surrogates-for-stochastic","title":"Target-based Surrogates for Stochastic Optimization","date":"2023-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wilderlavington/target-based-surrogates-for-stochastic-optimization","path":"models.py","file_url":"https://github.com/wilderlavington/target-based-surrogates-for-stochastic-optimization/blob/HEAD/models.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":"7a9e058c035f14cc","code_sha256_prefix":"7a9e058c035f14cc","mcp_get_code":{"code_sha256":"7a9e058c035f14cc"}},{"arxiv_id":"2207.13048","arxiv_id_is_arxiv":true,"paper":"/paper/domain-adaptation-under-open-set-label-shift","title":"Domain Adaptation under Open Set Label Shift","date":"2022-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"acmi-lab/open-set-label-shift","path":"models/Densenet.py","file_url":"https://github.com/acmi-lab/open-set-label-shift/blob/HEAD/models/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":"14e37cf982988836","code_sha256_prefix":"14e37cf982988836","mcp_get_code":{"code_sha256":"14e37cf982988836"}},{"arxiv_id":"2206.09387","arxiv_id_is_arxiv":true,"paper":"/paper/label-and-distribution-discriminative-dual","title":"Dual Representation Learning for Out-of-Distribution Detection","date":"2022-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lawliet-zzl/drl","path":"code/models/densenet.py","file_url":"https://github.com/lawliet-zzl/drl/blob/HEAD/code/models/densenet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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 LIONS-EPFL/SAMPa, and GitHub detected no licence in that repository when it was checked","code_sha256":"dfb395bae3d07d76","code_sha256_prefix":"dfb395bae3d07d76","mcp_get_code":{"code_sha256":"dfb395bae3d07d76"}},{"arxiv_id":"2201.13329","arxiv_id_is_arxiv":true,"paper":"/paper/can-adversarial-training-be-manipulated-by","title":"Can Adversarial Training Be Manipulated By Non-Robust Features?","date":"2022-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tlmichael/hypocritical-perturbation","path":"models/densenet.py","file_url":"https://github.com/tlmichael/hypocritical-perturbation/blob/HEAD/models/densenet.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":"580a043332af4a51","code_sha256_prefix":"580a043332af4a51","mcp_get_code":{"code_sha256":"580a043332af4a51"}},{"arxiv_id":"2108.09976","arxiv_id_is_arxiv":true,"paper":"/paper/revealing-distributional-vulnerability-of","title":"Revealing the Distributional Vulnerability of Discriminators by Implicit Generators","date":"2021-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lawliet-zzl/fig","path":"code_FIG/models/densenet.py","file_url":"https://github.com/lawliet-zzl/fig/blob/HEAD/code_FIG/models/densenet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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 LIONS-EPFL/SAMPa, and GitHub detected no licence in that repository when it was checked","code_sha256":"dfb395bae3d07d76","code_sha256_prefix":"dfb395bae3d07d76","mcp_get_code":{"code_sha256":"dfb395bae3d07d76"}},{"arxiv_id":"2105.13937","arxiv_id_is_arxiv":true,"paper":"/paper/polygonal-unadjusted-langevin-algorithms","title":"Polygonal Unadjusted Langevin Algorithms: Creating stable and efficient adaptive algorithms for neural networks","date":"2021-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DongyoungLim/THEO_POULA","path":"models/densenet.py","file_url":"https://github.com/DongyoungLim/THEO_POULA/blob/HEAD/models/densenet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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 LIONS-EPFL/SAMPa, and GitHub detected no licence in that repository when it was checked","code_sha256":"dfb395bae3d07d76","code_sha256_prefix":"dfb395bae3d07d76","mcp_get_code":{"code_sha256":"dfb395bae3d07d76"}},{"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":"DiGN.py","file_url":"https://github.com/theot1/dign/blob/HEAD/DiGN.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":"e18432664d73b55f","code_sha256_prefix":"e18432664d73b55f","mcp_get_code":{"code_sha256":"e18432664d73b55f"}},{"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":"densenet.py","file_url":"https://github.com/TheoT1/DiGN/blob/HEAD/densenet.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":"9ccdb4ad5a50fc5c","code_sha256_prefix":"9ccdb4ad5a50fc5c","mcp_get_code":{"code_sha256":"9ccdb4ad5a50fc5c"}},{"arxiv_id":"2006.15815","arxiv_id_is_arxiv":true,"paper":"/paper/adai-separating-the-effects-of-adaptive","title":"Adai: Separating the Effects of Adaptive Learning Rate and Momentum Inertia","date":"2020-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zeke-xie/adaptive-inertia-adai","path":"model/densenet.py","file_url":"https://github.com/zeke-xie/adaptive-inertia-adai/blob/HEAD/model/densenet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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 LIONS-EPFL/SAMPa, and GitHub detected no licence in that repository when it was checked","code_sha256":"dfb395bae3d07d76","code_sha256_prefix":"dfb395bae3d07d76","mcp_get_code":{"code_sha256":"dfb395bae3d07d76"}},{"arxiv_id":"2002.06349","arxiv_id_is_arxiv":true,"paper":"/paper/hold-me-tight-influence-of-discriminative","title":"Hold me tight! Influence of discriminative features on deep network boundaries","date":"2020-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LTS4/hold-me-tight","path":"model_classes/cifar10/densenet.py","file_url":"https://github.com/LTS4/hold-me-tight/blob/HEAD/model_classes/cifar10/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":"46d91f5224859d33","code_sha256_prefix":"46d91f5224859d33","mcp_get_code":{"code_sha256":"46d91f5224859d33"}},{"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.py","file_url":"https://github.com/deconvolutionpaper/deconvolution/blob/HEAD/models/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":"a848734514fda9d2","code_sha256_prefix":"a848734514fda9d2","mcp_get_code":{"code_sha256":"a848734514fda9d2"}},{"arxiv_id":"aaai_28784","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28784","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Hansong-Zhang/M3D","path":"models/densenet_cifar.py","file_url":"https://github.com/Hansong-Zhang/M3D/blob/HEAD/models/densenet_cifar.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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 AyushRoy2001/ManifoldGD, and GitHub detected no licence in that repository when it was checked","code_sha256":"19442a6a71144dbd","code_sha256_prefix":"19442a6a71144dbd","mcp_get_code":{"code_sha256":"19442a6a71144dbd"}},{"arxiv_id":"aaai_28019","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28019","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"VinAIResearch/COMBAT","path":"classifier_models/densenet.py","file_url":"https://github.com/VinAIResearch/COMBAT/blob/HEAD/classifier_models/densenet.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":"7ca32c7a6aa1ef41","code_sha256_prefix":"7ca32c7a6aa1ef41","mcp_get_code":{"code_sha256":"7ca32c7a6aa1ef41"}}],"record_sha256":"088a972b0da6afedecbd9c93209155b69b30e1478c6eaf6794fbf55947931e0f","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}