{"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/int-parameter","entry":"int_parameter","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":35,"n_papers_ran":32,"n_papers_ran_no_instrument_failure":32,"n_papers_ran_instrument_only":0,"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":12,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":9,"n_places":37,"n_places_pointer_only":15,"n_places_pointer_only_link_open":7,"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":6,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"unverified":2},"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":"2607.14125","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-14125","title":"CARPRT: Class-Aware Zero-Shot Prompt Reweighting for Black-Box Vision-Language Models","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"tmlr-group/CARPRT","path":"datasets/augmix_ops.py","file_url":"https://github.com/tmlr-group/CARPRT/blob/HEAD/datasets/augmix_ops.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tmlr-group/CARPRT when it was checked","code_sha256":"beaa91443124b324","code_sha256_prefix":"beaa91443124b324","mcp_get_code":{"code_sha256":"beaa91443124b324"}},{"arxiv_id":"2409.06290","arxiv_id_is_arxiv":true,"paper":"/paper/entaugment-entropy-driven-adaptive-data","title":"EntAugment: Entropy-Driven Adaptive Data Augmentation Framework for Image Classification","date":"2024-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jackbrocp/entaugment","path":"augmentation/entaugment.py","file_url":"https://github.com/jackbrocp/entaugment/blob/HEAD/augmentation/entaugment.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, jackbrocp/entaugment when it was checked","code_sha256":"b3a390f777b2388c","code_sha256_prefix":"b3a390f777b2388c","mcp_get_code":{"code_sha256":"b3a390f777b2388c"}},{"arxiv_id":"2403.06741","arxiv_id_is_arxiv":true,"paper":"/paper/distribution-aware-data-expansion-with","title":"Distribution-Aware Data Expansion with Diffusion Models","date":"2024-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haoweiz23/distdiff","path":"augmentations/augmentations.py","file_url":"https://github.com/haoweiz23/distdiff/blob/HEAD/augmentations/augmentations.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, haoweiz23/distdiff when it was checked","code_sha256":"fa762f2f1e10f2e4","code_sha256_prefix":"fa762f2f1e10f2e4","mcp_get_code":{"code_sha256":"fa762f2f1e10f2e4"}},{"arxiv_id":"2401.07062","arxiv_id_is_arxiv":true,"paper":"/paper/dirichlet-based-prediction-calibration-for","title":"Dirichlet-Based Prediction Calibration for Learning with Noisy Labels","date":"2024-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenchenzong/dpc","path":"AAAI2024_DPC_code/augmentation_archive.py","file_url":"https://github.com/chenchenzong/dpc/blob/HEAD/AAAI2024_DPC_code/augmentation_archive.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, chenchenzong/dpc when it was checked","code_sha256":"7900a3a6deef908b","code_sha256_prefix":"7900a3a6deef908b","mcp_get_code":{"code_sha256":"7900a3a6deef908b"}},{"arxiv_id":"2311.14905","arxiv_id_is_arxiv":true,"paper":"/paper/class-gradient-projection-for-continual","title":"Class Gradient Projection For Continual Learning","date":"2023-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zackschen/CGP","path":"augmentations.py","file_url":"https://github.com/zackschen/CGP/blob/HEAD/augmentations.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zackschen/CGP when it was checked","code_sha256":"fa762f2f1e10f2e4","code_sha256_prefix":"fa762f2f1e10f2e4","mcp_get_code":{"code_sha256":"fa762f2f1e10f2e4"}},{"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":"deepcore/datasets/augmentation_archive.py","file_url":"https://github.com/kaist-dmlab/Prune4Rel/blob/HEAD/deepcore/datasets/augmentation_archive.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 chenchenzong/dpc, and GitHub detected no licence in that repository when it was checked","code_sha256":"7900a3a6deef908b","code_sha256_prefix":"7900a3a6deef908b","mcp_get_code":{"code_sha256":"7900a3a6deef908b"}},{"arxiv_id":"2307.09676","arxiv_id_is_arxiv":true,"paper":"/paper/domain-adaptation-for-enhanced-object","title":"Domain Adaptation based Object Detection for Autonomous Driving in Foggy and Rainy Weather","date":"2023-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jinlong17/da-detect","path":"efficientderain-master/augmentations.py","file_url":"https://github.com/jinlong17/da-detect/blob/HEAD/efficientderain-master/augmentations.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fa762f2f1e10f2e4","code_sha256_prefix":"fa762f2f1e10f2e4","mcp_get_code":{"code_sha256":"fa762f2f1e10f2e4"}},{"arxiv_id":"2305.02507","arxiv_id_is_arxiv":true,"paper":"/paper/stimulative-training-go-beyond-the","title":"Stimulative Training++: Go Beyond The Performance Limits of Residual Networks","date":"2023-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunshine-ye/nips22-st","path":"aug_lib.py","file_url":"https://github.com/sunshine-ye/nips22-st/blob/HEAD/aug_lib.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from jackbrocp/entaugment, and GitHub detected no licence in that repository when it was checked","code_sha256":"b3a390f777b2388c","code_sha256_prefix":"b3a390f777b2388c","mcp_get_code":{"code_sha256":"b3a390f777b2388c"}},{"arxiv_id":"2210.03501","arxiv_id_is_arxiv":true,"paper":"/paper/towards-multi-modal-sarcasm-detection-via","title":"Towards Multi-Modal Sarcasm Detection via Hierarchical Congruity Modeling with Knowledge Enhancement","date":"2022-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"less-and-less-bugs/hkemodel","path":"aug_lib.py","file_url":"https://github.com/less-and-less-bugs/hkemodel/blob/HEAD/aug_lib.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":"f0777303762c1ba8","code_sha256_prefix":"f0777303762c1ba8","mcp_get_code":{"code_sha256":"f0777303762c1ba8"}},{"arxiv_id":"2204.13091","arxiv_id_is_arxiv":true,"paper":"/paper/attention-consistency-on-visual-corruptions","title":"Attention Consistency on Visual Corruptions for Single-Source Domain Generalization","date":"2022-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"explainableml/acvc","path":"preprocessing/image/AugMixGenerator.py","file_url":"https://github.com/explainableml/acvc/blob/HEAD/preprocessing/image/AugMixGenerator.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fa762f2f1e10f2e4","code_sha256_prefix":"fa762f2f1e10f2e4","mcp_get_code":{"code_sha256":"fa762f2f1e10f2e4"}},{"arxiv_id":"2203.16481","arxiv_id_is_arxiv":true,"paper":"/paper/on-uncertainty-tempering-and-data","title":"On Uncertainty, Tempering, and Data Augmentation in Bayesian Classification","date":"2022-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"activatedgeek/bayesian-classification","path":"src/data_aug/augmentations.py","file_url":"https://github.com/activatedgeek/bayesian-classification/blob/HEAD/src/data_aug/augmentations.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"beaa91443124b324","code_sha256_prefix":"beaa91443124b324","mcp_get_code":{"code_sha256":"beaa91443124b324"}},{"arxiv_id":"2201.03545","arxiv_id_is_arxiv":true,"paper":"/paper/a-convnet-for-the-2020s","title":"A ConvNet for the 2020s","date":"2022-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"0jason000/convnext","path":"src/transforms.py","file_url":"https://github.com/0jason000/convnext/blob/HEAD/src/transforms.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e5a370ee6856bd8d","code_sha256_prefix":"e5a370ee6856bd8d","mcp_get_code":{"code_sha256":"e5a370ee6856bd8d"}},{"arxiv_id":"2112.13547","arxiv_id_is_arxiv":true,"paper":"/paper/prime-a-few-primitives-can-boost-robustness","title":"PRIME: A few primitives can boost robustness to common corruptions","date":"2021-12-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amodas/PRIME-augmentations","path":"utils/augmix.py","file_url":"https://github.com/amodas/PRIME-augmentations/blob/HEAD/utils/augmix.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8b20dcbdf9e59b56","code_sha256_prefix":"8b20dcbdf9e59b56","mcp_get_code":{"code_sha256":"8b20dcbdf9e59b56"}},{"arxiv_id":"2112.05135","arxiv_id_is_arxiv":true,"paper":"/paper/pixmix-dreamlike-pictures-comprehensively","title":"PixMix: Dreamlike Pictures Comprehensively Improve Safety Measures","date":"2021-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andyzoujm/pixmix","path":"pixmix_utils.py","file_url":"https://github.com/andyzoujm/pixmix/blob/HEAD/pixmix_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fa762f2f1e10f2e4","code_sha256_prefix":"fa762f2f1e10f2e4","mcp_get_code":{"code_sha256":"fa762f2f1e10f2e4"}},{"arxiv_id":"2112.00337","arxiv_id_is_arxiv":true,"paper":"/paper/a-unified-benchmark-for-the-unknown-detection","title":"A Unified Benchmark for the Unknown Detection Capability of Deep Neural Networks","date":"2021-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daintlab/unknown-detection-benchmarks","path":"methods/augmix/augmentations.py","file_url":"https://github.com/daintlab/unknown-detection-benchmarks/blob/HEAD/methods/augmix/augmentations.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"beaa91443124b324","code_sha256_prefix":"beaa91443124b324","mcp_get_code":{"code_sha256":"beaa91443124b324"}},{"arxiv_id":"2111.06377","arxiv_id_is_arxiv":true,"paper":"/paper/masked-autoencoders-are-scalable-vision","title":"Masked Autoencoders Are Scalable Vision Learners","date":"2021-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"0jason000/mae_vit","path":"src/transforms.py","file_url":"https://github.com/0jason000/mae_vit/blob/HEAD/src/transforms.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e5a370ee6856bd8d","code_sha256_prefix":"e5a370ee6856bd8d","mcp_get_code":{"code_sha256":"e5a370ee6856bd8d"}},{"arxiv_id":"2110.13771","arxiv_id_is_arxiv":true,"paper":"/paper/augmax-adversarial-composition-of-random","title":"AugMax: Adversarial Composition of Random Augmentations for Robust Training","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/AugMax","path":"augmax_modules/augmentations.py","file_url":"https://github.com/VITA-Group/AugMax/blob/HEAD/augmax_modules/augmentations.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fa762f2f1e10f2e4","code_sha256_prefix":"fa762f2f1e10f2e4","mcp_get_code":{"code_sha256":"fa762f2f1e10f2e4"}},{"arxiv_id":"2110.10232","arxiv_id_is_arxiv":true,"paper":"/paper/test-time-adaptation-through-perturbation","title":"Test time Adaptation through Perturbation Robustness","date":"2021-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prabhuteja12/pest","path":"dataset/augmix.py","file_url":"https://github.com/prabhuteja12/pest/blob/HEAD/dataset/augmix.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f0217da1d26e045b","code_sha256_prefix":"f0217da1d26e045b","mcp_get_code":{"code_sha256":"f0217da1d26e045b"}},{"arxiv_id":"2110.09506","arxiv_id_is_arxiv":true,"paper":"/paper/memo-test-time-robustness-via-adaptation-and","title":"MEMO: Test Time Robustness via Adaptation and Augmentation","date":"2021-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kowshikthopalli/sista","path":"SISTA_DA/image_target_memo.py","file_url":"https://github.com/kowshikthopalli/sista/blob/HEAD/SISTA_DA/image_target_memo.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kowshikthopalli/sista when it was checked","code_sha256":"cce32b359dda4b20","code_sha256_prefix":"cce32b359dda4b20","mcp_get_code":{"code_sha256":"cce32b359dda4b20"}},{"arxiv_id":"2108.08487","arxiv_id_is_arxiv":true,"paper":"/paper/amplitude-phase-recombination-rethinking","title":"Amplitude-Phase Recombination: Rethinking Robustness of Convolutional Neural Networks in Frequency Domain","date":"2021-08-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iCGY96/APR","path":"datasets/APR.py","file_url":"https://github.com/iCGY96/APR/blob/HEAD/datasets/APR.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"beaa91443124b324","code_sha256_prefix":"beaa91443124b324","mcp_get_code":{"code_sha256":"beaa91443124b324"}},{"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_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8b20dcbdf9e59b56","code_sha256_prefix":"8b20dcbdf9e59b56","mcp_get_code":{"code_sha256":"8b20dcbdf9e59b56"}},{"arxiv_id":"2009.09238","arxiv_id_is_arxiv":true,"paper":"/paper/efficientderain-learning-pixel-wise-dilation","title":"EfficientDeRain: Learning Pixel-wise Dilation Filtering for High-Efficiency Single-Image Deraining","date":"2020-09-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsingqguo/efficientderain","path":"augmentations.py","file_url":"https://github.com/tsingqguo/efficientderain/blob/HEAD/augmentations.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fa762f2f1e10f2e4","code_sha256_prefix":"fa762f2f1e10f2e4","mcp_get_code":{"code_sha256":"fa762f2f1e10f2e4"}},{"arxiv_id":"2007.09271","arxiv_id_is_arxiv":true,"paper":"/paper/onlineaugment-online-data-augmentation-with","title":"OnlineAugment: Online Data Augmentation with Less Domain Knowledge","date":"2020-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhiqiangdon/online-augment","path":"archive_policies.py","file_url":"https://github.com/zhiqiangdon/online-augment/blob/HEAD/archive_policies.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 chenchenzong/dpc, and GitHub detected no licence in that repository when it was checked","code_sha256":"7900a3a6deef908b","code_sha256_prefix":"7900a3a6deef908b","mcp_get_code":{"code_sha256":"7900a3a6deef908b"}},{"arxiv_id":"2003.03780","arxiv_id_is_arxiv":true,"paper":"/paper/dada-differentiable-automatic-data","title":"DADA: Differentiable Automatic Data Augmentation","date":"2020-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VDIGPKU/DADA","path":"fast-autoaugment/archive.py","file_url":"https://github.com/VDIGPKU/DADA/blob/HEAD/fast-autoaugment/archive.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 chenchenzong/dpc, and GitHub detected no licence in that repository when it was checked","code_sha256":"7900a3a6deef908b","code_sha256_prefix":"7900a3a6deef908b","mcp_get_code":{"code_sha256":"7900a3a6deef908b"}},{"arxiv_id":"2001.06001","arxiv_id_is_arxiv":true,"paper":"/paper/curriculum-labeling-self-paced-pseudo","title":"Curriculum Labeling: Revisiting Pseudo-Labeling for Semi-Supervised Learning","date":"2020-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uvavision/Curriculum-Labeling","path":"utils/archive.py","file_url":"https://github.com/uvavision/Curriculum-Labeling/blob/HEAD/utils/archive.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 chenchenzong/dpc, and GitHub detected no licence in that repository when it was checked","code_sha256":"7900a3a6deef908b","code_sha256_prefix":"7900a3a6deef908b","mcp_get_code":{"code_sha256":"7900a3a6deef908b"}},{"arxiv_id":"1912.02781","arxiv_id_is_arxiv":true,"paper":"/paper/augmix-a-simple-data-processing-method-to","title":"AugMix: A Simple Data Processing Method to Improve Robustness and Uncertainty","date":"2019-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"fa762f2f1e10f2e4","code_sha256_prefix":"fa762f2f1e10f2e4","mcp_get_code":{"code_sha256":"fa762f2f1e10f2e4"}},{"arxiv_id":"1912.02781","arxiv_id_is_arxiv":true,"paper":"/paper/augmix-a-simple-data-processing-method-to","title":"AugMix: A Simple Data Processing Method to Improve Robustness and Uncertainty","date":"2019-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ma7555/Augz","path":"augmix.py","file_url":"https://github.com/ma7555/Augz/blob/HEAD/augmix.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ma7555/Augz when it was checked","code_sha256":"4eb727da6e791a2f","code_sha256_prefix":"4eb727da6e791a2f","mcp_get_code":{"code_sha256":"4eb727da6e791a2f"}},{"arxiv_id":"1912.02781","arxiv_id_is_arxiv":true,"paper":"/paper/augmix-a-simple-data-processing-method-to","title":"AugMix: A Simple Data Processing Method to Improve Robustness and Uncertainty","date":"2019-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"szacho/augmix-tf","path":"augmix/helpers.py","file_url":"https://github.com/szacho/augmix-tf/blob/HEAD/augmix/helpers.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":"9fc8a5bff5d4d44e","code_sha256_prefix":"9fc8a5bff5d4d44e","mcp_get_code":{"code_sha256":"9fc8a5bff5d4d44e"}},{"arxiv_id":"1911.11907","arxiv_id_is_arxiv":true,"paper":"/paper/ghostnet-more-features-from-cheap-operations","title":"GhostNet: More Features from Cheap Operations","date":"2019-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"0jason000/S-GhostNet","path":"src/autoaug.py","file_url":"https://github.com/0jason000/S-GhostNet/blob/HEAD/src/autoaug.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e5a370ee6856bd8d","code_sha256_prefix":"e5a370ee6856bd8d","mcp_get_code":{"code_sha256":"e5a370ee6856bd8d"}},{"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":"kakaobrain/fast-autoaugment","path":"archive.py","file_url":"https://github.com/kakaobrain/fast-autoaugment/blob/HEAD/archive.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 chenchenzong/dpc, and GitHub detected no licence in that repository when it was checked","code_sha256":"7900a3a6deef908b","code_sha256_prefix":"7900a3a6deef908b","mcp_get_code":{"code_sha256":"7900a3a6deef908b"}},{"arxiv_id":"1904.12848","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-data-augmentation-1","title":"Unsupervised Data Augmentation for Consistency Training","date":"2019-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ildoonet/unsupervised-data-augmentation","path":"archive.py","file_url":"https://github.com/ildoonet/unsupervised-data-augmentation/blob/HEAD/archive.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 chenchenzong/dpc, and GitHub detected no licence in that repository when it was checked","code_sha256":"7900a3a6deef908b","code_sha256_prefix":"7900a3a6deef908b","mcp_get_code":{"code_sha256":"7900a3a6deef908b"}},{"arxiv_id":"1805.09501","arxiv_id_is_arxiv":true,"paper":"/paper/autoaugment-learning-augmentation-policies","title":"AutoAugment: Learning Augmentation Policies from Data","date":"2018-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TillBeemelmanns/auto-augment-tf2-operations","path":"tfops_aug/augmentation_operations.py","file_url":"https://github.com/TillBeemelmanns/auto-augment-tf2-operations/blob/HEAD/tfops_aug/augmentation_operations.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d9e70dca8d829825","code_sha256_prefix":"d9e70dca8d829825","mcp_get_code":{"code_sha256":"d9e70dca8d829825"}},{"arxiv_id":"1608.06993","arxiv_id_is_arxiv":true,"paper":"/paper/densely-connected-convolutional-networks","title":"Densely Connected Convolutional Networks","date":"2016-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"0jason000/DenseNet","path":"src/transforms.py","file_url":"https://github.com/0jason000/DenseNet/blob/HEAD/src/transforms.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e5a370ee6856bd8d","code_sha256_prefix":"e5a370ee6856bd8d","mcp_get_code":{"code_sha256":"e5a370ee6856bd8d"}},{"arxiv_id":"1512.00567","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-the-inception-architecture-for","title":"Rethinking the Inception Architecture for Computer Vision","date":"2015-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"0jason000/inception_v3","path":"src/transforms.py","file_url":"https://github.com/0jason000/inception_v3/blob/HEAD/src/transforms.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e5a370ee6856bd8d","code_sha256_prefix":"e5a370ee6856bd8d","mcp_get_code":{"code_sha256":"e5a370ee6856bd8d"}},{"arxiv_id":"1409.4842","arxiv_id_is_arxiv":true,"paper":"/paper/going-deeper-with-convolutions","title":"Going Deeper with Convolutions","date":"2014-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"0jason000/GoogleNet","path":"src/transforms.py","file_url":"https://github.com/0jason000/GoogleNet/blob/HEAD/src/transforms.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e5a370ee6856bd8d","code_sha256_prefix":"e5a370ee6856bd8d","mcp_get_code":{"code_sha256":"e5a370ee6856bd8d"}},{"arxiv_id":"aaai_25958","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25958","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"tsingqguo/bgmix","path":"augmentations.py","file_url":"https://github.com/tsingqguo/bgmix/blob/HEAD/augmentations.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fa762f2f1e10f2e4","code_sha256_prefix":"fa762f2f1e10f2e4","mcp_get_code":{"code_sha256":"fa762f2f1e10f2e4"}},{"arxiv_id":"Li_Learning_From_Noisy_Data_With_Robust_Representation_Learning_ICCV_2021_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Li_Learning_From_Noisy_Data_With_Robust_Representation_Learning_ICCV_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"salesforce/RRL","path":"augmentations.py","file_url":"https://github.com/salesforce/RRL/blob/HEAD/augmentations.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fa762f2f1e10f2e4","code_sha256_prefix":"fa762f2f1e10f2e4","mcp_get_code":{"code_sha256":"fa762f2f1e10f2e4"}}],"record_sha256":"10cadc94ce89a88a3234f2380986286f03625333125badb314a23bd08827b725","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}