{"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/color","entry":"Color","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":29,"n_papers_ran":29,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":29,"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":7,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":6,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":31,"n_places_pointer_only":28,"n_places_pointer_only_link_open":16,"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":4,"ran":0,"unverified":1},"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.31742","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-31742","title":"FedXDS: Leveraging Model Attribution Methods to counteract Data Heterogeneity in Federated Learning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"MaxH1996/FedXDS","path":"augment.py","file_url":"https://github.com/MaxH1996/FedXDS/blob/HEAD/augment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, MaxH1996/FedXDS when it was checked","code_sha256":"32cb3f5760fa593e","code_sha256_prefix":"32cb3f5760fa593e","mcp_get_code":{"code_sha256":"32cb3f5760fa593e"}},{"arxiv_id":"2411.01833","arxiv_id_is_arxiv":true,"paper":"/paper/owmatch-conditional-self-labeling-with","title":"OwMatch: Conditional Self-Labeling with Consistency for Open-World Semi-Supervised Learning","date":"2024-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"niusj03/OwMatch","path":"randaugment.py","file_url":"https://github.com/niusj03/OwMatch/blob/HEAD/randaugment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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 MaxH1996/FedXDS, and GitHub detected no licence in that repository when it was checked","code_sha256":"32cb3f5760fa593e","code_sha256_prefix":"32cb3f5760fa593e","mcp_get_code":{"code_sha256":"32cb3f5760fa593e"}},{"arxiv_id":"2410.06109","arxiv_id_is_arxiv":true,"paper":"/paper/continuous-contrastive-learning-for-long","title":"Continuous Contrastive Learning for Long-Tailed Semi-Supervised Recognition","date":"2024-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhouzihao11/CCL","path":"dataset/randaugment.py","file_url":"https://github.com/zhouzihao11/CCL/blob/HEAD/dataset/randaugment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, zhouzihao11/CCL when it was checked","code_sha256":"32cb3f5760fa593e","code_sha256_prefix":"32cb3f5760fa593e","mcp_get_code":{"code_sha256":"32cb3f5760fa593e"}},{"arxiv_id":"2407.07003","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-complement-and-to-defer-to","title":"Learning to Complement and to Defer to Multiple Users","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhengzhang37/lecodu","path":"utils/randaug.py","file_url":"https://github.com/zhengzhang37/lecodu/blob/HEAD/utils/randaug.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, zhengzhang37/lecodu when it was checked","code_sha256":"5e4ee5c45933ae09","code_sha256_prefix":"5e4ee5c45933ae09","mcp_get_code":{"code_sha256":"5e4ee5c45933ae09"}},{"arxiv_id":"2406.13187","arxiv_id_is_arxiv":true,"paper":"/paper/boosting-consistency-in-dual-training-for","title":"Boosting Consistency in Dual Training for Long-Tailed Semi-Supervised Learning","date":"2024-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gank0078/boat","path":"dataset/randaugment.py","file_url":"https://github.com/gank0078/boat/blob/HEAD/dataset/randaugment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, gank0078/boat when it was checked","code_sha256":"32cb3f5760fa593e","code_sha256_prefix":"32cb3f5760fa593e","mcp_get_code":{"code_sha256":"32cb3f5760fa593e"}},{"arxiv_id":"2405.11756","arxiv_id_is_arxiv":true,"paper":"/paper/erasing-the-bias-fine-tuning-foundation","title":"Erasing the Bias: Fine-Tuning Foundation Models for Semi-Supervised Learning","date":"2024-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Gank0078/FineSSL","path":"datasets/randaugment.py","file_url":"https://github.com/Gank0078/FineSSL/blob/HEAD/datasets/randaugment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, Gank0078/FineSSL when it was checked","code_sha256":"32cb3f5760fa593e","code_sha256_prefix":"32cb3f5760fa593e","mcp_get_code":{"code_sha256":"32cb3f5760fa593e"}},{"arxiv_id":"2403.12803","arxiv_id_is_arxiv":true,"paper":"/paper/dreamda-generative-data-augmentation-with","title":"DreamDA: Generative Data Augmentation with Diffusion Models","date":"2024-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunxiangfu2001/dreamda","path":"dataset/augmentation.py","file_url":"https://github.com/yunxiangfu2001/dreamda/blob/HEAD/dataset/augmentation.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, yunxiangfu2001/dreamda when it was checked","code_sha256":"5e4ee5c45933ae09","code_sha256_prefix":"5e4ee5c45933ae09","mcp_get_code":{"code_sha256":"5e4ee5c45933ae09"}},{"arxiv_id":"2402.14430","arxiv_id_is_arxiv":true,"paper":"/paper/robust-training-of-federated-models-with","title":"Robust Training of Federated Models with Extremely Label Deficiency","date":"2024-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmlr-group/Twin-sight","path":"randaugment.py","file_url":"https://github.com/tmlr-group/Twin-sight/blob/HEAD/randaugment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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 MaxH1996/FedXDS, and GitHub detected no licence in that repository when it was checked","code_sha256":"32cb3f5760fa593e","code_sha256_prefix":"32cb3f5760fa593e","mcp_get_code":{"code_sha256":"32cb3f5760fa593e"}},{"arxiv_id":"2402.13505","arxiv_id_is_arxiv":true,"paper":"/paper/simpro-a-simple-probabilistic-framework","title":"SimPro: A Simple Probabilistic Framework Towards Realistic Long-Tailed Semi-Supervised Learning","date":"2024-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leaplabthu/simpro","path":"SimPro/dataset/randaugment.py","file_url":"https://github.com/leaplabthu/simpro/blob/HEAD/SimPro/dataset/randaugment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, leaplabthu/simpro when it was checked","code_sha256":"32cb3f5760fa593e","code_sha256_prefix":"32cb3f5760fa593e","mcp_get_code":{"code_sha256":"32cb3f5760fa593e"}},{"arxiv_id":"2402.01922","arxiv_id_is_arxiv":true,"paper":"/paper/a-general-framework-for-learning-from-weak","title":"A General Framework for Learning from Weak Supervision","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hhhhhhao/general-framework-weak-supervision","path":"src/datasets/rand_aug.py","file_url":"https://github.com/hhhhhhao/general-framework-weak-supervision/blob/HEAD/src/datasets/rand_aug.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, hhhhhhao/general-framework-weak-supervision when it was checked","code_sha256":"5e4ee5c45933ae09","code_sha256_prefix":"5e4ee5c45933ae09","mcp_get_code":{"code_sha256":"5e4ee5c45933ae09"}},{"arxiv_id":"2401.03145","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-feature-adaptation-for-3d","title":"Self-supervised Feature Adaptation for 3D Industrial Anomaly Detection","date":"2024-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuanpengtu/LSFA","path":"Adaptation/randaugment.py","file_url":"https://github.com/yuanpengtu/LSFA/blob/HEAD/Adaptation/randaugment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, yuanpengtu/LSFA when it was checked","code_sha256":"32cb3f5760fa593e","code_sha256_prefix":"32cb3f5760fa593e","mcp_get_code":{"code_sha256":"32cb3f5760fa593e"}},{"arxiv_id":"2312.12703","arxiv_id_is_arxiv":true,"paper":"/paper/federated-learning-with-extremely-noisy","title":"Federated Learning with Extremely Noisy Clients via Negative Distillation","date":"2023-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linchen99/fedned","path":"dataset/utils/randaugment.py","file_url":"https://github.com/linchen99/fedned/blob/HEAD/dataset/utils/randaugment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, linchen99/fedned when it was checked","code_sha256":"32cb3f5760fa593e","code_sha256_prefix":"32cb3f5760fa593e","mcp_get_code":{"code_sha256":"32cb3f5760fa593e"}},{"arxiv_id":"2312.04604","arxiv_id_is_arxiv":true,"paper":"/paper/transferable-candidate-proposal-with-bounded","title":"Transferable Candidate Proposal with Bounded Uncertainty","date":"2023-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gokyeongryeol/TBU","path":"active/dataset/augment.py","file_url":"https://github.com/gokyeongryeol/TBU/blob/HEAD/active/dataset/augment.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8fa703bbf4bd406f","code_sha256_prefix":"8fa703bbf4bd406f","mcp_get_code":{"code_sha256":"8fa703bbf4bd406f"}},{"arxiv_id":"2311.01002","arxiv_id_is_arxiv":true,"paper":"/paper/robust-data-pruning-under-label-noise-via","title":"Robust Data Pruning under Label Noise via Maximizing Re-labeling Accuracy","date":"2023-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaist-dmlab/Prune4Rel","path":"randaugment.py","file_url":"https://github.com/kaist-dmlab/Prune4Rel/blob/HEAD/randaugment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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 MaxH1996/FedXDS, and GitHub detected no licence in that repository when it was checked","code_sha256":"32cb3f5760fa593e","code_sha256_prefix":"32cb3f5760fa593e","mcp_get_code":{"code_sha256":"32cb3f5760fa593e"}},{"arxiv_id":"2309.04747","arxiv_id_is_arxiv":true,"paper":"/paper/when-to-learn-what-model-adaptive-data","title":"When to Learn What: Model-Adaptive Data Augmentation Curriculum","date":"2023-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JackHck/MADAug","path":"adaptive_augmentor.py","file_url":"https://github.com/JackHck/MADAug/blob/HEAD/adaptive_augmentor.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, JackHck/MADAug when it was checked","code_sha256":"de171eb052fc4c75","code_sha256_prefix":"de171eb052fc4c75","mcp_get_code":{"code_sha256":"de171eb052fc4c75"}},{"arxiv_id":"2307.11030","arxiv_id_is_arxiv":true,"paper":"/paper/cluster-aware-semi-supervised-learning","title":"Cluster-aware Semi-supervised Learning: Relational Knowledge Distillation Provably Learns Clustering","date":"2023-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dyjdongyijun/Semi_Supervised_Knowledge_Distillation","path":"dataset/randaugment.py","file_url":"https://github.com/dyjdongyijun/Semi_Supervised_Knowledge_Distillation/blob/HEAD/dataset/randaugment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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 MaxH1996/FedXDS, and GitHub detected no licence in that repository when it was checked","code_sha256":"32cb3f5760fa593e","code_sha256_prefix":"32cb3f5760fa593e","mcp_get_code":{"code_sha256":"32cb3f5760fa593e"}},{"arxiv_id":"2302.05499","arxiv_id_is_arxiv":true,"paper":"/paper/cuda-curriculum-of-data-augmentation-for-long","title":"CUDA: Curriculum of Data Augmentation for Long-Tailed Recognition","date":"2023-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sumyeongahn/cuda_ltr","path":"cifar/aug/cuda.py","file_url":"https://github.com/sumyeongahn/cuda_ltr/blob/HEAD/cifar/aug/cuda.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, sumyeongahn/cuda_ltr when it was checked","code_sha256":"d84dd48531aa301a","code_sha256_prefix":"d84dd48531aa301a","mcp_get_code":{"code_sha256":"d84dd48531aa301a"}},{"arxiv_id":"2210.09671","arxiv_id_is_arxiv":true,"paper":"/paper/not-all-poisons-are-created-equal-robust","title":"Not All Poisons are Created Equal: Robust Training against Data Poisoning","date":"2022-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuyang0901/effective-poison-identification","path":"dataset/randaugment.py","file_url":"https://github.com/yuyang0901/effective-poison-identification/blob/HEAD/dataset/randaugment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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 MaxH1996/FedXDS, and GitHub detected no licence in that repository when it was checked","code_sha256":"32cb3f5760fa593e","code_sha256_prefix":"32cb3f5760fa593e","mcp_get_code":{"code_sha256":"32cb3f5760fa593e"}},{"arxiv_id":"2208.11870","arxiv_id_is_arxiv":true,"paper":"/paper/fix-a-step-effective-semi-supervised-learning","title":"Fix-A-Step: Semi-supervised Learning from Uncurated Unlabeled Data","date":"2022-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tufts-ml/fix-a-step","path":"src_CIFAR10/randaugment.py","file_url":"https://github.com/tufts-ml/fix-a-step/blob/HEAD/src_CIFAR10/randaugment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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 MaxH1996/FedXDS, and GitHub detected no licence in that repository when it was checked","code_sha256":"32cb3f5760fa593e","code_sha256_prefix":"32cb3f5760fa593e","mcp_get_code":{"code_sha256":"32cb3f5760fa593e"}},{"arxiv_id":"2105.14148","arxiv_id_is_arxiv":true,"paper":"/paper/openmatch-open-set-consistency-regularization","title":"OpenMatch: Open-set Consistency Regularization for Semi-supervised Learning with Outliers","date":"2021-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VisionLearningGroup/OP_Match","path":"dataset/randaugment.py","file_url":"https://github.com/VisionLearningGroup/OP_Match/blob/HEAD/dataset/randaugment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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 MaxH1996/FedXDS, and GitHub detected no licence in that repository when it was checked","code_sha256":"32cb3f5760fa593e","code_sha256_prefix":"32cb3f5760fa593e","mcp_get_code":{"code_sha256":"32cb3f5760fa593e"}},{"arxiv_id":"2104.07713","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-learning-with-stronger-1","title":"Contrastive Learning with Stronger Augmentations","date":"2021-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maple-research-lab/CLSA","path":"data_processing/RandAugment.py","file_url":"https://github.com/maple-research-lab/CLSA/blob/HEAD/data_processing/RandAugment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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 MaxH1996/FedXDS, and GitHub detected no licence in that repository when it was checked","code_sha256":"32cb3f5760fa593e","code_sha256_prefix":"32cb3f5760fa593e","mcp_get_code":{"code_sha256":"32cb3f5760fa593e"}},{"arxiv_id":"2003.10580","arxiv_id_is_arxiv":true,"paper":"/paper/meta-pseudo-labels","title":"Meta Pseudo Labels","date":"2020-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ifsheldon/MPL_Lightning","path":"mpl_lightning/augmentation.py","file_url":"https://github.com/ifsheldon/MPL_Lightning/blob/HEAD/mpl_lightning/augmentation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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 MaxH1996/FedXDS, and GitHub detected no licence in that repository when it was checked","code_sha256":"32cb3f5760fa593e","code_sha256_prefix":"32cb3f5760fa593e","mcp_get_code":{"code_sha256":"32cb3f5760fa593e"}},{"arxiv_id":"2001.07685","arxiv_id_is_arxiv":true,"paper":"/paper/fixmatch-simplifying-semi-supervised-learning","title":"FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidence","date":"2020-01-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"S-HuaBomb/FixMatch-Paddle","path":"dataset/randaugment.py","file_url":"https://github.com/S-HuaBomb/FixMatch-Paddle/blob/HEAD/dataset/randaugment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from MaxH1996/FedXDS, and GitHub detected no licence in that repository when it was checked","code_sha256":"32cb3f5760fa593e","code_sha256_prefix":"32cb3f5760fa593e","mcp_get_code":{"code_sha256":"32cb3f5760fa593e"}},{"arxiv_id":"2001.07685","arxiv_id_is_arxiv":true,"paper":"/paper/fixmatch-simplifying-semi-supervised-learning","title":"FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidence","date":"2020-01-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kekmodel/FixMatch-pytorch","path":"dataset/randaugment.py","file_url":"https://github.com/kekmodel/FixMatch-pytorch/blob/HEAD/dataset/randaugment.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":"fbe48c6053d5de3b","code_sha256_prefix":"fbe48c6053d5de3b","mcp_get_code":{"code_sha256":"fbe48c6053d5de3b"}},{"arxiv_id":"1905.00397","arxiv_id_is_arxiv":true,"paper":"/paper/fast-autoaugment","title":"Fast AutoAugment","date":"2019-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tgilewicz/uniformaugment","path":"UniformAugment/augmentations.py","file_url":"https://github.com/tgilewicz/uniformaugment/blob/HEAD/UniformAugment/augmentations.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ccaa14b841bf44dc","code_sha256_prefix":"ccaa14b841bf44dc","mcp_get_code":{"code_sha256":"ccaa14b841bf44dc"}},{"arxiv_id":"aaai_29519","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_29519","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"wu-dd/DIRK","path":"augment/randaugment.py","file_url":"https://github.com/wu-dd/DIRK/blob/HEAD/augment/randaugment.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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 zhengzhang37/lecodu, and GitHub detected no licence in that repository when it was checked","code_sha256":"5e4ee5c45933ae09","code_sha256_prefix":"5e4ee5c45933ae09","mcp_get_code":{"code_sha256":"5e4ee5c45933ae09"}},{"arxiv_id":"aaai_29068","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_29068","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"NJUyued/SoC4SS-FGVC","path":"lib/datasets/augmentation/randaugment.py","file_url":"https://github.com/NJUyued/SoC4SS-FGVC/blob/HEAD/lib/datasets/augmentation/randaugment.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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 zhengzhang37/lecodu, and GitHub detected no licence in that repository when it was checked","code_sha256":"5e4ee5c45933ae09","code_sha256_prefix":"5e4ee5c45933ae09","mcp_get_code":{"code_sha256":"5e4ee5c45933ae09"}},{"arxiv_id":"aaai_28150","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28150","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"lhrrrrrr/DiDA","path":"transforms/RandAugment.py","file_url":"https://github.com/lhrrrrrr/DiDA/blob/HEAD/transforms/RandAugment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from MaxH1996/FedXDS, and GitHub detected no licence in that repository when it was checked","code_sha256":"32cb3f5760fa593e","code_sha256_prefix":"32cb3f5760fa593e","mcp_get_code":{"code_sha256":"32cb3f5760fa593e"}},{"arxiv_id":"aaai_28150","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28150","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"lhrrrrrr/DiDA","path":"utils/randaugment.py","file_url":"https://github.com/lhrrrrrr/DiDA/blob/HEAD/utils/randaugment.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from zhengzhang37/lecodu, and GitHub detected no licence in that repository when it was checked","code_sha256":"5e4ee5c45933ae09","code_sha256_prefix":"5e4ee5c45933ae09","mcp_get_code":{"code_sha256":"5e4ee5c45933ae09"}},{"arxiv_id":"Huang_Systematic_Comparison_of_Semi-supervised_and_Self-supervised_Learning_for_Medical_Image_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Huang_Systematic_Comparison_of_Semi-supervised_and_Self-supervised_Learning_for_Medical_Image_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"tufts-ml/SSL-vs-SSL-benchmark","path":"src/randaugment.py","file_url":"https://github.com/tufts-ml/SSL-vs-SSL-benchmark/blob/HEAD/src/randaugment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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 MaxH1996/FedXDS, and GitHub detected no licence in that repository when it was checked","code_sha256":"32cb3f5760fa593e","code_sha256_prefix":"32cb3f5760fa593e","mcp_get_code":{"code_sha256":"32cb3f5760fa593e"}},{"arxiv_id":"136970483","arxiv_id_is_arxiv":false,"paper":null,"title":"id 136970483 (not an arXiv id)","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"exped1230/S2-VER","path":"datasets/augmentation/randaugment.py","file_url":"https://github.com/exped1230/S2-VER/blob/HEAD/datasets/augmentation/randaugment.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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 zhengzhang37/lecodu, and GitHub detected no licence in that repository when it was checked","code_sha256":"5e4ee5c45933ae09","code_sha256_prefix":"5e4ee5c45933ae09","mcp_get_code":{"code_sha256":"5e4ee5c45933ae09"}}],"record_sha256":"e39c7bb909ff7cd7db8ba988fb15d01c92af26154adc06fdab352ff70eb69167","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}