{"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/solarize","entry":"solarize","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":15,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":6,"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":17,"n_samples_ran":16,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":10,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":19,"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":0,"ran_draft_wrong":9,"ran_fixture":1,"ran":6,"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":"2401.10474","arxiv_id_is_arxiv":true,"paper":"/paper/ldreg-local-dimensionality-regularized-self","title":"LDReg: Local Dimensionality Regularized Self-Supervised Learning","date":"2024-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JoJoNing25/DDAug","path":"losses/ntxent_lidaug.py","file_url":"https://github.com/JoJoNing25/DDAug/blob/HEAD/losses/ntxent_lidaug.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":"8000f04f9e183df4","code_sha256_prefix":"8000f04f9e183df4","mcp_get_code":{"code_sha256":"8000f04f9e183df4"}},{"arxiv_id":"2310.13807","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-learn-at-test-time","title":"Learning to (Learn at Test Time)","date":"2023-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"test-time-training/mttt","path":"pp/autoaugment.py","file_url":"https://github.com/test-time-training/mttt/blob/HEAD/pp/autoaugment.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":"2f023d4690a70195","code_sha256_prefix":"2f023d4690a70195","mcp_get_code":{"code_sha256":"2f023d4690a70195"}},{"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, kowshikthopalli/sista when it was checked","code_sha256":"7d16ac5dad904d6e","code_sha256_prefix":"7d16ac5dad904d6e","mcp_get_code":{"code_sha256":"7d16ac5dad904d6e"}},{"arxiv_id":"2110.09192","arxiv_id_is_arxiv":true,"paper":"/paper/learning-optimal-conformal-classifiers-1","title":"Learning Optimal Conformal Classifiers","date":"2021-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepmind/conformal_training","path":"auto_augment.py","file_url":"https://github.com/deepmind/conformal_training/blob/HEAD/auto_augment.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":"f483cc864d3d3300","code_sha256_prefix":"f483cc864d3d3300","mcp_get_code":{"code_sha256":"f483cc864d3d3300"}},{"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"62f59af34932ce5f","code_sha256_prefix":"62f59af34932ce5f","mcp_get_code":{"code_sha256":"62f59af34932ce5f"}},{"arxiv_id":"2106.13195","arxiv_id_is_arxiv":true,"paper":"/paper/fitvid-overfitting-in-pixel-level-video","title":"FitVid: Overfitting in Pixel-Level Video Prediction","date":"2021-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/fitvid","path":"randaug.py","file_url":"https://github.com/google-research/fitvid/blob/HEAD/randaug.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":"6a5f91515bf55921","code_sha256_prefix":"6a5f91515bf55921","mcp_get_code":{"code_sha256":"6a5f91515bf55921"}},{"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":"879172744bfa9ab1","code_sha256_prefix":"879172744bfa9ab1","mcp_get_code":{"code_sha256":"879172744bfa9ab1"}},{"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"58bdedec5152aaaa","code_sha256_prefix":"58bdedec5152aaaa","mcp_get_code":{"code_sha256":"58bdedec5152aaaa"}},{"arxiv_id":"2103.16201","arxiv_id_is_arxiv":true,"paper":"/paper/mt3-meta-test-time-training-for-self","title":"MT3: Meta Test-Time Training for Self-Supervised Test-Time Adaption","date":"2021-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlexanderBartler/MT3","path":"model/augementations/auto_augment.py","file_url":"https://github.com/AlexanderBartler/MT3/blob/HEAD/model/augementations/auto_augment.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":"e40dd3a18c0fb8bc","code_sha256_prefix":"e40dd3a18c0fb8bc","mcp_get_code":{"code_sha256":"e40dd3a18c0fb8bc"}},{"arxiv_id":"2006.16241","arxiv_id_is_arxiv":true,"paper":"/paper/the-many-faces-of-robustness-a-critical","title":"The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalization","date":"2020-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hendrycks/imagenet-r","path":"deepfashion_remix/augmix.py","file_url":"https://github.com/hendrycks/imagenet-r/blob/HEAD/deepfashion_remix/augmix.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ea3db097ab0c59d3","code_sha256_prefix":"ea3db097ab0c59d3","mcp_get_code":{"code_sha256":"ea3db097ab0c59d3"}},{"arxiv_id":"2006.14536","arxiv_id_is_arxiv":true,"paper":"/paper/smooth-adversarial-training","title":"Smooth Adversarial Training","date":"2020-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cihangxie/SmoothAdversarialTraining","path":"EfficientNet/autoaugment.py","file_url":"https://github.com/cihangxie/SmoothAdversarialTraining/blob/HEAD/EfficientNet/autoaugment.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":"2f023d4690a70195","code_sha256_prefix":"2f023d4690a70195","mcp_get_code":{"code_sha256":"2f023d4690a70195"}},{"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":"google-research/augmix","path":"augment_and_mix.py","file_url":"https://github.com/google-research/augmix/blob/HEAD/augment_and_mix.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"78f075a3d806fae7","code_sha256_prefix":"78f075a3d806fae7","mcp_get_code":{"code_sha256":"78f075a3d806fae7"}},{"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, ma7555/Augz when it was checked","code_sha256":"0112fdb1956a37d5","code_sha256_prefix":"0112fdb1956a37d5","mcp_get_code":{"code_sha256":"0112fdb1956a37d5"}},{"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":"Kaushal28/Bengali-AI","path":"src/dataset.py","file_url":"https://github.com/Kaushal28/Bengali-AI/blob/HEAD/src/dataset.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, Kaushal28/Bengali-AI when it was checked","code_sha256":"433a8a57c5669f13","code_sha256_prefix":"433a8a57c5669f13","mcp_get_code":{"code_sha256":"433a8a57c5669f13"}},{"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":"etetteh/sota-data-augmentation-and-optimizers","path":"augmentation/AugMix/AugMix.py","file_url":"https://github.com/etetteh/sota-data-augmentation-and-optimizers/blob/HEAD/augmentation/AugMix/AugMix.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"174b8d6cc1208268","code_sha256_prefix":"174b8d6cc1208268","mcp_get_code":{"code_sha256":"174b8d6cc1208268"}},{"arxiv_id":"1911.04252","arxiv_id_is_arxiv":true,"paper":"/paper/self-training-with-noisy-student-improves","title":"Self-training with Noisy Student improves ImageNet classification","date":"2019-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/noisystudent","path":"randaugment.py","file_url":"https://github.com/google-research/noisystudent/blob/HEAD/randaugment.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":"e40dd3a18c0fb8bc","code_sha256_prefix":"e40dd3a18c0fb8bc","mcp_get_code":{"code_sha256":"e40dd3a18c0fb8bc"}},{"arxiv_id":"1909.13719","arxiv_id_is_arxiv":true,"paper":"/paper/randaugment-practical-data-augmentation-with","title":"RandAugment: Practical automated data augmentation with a reduced search space","date":"2019-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nachiket273/pytorch_resnet_rs","path":"model/randaugment.py","file_url":"https://github.com/nachiket273/pytorch_resnet_rs/blob/HEAD/model/randaugment.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":"b8a2aca46dc33d3f","code_sha256_prefix":"b8a2aca46dc33d3f","mcp_get_code":{"code_sha256":"b8a2aca46dc33d3f"}},{"arxiv_id":"1909.13719","arxiv_id_is_arxiv":true,"paper":"/paper/randaugment-practical-data-augmentation-with","title":"RandAugment: Practical automated data augmentation with a reduced search space","date":"2019-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lyxxn0414/test-data-generation","path":"auto_augment.py","file_url":"https://github.com/lyxxn0414/test-data-generation/blob/HEAD/auto_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, lyxxn0414/test-data-generation when it was checked","code_sha256":"f5999a1ee8824e22","code_sha256_prefix":"f5999a1ee8824e22","mcp_get_code":{"code_sha256":"f5999a1ee8824e22"}},{"arxiv_id":"1904.07850","arxiv_id_is_arxiv":true,"paper":"/paper/objects-as-points","title":"Objects as Points","date":"2019-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuannianz/keras-CenterNet","path":"augmentor/color.py","file_url":"https://github.com/xuannianz/keras-CenterNet/blob/HEAD/augmentor/color.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":"8e2fdb3504fc1330","code_sha256_prefix":"8e2fdb3504fc1330","mcp_get_code":{"code_sha256":"8e2fdb3504fc1330"}}],"record_sha256":"ce4e433e447b7c182960c2694a3ec20bfa7662366ca8e46ee6973326f73ec540","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}