{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/code/sam","entry":"SAM","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":25,"n_papers_ran":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":28,"n_samples_ran":18,"n_samples_fingerprinted":1,"n_places":28,"n_places_pointer_only":11,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":17,"unverified":10},"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.27655","paper":"/paper/arxiv-2606-27655","title":"Temporal-Emerged Prompting for Segment Anything in Multiframe Infrared Small Target Detection","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"cdh8285/TEP-SAM","path":"models/sam_withToken.py","file_url":"https://github.com/cdh8285/TEP-SAM/blob/HEAD/models/sam_withToken.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"850f7b3f4cdbb1de","mcp_get_code":{"code_sha256":"850f7b3f4cdbb1de"}},{"arxiv_id":"2602.23827","paper":"/paper/arxiv-2602-23827","title":"Consistency of Local and Global Flatness for Federated Learning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"junkangLiu0/FedNSAM","path":"optimizer/SAM.py","file_url":"https://github.com/junkangLiu0/FedNSAM/blob/HEAD/optimizer/SAM.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e50e6e9c7bcdac38","mcp_get_code":{"code_sha256":"e50e6e9c7bcdac38"}},{"arxiv_id":"2601.11981","paper":"/paper/arxiv-2601-11981","title":"Nip Rumors in the Bud: Retrieval-Guided Topic-Level Adaptation for Test-Time Fake News Video Detection","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Jian-Lang/RADAR","path":"core/adapt_model/RADAR/RADAR_model.py","file_url":"https://github.com/Jian-Lang/RADAR/blob/HEAD/core/adapt_model/RADAR/RADAR_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"edad212265ca9252","mcp_get_code":{"code_sha256":"edad212265ca9252"}},{"arxiv_id":"2506.13715","paper":"/paper/sharpness-aware-machine-unlearning","title":"Sharpness-Aware Machine Unlearning","date":"2025-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HaoranTang/sharp-unlearn","path":"sam/sam.py","file_url":"https://github.com/HaoranTang/sharp-unlearn/blob/HEAD/sam/sam.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fccfa41f34e12825","mcp_get_code":{"code_sha256":"fccfa41f34e12825"}},{"arxiv_id":"2506.06866","paper":"/paper/safe-finding-sparse-and-flat-minima-to","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","date":"2025-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LOG-postech/safe-torch","path":"language/lib/prune.py","file_url":"https://github.com/LOG-postech/safe-torch/blob/HEAD/language/lib/prune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e75a622bc571e165","mcp_get_code":{"code_sha256":"e75a622bc571e165"}},{"arxiv_id":"2504.14662","paper":"/paper/mitigating-parameter-interference-in-model","title":"Mitigating Parameter Interference in Model Merging via Sharpness-Aware Fine-Tuning","date":"2025-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"baiklab/saft-merge","path":"linearized_saft/src/sam.py","file_url":"https://github.com/baiklab/saft-merge/blob/HEAD/linearized_saft/src/sam.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e829ad9fe1462ced","mcp_get_code":{"code_sha256":"e829ad9fe1462ced"}},{"arxiv_id":"2410.23227","paper":"/paper/fl-2-overcoming-few-labels-in-federated-semi","title":"(FL)$^2$: Overcoming Few Labels in Federated Semi-Supervised Learning","date":"2024-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seungjoo-ai/FLFL-NeurIPS24","path":"src/algorithm/flfl.py","file_url":"https://github.com/seungjoo-ai/FLFL-NeurIPS24/blob/HEAD/src/algorithm/flfl.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5937ee54bec0a47e","mcp_get_code":{"code_sha256":"5937ee54bec0a47e"}},{"arxiv_id":"2407.12993","paper":"/paper/improving-sam-requires-rethinking-its","title":"Improving SAM Requires Rethinking its Optimization Formulation","date":"2024-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LIONS-EPFL/BiSAM","path":"utility/sam.py","file_url":"https://github.com/LIONS-EPFL/BiSAM/blob/HEAD/utility/sam.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"aacd1c60e21babdd","mcp_get_code":{"code_sha256":"aacd1c60e21babdd"}},{"arxiv_id":"2405.02843","paper":"/paper/residual-conditioned-optimal-transport","title":"Residual-Conditioned Optimal Transport: Towards Structure-Preserving Unpaired and Paired Image Restoration","date":"2024-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xl-tang3/RCOT","path":"Net.py","file_url":"https://github.com/xl-tang3/RCOT/blob/HEAD/Net.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4bf95f287cef1b67","mcp_get_code":{"code_sha256":"4bf95f287cef1b67"}},{"arxiv_id":"2401.02161","paper":"/paper/enhancing-raw-to-srgb-with-decoupled-style","title":"Enhancing RAW-to-sRGB with Decoupled Style Structure in Fourier Domain","date":"2024-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alexhe101/FourierISP","path":"basicsr/archs/FourierISP_arch.py","file_url":"https://github.com/alexhe101/FourierISP/blob/HEAD/basicsr/archs/FourierISP_arch.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c53f98dfc4e5460f","mcp_get_code":{"code_sha256":"c53f98dfc4e5460f"}},{"arxiv_id":"2305.08661","paper":"/paper/global-and-local-mixture-consistency-1","title":"Global and Local Mixture Consistency Cumulative Learning for Long-tailed Visual Recognitions","date":"2023-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"val-iisc/saddle-longtail","path":"GLMC-2023/Trainer.py","file_url":"https://github.com/val-iisc/saddle-longtail/blob/HEAD/GLMC-2023/Trainer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5f0b6886fbdb403e","mcp_get_code":{"code_sha256":"5f0b6886fbdb403e"}},{"arxiv_id":"2303.15046","paper":"/paper/nighttime-smartphone-reflective-flare-removal","title":"Nighttime Smartphone Reflective Flare Removal Using Optical Center Symmetry Prior","date":"2023-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ykdai/BracketFlare","path":"basicsr/archs/mprnet_arch.py","file_url":"https://github.com/ykdai/BracketFlare/blob/HEAD/basicsr/archs/mprnet_arch.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"f289867efcaa686f","mcp_get_code":{"code_sha256":"f289867efcaa686f"}},{"arxiv_id":"2303.13087","paper":"/paper/robust-generalization-against-photon-limited","title":"Robust Generalization against Photon-Limited Corruptions via Worst-Case Sharpness Minimization","date":"2023-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhuohuangai/sharpdro","path":"sam.py","file_url":"https://github.com/zhuohuangai/sharpdro/blob/HEAD/sam.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"91898e953f3b8aa0","mcp_get_code":{"code_sha256":"91898e953f3b8aa0"}},{"arxiv_id":"2210.05177","paper":"/paper/make-sharpness-aware-minimization-stronger-a","title":"Make Sharpness-Aware Minimization Stronger: A Sparsified Perturbation Approach","date":"2022-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dbahri/universal_sam","path":"solver/sam.py","file_url":"https://github.com/dbahri/universal_sam/blob/HEAD/solver/sam.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7bd30c15c31ad1bb","mcp_get_code":{"code_sha256":"7bd30c15c31ad1bb"}},{"arxiv_id":"2210.05177","paper":"/paper/make-sharpness-aware-minimization-stronger-a","title":"Make Sharpness-Aware Minimization Stronger: A Sparsified Perturbation Approach","date":"2022-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mi-peng/sparse-sharpness-aware-minimization","path":"solver/sam.py","file_url":"https://github.com/mi-peng/sparse-sharpness-aware-minimization/blob/HEAD/solver/sam.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"291f38ec812b48d8","mcp_get_code":{"code_sha256":"291f38ec812b48d8"}},{"arxiv_id":"2208.05244","paper":"/paper/learning-degradation-representations-for","title":"Learning Degradation Representations for Image Deblurring","date":"2022-08-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dasongli1/learning_degradation","path":"basicsr/models/archs/msdi_arch.py","file_url":"https://github.com/dasongli1/learning_degradation/blob/HEAD/basicsr/models/archs/msdi_arch.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"38a5faff61c0143d","mcp_get_code":{"code_sha256":"38a5faff61c0143d"}},{"arxiv_id":"2207.14200","paper":"/paper/cram-a-compression-aware-minimizer","title":"CrAM: A Compression-Aware Minimizer","date":"2022-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ist-daslab/cram","path":"optimization/custom_optimizers.py","file_url":"https://github.com/ist-daslab/cram/blob/HEAD/optimization/custom_optimizers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"e74d6737263a0f1b","mcp_get_code":{"code_sha256":"e74d6737263a0f1b"}},{"arxiv_id":"2206.08213","paper":"/paper/a-closer-look-at-smoothness-in-domain-1","title":"A Closer Look at Smoothness in Domain Adversarial Training","date":"2022-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"val-iisc/sdat","path":"common/utils/sam.py","file_url":"https://github.com/val-iisc/sdat/blob/HEAD/common/utils/sam.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"14e32376472deb6c","mcp_get_code":{"code_sha256":"14e32376472deb6c"}},{"arxiv_id":"2204.13348","paper":"/paper/deep-generalized-unfolding-networks-for-image","title":"Deep Generalized Unfolding Networks for Image Restoration","date":"2022-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mc-e/deep-generalized-unfolding-networks-for-image-restoration","path":"Compressive-Sensing/DGUNet.py","file_url":"https://github.com/mc-e/deep-generalized-unfolding-networks-for-image-restoration/blob/HEAD/Compressive-Sensing/DGUNet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"658b7827b59f378e","mcp_get_code":{"code_sha256":"658b7827b59f378e"}},{"arxiv_id":"2203.07860","paper":"/paper/imputing-out-of-vocabulary-embeddings-with","title":"Imputing Out-of-Vocabulary Embeddings with LOVE Makes Language Models Robust with Little Cost","date":"2022-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tigerchen52/LOVE","path":"model.py","file_url":"https://github.com/tigerchen52/LOVE/blob/HEAD/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"64c0f6a050045fc9","mcp_get_code":{"code_sha256":"64c0f6a050045fc9"}},{"arxiv_id":"2201.02973","paper":"/paper/maxim-multi-axis-mlp-for-image-processing","title":"MAXIM: Multi-Axis MLP for Image Processing","date":"2022-01-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sayakpaul/maxim-tf","path":"maxim/maxim.py","file_url":"https://github.com/sayakpaul/maxim-tf/blob/HEAD/maxim/maxim.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"e1002ec72887a8e7","mcp_get_code":{"code_sha256":"e1002ec72887a8e7"}},{"arxiv_id":"2201.02973","paper":"/paper/maxim-multi-axis-mlp-for-image-processing","title":"MAXIM: Multi-Axis MLP for Image Processing","date":"2022-01-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/maxim","path":"maxim/models/maxim.py","file_url":"https://github.com/google-research/maxim/blob/HEAD/maxim/models/maxim.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"5677718f64cf57a1","mcp_get_code":{"code_sha256":"5677718f64cf57a1"}},{"arxiv_id":"2106.05210","paper":"/paper/rethinking-space-time-networks-with-improved","title":"Rethinking Space-Time Networks with Improved Memory Coverage for Efficient Video Object Segmentation","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"limingxing00/rde-vos-cvpr2022","path":"model/modules.py","file_url":"https://github.com/limingxing00/rde-vos-cvpr2022/blob/HEAD/model/modules.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2a010015f43898d9","mcp_get_code":{"code_sha256":"2a010015f43898d9"}},{"arxiv_id":"2106.02299","paper":"/paper/masa-sr-matching-acceleration-and-spatial","title":"MASA-SR: Matching Acceleration and Spatial Adaptation for Reference-Based Image Super-Resolution","date":"2021-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dvlab-research/MASA-SR","path":"models/archs/MASA_arch.py","file_url":"https://github.com/dvlab-research/MASA-SR/blob/HEAD/models/archs/MASA_arch.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"224af6a4c088bba6","mcp_get_code":{"code_sha256":"224af6a4c088bba6"}},{"arxiv_id":"2010.01412","paper":"/paper/sharpness-aware-minimization-for-efficiently-1","title":"Sharpness-Aware Minimization for Efficiently Improving Generalization","date":"2020-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"simon20010923/DDAMFN","path":"DDAMFN++/sam.py","file_url":"https://github.com/simon20010923/DDAMFN/blob/HEAD/DDAMFN%2B%2B/sam.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f04e7b9eb0136335","mcp_get_code":{"code_sha256":"f04e7b9eb0136335"}},{"arxiv_id":"2010.01412","paper":"/paper/sharpness-aware-minimization-for-efficiently-1","title":"Sharpness-Aware Minimization for Efficiently Improving Generalization","date":"2020-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jannoshh/simple-sam","path":"sam.py","file_url":"https://github.com/Jannoshh/simple-sam/blob/HEAD/sam.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"954d13e2c6b31007","mcp_get_code":{"code_sha256":"954d13e2c6b31007"}},{"arxiv_id":"aaai_28478","paper":null,"title":"arXiv:aaai_28478","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"AlexYangxx/CESST","path":"train_code/architecture/CESST.py","file_url":"https://github.com/AlexYangxx/CESST/blob/HEAD/train_code/architecture/CESST.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"99df98d02541aff9","mcp_get_code":{"code_sha256":"99df98d02541aff9"}},{"arxiv_id":"aaai_27923","paper":null,"title":"arXiv:aaai_27923","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Jiahuiqu/M2DTN","path":"metrics_utils.py","file_url":"https://github.com/Jiahuiqu/M2DTN/blob/HEAD/metrics_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cf1e86bd2a0afa2b","mcp_get_code":{"code_sha256":"cf1e86bd2a0afa2b"}}]}