{"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/ce-loss","entry":"ce_loss","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":34,"n_papers_ran":30,"n_papers_ran_no_instrument_failure":14,"n_papers_ran_instrument_only":16,"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":33,"n_samples_ran":27,"n_samples_constructed":0,"n_samples_ran_checked":13,"n_samples_instrument":14,"n_samples_unverified":6,"n_samples_fingerprinted":8,"n_places":36,"n_places_pointer_only":10,"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":2,"ran_violates":0,"ran_draft_wrong":5,"ran_fixture":9,"ran":11,"unverified":6},"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_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":"14374bd37af63bc3","code_sha256_prefix":"14374bd37af63bc3","mcp_get_code":{"code_sha256":"14374bd37af63bc3"}},{"arxiv_id":"2510.03993","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-03993","title":"Keep It on a Leash: Controllable Pseudo-label Generation Towards Realistic Long-Tailed Semi-Supervised Learning","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"yaxinhou/CPG","path":"semilearn/core/criterions/cross_entropy.py","file_url":"https://github.com/yaxinhou/CPG/blob/HEAD/semilearn/core/criterions/cross_entropy.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yaxinhou/CPG when it was checked","code_sha256":"6554d2f5118ba705","code_sha256_prefix":"6554d2f5118ba705","mcp_get_code":{"code_sha256":"6554d2f5118ba705"}},{"arxiv_id":"2506.20990","arxiv_id_is_arxiv":true,"paper":"/paper/sharpzo-hybrid-sharpness-aware-vision","title":"SharpZO: Hybrid Sharpness-Aware Vision Language Model Prompt Tuning via Forward-Only Passes","date":"2025-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yifanycc/sharpzo","path":"clip/bb_clip_model.py","file_url":"https://github.com/yifanycc/sharpzo/blob/HEAD/clip/bb_clip_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"199d6f35dcbfe379","code_sha256_prefix":"199d6f35dcbfe379","mcp_get_code":{"code_sha256":"199d6f35dcbfe379"}},{"arxiv_id":"2506.20990","arxiv_id_is_arxiv":true,"paper":"/paper/sharpzo-hybrid-sharpness-aware-vision","title":"SharpZO: Hybrid Sharpness-Aware Vision Language Model Prompt Tuning via Forward-Only Passes","date":"2025-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yifanycc/sharpzo","path":"main_sharpzo.py","file_url":"https://github.com/yifanycc/sharpzo/blob/HEAD/main_sharpzo.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":"3d3bb1e71ff2f61e","code_sha256_prefix":"3d3bb1e71ff2f61e","mcp_get_code":{"code_sha256":"3d3bb1e71ff2f61e"}},{"arxiv_id":"2503.02231","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2503.02231","date":null,"month_inferred_from_arxiv_id":"2025-03","title_source":null,"repo":"BoCheng-96/CGMatch","path":"semilearn/core/criterions/cross_entropy.py","file_url":"https://github.com/BoCheng-96/CGMatch/blob/HEAD/semilearn/core/criterions/cross_entropy.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"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 yaxinhou/CPG, and GitHub detected no licence in that repository when it was checked","code_sha256":"6554d2f5118ba705","code_sha256_prefix":"6554d2f5118ba705","mcp_get_code":{"code_sha256":"6554d2f5118ba705"}},{"arxiv_id":"2502.10233","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-solve-the-min-max-mixed-shelves","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","date":"2025-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ltluttmann/marl4msprp","path":"marlprp/algorithms/losses.py","file_url":"https://github.com/ltluttmann/marl4msprp/blob/HEAD/marlprp/algorithms/losses.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":"2e769f511bdda9c4","code_sha256_prefix":"2e769f511bdda9c4","mcp_get_code":{"code_sha256":"2e769f511bdda9c4"}},{"arxiv_id":"2410.23227","arxiv_id_is_arxiv":true,"paper":"/paper/fl-2-overcoming-few-labels-in-federated-semi","title":"(FL)$^2$: Overcoming Few Labels in Federated Semi-Supervised Learning","date":"2024-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seungjoo-ai/FLFL-NeurIPS24","path":"src/algorithm/flfl.py","file_url":"https://github.com/seungjoo-ai/FLFL-NeurIPS24/blob/HEAD/src/algorithm/flfl.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ac50b71552df6ea1","code_sha256_prefix":"ac50b71552df6ea1","mcp_get_code":{"code_sha256":"ac50b71552df6ea1"}},{"arxiv_id":"2410.09890","arxiv_id_is_arxiv":true,"paper":"/paper/large-scale-3d-medical-image-pre-training","title":"Large-Scale 3D Medical Image Pre-training with Geometric Context Priors","date":"2024-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luffy03/large-scale-medical","path":"Omni-supervised/models/voco_head.py","file_url":"https://github.com/luffy03/large-scale-medical/blob/HEAD/Omni-supervised/models/voco_head.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eb30e78d89562dd2","code_sha256_prefix":"eb30e78d89562dd2","mcp_get_code":{"code_sha256":"eb30e78d89562dd2"}},{"arxiv_id":"2407.15362","arxiv_id_is_arxiv":true,"paper":"/paper/a-multimodal-knowledge-enhanced-whole-slide","title":"A Multimodal Knowledge-enhanced Whole-slide Pathology Foundation Model","date":"2024-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cassie07/pathomics","path":"PathOmics/model_and_training_utils/Customized_Loss.py","file_url":"https://github.com/cassie07/pathomics/blob/HEAD/PathOmics/model_and_training_utils/Customized_Loss.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, cassie07/pathomics when it was checked","code_sha256":"e733788b8a808833","code_sha256_prefix":"e733788b8a808833","mcp_get_code":{"code_sha256":"e733788b8a808833"}},{"arxiv_id":"2402.17300","arxiv_id_is_arxiv":true,"paper":"/paper/voco-a-simple-yet-effective-volume","title":"VoCo: A Simple-yet-Effective Volume Contrastive Learning Framework for 3D Medical Image Analysis","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Luffy03/VoCo","path":"models/voco_head.py","file_url":"https://github.com/Luffy03/VoCo/blob/HEAD/models/voco_head.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a99b36c20266880b","code_sha256_prefix":"a99b36c20266880b","mcp_get_code":{"code_sha256":"a99b36c20266880b"}},{"arxiv_id":"2402.14430","arxiv_id_is_arxiv":true,"paper":"/paper/robust-training-of-federated-models-with","title":"Robust Training of Federated Models with Extremely Label Deficiency","date":"2024-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"visitworld123/Twin-sight","path":"trainers/normal_trainer.py","file_url":"https://github.com/visitworld123/Twin-sight/blob/HEAD/trainers/normal_trainer.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":"5623e1ae3f61cea9","code_sha256_prefix":"5623e1ae3f61cea9","mcp_get_code":{"code_sha256":"5623e1ae3f61cea9"}},{"arxiv_id":"2402.04050","arxiv_id_is_arxiv":true,"paper":"/paper/connecting-the-dots-collaborative-fine-tuning","title":"Connecting the Dots: Collaborative Fine-tuning for Black-Box Vision-Language Models","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mrflogs/craft","path":"main_craft.py","file_url":"https://github.com/mrflogs/craft/blob/HEAD/main_craft.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"199d6f35dcbfe379","code_sha256_prefix":"199d6f35dcbfe379","mcp_get_code":{"code_sha256":"199d6f35dcbfe379"}},{"arxiv_id":"2402.01032","arxiv_id_is_arxiv":true,"paper":"/paper/repeat-after-me-transformers-are-better-than","title":"Repeat After Me: Transformers are Better than State Space Models at Copying","date":"2024-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sjelassi/transformers_ssm_copy","path":"synthetic_exps/train_utils.py","file_url":"https://github.com/sjelassi/transformers_ssm_copy/blob/HEAD/synthetic_exps/train_utils.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":"b9b929da44e45018","code_sha256_prefix":"b9b929da44e45018","mcp_get_code":{"code_sha256":"b9b929da44e45018"}},{"arxiv_id":"2310.12982","arxiv_id_is_arxiv":true,"paper":"/paper/putting-the-object-back-into-video-object","title":"Putting the Object Back into Video Object Segmentation","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkchengrex/Cutie","path":"cutie/model/losses.py","file_url":"https://github.com/hkchengrex/Cutie/blob/HEAD/cutie/model/losses.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":"066adf2df6def74d","code_sha256_prefix":"066adf2df6def74d","mcp_get_code":{"code_sha256":"066adf2df6def74d"}},{"arxiv_id":"2309.08825","arxiv_id_is_arxiv":true,"paper":"/paper/distributionally-robust-post-hoc-classifiers","title":"Distributionally Robust Post-hoc Classifiers under Prior Shifts","date":"2023-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weijiaheng/drops","path":"drops_test_time.py","file_url":"https://github.com/weijiaheng/drops/blob/HEAD/drops_test_time.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, weijiaheng/drops when it was checked","code_sha256":"a85f3df5207d6bdf","code_sha256_prefix":"a85f3df5207d6bdf","mcp_get_code":{"code_sha256":"a85f3df5207d6bdf"}},{"arxiv_id":"2309.06979","arxiv_id_is_arxiv":true,"paper":"/paper/auto-regressive-next-token-predictors-are","title":"Auto-Regressive Next-Token Predictors are Universal Learners","date":"2023-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"emalach/linearlm","path":"training/linear_decoder.py","file_url":"https://github.com/emalach/linearlm/blob/HEAD/training/linear_decoder.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, emalach/linearlm when it was checked","code_sha256":"1cd9d3020ea9cf57","code_sha256_prefix":"1cd9d3020ea9cf57","mcp_get_code":{"code_sha256":"1cd9d3020ea9cf57"}},{"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","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":"f31099eaf0227660","code_sha256_prefix":"f31099eaf0227660","mcp_get_code":{"code_sha256":"f31099eaf0227660"}},{"arxiv_id":"2308.13168","arxiv_id_is_arxiv":true,"paper":"/paper/iomatch-simplifying-open-set-semi-supervised","title":"IOMatch: Simplifying Open-Set Semi-Supervised Learning with Joint Inliers and Outliers Utilization","date":"2023-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nukezil/IOMatch","path":"semilearn/algorithms/utils/loss.py","file_url":"https://github.com/nukezil/IOMatch/blob/HEAD/semilearn/algorithms/utils/loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c2e202cd61888d8e","code_sha256_prefix":"c2e202cd61888d8e","mcp_get_code":{"code_sha256":"c2e202cd61888d8e"}},{"arxiv_id":"2301.12798","arxiv_id_is_arxiv":true,"paper":"/paper/trfeddis-trusted-federated-disentangling","title":"Reliable Federated Disentangling Network for Non-IID Domain Feature","date":"2023-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"looking9218/rfeddis","path":"federated/RFedDis_Domainnet.py","file_url":"https://github.com/looking9218/rfeddis/blob/HEAD/federated/RFedDis_Domainnet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, looking9218/rfeddis when it was checked","code_sha256":"c6bf27cd6b8c13be","code_sha256_prefix":"c6bf27cd6b8c13be","mcp_get_code":{"code_sha256":"c6bf27cd6b8c13be"}},{"arxiv_id":"2301.10921","arxiv_id_is_arxiv":true,"paper":"/paper/softmatch-addressing-the-quantity-quality","title":"SoftMatch: Addressing the Quantity-Quality Trade-off in Semi-supervised Learning","date":"2023-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"torchssl/torchssl","path":"models/softmatch/softmatch.py","file_url":"https://github.com/torchssl/torchssl/blob/HEAD/models/softmatch/softmatch.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ceaa5f15ab49feba","code_sha256_prefix":"ceaa5f15ab49feba","mcp_get_code":{"code_sha256":"ceaa5f15ab49feba"}},{"arxiv_id":"2211.11953","arxiv_id_is_arxiv":true,"paper":"/paper/teach-detr-better-training-detr-with-teachers","title":"Teach-DETR: Better Training DETR with Teachers","date":"2022-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leonhlj/teach-detr","path":"H-Deformable-DETR/models/deformable_detr.py","file_url":"https://github.com/leonhlj/teach-detr/blob/HEAD/H-Deformable-DETR/models/deformable_detr.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":"ddb9b0f4a2035653","code_sha256_prefix":"ddb9b0f4a2035653","mcp_get_code":{"code_sha256":"ddb9b0f4a2035653"}},{"arxiv_id":"2208.04619","arxiv_id_is_arxiv":true,"paper":"/paper/rda-reciprocal-distribution-alignment-for","title":"RDA: Reciprocal Distribution Alignment for Robust Semi-supervised Learning","date":"2022-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NJUyued/RDA4RobustSSL","path":"models/rda/rda.py","file_url":"https://github.com/NJUyued/RDA4RobustSSL/blob/HEAD/models/rda/rda.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0c1d927c0e848f5c","code_sha256_prefix":"0c1d927c0e848f5c","mcp_get_code":{"code_sha256":"0c1d927c0e848f5c"}},{"arxiv_id":"2204.07596","arxiv_id_is_arxiv":true,"paper":"/paper/perfectly-balanced-improving-transfer-and","title":"Perfectly Balanced: Improving Transfer and Robustness of Supervised Contrastive Learning","date":"2022-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HazyResearch/thanos-code","path":"unagi/tasks/loss_modules.py","file_url":"https://github.com/HazyResearch/thanos-code/blob/HEAD/unagi/tasks/loss_modules.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":"4251f968142da139","code_sha256_prefix":"4251f968142da139","mcp_get_code":{"code_sha256":"4251f968142da139"}},{"arxiv_id":"2203.02485","arxiv_id_is_arxiv":true,"paper":"/paper/better-supervisory-signals-by-observing-1","title":"Better Supervisory Signals by Observing Learning Paths","date":"2022-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joshua-ren/better_supervisory_signal","path":"utils.py","file_url":"https://github.com/joshua-ren/better_supervisory_signal/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"21fe6fa61f6e0652","code_sha256_prefix":"21fe6fa61f6e0652","mcp_get_code":{"code_sha256":"21fe6fa61f6e0652"}},{"arxiv_id":"2202.10553","arxiv_id_is_arxiv":true,"paper":"/paper/guidelines-and-evaluation-for-clinical","title":"Guidelines and Evaluation of Clinical Explainable AI in Medical Image Analysis","date":"2022-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weinajin/multimodal_explanation","path":"code/model/loss.py","file_url":"https://github.com/weinajin/multimodal_explanation/blob/HEAD/code/model/loss.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":"bda86860758146a3","code_sha256_prefix":"bda86860758146a3","mcp_get_code":{"code_sha256":"bda86860758146a3"}},{"arxiv_id":"2110.08263","arxiv_id_is_arxiv":true,"paper":"/paper/flexmatch-boosting-semi-supervised-learning","title":"FlexMatch: Boosting Semi-Supervised Learning with Curriculum Pseudo Labeling","date":"2021-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"beandkay/sequencematch","path":"models/flexmatch/flexmatch.py","file_url":"https://github.com/beandkay/sequencematch/blob/HEAD/models/flexmatch/flexmatch.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1b2ef05b7424074f","code_sha256_prefix":"1b2ef05b7424074f","mcp_get_code":{"code_sha256":"1b2ef05b7424074f"}},{"arxiv_id":"2107.04795","arxiv_id_is_arxiv":true,"paper":"/paper/semi-supervised-learning-with-multi-head-co","title":"Semi-Supervised Learning with Multi-Head Co-Training","date":"2021-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenmc1996/Multi-Head-Co-Training","path":"multi_head.py","file_url":"https://github.com/chenmc1996/Multi-Head-Co-Training/blob/HEAD/multi_head.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, chenmc1996/Multi-Head-Co-Training when it was checked","code_sha256":"89e54e0adff22983","code_sha256_prefix":"89e54e0adff22983","mcp_get_code":{"code_sha256":"89e54e0adff22983"}},{"arxiv_id":"2102.02051","arxiv_id_is_arxiv":true,"paper":"/paper/trusted-multi-view-classification-1","title":"Trusted Multi-View Classification","date":"2021-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hanmenghan/TMC","path":"TMC ICLR/model.py","file_url":"https://github.com/hanmenghan/TMC/blob/HEAD/TMC%20ICLR/model.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, hanmenghan/TMC when it was checked","code_sha256":"0457de81106bb225","code_sha256_prefix":"0457de81106bb225","mcp_get_code":{"code_sha256":"0457de81106bb225"}},{"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":"gomezzz/MSMatch","path":"models/fixmatch/fixmatch.py","file_url":"https://github.com/gomezzz/MSMatch/blob/HEAD/models/fixmatch/fixmatch.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":"9723f46ec1689a37","code_sha256_prefix":"9723f46ec1689a37","mcp_get_code":{"code_sha256":"9723f46ec1689a37"}},{"arxiv_id":"1903.08094","arxiv_id_is_arxiv":true,"paper":"/paper/corners-for-layout-end-to-end-layout-recovery","title":"Corners for Layout: End-to-End Layout Recovery from 360 Images","date":"2019-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"palver7/CFLPytorch","path":"train_CFL.py","file_url":"https://github.com/palver7/CFLPytorch/blob/HEAD/train_CFL.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, palver7/CFLPytorch when it was checked","code_sha256":"64b75e2a61be6d29","code_sha256_prefix":"64b75e2a61be6d29","mcp_get_code":{"code_sha256":"64b75e2a61be6d29"}},{"arxiv_id":"1806.05034","arxiv_id_is_arxiv":true,"paper":"/paper/a-probabilistic-u-net-for-segmentation-of","title":"A Probabilistic U-Net for Segmentation of Ambiguous Images","date":"2018-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MIC-DKFZ/probabilistic_unet","path":"utils/training_utils.py","file_url":"https://github.com/MIC-DKFZ/probabilistic_unet/blob/HEAD/utils/training_utils.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":"1154f612e91c9287","code_sha256_prefix":"1154f612e91c9287","mcp_get_code":{"code_sha256":"1154f612e91c9287"}},{"arxiv_id":"1711.05225","arxiv_id_is_arxiv":true,"paper":"/paper/chexnet-radiologist-level-pneumonia-detection","title":"CheXNet: Radiologist-Level Pneumonia Detection on Chest X-Rays with Deep Learning","date":"2017-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SenWu/emmental-tutorials","path":"chexnet/task.py","file_url":"https://github.com/SenWu/emmental-tutorials/blob/HEAD/chexnet/task.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":"463d3f2f4d6be38d","code_sha256_prefix":"463d3f2f4d6be38d","mcp_get_code":{"code_sha256":"463d3f2f4d6be38d"}},{"arxiv_id":"1711.05225","arxiv_id_is_arxiv":true,"paper":"/paper/chexnet-radiologist-level-pneumonia-detection","title":"CheXNet: Radiologist-Level Pneumonia Detection on Chest X-Rays with Deep Learning","date":"2017-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SenWu/emmental-tutorials","path":"glue/glue_tasks.py","file_url":"https://github.com/SenWu/emmental-tutorials/blob/HEAD/glue/glue_tasks.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":"188aff3170045ab9","code_sha256_prefix":"188aff3170045ab9","mcp_get_code":{"code_sha256":"188aff3170045ab9"}},{"arxiv_id":"ijcai2024_0712","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2024_0712","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"nyh-a/CoSTC","path":"model/loss.py","file_url":"https://github.com/nyh-a/CoSTC/blob/HEAD/model/loss.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":"bda86860758146a3","code_sha256_prefix":"bda86860758146a3","mcp_get_code":{"code_sha256":"bda86860758146a3"}},{"arxiv_id":"aaai_25883","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25883","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"alcorreia/cm-tpm","path":"utils/losses.py","file_url":"https://github.com/alcorreia/cm-tpm/blob/HEAD/utils/losses.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":"fbb033fb1cd79f44","code_sha256_prefix":"fbb033fb1cd79f44","mcp_get_code":{"code_sha256":"fbb033fb1cd79f44"}},{"arxiv_id":"136810034","arxiv_id_is_arxiv":false,"paper":null,"title":"id 136810034 (not an arXiv id)","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Sense-X/UniNet","path":"losses.py","file_url":"https://github.com/Sense-X/UniNet/blob/HEAD/losses.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"71964fb5d0fe8809","code_sha256_prefix":"71964fb5d0fe8809","mcp_get_code":{"code_sha256":"71964fb5d0fe8809"}}],"record_sha256":"e63a5417b381b7e5701ce99615c00221852ff0c99238ea49b395a5646d277b24","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}