{"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/multiclass-noisify","entry":"multiclass_noisify","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":7,"n_papers_ran":0,"n_papers_ran_no_instrument_failure":0,"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":7,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":7,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":2,"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":0,"unverified":7},"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":"2403.01942","arxiv_id_is_arxiv":true,"paper":"/paper/mitigating-label-noise-on-graph-via","title":"Mitigating Label Noise on Graph via Topological Sample Selection","date":"2024-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmllab/2024_ICML_TSS","path":"make_noise.py","file_url":"https://github.com/tmllab/2024_ICML_TSS/blob/HEAD/make_noise.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, tmllab/2024_ICML_TSS when it was checked","code_sha256":"e6909ca443b75a70","code_sha256_prefix":"e6909ca443b75a70","mcp_get_code":{"code_sha256":"e6909ca443b75a70"}},{"arxiv_id":"2311.15502","arxiv_id_is_arxiv":true,"paper":"/paper/learning-with-complementary-labels-revisited","title":"Learning with Complementary Labels Revisited: The Selected-Completely-at-Random Setting Is More Practical","date":"2023-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wwangwitsel/SCARCE","path":"utils_data.py","file_url":"https://github.com/wwangwitsel/SCARCE/blob/HEAD/utils_data.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, wwangwitsel/SCARCE when it was checked","code_sha256":"0ac9d8e2b2bf03ab","code_sha256_prefix":"0ac9d8e2b2bf03ab","mcp_get_code":{"code_sha256":"0ac9d8e2b2bf03ab"}},{"arxiv_id":"2006.15766","arxiv_id_is_arxiv":true,"paper":"/paper/heteroskedastic-and-imbalanced-deep-learning","title":"Heteroskedastic and Imbalanced Deep Learning with Adaptive Regularization","date":"2020-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaidic/HAR","path":"heteroskedastic_cifar.py","file_url":"https://github.com/kaidic/HAR/blob/HEAD/heteroskedastic_cifar.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":"c5c3434271117391","code_sha256_prefix":"c5c3434271117391","mcp_get_code":{"code_sha256":"c5c3434271117391"}},{"arxiv_id":"2006.13554","arxiv_id_is_arxiv":true,"paper":"/paper/normalized-loss-functions-for-deep-learning","title":"Normalized Loss Functions for Deep Learning with Noisy Labels","date":"2020-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HanxunH/Active-Passive-Losses","path":"dataset.py","file_url":"https://github.com/HanxunH/Active-Passive-Losses/blob/HEAD/dataset.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":"b175d19a7622c5c6","code_sha256_prefix":"b175d19a7622c5c6","mcp_get_code":{"code_sha256":"b175d19a7622c5c6"}},{"arxiv_id":"2006.04662","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-importance-weighting-for-deep","title":"Rethinking Importance Weighting for Deep Learning under Distribution Shift","date":"2020-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TongtongFANG/DIW","path":"diw.py","file_url":"https://github.com/TongtongFANG/DIW/blob/HEAD/diw.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":"5f14559820810bee","code_sha256_prefix":"5f14559820810bee","mcp_get_code":{"code_sha256":"5f14559820810bee"}},{"arxiv_id":"aaai_29668","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_29668","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yhzhu66/RNCGLN","path":"utils/Noise_about.py","file_url":"https://github.com/yhzhu66/RNCGLN/blob/HEAD/utils/Noise_about.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":"daf2a1f7a7323a3a","code_sha256_prefix":"daf2a1f7a7323a3a","mcp_get_code":{"code_sha256":"daf2a1f7a7323a3a"}},{"arxiv_id":"aaai_29393","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_29393","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"VGCQ/DSD2","path":"utils/cifar.py","file_url":"https://github.com/VGCQ/DSD2/blob/HEAD/utils/cifar.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":"41ab49097e3db0cc","code_sha256_prefix":"41ab49097e3db0cc","mcp_get_code":{"code_sha256":"41ab49097e3db0cc"}}],"record_sha256":"1dd3096a546b16535cc802175f25c2c01cf24114d5fa1f52f56c409eb8fba820","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}