{"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/sample-level","entry":"sample_level","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":16,"n_papers_ran":16,"n_papers_ran_no_instrument_failure":16,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":17,"n_places_pointer_only":4,"n_places_pointer_only_link_open":0,"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":1,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":0},"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_violates","verification_level":1,"contract_check":"VIOLATES","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":"5cc8d4764ac07a35","code_sha256_prefix":"5cc8d4764ac07a35","mcp_get_code":{"code_sha256":"5cc8d4764ac07a35"}},{"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_violates","verification_level":1,"contract_check":"VIOLATES","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":"5cc8d4764ac07a35","code_sha256_prefix":"5cc8d4764ac07a35","mcp_get_code":{"code_sha256":"5cc8d4764ac07a35"}},{"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_violates","verification_level":1,"contract_check":"VIOLATES","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":"5cc8d4764ac07a35","code_sha256_prefix":"5cc8d4764ac07a35","mcp_get_code":{"code_sha256":"5cc8d4764ac07a35"}},{"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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5cc8d4764ac07a35","code_sha256_prefix":"5cc8d4764ac07a35","mcp_get_code":{"code_sha256":"5cc8d4764ac07a35"}},{"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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5cc8d4764ac07a35","code_sha256_prefix":"5cc8d4764ac07a35","mcp_get_code":{"code_sha256":"5cc8d4764ac07a35"}},{"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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5cc8d4764ac07a35","code_sha256_prefix":"5cc8d4764ac07a35","mcp_get_code":{"code_sha256":"5cc8d4764ac07a35"}},{"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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5cc8d4764ac07a35","code_sha256_prefix":"5cc8d4764ac07a35","mcp_get_code":{"code_sha256":"5cc8d4764ac07a35"}},{"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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5cc8d4764ac07a35","code_sha256_prefix":"5cc8d4764ac07a35","mcp_get_code":{"code_sha256":"5cc8d4764ac07a35"}},{"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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5cc8d4764ac07a35","code_sha256_prefix":"5cc8d4764ac07a35","mcp_get_code":{"code_sha256":"5cc8d4764ac07a35"}},{"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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5cc8d4764ac07a35","code_sha256_prefix":"5cc8d4764ac07a35","mcp_get_code":{"code_sha256":"5cc8d4764ac07a35"}},{"arxiv_id":"2104.13963","arxiv_id_is_arxiv":true,"paper":"/paper/semi-supervised-learning-of-visual-features","title":"Semi-Supervised Learning of Visual Features by Non-Parametrically Predicting View Assignments with Support Samples","date":"2021-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sayakpaul/PAWS-TF","path":"utils/multicrop_loader.py","file_url":"https://github.com/sayakpaul/PAWS-TF/blob/HEAD/utils/multicrop_loader.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":"08ad311e00fe4f97","code_sha256_prefix":"08ad311e00fe4f97","mcp_get_code":{"code_sha256":"08ad311e00fe4f97"}},{"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":"augmentations.py","file_url":"https://github.com/TheoT1/DiGN/blob/HEAD/augmentations.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5cc8d4764ac07a35","code_sha256_prefix":"5cc8d4764ac07a35","mcp_get_code":{"code_sha256":"5cc8d4764ac07a35"}},{"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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5cc8d4764ac07a35","code_sha256_prefix":"5cc8d4764ac07a35","mcp_get_code":{"code_sha256":"5cc8d4764ac07a35"}},{"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_violates","verification_level":1,"contract_check":"VIOLATES","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":"5cc8d4764ac07a35","code_sha256_prefix":"5cc8d4764ac07a35","mcp_get_code":{"code_sha256":"5cc8d4764ac07a35"}},{"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":"1fc8b53e59650424","code_sha256_prefix":"1fc8b53e59650424","mcp_get_code":{"code_sha256":"1fc8b53e59650424"}},{"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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5cc8d4764ac07a35","code_sha256_prefix":"5cc8d4764ac07a35","mcp_get_code":{"code_sha256":"5cc8d4764ac07a35"}},{"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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5cc8d4764ac07a35","code_sha256_prefix":"5cc8d4764ac07a35","mcp_get_code":{"code_sha256":"5cc8d4764ac07a35"}}],"record_sha256":"5d40c5c5ab1d9362fbfd68b5a63b5c43e3ce0bed2533d2f04e7bc53c77d7ffad","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}