{"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/vgg11-bn","entry":"vgg11_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":40,"n_papers_ran":29,"n_papers_ran_no_instrument_failure":19,"n_papers_ran_instrument_only":10,"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":34,"n_samples_ran":24,"n_samples_constructed":0,"n_samples_ran_checked":18,"n_samples_instrument":6,"n_samples_unverified":10,"n_samples_fingerprinted":0,"n_places":41,"n_places_pointer_only":14,"n_places_pointer_only_link_open":4,"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":6,"ran_fixture":0,"ran":18,"unverified":10},"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.18909","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-role-of-label-noise-in-the-feature","title":"On the Role of Label Noise in the Feature Learning Process","date":"2025-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zzp1012/label-noise-theory","path":"src/model/cifar_vgg.py","file_url":"https://github.com/zzp1012/label-noise-theory/blob/HEAD/src/model/cifar_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":"174e080f41432e65","code_sha256_prefix":"174e080f41432e65","mcp_get_code":{"code_sha256":"174e080f41432e65"}},{"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/vgg.py","file_url":"https://github.com/huyvnphan/PyTorch_CIFAR10/blob/HEAD/cifar10_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":"e569c3a2806d4b22","code_sha256_prefix":"e569c3a2806d4b22","mcp_get_code":{"code_sha256":"e569c3a2806d4b22"}},{"arxiv_id":"2410.23495","arxiv_id_is_arxiv":true,"paper":"/paper/dash-warm-starting-neural-network-training-in","title":"DASH: Warm-Starting Neural Network Training in Stationary Settings without Loss of Plasticity","date":"2024-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"baekrok/DASH-Direction-Aware-SHrinking","path":"models/VGG.py","file_url":"https://github.com/baekrok/DASH-Direction-Aware-SHrinking/blob/HEAD/models/VGG.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":"e8ac6d6137c1707b","code_sha256_prefix":"e8ac6d6137c1707b","mcp_get_code":{"code_sha256":"e8ac6d6137c1707b"}},{"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/vgg.py","file_url":"https://github.com/LIONS-EPFL/SAMPa/blob/HEAD/model/vgg.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":"09c336c3ecb596a3","code_sha256_prefix":"09c336c3ecb596a3","mcp_get_code":{"code_sha256":"09c336c3ecb596a3"}},{"arxiv_id":"2409.19613","arxiv_id_is_arxiv":true,"paper":"/paper/hybrid-mamba-for-few-shot-segmentation","title":"Hybrid Mamba for Few-Shot Segmentation","date":"2024-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sam1224/hmnet","path":"model/vgg.py","file_url":"https://github.com/sam1224/hmnet/blob/HEAD/model/vgg.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, sam1224/hmnet (NOASSERTION)","code_sha256":"bf96fb236a6b1683","code_sha256_prefix":"bf96fb236a6b1683","mcp_get_code":{"code_sha256":"bf96fb236a6b1683"}},{"arxiv_id":"2407.11910","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-the-attribution-quality-of","title":"Benchmarking the Attribution Quality of Vision Models","date":"2024-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"visinf/idsds","path":"models/vgg.py","file_url":"https://github.com/visinf/idsds/blob/HEAD/models/vgg.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":"df6cfaa1fbccd91a","code_sha256_prefix":"df6cfaa1fbccd91a","mcp_get_code":{"code_sha256":"df6cfaa1fbccd91a"}},{"arxiv_id":"2407.09842","arxiv_id_is_arxiv":true,"paper":"/paper/eliminating-feature-ambiguity-for-few-shot","title":"Eliminating Feature Ambiguity for Few-Shot Segmentation","date":"2024-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sam1224/aenet","path":"HDMNet/model/vgg.py","file_url":"https://github.com/sam1224/aenet/blob/HEAD/HDMNet/model/vgg.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, sam1224/aenet when it was checked","code_sha256":"bf96fb236a6b1683","code_sha256_prefix":"bf96fb236a6b1683","mcp_get_code":{"code_sha256":"bf96fb236a6b1683"}},{"arxiv_id":"2403.07968","arxiv_id_is_arxiv":true,"paper":"/paper/do-deep-neural-network-solutions-form-a-star","title":"Do Deep Neural Network Solutions Form a Star Domain?","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aktsonthalia/starlight","path":"models/vgg.py","file_url":"https://github.com/aktsonthalia/starlight/blob/HEAD/models/vgg.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":"2dbd65bc233a2ffe","code_sha256_prefix":"2dbd65bc233a2ffe","mcp_get_code":{"code_sha256":"2dbd65bc233a2ffe"}},{"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/base/vgg.py","file_url":"https://github.com/syp2ysy/vrp-sam/blob/HEAD/model/base/vgg.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 sam1224/hmnet, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"bf96fb236a6b1683","code_sha256_prefix":"bf96fb236a6b1683","mcp_get_code":{"code_sha256":"bf96fb236a6b1683"}},{"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/VGG.py","file_url":"https://github.com/hala64/udp/blob/HEAD/model/VGG.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":"2b1f218ccb1f2dd2","code_sha256_prefix":"2b1f218ccb1f2dd2","mcp_get_code":{"code_sha256":"2b1f218ccb1f2dd2"}},{"arxiv_id":"2312.06372","arxiv_id_is_arxiv":true,"paper":"/paper/ternary-spike-learning-ternary-spikes-for","title":"Ternary Spike: Learning Ternary Spikes for Spiking Neural Networks","date":"2023-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yfguo91/ternary-spike","path":"models/vggcifar.py","file_url":"https://github.com/yfguo91/ternary-spike/blob/HEAD/models/vggcifar.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, yfguo91/ternary-spike when it was checked","code_sha256":"ff89b5bc32b8bfd8","code_sha256_prefix":"ff89b5bc32b8bfd8","mcp_get_code":{"code_sha256":"ff89b5bc32b8bfd8"}},{"arxiv_id":"2312.00761","arxiv_id_is_arxiv":true,"paper":"/paper/deep-unlearning-fast-and-efficient-training","title":"Deep Unlearning: Fast and Efficient Gradient-free Approach to Class Forgetting","date":"2023-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sangamesh-kodge/class_forgetting","path":"models/vgg.py","file_url":"https://github.com/sangamesh-kodge/class_forgetting/blob/HEAD/models/vgg.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, sangamesh-kodge/class_forgetting when it was checked","code_sha256":"ea6c4b4731920685","code_sha256_prefix":"ea6c4b4731920685","mcp_get_code":{"code_sha256":"ea6c4b4731920685"}},{"arxiv_id":"2311.17232","arxiv_id_is_arxiv":true,"paper":"/paper/reward-retinal-waves-for-pre-training","title":"ReWaRD: Retinal Waves for Pre-Training Artificial Neural Networks Mimicking Real Prenatal Development","date":"2023-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bennyca/reward","path":"4_Visualization/nets/vgg.py","file_url":"https://github.com/bennyca/reward/blob/HEAD/4_Visualization/nets/vgg.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, bennyca/reward (NOASSERTION)","code_sha256":"1a5af0592a5260dc","code_sha256_prefix":"1a5af0592a5260dc","mcp_get_code":{"code_sha256":"1a5af0592a5260dc"}},{"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":"acc8c58f222a7df0","code_sha256_prefix":"acc8c58f222a7df0","mcp_get_code":{"code_sha256":"acc8c58f222a7df0"}},{"arxiv_id":"2310.18574","arxiv_id_is_arxiv":true,"paper":"/paper/breaking-the-trilemma-of-privacy-utility","title":"Breaking the Trilemma of Privacy, Utility, Efficiency via Controllable Machine Unlearning","date":"2023-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guangyaodou/conmu","path":"cv_models/VGG.py","file_url":"https://github.com/guangyaodou/conmu/blob/HEAD/cv_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":"2617bb063e662998","code_sha256_prefix":"2617bb063e662998","mcp_get_code":{"code_sha256":"2617bb063e662998"}},{"arxiv_id":"2308.06248","arxiv_id_is_arxiv":true,"paper":"/paper/funnybirds-a-synthetic-vision-dataset-for-a","title":"FunnyBirds: A Synthetic Vision Dataset for a Part-Based Analysis of Explainable AI Methods","date":"2023-08-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"visinf/funnybirds","path":"funnybirds_complete/models/vgg.py","file_url":"https://github.com/visinf/funnybirds/blob/HEAD/funnybirds_complete/models/vgg.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":"df6cfaa1fbccd91a","code_sha256_prefix":"df6cfaa1fbccd91a","mcp_get_code":{"code_sha256":"df6cfaa1fbccd91a"}},{"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/vgg.py","file_url":"https://github.com/cgcl-codes/transferattacksurrogates/blob/HEAD/TransferAttack/models/vgg.py","status":"ran","verification_level":1,"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":"acc8c58f222a7df0","code_sha256_prefix":"acc8c58f222a7df0","mcp_get_code":{"code_sha256":"acc8c58f222a7df0"}},{"arxiv_id":"2306.13856","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-rank-meets-language-boosting-1","title":"Learning-to-Rank Meets Language: Boosting Language-Driven Ordering Alignment for Ordinal Classification","date":"2023-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xk-huang/OrdinalCLIP","path":"ordinalclip/models/image_encoders/vgg.py","file_url":"https://github.com/xk-huang/OrdinalCLIP/blob/HEAD/ordinalclip/models/image_encoders/vgg.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":"71569392426397ab","code_sha256_prefix":"71569392426397ab","mcp_get_code":{"code_sha256":"71569392426397ab"}},{"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":"d13139f6d7bfd8d6","code_sha256_prefix":"d13139f6d7bfd8d6","mcp_get_code":{"code_sha256":"d13139f6d7bfd8d6"}},{"arxiv_id":"2207.13686","arxiv_id_is_arxiv":true,"paper":"/paper/shift-tolerant-perceptual-similarity-metric-1","title":"Shift-tolerant Perceptual Similarity Metric","date":"2022-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abhijay9/shifttolerant-lpips","path":"models_lpf/vgg.py","file_url":"https://github.com/abhijay9/shifttolerant-lpips/blob/HEAD/models_lpf/vgg.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"37a0395593656d08","code_sha256_prefix":"37a0395593656d08","mcp_get_code":{"code_sha256":"37a0395593656d08"}},{"arxiv_id":"2206.13190","arxiv_id_is_arxiv":true,"paper":"/paper/an-empirical-study-of-personalized-federated","title":"An Empirical Study of Personalized Federated Learning","date":"2022-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"onizukalab/fedbench","path":"code/utils/model.py","file_url":"https://github.com/onizukalab/fedbench/blob/HEAD/code/utils/model.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":"f7cd4a2b57319df7","code_sha256_prefix":"f7cd4a2b57319df7","mcp_get_code":{"code_sha256":"f7cd4a2b57319df7"}},{"arxiv_id":"2206.12680","arxiv_id_is_arxiv":true,"paper":"/paper/topology-aware-generalization-of","title":"Topology-aware Generalization of Decentralized SGD","date":"2022-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raiden-zhu/generalization-of-dsgd","path":"gpu_work.py","file_url":"https://github.com/raiden-zhu/generalization-of-dsgd/blob/HEAD/gpu_work.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, raiden-zhu/generalization-of-dsgd when it was checked","code_sha256":"617b89aca9a6c336","code_sha256_prefix":"617b89aca9a6c336","mcp_get_code":{"code_sha256":"617b89aca9a6c336"}},{"arxiv_id":"2206.07387","arxiv_id_is_arxiv":true,"paper":"/paper/the-manifold-hypothesis-for-gradient-based-1","title":"The Manifold Hypothesis for Gradient-Based Explanations","date":"2022-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tml-tuebingen/explanations-manifold","path":"replicate-paper/other_datasets/vgg.py","file_url":"https://github.com/tml-tuebingen/explanations-manifold/blob/HEAD/replicate-paper/other_datasets/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":"e569c3a2806d4b22","code_sha256_prefix":"e569c3a2806d4b22","mcp_get_code":{"code_sha256":"e569c3a2806d4b22"}},{"arxiv_id":"2205.13282","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-eigenvalues-of-global-covariance","title":"On the Eigenvalues of Global Covariance Pooling for Fine-grained Visual Recognition","date":"2022-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KingJamesSong/DifferentiableSVD","path":"src/network/vgg.py","file_url":"https://github.com/KingJamesSong/DifferentiableSVD/blob/HEAD/src/network/vgg.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":"57ac34428a02311d","code_sha256_prefix":"57ac34428a02311d","mcp_get_code":{"code_sha256":"57ac34428a02311d"}},{"arxiv_id":"2203.07615","arxiv_id_is_arxiv":true,"paper":"/paper/learning-what-not-to-segment-a-new","title":"Learning What Not to Segment: A New Perspective on Few-Shot Segmentation","date":"2022-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chunbolang/BAM","path":"model/vgg.py","file_url":"https://github.com/chunbolang/BAM/blob/HEAD/model/vgg.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 sam1224/hmnet, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"bf96fb236a6b1683","code_sha256_prefix":"bf96fb236a6b1683","mcp_get_code":{"code_sha256":"bf96fb236a6b1683"}},{"arxiv_id":"2110.05323","arxiv_id_is_arxiv":true,"paper":"/paper/progfed-effective-communication-and-1","title":"ProgFed: Effective, Communication, and Computation Efficient Federated Learning by Progressive Training","date":"2021-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hui-po-wang/progfed","path":"models/vgg.py","file_url":"https://github.com/hui-po-wang/progfed/blob/HEAD/models/vgg.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":"305019eddb7a5f28","code_sha256_prefix":"305019eddb7a5f28","mcp_get_code":{"code_sha256":"305019eddb7a5f28"}},{"arxiv_id":"2110.05283","arxiv_id_is_arxiv":true,"paper":"/paper/phase-collapse-in-neural-networks-1","title":"Phase Collapse in Neural Networks","date":"2021-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"florentinguth/phasecollapse","path":"models/vgg.py","file_url":"https://github.com/florentinguth/phasecollapse/blob/HEAD/models/vgg.py","status":"ran","verification_level":1,"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":"9424fcdf454449da","code_sha256_prefix":"9424fcdf454449da","mcp_get_code":{"code_sha256":"9424fcdf454449da"}},{"arxiv_id":"2108.05293","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-segmentation-with-global-and-local","title":"Few-Shot Segmentation with Global and Local Contrastive Learning","date":"2021-08-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuweide01/GQNet-Few-shot-segmentation","path":"model/vgg.py","file_url":"https://github.com/liuweide01/GQNet-Few-shot-segmentation/blob/HEAD/model/vgg.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 sam1224/hmnet, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"bf96fb236a6b1683","code_sha256_prefix":"bf96fb236a6b1683","mcp_get_code":{"code_sha256":"bf96fb236a6b1683"}},{"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/vgg.py","file_url":"https://github.com/DongyoungLim/THEO_POULA/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":"b98435ae05182b25","code_sha256_prefix":"b98435ae05182b25","mcp_get_code":{"code_sha256":"b98435ae05182b25"}},{"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/vgg.py","file_url":"https://github.com/TrustworthyDL/LeBA/blob/HEAD/imagenet/models/vgg.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":"4bafe38c1d715c07","code_sha256_prefix":"4bafe38c1d715c07","mcp_get_code":{"code_sha256":"4bafe38c1d715c07"}},{"arxiv_id":"2007.07435","arxiv_id_is_arxiv":true,"paper":"/paper/advflow-inconspicuous-black-box-adversarial","title":"AdvFlow: Inconspicuous Black-box Adversarial Attacks using Normalizing Flows","date":"2020-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hmdolatabadi/AdvFlow","path":"vgg.py","file_url":"https://github.com/hmdolatabadi/AdvFlow/blob/HEAD/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":"dbe86db498d00951","code_sha256_prefix":"dbe86db498d00951","mcp_get_code":{"code_sha256":"dbe86db498d00951"}},{"arxiv_id":"2005.03823","arxiv_id_is_arxiv":true,"paper":"/paper/blind-backdoors-in-deep-learning-models","title":"Blind Backdoors in Deep Learning Models","date":"2020-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ebagdasa/backdoors101","path":"models/vgg.py","file_url":"https://github.com/ebagdasa/backdoors101/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":"5c9b2e9b83552cf6","code_sha256_prefix":"5c9b2e9b83552cf6","mcp_get_code":{"code_sha256":"5c9b2e9b83552cf6"}},{"arxiv_id":"1904.03441","arxiv_id_is_arxiv":true,"paper":"/paper/iterative-normalization-beyond","title":"Iterative Normalization: Beyond Standardization towards Efficient Whitening","date":"2019-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huangleiBuaa/IterNorm-pytorch","path":"ImageNet/models/vgg.py","file_url":"https://github.com/huangleiBuaa/IterNorm-pytorch/blob/HEAD/ImageNet/models/vgg.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"16c88c00e897cd0a","code_sha256_prefix":"16c88c00e897cd0a","mcp_get_code":{"code_sha256":"16c88c00e897cd0a"}},{"arxiv_id":"1904.00370","arxiv_id_is_arxiv":true,"paper":"/paper/variational-adversarial-active-learning","title":"Variational Adversarial Active Learning","date":"2019-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sinhasam/vaal","path":"vgg.py","file_url":"https://github.com/sinhasam/vaal/blob/HEAD/vgg.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fb01d604c8bf7aa2","code_sha256_prefix":"fb01d604c8bf7aa2","mcp_get_code":{"code_sha256":"fb01d604c8bf7aa2"}},{"arxiv_id":"1904.00370","arxiv_id_is_arxiv":true,"paper":"/paper/variational-adversarial-active-learning","title":"Variational Adversarial Active Learning","date":"2019-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"johntiger1/vaal_querying","path":"vgg.py","file_url":"https://github.com/johntiger1/vaal_querying/blob/HEAD/vgg.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2a49eb37cf4d8847","code_sha256_prefix":"2a49eb37cf4d8847","mcp_get_code":{"code_sha256":"2a49eb37cf4d8847"}},{"arxiv_id":"1903.12117","arxiv_id_is_arxiv":true,"paper":"/paper/many-task-learning-with-task-routing","title":"Many Task Learning with Task Routing","date":"2019-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gstrezoski/TaskRouting","path":"routed_vgg.py","file_url":"https://github.com/gstrezoski/TaskRouting/blob/HEAD/routed_vgg.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, gstrezoski/TaskRouting when it was checked","code_sha256":"1cce7b73b2c6e63c","code_sha256_prefix":"1cce7b73b2c6e63c","mcp_get_code":{"code_sha256":"1cce7b73b2c6e63c"}},{"arxiv_id":"aaai_33972","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_33972","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"sangamesh-kodge/SAP","path":"models/vgg.py","file_url":"https://github.com/sangamesh-kodge/SAP/blob/HEAD/models/vgg.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":"5a9e5f8cb1d2d696","code_sha256_prefix":"5a9e5f8cb1d2d696","mcp_get_code":{"code_sha256":"5a9e5f8cb1d2d696"}},{"arxiv_id":"aaai_28258","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28258","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"dongmo-qcq/FG-CAM","path":"models/vgg.py","file_url":"https://github.com/dongmo-qcq/FG-CAM/blob/HEAD/models/vgg.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":"7512164ac05c0917","code_sha256_prefix":"7512164ac05c0917","mcp_get_code":{"code_sha256":"7512164ac05c0917"}},{"arxiv_id":"Pang_Backdoor_Cleansing_With_Unlabeled_Data_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Pang_Backdoor_Cleansing_With_Unlabeled_Data_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"luluppang/BCU","path":"models/vgg.py","file_url":"https://github.com/luluppang/BCU/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":"4dbe602a3c7fef59","code_sha256_prefix":"4dbe602a3c7fef59","mcp_get_code":{"code_sha256":"4dbe602a3c7fef59"}},{"arxiv_id":"136780474","arxiv_id_is_arxiv":false,"paper":null,"title":"id 136780474 (not an arXiv id)","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"dengyecode/hourglassattention","path":"model/vgg.py","file_url":"https://github.com/dengyecode/hourglassattention/blob/HEAD/model/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":"16bb9df35979ec55","code_sha256_prefix":"16bb9df35979ec55","mcp_get_code":{"code_sha256":"16bb9df35979ec55"}},{"arxiv_id":"03594","arxiv_id_is_arxiv":false,"paper":null,"title":"id 03594 (not an arXiv id)","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"zouyuda220/SAE","path":"models/vgg_.py","file_url":"https://github.com/zouyuda220/SAE/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":"dc0345cf5f5d20b4","code_sha256_prefix":"dc0345cf5f5d20b4","mcp_get_code":{"code_sha256":"dc0345cf5f5d20b4"}}],"record_sha256":"d54395549b9b50fc22c1c4fadf150123f4026db313263d73a2223709812e305d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}