{"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/sheary","entry":"ShearY","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":14,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":13,"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":7,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":6,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":14,"n_places_pointer_only":6,"n_places_pointer_only_link_open":1,"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":1,"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":"2407.18365","arxiv_id_is_arxiv":true,"paper":"/paper/fadas-towards-federated-adaptive-asynchronous","title":"FADAS: Towards Federated Adaptive Asynchronous Optimization","date":"2024-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yujiaw98/FADAS","path":"models/randaug.py","file_url":"https://github.com/yujiaw98/FADAS/blob/HEAD/models/randaug.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, yujiaw98/FADAS when it was checked","code_sha256":"f5e3179cafd9393a","code_sha256_prefix":"f5e3179cafd9393a","mcp_get_code":{"code_sha256":"f5e3179cafd9393a"}},{"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/augmentations.py","file_url":"https://github.com/chenchenzong/dpc/blob/HEAD/AAAI2024_DPC_code/augmentations.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, chenchenzong/dpc when it was checked","code_sha256":"008c64b77c4ae4c9","code_sha256_prefix":"008c64b77c4ae4c9","mcp_get_code":{"code_sha256":"008c64b77c4ae4c9"}},{"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/augmentations.py","file_url":"https://github.com/kaist-dmlab/Prune4Rel/blob/HEAD/deepcore/datasets/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":"008c64b77c4ae4c9","code_sha256_prefix":"008c64b77c4ae4c9","mcp_get_code":{"code_sha256":"008c64b77c4ae4c9"}},{"arxiv_id":"2310.17622","arxiv_id_is_arxiv":true,"paper":"/paper/combating-representation-learning-disparity-1","title":"Combating Representation Learning Disparity with Geometric Harmonization","date":"2023-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MediaBrain-SJTU/Geometric-Harmonization","path":"BCL/randaug.py","file_url":"https://github.com/MediaBrain-SJTU/Geometric-Harmonization/blob/HEAD/BCL/randaug.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 sumyeongahn/cuda_ltr, and GitHub detected no licence in that repository when it was checked","code_sha256":"109155544d6d2c48","code_sha256_prefix":"109155544d6d2c48","mcp_get_code":{"code_sha256":"109155544d6d2c48"}},{"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":"b6880407116d0216","code_sha256_prefix":"b6880407116d0216","mcp_get_code":{"code_sha256":"b6880407116d0216"}},{"arxiv_id":"2308.04995","arxiv_id_is_arxiv":true,"paper":"/paper/idiff-face-synthetic-based-face-recognition","title":"IDiff-Face: Synthetic-based Face Recognition through Fizzy Identity-Conditioned Diffusion Models","date":"2023-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fdbtrs/IDiff-Face","path":"face_recognition_training/utils/FAA_policy.py","file_url":"https://github.com/fdbtrs/IDiff-Face/blob/HEAD/face_recognition_training/utils/FAA_policy.py","status":"ran","verification_level":1,"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, fdbtrs/IDiff-Face when it was checked","code_sha256":"37111f89a7fe93fa","code_sha256_prefix":"37111f89a7fe93fa","mcp_get_code":{"code_sha256":"37111f89a7fe93fa"}},{"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":"109155544d6d2c48","code_sha256_prefix":"109155544d6d2c48","mcp_get_code":{"code_sha256":"109155544d6d2c48"}},{"arxiv_id":"2207.08877","arxiv_id_is_arxiv":true,"paper":"/paper/prior-knowledge-guided-unsupervised-domain","title":"Prior Knowledge Guided Unsupervised Domain Adaptation","date":"2022-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsun/KUDA","path":"SHOT/augmentations.py","file_url":"https://github.com/tsun/KUDA/blob/HEAD/SHOT/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":"f5e3179cafd9393a","code_sha256_prefix":"f5e3179cafd9393a","mcp_get_code":{"code_sha256":"f5e3179cafd9393a"}},{"arxiv_id":"2005.04373","arxiv_id_is_arxiv":true,"paper":"/paper/autoclint-the-winning-method-in-autocv","title":"AutoCLINT: The Winning Method in AutoCV Challenge 2019","date":"2020-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kakaobrain/autoclint","path":"skeleton/data/augmentations.py","file_url":"https://github.com/kakaobrain/autoclint/blob/HEAD/skeleton/data/augmentations.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"508600c3fb3442f9","code_sha256_prefix":"508600c3fb3442f9","mcp_get_code":{"code_sha256":"508600c3fb3442f9"}},{"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":"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":"47ddf827c80f0e32","code_sha256_prefix":"47ddf827c80f0e32","mcp_get_code":{"code_sha256":"47ddf827c80f0e32"}},{"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/augmentations.py","file_url":"https://github.com/uvavision/Curriculum-Labeling/blob/HEAD/utils/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":"008c64b77c4ae4c9","code_sha256_prefix":"008c64b77c4ae4c9","mcp_get_code":{"code_sha256":"008c64b77c4ae4c9"}},{"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":"pwc-1/Paper-9","path":"3/AVA_cifar/src/RandAugment/augmentations.py","file_url":"https://github.com/pwc-1/Paper-9/blob/HEAD/3/AVA_cifar/src/RandAugment/augmentations.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f5e3179cafd9393a","code_sha256_prefix":"f5e3179cafd9393a","mcp_get_code":{"code_sha256":"f5e3179cafd9393a"}},{"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/autoclint","path":"skeleton/data/augmentations.py","file_url":"https://github.com/kakaobrain/autoclint/blob/HEAD/skeleton/data/augmentations.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"008c64b77c4ae4c9","code_sha256_prefix":"008c64b77c4ae4c9","mcp_get_code":{"code_sha256":"008c64b77c4ae4c9"}},{"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":"augmentations.py","file_url":"https://github.com/ildoonet/unsupervised-data-augmentation/blob/HEAD/augmentations.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"008c64b77c4ae4c9","code_sha256_prefix":"008c64b77c4ae4c9","mcp_get_code":{"code_sha256":"008c64b77c4ae4c9"}}],"record_sha256":"3a1b2be06771a812278464196aedefee356a7daba49ad16fae23b18f73f3a0ac","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}