{"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/plot-confusion-matrix","entry":"plot_confusion_matrix","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":11,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":8,"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":9,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":11,"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":6,"unverified":3},"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":"2603.24150","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-24150","title":"A visual observation on the geometry of UMAP projections of the difference vectors of antonym and synonym word pair embeddings","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"ramiluisto/CuriousSwirl","path":"semsim/plots.py","file_url":"https://github.com/ramiluisto/CuriousSwirl/blob/HEAD/semsim/plots.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":"2523a48b4c15f71f","code_sha256_prefix":"2523a48b4c15f71f","mcp_get_code":{"code_sha256":"2523a48b4c15f71f"}},{"arxiv_id":"2312.06258","arxiv_id_is_arxiv":true,"paper":"/paper/no-prior-mask-eliminate-redundant-action-for","title":"No Prior Mask: Eliminate Redundant Action for Deep Reinforcement Learning","date":"2023-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhongdy15/npm","path":"min_red/mf_model_trainer.py","file_url":"https://github.com/zhongdy15/npm/blob/HEAD/min_red/mf_model_trainer.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, zhongdy15/npm when it was checked","code_sha256":"45aa96ce584544fa","code_sha256_prefix":"45aa96ce584544fa","mcp_get_code":{"code_sha256":"45aa96ce584544fa"}},{"arxiv_id":"2304.09426","arxiv_id_is_arxiv":true,"paper":"/paper/decoupled-training-for-long-tailed","title":"Decoupled Training for Long-Tailed Classification With Stochastic Representations","date":"2023-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaidic/LDAM-DRW","path":"utils.py","file_url":"https://github.com/kaidic/LDAM-DRW/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":"e5ce72a1e8d9bc22","code_sha256_prefix":"e5ce72a1e8d9bc22","mcp_get_code":{"code_sha256":"e5ce72a1e8d9bc22"}},{"arxiv_id":"2111.03874","arxiv_id_is_arxiv":true,"paper":"/paper/towards-calibrated-model-for-long-tailed","title":"Towards Calibrated Model for Long-Tailed Visual Recognition from Prior Perspective","date":"2021-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XuZhengzhuo/Prior-LT","path":"utils.py","file_url":"https://github.com/XuZhengzhuo/Prior-LT/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":"46490b0cfc522d35","code_sha256_prefix":"46490b0cfc522d35","mcp_get_code":{"code_sha256":"46490b0cfc522d35"}},{"arxiv_id":"1906.07413","arxiv_id_is_arxiv":true,"paper":"/paper/learning-imbalanced-datasets-with-label","title":"Learning Imbalanced Datasets with Label-Distribution-Aware Margin Loss","date":"2019-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ihaeyong/maximum-margin-ldam","path":"utils.py","file_url":"https://github.com/ihaeyong/maximum-margin-ldam/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":"e5ce72a1e8d9bc22","code_sha256_prefix":"e5ce72a1e8d9bc22","mcp_get_code":{"code_sha256":"e5ce72a1e8d9bc22"}},{"arxiv_id":"1711.10609","arxiv_id_is_arxiv":true,"paper":"/paper/171110609","title":"A recurrent neural network for classification of unevenly sampled variable stars","date":null,"month_inferred_from_arxiv_id":"2017-11","title_source":"archive","repo":"bthtsang/DeepClassifierNoveltyDetection","path":"classify_noveltydetect.py","file_url":"https://github.com/bthtsang/DeepClassifierNoveltyDetection/blob/HEAD/classify_noveltydetect.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":"8435d01194c988f9","code_sha256_prefix":"8435d01194c988f9","mcp_get_code":{"code_sha256":"8435d01194c988f9"}},{"arxiv_id":"1603.00882","arxiv_id_is_arxiv":true,"paper":"/paper/photometric-supernova-classification-with","title":"Photometric Supernova Classification With Machine Learning","date":null,"month_inferred_from_arxiv_id":"2016-03","title_source":"archive","repo":"LSSTDESC/snmachine","path":"snmachine/analysis.py","file_url":"https://github.com/LSSTDESC/snmachine/blob/HEAD/snmachine/analysis.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"88da824ebaae134c","code_sha256_prefix":"88da824ebaae134c","mcp_get_code":{"code_sha256":"88da824ebaae134c"}},{"arxiv_id":"1602.04938","arxiv_id_is_arxiv":true,"paper":"/paper/why-should-i-trust-you-explaining-the","title":"\"Why Should I Trust You?\": Explaining the Predictions of Any Classifier","date":"2016-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aildnont/HIFIS-model","path":"src/visualization/visualize.py","file_url":"https://github.com/aildnont/HIFIS-model/blob/HEAD/src/visualization/visualize.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":"d83a0853d1cf871a","code_sha256_prefix":"d83a0853d1cf871a","mcp_get_code":{"code_sha256":"d83a0853d1cf871a"}},{"arxiv_id":"1511.06434","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-representation-learning-with-1","title":"Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks","date":"2015-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pharikal/Breast-Cancer-Detection-Using-Deep-Learning","path":"DCGAN.py","file_url":"https://github.com/pharikal/Breast-Cancer-Detection-Using-Deep-Learning/blob/HEAD/DCGAN.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, pharikal/Breast-Cancer-Detection-Using-Deep-Learning when it was checked","code_sha256":"6738e73abbfabfa8","code_sha256_prefix":"6738e73abbfabfa8","mcp_get_code":{"code_sha256":"6738e73abbfabfa8"}},{"arxiv_id":"1511.02580","arxiv_id_is_arxiv":true,"paper":"/paper/how-far-can-we-go-without-convolution","title":"How far can we go without convolution: Improving fully-connected networks","date":"2015-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AvocadoAlpha/boltz_bo","path":"boltzmann_machines/utils/plot_utils.py","file_url":"https://github.com/AvocadoAlpha/boltz_bo/blob/HEAD/boltzmann_machines/utils/plot_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":"520feb68778834ef","code_sha256_prefix":"520feb68778834ef","mcp_get_code":{"code_sha256":"520feb68778834ef"}},{"arxiv_id":"Chen_AREA_Adaptive_Reweighting_via_Effective_Area_for_Long-Tailed_Classification_ICCV_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Chen_AREA_Adaptive_Reweighting_via_Effective_Area_for_Long-Tailed_Classification_ICCV_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"xiaohua-chen/AREA","path":"utils.py","file_url":"https://github.com/xiaohua-chen/AREA/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":"e5ce72a1e8d9bc22","code_sha256_prefix":"e5ce72a1e8d9bc22","mcp_get_code":{"code_sha256":"e5ce72a1e8d9bc22"}}],"record_sha256":"04e4bfea490c1a24ceb336f810e5e6e662b66641833c2feb547f0ba3fa28d617","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}