{"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/averagemeter","entry":"AverageMeter","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":26,"n_papers_ran":26,"n_papers_ran_no_instrument_failure":26,"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":26,"n_samples_ran":26,"n_samples_constructed":22,"n_samples_ran_checked":26,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":26,"n_places_pointer_only":11,"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":0,"ran_fixture":0,"ran":26,"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":"2606.22627","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-22627","title":"Orthogonal Representation Editing: Decoupling Semantic Entanglement in Batch Knowledge Editing of LLMs","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"YVVH/ORE","path":"ORE/ORE_main.py","file_url":"https://github.com/YVVH/ORE/blob/HEAD/ORE/ORE_main.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"48891b8496966711","code_sha256_prefix":"48891b8496966711","mcp_get_code":{"code_sha256":"48891b8496966711"}},{"arxiv_id":"2606.19679","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-19679","title":"LOKI: Memory-Free Null-Space Constrained Lifelong Knowledge Editing","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"neu-spiral/LOKI","path":"easyeditor/models/loki/loki_main.py","file_url":"https://github.com/neu-spiral/LOKI/blob/HEAD/easyeditor/models/loki/loki_main.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":"8150829e9028d896","code_sha256_prefix":"8150829e9028d896","mcp_get_code":{"code_sha256":"8150829e9028d896"}},{"arxiv_id":"2602.03895","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-03895","title":"Benchmarking Bias Mitigation Toward Fairness Without Harm from Vision to LVLMs","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"osu-srml/NH-Fair","path":"src/release_benchmark/methods/vlm/clip_fairer.py","file_url":"https://github.com/osu-srml/NH-Fair/blob/HEAD/src/release_benchmark/methods/vlm/clip_fairer.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":"1894046f082c6404","code_sha256_prefix":"1894046f082c6404","mcp_get_code":{"code_sha256":"1894046f082c6404"}},{"arxiv_id":"2501.18277","arxiv_id_is_arxiv":true,"paper":"/paper/sebra-debiasing-through-self-guided-bias","title":"Sebra: Debiasing Through Self-Guided Bias Ranking","date":"2025-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kadarsh22/Sebra","path":"bar_trainers/sebra.py","file_url":"https://github.com/kadarsh22/Sebra/blob/HEAD/bar_trainers/sebra.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, kadarsh22/Sebra when it was checked","code_sha256":"3c1e74bdaf82c34d","code_sha256_prefix":"3c1e74bdaf82c34d","mcp_get_code":{"code_sha256":"3c1e74bdaf82c34d"}},{"arxiv_id":"2411.01981","arxiv_id_is_arxiv":true,"paper":"/paper/typicalness-aware-learning-for-failure","title":"Typicalness-Aware Learning for Failure Detection","date":"2024-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuyijungoon/tal","path":"trainer/train_TAL.py","file_url":"https://github.com/liuyijungoon/tal/blob/HEAD/trainer/train_TAL.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":"e2ff478922f1aa7e","code_sha256_prefix":"e2ff478922f1aa7e","mcp_get_code":{"code_sha256":"e2ff478922f1aa7e"}},{"arxiv_id":"2410.23996","arxiv_id_is_arxiv":true,"paper":"/paper/an-information-criterion-for-controlled","title":"An Information Criterion for Controlled Disentanglement of Multimodal Data","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uhlerlab/disentangledssl","path":"synthetic_task/algorithms.py","file_url":"https://github.com/uhlerlab/disentangledssl/blob/HEAD/synthetic_task/algorithms.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, uhlerlab/disentangledssl when it was checked","code_sha256":"2a32b32bce61522c","code_sha256_prefix":"2a32b32bce61522c","mcp_get_code":{"code_sha256":"2a32b32bce61522c"}},{"arxiv_id":"2402.15017","arxiv_id_is_arxiv":true,"paper":"/paper/towards-few-shot-adaptation-of-foundation","title":"Towards Few-Shot Adaptation of Foundation Models via Multitask Finetuning","date":"2024-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oliverxuzy/foudation-model_multitask","path":"finetune.py","file_url":"https://github.com/oliverxuzy/foudation-model_multitask/blob/HEAD/finetune.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, oliverxuzy/foudation-model_multitask when it was checked","code_sha256":"448391a260518c64","code_sha256_prefix":"448391a260518c64","mcp_get_code":{"code_sha256":"448391a260518c64"}},{"arxiv_id":"2309.03598","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-sample-utilization-through-sample","title":"Enhancing Sample Utilization through Sample Adaptive Augmentation in Semi-Supervised Learning","date":"2023-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GuanGui-nju/SAA","path":"models/fixmatch/dafree.py","file_url":"https://github.com/GuanGui-nju/SAA/blob/HEAD/models/fixmatch/dafree.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, GuanGui-nju/SAA when it was checked","code_sha256":"f9925fc7039869c6","code_sha256_prefix":"f9925fc7039869c6","mcp_get_code":{"code_sha256":"f9925fc7039869c6"}},{"arxiv_id":"2306.07483","arxiv_id_is_arxiv":true,"paper":"/paper/semi-supervised-learning-made-simple-with-1","title":"Semi-supervised learning made simple with self-supervised clustering","date":"2023-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pietroastolfi/suave-daino","path":"suave/main_suave.py","file_url":"https://github.com/pietroastolfi/suave-daino/blob/HEAD/suave/main_suave.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, pietroastolfi/suave-daino (NOASSERTION)","code_sha256":"3190fbd7139d6122","code_sha256_prefix":"3190fbd7139d6122","mcp_get_code":{"code_sha256":"3190fbd7139d6122"}},{"arxiv_id":"2305.08661","arxiv_id_is_arxiv":true,"paper":"/paper/global-and-local-mixture-consistency-1","title":"Global and Local Mixture Consistency Cumulative Learning for Long-tailed Visual Recognitions","date":"2023-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"val-iisc/saddle-longtail","path":"GLMC-2023/Trainer.py","file_url":"https://github.com/val-iisc/saddle-longtail/blob/HEAD/GLMC-2023/Trainer.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":"8c2fbaf0a3677a09","code_sha256_prefix":"8c2fbaf0a3677a09","mcp_get_code":{"code_sha256":"8c2fbaf0a3677a09"}},{"arxiv_id":"2304.04858","arxiv_id_is_arxiv":true,"paper":"/paper/simulated-annealing-in-early-layers-leads-to","title":"Simulated Annealing in Early Layers Leads to Better Generalization","date":"2023-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amiiir-sarfi/seal","path":"core.py","file_url":"https://github.com/amiiir-sarfi/seal/blob/HEAD/core.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, amiiir-sarfi/seal when it was checked","code_sha256":"402a4933d75f91b2","code_sha256_prefix":"402a4933d75f91b2","mcp_get_code":{"code_sha256":"402a4933d75f91b2"}},{"arxiv_id":"2208.05810","arxiv_id_is_arxiv":true,"paper":"/paper/towards-sequence-level-training-for-visual","title":"Towards Sequence-Level Training for Visual Tracking","date":"2022-08-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"byminji/SLTtrack","path":"ltr/trainers/slt_transt_trainer.py","file_url":"https://github.com/byminji/SLTtrack/blob/HEAD/ltr/trainers/slt_transt_trainer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, byminji/SLTtrack, is not in the permissive set Syntology serves inline","code_sha256":"06ad30a435b0a300","code_sha256_prefix":"06ad30a435b0a300","mcp_get_code":{"code_sha256":"06ad30a435b0a300"}},{"arxiv_id":"2207.12258","arxiv_id_is_arxiv":true,"paper":"/paper/equivariance-and-invariance-inductive-bias","title":"Equivariance and Invariance Inductive Bias for Learning from Insufficient Data","date":"2022-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Wangt-CN/EqInv","path":"vipriors_eqinv.py","file_url":"https://github.com/Wangt-CN/EqInv/blob/HEAD/vipriors_eqinv.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":"9090d08e263ab16d","code_sha256_prefix":"9090d08e263ab16d","mcp_get_code":{"code_sha256":"9090d08e263ab16d"}},{"arxiv_id":"2207.02269","arxiv_id_is_arxiv":true,"paper":"/paper/towards-realistic-semi-supervised-learning","title":"Towards Realistic Semi-Supervised Learning","date":"2022-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nayeemrizve/trssl","path":"utils/uncr_util.py","file_url":"https://github.com/nayeemrizve/trssl/blob/HEAD/utils/uncr_util.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":"676d63684139b1cb","code_sha256_prefix":"676d63684139b1cb","mcp_get_code":{"code_sha256":"676d63684139b1cb"}},{"arxiv_id":"2205.11819","arxiv_id_is_arxiv":true,"paper":"/paper/quarantine-sparsity-can-uncover-the-trojan","title":"Quarantine: Sparsity Can Uncover the Trojan Attack Trigger for Free","date":"2022-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/backdoor-lth","path":"utils_reverse_trigger.py","file_url":"https://github.com/vita-group/backdoor-lth/blob/HEAD/utils_reverse_trigger.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":"58a51ee2ea69c0e6","code_sha256_prefix":"58a51ee2ea69c0e6","mcp_get_code":{"code_sha256":"58a51ee2ea69c0e6"}},{"arxiv_id":"2204.10377","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-test-time-adaptation","title":"Contrastive Test-Time Adaptation","date":"2022-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DianCh/AdaContrast","path":"target.py","file_url":"https://github.com/DianCh/AdaContrast/blob/HEAD/target.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, DianCh/AdaContrast when it was checked","code_sha256":"52b386c85c15f1f1","code_sha256_prefix":"52b386c85c15f1f1","mcp_get_code":{"code_sha256":"52b386c85c15f1f1"}},{"arxiv_id":"2203.00357","arxiv_id_is_arxiv":true,"paper":"/paper/merit-meta-path-guided-contrastive-learning","title":"MERIt: Meta-Path Guided Contrastive Learning for Logical Reasoning","date":"2022-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sparkjiao/merit","path":"models/roberta_sent_att_sup.py","file_url":"https://github.com/sparkjiao/merit/blob/HEAD/models/roberta_sent_att_sup.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":"bae3f62db60db88a","code_sha256_prefix":"bae3f62db60db88a","mcp_get_code":{"code_sha256":"bae3f62db60db88a"}},{"arxiv_id":"2106.09701","arxiv_id_is_arxiv":true,"paper":"/paper/always-be-dreaming-a-new-approach-for-data","title":"Always Be Dreaming: A New Approach for Data-Free Class-Incremental Learning","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GT-RIPL/AlwaysBeDreaming-DFCIL","path":"learners/datafree.py","file_url":"https://github.com/GT-RIPL/AlwaysBeDreaming-DFCIL/blob/HEAD/learners/datafree.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":"fcca5441c56a56a7","code_sha256_prefix":"fcca5441c56a56a7","mcp_get_code":{"code_sha256":"fcca5441c56a56a7"}},{"arxiv_id":"2105.06152","arxiv_id_is_arxiv":true,"paper":"/paper/when-human-pose-estimation-meets-robustness","title":"When Human Pose Estimation Meets Robustness: Adversarial Algorithms and Benchmarks","date":"2021-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AIprogrammer/AdvMix","path":"lib/core/function.py","file_url":"https://github.com/AIprogrammer/AdvMix/blob/HEAD/lib/core/function.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":"a605a498a2198a9d","code_sha256_prefix":"a605a498a2198a9d","mcp_get_code":{"code_sha256":"a605a498a2198a9d"}},{"arxiv_id":"2105.04776","arxiv_id_is_arxiv":true,"paper":"/paper/graph-consistency-based-mean-teaching-for","title":"Graph Consistency Based Mean-Teaching for Unsupervised Domain Adaptive Person Re-Identification","date":"2021-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liu-xb/GCMT","path":"gcc/trainer_v2.py","file_url":"https://github.com/liu-xb/GCMT/blob/HEAD/gcc/trainer_v2.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, liu-xb/GCMT when it was checked","code_sha256":"ac660c609ee238a7","code_sha256_prefix":"ac660c609ee238a7","mcp_get_code":{"code_sha256":"ac660c609ee238a7"}},{"arxiv_id":"2003.01794","arxiv_id_is_arxiv":true,"paper":"/paper/good-subnetworks-provably-exist-pruning-via","title":"Good Subnetworks Provably Exist: Pruning via Greedy Forward Selection","date":"2020-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lushleaf/Network-Pruning-Greedy-Forward-Selection","path":"mobile2_prune.py","file_url":"https://github.com/lushleaf/Network-Pruning-Greedy-Forward-Selection/blob/HEAD/mobile2_prune.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, lushleaf/Network-Pruning-Greedy-Forward-Selection when it was checked","code_sha256":"9c594fdddb872b1e","code_sha256_prefix":"9c594fdddb872b1e","mcp_get_code":{"code_sha256":"9c594fdddb872b1e"}},{"arxiv_id":"2002.06774","arxiv_id_is_arxiv":true,"paper":"/paper/residual-continual-learning","title":"Residual Continual Learning","date":"2020-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"parvex/residual-continual-learning-benchmark","path":"agents/regularization.py","file_url":"https://github.com/parvex/residual-continual-learning-benchmark/blob/HEAD/agents/regularization.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":"b208280d7046fd72","code_sha256_prefix":"b208280d7046fd72","mcp_get_code":{"code_sha256":"b208280d7046fd72"}},{"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":"ptrckhmmr/learning-to-defer-with-limited-expert-predictions","path":"Semi-Supervised/Train_FixMatch.py","file_url":"https://github.com/ptrckhmmr/learning-to-defer-with-limited-expert-predictions/blob/HEAD/Semi-Supervised/Train_FixMatch.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, ptrckhmmr/learning-to-defer-with-limited-expert-predictions when it was checked","code_sha256":"2c90584bcf844d28","code_sha256_prefix":"2c90584bcf844d28","mcp_get_code":{"code_sha256":"2c90584bcf844d28"}},{"arxiv_id":"1912.01603","arxiv_id_is_arxiv":true,"paper":"/paper/dream-to-control-learning-behaviors-by-latent","title":"Dream to Control: Learning Behaviors by Latent Imagination","date":"2019-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhixuan-lin/dreamer-pytorch","path":"dreamer.py","file_url":"https://github.com/zhixuan-lin/dreamer-pytorch/blob/HEAD/dreamer.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":"06a7b70ff704fbf8","code_sha256_prefix":"06a7b70ff704fbf8","mcp_get_code":{"code_sha256":"06a7b70ff704fbf8"}},{"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":"lantgabor/Unsupervised-Data-Augmentation-PyTorch","path":"UDA.py","file_url":"https://github.com/lantgabor/Unsupervised-Data-Augmentation-PyTorch/blob/HEAD/UDA.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":"9355efdc819d943e","code_sha256_prefix":"9355efdc819d943e","mcp_get_code":{"code_sha256":"9355efdc819d943e"}},{"arxiv_id":"1901.08573","arxiv_id_is_arxiv":true,"paper":"/paper/theoretically-principled-trade-off-between","title":"Theoretically Principled Trade-off between Robustness and Accuracy","date":"2019-01-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arobey1/advbench","path":"advbench/algorithms.py","file_url":"https://github.com/arobey1/advbench/blob/HEAD/advbench/algorithms.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":"61308ee90996cb91","code_sha256_prefix":"61308ee90996cb91","mcp_get_code":{"code_sha256":"61308ee90996cb91"}}],"record_sha256":"f7f306f6fce8165f250f9ae85b4b977acf787b1bcdaf82d05223347be9c6a483","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}