{"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/eval-train","entry":"eval_train","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":10,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":3,"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":11,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":8,"n_samples_fingerprinted":0,"n_places":13,"n_places_pointer_only":9,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":8},"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":"2409.19696","arxiv_id_is_arxiv":true,"paper":"/paper/vision-language-models-are-strong-noisy-label","title":"Vision-Language Models are Strong Noisy Label Detectors","date":"2024-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HotanLee/DeFT","path":"main_real_baseline.py","file_url":"https://github.com/HotanLee/DeFT/blob/HEAD/main_real_baseline.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":"514531c5f0f598b8","code_sha256_prefix":"514531c5f0f598b8","mcp_get_code":{"code_sha256":"514531c5f0f598b8"}},{"arxiv_id":"2409.15180","arxiv_id_is_arxiv":true,"paper":"/paper/a-comprehensive-survey-with-critical-analysis","title":"A Comprehensive Survey with Critical Analysis for Deepfake Speech Detection","date":null,"month_inferred_from_arxiv_id":"2024-09","title_source":"archive","repo":"tamlhp/dfd_benchmark","path":"pytorch_model/train_torch.py","file_url":"https://github.com/tamlhp/dfd_benchmark/blob/HEAD/pytorch_model/train_torch.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":"897a5d87d28bfaed","code_sha256_prefix":"897a5d87d28bfaed","mcp_get_code":{"code_sha256":"897a5d87d28bfaed"}},{"arxiv_id":"2404.11265","arxiv_id_is_arxiv":true,"paper":"/paper/the-victim-and-the-beneficiary-exploiting-a-1","title":"The Victim and The Beneficiary: Exploiting a Poisoned Model to Train a Clean Model on Poisoned Data","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zixuan-zhu/vab","path":"functions_ImageNet.py","file_url":"https://github.com/zixuan-zhu/vab/blob/HEAD/functions_ImageNet.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, zixuan-zhu/vab when it was checked","code_sha256":"10634dee6d4c19f9","code_sha256_prefix":"10634dee6d4c19f9","mcp_get_code":{"code_sha256":"10634dee6d4c19f9"}},{"arxiv_id":"2404.11265","arxiv_id_is_arxiv":true,"paper":"/paper/the-victim-and-the-beneficiary-exploiting-a-1","title":"The Victim and The Beneficiary: Exploiting a Poisoned Model to Train a Clean Model on Poisoned Data","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zixuan-zhu/vab","path":"functions_cifar10.py","file_url":"https://github.com/zixuan-zhu/vab/blob/HEAD/functions_cifar10.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, zixuan-zhu/vab when it was checked","code_sha256":"2d53215c054785a6","code_sha256_prefix":"2d53215c054785a6","mcp_get_code":{"code_sha256":"2d53215c054785a6"}},{"arxiv_id":"2401.13360","arxiv_id_is_arxiv":true,"paper":"/paper/debiased-sample-selection-for-combating-noisy","title":"Debiased Sample Selection for Combating Noisy Labels","date":"2024-01-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"1998v7/item","path":"Train_cifar.py","file_url":"https://github.com/1998v7/item/blob/HEAD/Train_cifar.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, 1998v7/item when it was checked","code_sha256":"de1446f159fb31f9","code_sha256_prefix":"de1446f159fb31f9","mcp_get_code":{"code_sha256":"de1446f159fb31f9"}},{"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/Train_cifar.py","file_url":"https://github.com/chenchenzong/dpc/blob/HEAD/AAAI2024_DPC_code/Train_cifar.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, chenchenzong/dpc when it was checked","code_sha256":"1e7c011c7c168d10","code_sha256_prefix":"1e7c011c7c168d10","mcp_get_code":{"code_sha256":"1e7c011c7c168d10"}},{"arxiv_id":"2210.03930","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-graph-transformer-with-adaptive","title":"Hierarchical Graph Transformer with Adaptive Node Sampling","date":"2022-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zaixizhang/ans-gt","path":"main_adaptive.py","file_url":"https://github.com/zaixizhang/ans-gt/blob/HEAD/main_adaptive.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, zaixizhang/ans-gt when it was checked","code_sha256":"a6bcf32f19f8f934","code_sha256_prefix":"a6bcf32f19f8f934","mcp_get_code":{"code_sha256":"a6bcf32f19f8f934"}},{"arxiv_id":"2105.14083","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-noisy-label-models-labeler","title":"Rethinking Noisy Label Models: Labeler-Dependent Noise with Adversarial Awareness","date":"2021-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LiJunnan1992/DivideMix","path":"Train_cifar.py","file_url":"https://github.com/LiJunnan1992/DivideMix/blob/HEAD/Train_cifar.py","status":"unverified","verification_level":0,"contract_check":null,"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 kthyeon/fine_official, and GitHub detected no licence in that repository when it was checked","code_sha256":"8a2d14d95795c655","code_sha256_prefix":"8a2d14d95795c655","mcp_get_code":{"code_sha256":"8a2d14d95795c655"}},{"arxiv_id":"2105.14083","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-noisy-label-models-labeler","title":"Rethinking Noisy Label Models: Labeler-Dependent Noise with Adversarial Awareness","date":"2021-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LiJunnan1992/DivideMix","path":"Train_clothing1M.py","file_url":"https://github.com/LiJunnan1992/DivideMix/blob/HEAD/Train_clothing1M.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":"df2e2be3758f71af","code_sha256_prefix":"df2e2be3758f71af","mcp_get_code":{"code_sha256":"df2e2be3758f71af"}},{"arxiv_id":"2105.14083","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-noisy-label-models-labeler","title":"Rethinking Noisy Label Models: Labeler-Dependent Noise with Adversarial Awareness","date":"2021-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LiJunnan1992/DivideMix","path":"Train_webvision.py","file_url":"https://github.com/LiJunnan1992/DivideMix/blob/HEAD/Train_webvision.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":"cf746fb075a6fb8b","code_sha256_prefix":"cf746fb075a6fb8b","mcp_get_code":{"code_sha256":"cf746fb075a6fb8b"}},{"arxiv_id":"2102.11628","arxiv_id_is_arxiv":true,"paper":"/paper/winning-ticket-in-noisy-image-classification","title":"FINE Samples for Learning with Noisy Labels","date":"2021-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kthyeon/fine_official","path":"dividemix/Train_cifar.py","file_url":"https://github.com/kthyeon/fine_official/blob/HEAD/dividemix/Train_cifar.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, kthyeon/fine_official when it was checked","code_sha256":"8a2d14d95795c655","code_sha256_prefix":"8a2d14d95795c655","mcp_get_code":{"code_sha256":"8a2d14d95795c655"}},{"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":"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, lushleaf/Network-Pruning-Greedy-Forward-Selection when it was checked","code_sha256":"a2264353ce143e03","code_sha256_prefix":"a2264353ce143e03","mcp_get_code":{"code_sha256":"a2264353ce143e03"}},{"arxiv_id":"2002.07394","arxiv_id_is_arxiv":true,"paper":"/paper/dividemix-learning-with-noisy-labels-as-semi-1","title":"DivideMix: Learning with Noisy Labels as Semi-supervised Learning","date":"2020-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"8a2d14d95795c655","code_sha256_prefix":"8a2d14d95795c655","mcp_get_code":{"code_sha256":"8a2d14d95795c655"}}],"record_sha256":"af85e821d99eddf472625fa18f29f4472c84a69d303939212b3baa1d3d3aff5a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}