{"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/get-criterion","entry":"get_criterion","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":9,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":4,"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":15,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":5,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":16,"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":3,"ran_fixture":2,"ran":5,"unverified":5},"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":"2602.18502","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-18502","title":"Mitigating Shortcut Learning via Feature Disentanglement in Medical Imaging: A Benchmark Study","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"berenslab/medical-shortcut-mitigation","path":"src/shortcut/criterion.py","file_url":"https://github.com/berenslab/medical-shortcut-mitigation/blob/HEAD/src/shortcut/criterion.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":"d0f1cf7101a32e07","code_sha256_prefix":"d0f1cf7101a32e07","mcp_get_code":{"code_sha256":"d0f1cf7101a32e07"}},{"arxiv_id":"2602.10870","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-10870","title":"FedPS: Federated data Preprocessing via aggregated Statistics","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"xuefeng-xu/fl-tabular","path":"fltabular/task.py","file_url":"https://github.com/xuefeng-xu/fl-tabular/blob/HEAD/fltabular/task.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5a02e40e3c396772","code_sha256_prefix":"5a02e40e3c396772","mcp_get_code":{"code_sha256":"5a02e40e3c396772"}},{"arxiv_id":"2510.20877","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-20877","title":"Multimodal Negative Learning","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"BaoquanGong/Multimodal-Negative-Learning","path":"eval_latefusion.py","file_url":"https://github.com/BaoquanGong/Multimodal-Negative-Learning/blob/HEAD/eval_latefusion.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, BaoquanGong/Multimodal-Negative-Learning when it was checked","code_sha256":"d50a0c22b67129e0","code_sha256_prefix":"d50a0c22b67129e0","mcp_get_code":{"code_sha256":"d50a0c22b67129e0"}},{"arxiv_id":"2510.20877","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-20877","title":"Multimodal Negative Learning","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"BaoquanGong/Multimodal-Negative-Learning","path":"train_latefusion.py","file_url":"https://github.com/BaoquanGong/Multimodal-Negative-Learning/blob/HEAD/train_latefusion.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, BaoquanGong/Multimodal-Negative-Learning when it was checked","code_sha256":"210f88d32e504aa9","code_sha256_prefix":"210f88d32e504aa9","mcp_get_code":{"code_sha256":"210f88d32e504aa9"}},{"arxiv_id":"2406.04802","arxiv_id_is_arxiv":true,"paper":"/paper/predictive-dynamic-fusion","title":"Predictive Dynamic Fusion","date":"2024-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yinan-Xia/PDF","path":"train_pdf.py","file_url":"https://github.com/Yinan-Xia/PDF/blob/HEAD/train_pdf.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"21eb6aa1ead38068","code_sha256_prefix":"21eb6aa1ead38068","mcp_get_code":{"code_sha256":"21eb6aa1ead38068"}},{"arxiv_id":"2402.02653","arxiv_id_is_arxiv":true,"paper":"/paper/learning-with-mixture-of-prototypes-for-out","title":"Learning with Mixture of Prototypes for Out-of-Distribution Detection","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jeff024/PALM","path":"util/loaders/model_loader.py","file_url":"https://github.com/jeff024/PALM/blob/HEAD/util/loaders/model_loader.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":"4af821a58b36ebf4","code_sha256_prefix":"4af821a58b36ebf4","mcp_get_code":{"code_sha256":"4af821a58b36ebf4"}},{"arxiv_id":"2312.16490","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-news-creation-intents-frame","title":"Exploring news intent and its application: A theory-driven approach","date":"2023-12-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ictmcg/newsint","path":"DMint/engine.py","file_url":"https://github.com/ictmcg/newsint/blob/HEAD/DMint/engine.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, ictmcg/newsint when it was checked","code_sha256":"b51b685a650e6ebe","code_sha256_prefix":"b51b685a650e6ebe","mcp_get_code":{"code_sha256":"b51b685a650e6ebe"}},{"arxiv_id":"2308.02866","arxiv_id_is_arxiv":true,"paper":"/paper/np-semiseg-when-neural-processes-meet-semi","title":"NP-SemiSeg: When Neural Processes meet Semi-Supervised Semantic Segmentation","date":"2023-08-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jianf-wang/np-semiseg","path":"AugSeg/augseg/utils/loss_helper.py","file_url":"https://github.com/jianf-wang/np-semiseg/blob/HEAD/AugSeg/augseg/utils/loss_helper.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, jianf-wang/np-semiseg when it was checked","code_sha256":"9f859fb1a07bac85","code_sha256_prefix":"9f859fb1a07bac85","mcp_get_code":{"code_sha256":"9f859fb1a07bac85"}},{"arxiv_id":"2306.02050","arxiv_id_is_arxiv":true,"paper":"/paper/provable-dynamic-fusion-for-low-quality","title":"Provable Dynamic Fusion for Low-Quality Multimodal Data","date":"2023-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"QingyangZhang/QMF","path":"text-image-classification/train_qmf.py","file_url":"https://github.com/QingyangZhang/QMF/blob/HEAD/text-image-classification/train_qmf.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":"83337ce5b4a2a13b","code_sha256_prefix":"83337ce5b4a2a13b","mcp_get_code":{"code_sha256":"83337ce5b4a2a13b"}},{"arxiv_id":"2303.11203","arxiv_id_is_arxiv":true,"paper":"/paper/less-is-more-reducing-task-and-model","title":"Less is More: Reducing Task and Model Complexity for 3D Point Cloud Semantic Segmentation","date":"2023-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"l1997i/lim3d","path":"utils/contra_memobank_loss.py","file_url":"https://github.com/l1997i/lim3d/blob/HEAD/utils/contra_memobank_loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from jianf-wang/np-semiseg, and GitHub detected no licence in that repository when it was checked","code_sha256":"9f859fb1a07bac85","code_sha256_prefix":"9f859fb1a07bac85","mcp_get_code":{"code_sha256":"9f859fb1a07bac85"}},{"arxiv_id":"2208.02955","arxiv_id_is_arxiv":true,"paper":"/paper/zlpr-a-novel-loss-for-multi-label","title":"ZLPR: A Novel Loss for Multi-label Classification","date":"2022-08-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"whitepurple/HBM-loss-for-HTC","path":"src/utils/criterion.py","file_url":"https://github.com/whitepurple/HBM-loss-for-HTC/blob/HEAD/src/utils/criterion.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":"d995c92577dc8eb1","code_sha256_prefix":"d995c92577dc8eb1","mcp_get_code":{"code_sha256":"d995c92577dc8eb1"}},{"arxiv_id":"2108.08012","arxiv_id_is_arxiv":true,"paper":"/paper/multi-anchor-active-domain-adaptation-for","title":"Multi-Anchor Active Domain Adaptation for Semantic Segmentation","date":"2021-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"munanning/madav2","path":"loss/loss.py","file_url":"https://github.com/munanning/madav2/blob/HEAD/loss/loss.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":"8a376f4180e6fb9c","code_sha256_prefix":"8a376f4180e6fb9c","mcp_get_code":{"code_sha256":"8a376f4180e6fb9c"}},{"arxiv_id":"2105.11333","arxiv_id_is_arxiv":true,"paper":"/paper/multi-modal-understanding-and-generation-for","title":"Multi-modal Understanding and Generation for Medical Images and Text via Vision-Language Pre-Training","date":"2021-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SuperSupermoon/MedViLL","path":"downstream_task/classification/cls.py","file_url":"https://github.com/SuperSupermoon/MedViLL/blob/HEAD/downstream_task/classification/cls.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":"13116739869d86d2","code_sha256_prefix":"13116739869d86d2","mcp_get_code":{"code_sha256":"13116739869d86d2"}},{"arxiv_id":"2105.04522","arxiv_id_is_arxiv":true,"paper":"/paper/generalized-jensen-shannon-divergence-loss","title":"Generalized Jensen-Shannon Divergence Loss for Learning with Noisy Labels","date":"2021-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"erikenglesson/gjs","path":"losses.py","file_url":"https://github.com/erikenglesson/gjs/blob/HEAD/losses.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, erikenglesson/gjs when it was checked","code_sha256":"c5746d47232aa0b1","code_sha256_prefix":"c5746d47232aa0b1","mcp_get_code":{"code_sha256":"c5746d47232aa0b1"}},{"arxiv_id":"2002.04289","arxiv_id_is_arxiv":true,"paper":"/paper/to-share-or-not-to-share-a-comprehensive","title":"To Share or Not To Share: A Comprehensive Appraisal of Weight-Sharing","date":"2020-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apourchot/to_share_or_not_to_share","path":"utils.py","file_url":"https://github.com/apourchot/to_share_or_not_to_share/blob/HEAD/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":"23f701d112f0a43c","code_sha256_prefix":"23f701d112f0a43c","mcp_get_code":{"code_sha256":"23f701d112f0a43c"}},{"arxiv_id":"Lu_FedHCA2_Towards_Hetero-Client_Federated_Multi-Task_Learning_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Lu_FedHCA2_Towards_Hetero-Client_Federated_Multi-Task_Learning_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"innovator-zero/FedHCA2","path":"losses.py","file_url":"https://github.com/innovator-zero/FedHCA2/blob/HEAD/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":"71af099cdba2bd60","code_sha256_prefix":"71af099cdba2bd60","mcp_get_code":{"code_sha256":"71af099cdba2bd60"}}],"record_sha256":"6699ba42da6deec4be7a8a25593d65180814b80dc0999b66a8538f8ad7225a99","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}