{"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/plasma-fractal","entry":"plasma_fractal","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":12,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"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":6,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":3,"n_places":13,"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":3,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":3},"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.16996","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-16996","title":"ActiveSAM: Image-Conditional Class Pruning for Fast and Accurate Open-Vocabulary Segmentation","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"VILA-Lab/ActiveSAM","path":"activesam/imagecorruptions/corruptions.py","file_url":"https://github.com/VILA-Lab/ActiveSAM/blob/HEAD/activesam/imagecorruptions/corruptions.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6428862c231256ee","code_sha256_prefix":"6428862c231256ee","mcp_get_code":{"code_sha256":"6428862c231256ee"}},{"arxiv_id":"2508.12082","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2508-12082","title":"Automated Model Evaluation for Object Detection via Prediction Consistency and Reliability","date":null,"month_inferred_from_arxiv_id":"2025-08","title_source":"syntology","repo":"YonseiML/autoeval-det","path":"imagenet_c/corruptions.py","file_url":"https://github.com/YonseiML/autoeval-det/blob/HEAD/imagenet_c/corruptions.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, YonseiML/autoeval-det when it was checked","code_sha256":"3fe212e00cbe6fb3","code_sha256_prefix":"3fe212e00cbe6fb3","mcp_get_code":{"code_sha256":"3fe212e00cbe6fb3"}},{"arxiv_id":"2507.20453","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.20453","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"ctamayor/NeurIPS-Robustness-ViT","path":"transforms.py","file_url":"https://github.com/ctamayor/NeurIPS-Robustness-ViT/blob/HEAD/transforms.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":"2bbe14179df1ff28","code_sha256_prefix":"2bbe14179df1ff28","mcp_get_code":{"code_sha256":"2bbe14179df1ff28"}},{"arxiv_id":"2211.15937","arxiv_id_is_arxiv":true,"paper":"/paper/robustness-disparities-in-face-detection","title":"Robustness Disparities in Face Detection","date":"2022-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dooleys/Robustness-Disparities-in-Commercial-Face-Detection","path":"code/imagenet_c_big/corruptions.py","file_url":"https://github.com/dooleys/Robustness-Disparities-in-Commercial-Face-Detection/blob/HEAD/code/imagenet_c_big/corruptions.py","status":"unverified","verification_level":0,"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":"3fe212e00cbe6fb3","code_sha256_prefix":"3fe212e00cbe6fb3","mcp_get_code":{"code_sha256":"3fe212e00cbe6fb3"}},{"arxiv_id":"2211.02578","arxiv_id_is_arxiv":true,"paper":"/paper/data-models-for-dataset-drift-controls-in","title":"Data Models for Dataset Drift Controls in Machine Learning With Optical Images","date":"2022-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aiaudit-org/raw2logit","path":"utils/hendrycks_robustness.py","file_url":"https://github.com/aiaudit-org/raw2logit/blob/HEAD/utils/hendrycks_robustness.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":"cb4092b5e3cb3af3","code_sha256_prefix":"cb4092b5e3cb3af3","mcp_get_code":{"code_sha256":"cb4092b5e3cb3af3"}},{"arxiv_id":"2207.13916","arxiv_id_is_arxiv":true,"paper":"/paper/a-novel-data-augmentation-technique-for-out","title":"A Novel Data Augmentation Technique for Out-of-Distribution Sample Detection using Compounded Corruptions","date":"2022-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cnc-ood/cnc_ood","path":"augmentations/corruptions.py","file_url":"https://github.com/cnc-ood/cnc_ood/blob/HEAD/augmentations/corruptions.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":"3f32f32f9972eaf6","code_sha256_prefix":"3f32f32f9972eaf6","mcp_get_code":{"code_sha256":"3f32f32f9972eaf6"}},{"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/corruptions_IN.py","file_url":"https://github.com/VITA-Group/AugMax/blob/HEAD/augmax_modules/corruptions_IN.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":"3fe212e00cbe6fb3","code_sha256_prefix":"3fe212e00cbe6fb3","mcp_get_code":{"code_sha256":"3fe212e00cbe6fb3"}},{"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/corruptions_cifar.py","file_url":"https://github.com/VITA-Group/AugMax/blob/HEAD/augmax_modules/corruptions_cifar.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":"cb4092b5e3cb3af3","code_sha256_prefix":"cb4092b5e3cb3af3","mcp_get_code":{"code_sha256":"cb4092b5e3cb3af3"}},{"arxiv_id":"2001.06057","arxiv_id_is_arxiv":true,"paper":"/paper/increasing-the-robustness-of-dnns-against","title":"A simple way to make neural networks robust against diverse image corruptions","date":"2020-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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":"3fe212e00cbe6fb3","code_sha256_prefix":"3fe212e00cbe6fb3","mcp_get_code":{"code_sha256":"3fe212e00cbe6fb3"}},{"arxiv_id":"1907.07484","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-robustness-in-object-detection","title":"Benchmarking Robustness in Object Detection: Autonomous Driving when Winter is Coming","date":"2019-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bethgelab/imagecorruptions","path":"imagecorruptions/corruptions.py","file_url":"https://github.com/bethgelab/imagecorruptions/blob/HEAD/imagecorruptions/corruptions.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":"33492980f6e79af5","code_sha256_prefix":"33492980f6e79af5","mcp_get_code":{"code_sha256":"33492980f6e79af5"}},{"arxiv_id":"1906.02337","arxiv_id_is_arxiv":true,"paper":"/paper/mnist-c-a-robustness-benchmark-for-computer","title":"MNIST-C: A Robustness Benchmark for Computer Vision","date":"2019-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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":"3fe212e00cbe6fb3","code_sha256_prefix":"3fe212e00cbe6fb3","mcp_get_code":{"code_sha256":"3fe212e00cbe6fb3"}},{"arxiv_id":"1903.12261","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-neural-network-robustness-to-2","title":"Benchmarking Neural Network Robustness to Common Corruptions and Perturbations","date":"2019-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hendrycks/robustness","path":"ImageNet-C/imagenet_c/imagenet_c/corruptions.py","file_url":"https://github.com/hendrycks/robustness/blob/HEAD/ImageNet-C/imagenet_c/imagenet_c/corruptions.py","status":"unverified","verification_level":0,"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":"3fe212e00cbe6fb3","code_sha256_prefix":"3fe212e00cbe6fb3","mcp_get_code":{"code_sha256":"3fe212e00cbe6fb3"}},{"arxiv_id":"1807.01697","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-neural-network-robustness-to","title":"Benchmarking Neural Network Robustness to Common Corruptions and Surface Variations","date":"2018-07-04","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":"33492980f6e79af5","code_sha256_prefix":"33492980f6e79af5","mcp_get_code":{"code_sha256":"33492980f6e79af5"}}],"record_sha256":"24e7caf4ad40f345a15072e7afb745a12736daf3369e89ef3304251b910310b0","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}