{"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":"/sota/image-classification-on-mini-webvision-1-0","task":{"name":"Image Classification","url":"/task/image-classification","note":null},"dataset":{"name":"mini WebVision 1.0","url":"/dataset/webvision-database"},"category":"Computer Vision","categories":["Adversarial","Computer Vision"],"category_note":null,"description":"**Image Classification** is a fundamental task in vision recognition that aims to understand and categorize an image as a whole under a specific label. Unlike [object detection](/task/object-detection), which involves classification and location of multiple objects within an image, image classification typically pertains to single-object images. When the classification becomes highly detailed or reaches instance-level, it is often referred to as [image retrieval](/task/image-retrieval), which also involves finding similar images in a large database.\r\n\r\n\r\n<span class=\"description-source\">Source: [Metamorphic Testing for Object Detection Systems ](https://arxiv.org/abs/1912.12162)</span>","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["Top-1 Accuracy","Top-5 Accuracy","ImageNet Top-1 Accuracy","ImageNet Top-5 Accuracy"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction; the tokens 'score' and 'time' are not used on this page); null = not inferred, chart draws points only","by_metric":{"Top-1 Accuracy":"higher","Top-5 Accuracy":"higher","ImageNet Top-1 Accuracy":"higher","ImageNet Top-5 Accuracy":"higher"}},"counts":{"rows":47,"rows_with_code":36,"rows_with_paper_page":47,"rows_dated":47,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"LRA-diffusion (CLIP ViT)","metrics":{"ImageNet Top-1 Accuracy":"82.56","Top-1 Accuracy":"84.16"},"uses_additional_data":false,"paper_date":"2023-05-31","paper":"/paper/label-retrieval-augmented-diffusion-models-1","paper_url":"https://arxiv.org/abs/2305.19518v2","paper_title":"Label-Retrieval-Augmented Diffusion Models for Learning from Noisy Labels","code":"https://github.com/puar-playground/lra-diffusion","n_code_links":1,"official":{"repos":["puar-playground/lra-diffusion"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]},"syntology":{"n_ran":7,"n_constructed":4,"n_ran_checked":4,"n_instrument":3,"n_unverified":2,"n_samples":9,"n_pointer_only_licence":0,"sample_list":"/paper/label-retrieval-augmented-diffusion-models-1#ran","syntology_url":"https://syntology.ai/paper/2305.19518","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.19518"}}}},{"rank_in_archive_order":2,"model":"Robust LR","metrics":{"ImageNet Top-1 Accuracy":"75.48","ImageNet Top-5 Accuracy":"93.76","Top-1 Accuracy":"81.84","Top-5 Accuracy":"94.12"},"uses_additional_data":false,"paper_date":"2021-12-06","paper":"/paper/two-wrongs-don-t-make-a-right-combating","paper_url":"https://arxiv.org/abs/2112.02960v3","paper_title":"Two Wrongs Don't Make a Right: Combating Confirmation Bias in Learning with Label Noise","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":3,"model":"PGDF (Inception-ResNet-v2)","metrics":{"ImageNet Top-1 Accuracy":"75.45","ImageNet Top-5 Accuracy":"93.11","Top-1 Accuracy":"81.47","Top-5 Accuracy":"94.03"},"uses_additional_data":false,"paper_date":"2021-12-02","paper":"/paper/sample-prior-guided-robust-model-learning-to","paper_url":"https://arxiv.org/abs/2112.01197v3","paper_title":"Sample Prior Guided Robust Model Learning to Suppress Noisy Labels","code":"https://github.com/bupt-ai-cz/PGDF","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":4,"model":"SSR","metrics":{"ImageNet Top-1 Accuracy":"75.76","ImageNet Top-5 Accuracy":"91.76","Top-1 Accuracy":"80.92","Top-5 Accuracy":"92.80"},"uses_additional_data":false,"paper_date":"2021-11-22","paper":"/paper/s3-supervised-self-supervised-learning-under-1","paper_url":"https://arxiv.org/abs/2111.11288v2","paper_title":"SSR: An Efficient and Robust Framework for Learning with Unknown Label Noise","code":"https://github.com/MrChenFeng/SSR_BMVC2022","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":5,"model":"BtR","metrics":{"ImageNet Top-1 Accuracy":"75.96","ImageNet Top-5 Accuracy":"92.20","Top-1 Accuracy":"80.88","Top-5 Accuracy":"92.76"},"uses_additional_data":false,"paper_date":"2022-10-17","paper":"/paper/bootstrapping-the-relationship-between-images","paper_url":"https://arxiv.org/abs/2210.08826v1","paper_title":"Bootstrapping the Relationship Between Images and Their Clean and Noisy Labels","code":"https://github.com/btsmart/bootstrapping-label-noise","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":6,"model":"CoDiM-Sup (Inception-ResNet-v2)","metrics":{"ImageNet Top-1 Accuracy":"76.52","ImageNet Top-5 Accuracy":"91.96","Top-1 Accuracy":"80.88","Top-5 Accuracy":"92.48"},"uses_additional_data":false,"paper_date":"2021-11-23","paper":"/paper/codim-learning-with-noisy-labels-via","paper_url":"https://arxiv.org/abs/2111.11652v1","paper_title":"CoDiM: Learning with Noisy Labels via Contrastive Semi-Supervised Learning","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":7,"model":"NCR+Mixup+DA (ResNet-50)","metrics":{"Top-1 Accuracy":"80.5"},"uses_additional_data":false,"paper_date":"2022-02-04","paper":"/paper/learning-with-neighbor-consistency-for-noisy-1","paper_url":"https://arxiv.org/abs/2202.02200v2","paper_title":"Learning with Neighbor Consistency for Noisy Labels","code":"https://github.com/google-research/scenic","n_code_links":1,"official":{"repos":["google-research/scenic"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_samples":4,"n_pointer_only_licence":0,"sample_list":"/paper/learning-with-neighbor-consistency-for-noisy-1#ran","syntology_url":"https://syntology.ai/paper/2202.02200","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.02200"}}}},{"rank_in_archive_order":8,"model":"CMW-Net-SL+C2D","metrics":{"ImageNet Top-1 Accuracy":"77.36","ImageNet Top-5 Accuracy":"93.48","Top-1 Accuracy":"80.44","Top-5 Accuracy":"93.36"},"uses_additional_data":false,"paper_date":"2022-02-11","paper":"/paper/cmw-net-learning-a-class-aware-sample","paper_url":"https://arxiv.org/abs/2202.05613v3","paper_title":"CMW-Net: Learning a Class-Aware Sample Weighting Mapping for Robust Deep Learning","code":"https://github.com/xjtushujun/cmw-net","n_code_links":1,"official":{"repos":["xjtushujun/cmw-net"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_samples":3,"n_pointer_only_licence":3,"sample_list":"/paper/cmw-net-learning-a-class-aware-sample#ran","syntology_url":"https://syntology.ai/paper/2202.05613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.05613"}}}},{"rank_in_archive_order":9,"model":"Dynamic Loss  (Inception-ResNet-v2)","metrics":{"ImageNet Top-1 Accuracy":"74.76","ImageNet Top-5 Accuracy":"93.08","Top-1 Accuracy":"80.12","Top-5 Accuracy":"93.64"},"uses_additional_data":false,"paper_date":"2022-11-22","paper":"/paper/dynamic-loss-for-robust-learning","paper_url":"https://arxiv.org/abs/2211.12506v2","paper_title":"Dynamic Loss For Robust Learning","code":"https://github.com/jiangwenj02/dynamic_loss","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":10,"model":"CoDiM-Self  (Inception-ResNet-v2)","metrics":{"ImageNet Top-1 Accuracy":"77.24","ImageNet Top-5 Accuracy":"92.48","Top-1 Accuracy":"80.12","Top-5 Accuracy":"93.52"},"uses_additional_data":false,"paper_date":"2021-11-23","paper":"/paper/codim-learning-with-noisy-labels-via","paper_url":"https://arxiv.org/abs/2111.11652v1","paper_title":"CoDiM: Learning with Noisy Labels via Contrastive Semi-Supervised Learning","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":11,"model":"Sel-CL+ (ResNet-18)","metrics":{"ImageNet Top-1 Accuracy":"76.84","ImageNet Top-5 Accuracy":"93.04","Top-1 Accuracy":"79.96","Top-5 Accuracy":"92.64"},"uses_additional_data":false,"paper_date":"2022-03-08","paper":"/paper/selective-supervised-contrastive-learning","paper_url":"https://arxiv.org/abs/2203.04181v1","paper_title":"Selective-Supervised Contrastive Learning with Noisy Labels","code":"https://github.com/shikunli/sel-cl","n_code_links":1,"official":{"repos":["shikunli/sel-cl"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":1,"sample_list":"/paper/selective-supervised-contrastive-learning#ran","syntology_url":"https://syntology.ai/paper/2203.04181","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.04181"}}}},{"rank_in_archive_order":12,"model":"CPC","metrics":{"ImageNet Top-1 Accuracy":"75.75±0.14","ImageNet Top-5 Accuracy":"93.49±0.25","Top-1 Accuracy":"79.63±0.08","Top-5 Accuracy":"93.46±0.10"},"uses_additional_data":false,"paper_date":"2022-12-21","paper":"/paper/class-prototype-based-cleaner-for-label-noise","paper_url":"https://arxiv.org/abs/2212.10766v1","paper_title":"Class Prototype-based Cleaner for Label Noise Learning","code":"https://github.com/hjjpku/cpc","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":13,"model":"PSSCL (130 epochs)","metrics":{"ImageNet Top-1 Accuracy":"79.68","ImageNet Top-5 Accuracy":"95.16","Top-1 Accuracy":"79.56","Top-5 Accuracy":"94.84"},"uses_additional_data":false,"paper_date":"2024-12-18","paper":"/paper/psscl-a-progressive-sample-selection","paper_url":"https://www.sciencedirect.com/science/article/abs/pii/S0031320324010355","paper_title":"PSSCL: A progressive sample selection framework with contrastive loss designed for noisy labels","code":"https://github.com/LanXiaoPang613/PSSCL","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":14,"model":"DivideMix with C2D (ResNet-50)","metrics":{"ImageNet Top-1 Accuracy":"78.57 ± 0.37","ImageNet Top-5 Accuracy":"93.04 ± 0.10","Top-1 Accuracy":"79.42 ± 0.34","Top-5 Accuracy":"92.32 ± 0.33"},"uses_additional_data":false,"paper_date":"2021-03-25","paper":"/paper/contrast-to-divide-self-supervised-pre-1","paper_url":"https://arxiv.org/abs/2103.13646v2","paper_title":"Contrast to Divide: Self-Supervised Pre-Training for Learning with Noisy Labels","code":"https://github.com/ContrastToDivide/C2D","n_code_links":1,"official":{"repos":["ContrastToDivide/C2D"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":1,"n_samples":7,"n_pointer_only_licence":0,"sample_list":"/paper/contrast-to-divide-self-supervised-pre-1#ran","syntology_url":"https://syntology.ai/paper/2103.13646","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13646"}}}},{"rank_in_archive_order":15,"model":"FaMUS","metrics":{"ImageNet Top-1 Accuracy":"77","ImageNet Top-5 Accuracy":"92.76","Top-1 Accuracy":"79.4","Top-5 Accuracy":"92.80"},"uses_additional_data":false,"paper_date":"2021-04-30","paper":"/paper/faster-meta-update-strategy-for-noise-robust","paper_url":"https://arxiv.org/abs/2104.15092v1","paper_title":"Faster Meta Update Strategy for Noise-Robust Deep Learning","code":"https://github.com/youjiangxu/FaMUS","n_code_links":1,"official":{"repos":["youjiangxu/FaMUS"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official","unlocated"]},"syntology":{"n_ran":3,"n_constructed":1,"n_ran_checked":2,"n_instrument":1,"n_unverified":4,"n_samples":7,"n_pointer_only_licence":7,"sample_list":"/paper/faster-meta-update-strategy-for-noise-robust#ran","syntology_url":"https://syntology.ai/paper/2104.15092","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.15092"}}}},{"rank_in_archive_order":16,"model":"NCR+Mixup (ResNet-50)","metrics":{"Top-1 Accuracy":"79.4"},"uses_additional_data":false,"paper_date":"2022-02-04","paper":"/paper/learning-with-neighbor-consistency-for-noisy-1","paper_url":"https://arxiv.org/abs/2202.02200v2","paper_title":"Learning with Neighbor Consistency for Noisy Labels","code":"https://github.com/google-research/scenic","n_code_links":1,"official":{"repos":["google-research/scenic"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_samples":4,"n_pointer_only_licence":0,"sample_list":"/paper/learning-with-neighbor-consistency-for-noisy-1#ran","syntology_url":"https://syntology.ai/paper/2202.02200","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.02200"}}}},{"rank_in_archive_order":17,"model":"CC","metrics":{"ImageNet Top-1 Accuracy":"76.08","ImageNet Top-5 Accuracy":"93.86","Top-1 Accuracy":"79.36","Top-5 Accuracy":"93.64"},"uses_additional_data":false,"paper_date":"2022-07-29","paper":"/paper/centrality-and-consistency-two-stage-clean","paper_url":"https://arxiv.org/abs/2207.14476v1","paper_title":"Centrality and Consistency: Two-Stage Clean Samples Identification for Learning with Instance-Dependent Noisy Labels","code":"https://github.com/uitrbn/tscsi_idn","n_code_links":1,"official":{"repos":["uitrbn/tscsi_idn"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]},"syntology":{"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":3,"n_samples":9,"n_pointer_only_licence":3,"sample_list":"/paper/centrality-and-consistency-two-stage-clean#ran","syntology_url":"https://syntology.ai/paper/2207.14476","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.14476"}}}},{"rank_in_archive_order":18,"model":"GJS (ResNet-50)","metrics":{"ImageNet Top-1 Accuracy":"75.50","ImageNet Top-5 Accuracy":"91.27","Top-1 Accuracy":"79.28","Top-5 Accuracy":"91.22"},"uses_additional_data":false,"paper_date":"2021-05-10","paper":"/paper/generalized-jensen-shannon-divergence-loss","paper_url":"https://arxiv.org/abs/2105.04522v4","paper_title":"Generalized Jensen-Shannon Divergence Loss for Learning with Noisy Labels","code":"https://github.com/erikenglesson/gjs","n_code_links":1,"official":{"repos":["erikenglesson/gjs"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":4,"n_constructed":1,"n_ran_checked":2,"n_instrument":2,"n_unverified":1,"n_samples":5,"n_pointer_only_licence":5,"sample_list":"/paper/generalized-jensen-shannon-divergence-loss#ran","syntology_url":"https://syntology.ai/paper/2105.04522","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.04522"}}}},{"rank_in_archive_order":19,"model":"NGC (Inception-ResNet-v2)","metrics":{"ImageNet Top-1 Accuracy":"74.44 ","ImageNet Top-5 Accuracy":"91.04","Top-1 Accuracy":"79.16","Top-5 Accuracy":"91.84 "},"uses_additional_data":false,"paper_date":"2021-08-25","paper":"/paper/ngc-a-unified-framework-for-learning-with","paper_url":"https://arxiv.org/abs/2108.11035v1","paper_title":"NGC: A Unified Framework for Learning with Open-World Noisy Data","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":20,"model":"TCL","metrics":{"ImageNet Top-1 Accuracy":"75.4","ImageNet Top-5 Accuracy":"92.4","Top-1 Accuracy":"79.1","Top-5 Accuracy":"92.3"},"uses_additional_data":false,"paper_date":"2023-03-13","paper":"/paper/twin-contrastive-learning-with-noisy-labels","paper_url":"https://arxiv.org/abs/2303.06930v1","paper_title":"Twin Contrastive Learning with Noisy Labels","code":"https://github.com/hzzone/tcl","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":21,"model":"LongReMix (Inception-ResNet-v2)","metrics":{"Top-1 Accuracy":"78.92","Top-5 Accuracy":"92.32"},"uses_additional_data":false,"paper_date":"2021-03-06","paper":"/paper/longremix-robust-learning-with-high","paper_url":"https://arxiv.org/abs/2103.04173v2","paper_title":"LongReMix: Robust Learning with High Confidence Samples in a Noisy Label Environment","code":"https://github.com/filipe-research/LongReMix","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":22,"model":"MOIT+ (ResNet-18)","metrics":{"Top-1 Accuracy":"78.76"},"uses_additional_data":false,"paper_date":"2020-12-08","paper":"/paper/multi-objective-interpolation-training-for","paper_url":"https://arxiv.org/abs/2012.04462v2","paper_title":"Multi-Objective Interpolation Training for Robustness to Label Noise","code":"https://github.com/DiegoOrtego/LabelNoiseMOIT","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":23,"model":"PSSCL (120 epochs)","metrics":{"ImageNet Top-1 Accuracy":"79.40","ImageNet Top-5 Accuracy":"94.84","Top-1 Accuracy":"78.52","Top-5 Accuracy":"93.80"},"uses_additional_data":false,"paper_date":"2024-12-18","paper":"/paper/psscl-a-progressive-sample-selection","paper_url":"https://www.sciencedirect.com/science/article/abs/pii/S0031320324010355","paper_title":"PSSCL: A progressive sample selection framework with contrastive loss designed for noisy labels","code":"https://github.com/LanXiaoPang613/PSSCL","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":24,"model":"CMW-Net-SL","metrics":{"ImageNet Top-1 Accuracy":"75.72","ImageNet Top-5 Accuracy":"92.52","Top-1 Accuracy":"78.08","Top-5 Accuracy":"92.96"},"uses_additional_data":false,"paper_date":"2022-02-11","paper":"/paper/cmw-net-learning-a-class-aware-sample","paper_url":"https://arxiv.org/abs/2202.05613v3","paper_title":"CMW-Net: Learning a Class-Aware Sample Weighting Mapping for Robust Deep Learning","code":"https://github.com/xjtushujun/cmw-net","n_code_links":1,"official":{"repos":["xjtushujun/cmw-net"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_samples":3,"n_pointer_only_licence":3,"sample_list":"/paper/cmw-net-learning-a-class-aware-sample#ran","syntology_url":"https://syntology.ai/paper/2202.05613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.05613"}}}},{"rank_in_archive_order":25,"model":"ELR+ (Inception-ResNet-v2)","metrics":{"ImageNet Top-1 Accuracy":"70.29","ImageNet Top-5 Accuracy":"89.76","Top-1 Accuracy":"77.78","Top-5 Accuracy":"91.68"},"uses_additional_data":false,"paper_date":"2020-06-30","paper":"/paper/early-learning-regularization-prevents","paper_url":"https://arxiv.org/abs/2007.00151v2","paper_title":"Early-Learning Regularization Prevents Memorization of Noisy Labels","code":"https://github.com/shengliu66/ELR","n_code_links":2,"official":{"repos":["shengliu66/ELR"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0,"sample_list":"/paper/early-learning-regularization-prevents#ran","syntology_url":"https://syntology.ai/paper/2007.00151","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.00151"}}}},{"rank_in_archive_order":26,"model":"ScanMix (Inception-ResNet-v2)","metrics":{"Top-1 Accuracy":"77.72"},"uses_additional_data":false,"paper_date":"2021-03-21","paper":"/paper/scanmix-learning-from-severe-label-noise-via","paper_url":"https://arxiv.org/abs/2103.11395v3","paper_title":"ScanMix: Learning from Severe Label Noise via Semantic Clustering and Semi-Supervised Learning","code":"https://github.com/ragavsachdeva/ScanMix","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":27,"model":"ROLT+ (Inception-ResNet-v2)","metrics":{"ImageNet Top-1 Accuracy":"74.64","ImageNet Top-5 Accuracy":"92.48","Top-1 Accuracy":"77.64","Top-5 Accuracy":"92.44"},"uses_additional_data":false,"paper_date":"2021-08-26","paper":"/paper/robust-long-tailed-learning-under-label-noise","paper_url":"https://arxiv.org/abs/2108.11569v1","paper_title":"Robust Long-Tailed Learning under Label Noise","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":28,"model":"CNLCU-S + DivideMix (Inception-ResNet-v2)","metrics":{"Top-1 Accuracy":"77.53"},"uses_additional_data":false,"paper_date":"2021-06-01","paper":"/paper/sample-selection-with-uncertainty-of-losses","paper_url":"https://arxiv.org/abs/2106.00445v1","paper_title":"Sample Selection with Uncertainty of Losses for Learning with Noisy Labels","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":29,"model":"HSA-NRL(Inception-ResNet-v2)","metrics":{"Top-1 Accuracy":"77.52"},"uses_additional_data":false,"paper_date":"2021-12-05","paper":"/paper/hard-sample-aware-noise-robust-learning-for","paper_url":"https://arxiv.org/abs/2112.03694v1","paper_title":"Hard Sample Aware Noise Robust Learning for Histopathology Image Classification","code":"https://github.com/bupt-ai-cz/HSA-NRL","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":30,"model":"CAR","metrics":{"ImageNet Top-1 Accuracy":"74.09","ImageNet Top-5 Accuracy":"92.09","Top-1 Accuracy":"77.41","Top-5 Accuracy":"92.25"},"uses_additional_data":false,"paper_date":"2021-08-18","paper":"/paper/confidence-adaptive-regularization-for-deep","paper_url":"https://arxiv.org/abs/2108.08212v2","paper_title":"Confidence Adaptive Regularization for Deep Learning with Noisy Labels","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":31,"model":"DivideMix (Inception-ResNet-v2)","metrics":{"ImageNet Top-1 Accuracy":"75.20","ImageNet Top-5 Accuracy":"91.64","Top-1 Accuracy":"77.32","Top-5 Accuracy":"91.64"},"uses_additional_data":false,"paper_date":"2020-02-18","paper":"/paper/dividemix-learning-with-noisy-labels-as-semi-1","paper_url":"https://arxiv.org/abs/2002.07394v1","paper_title":"DivideMix: Learning with Noisy Labels as Semi-supervised Learning","code":"https://github.com/LiJunnan1992/DivideMix","n_code_links":2,"official":{"repos":["LiJunnan1992/DivideMix"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]},"syntology":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_samples":2,"n_pointer_only_licence":2,"sample_list":"/paper/dividemix-learning-with-noisy-labels-as-semi-1#ran","syntology_url":"https://syntology.ai/paper/2002.07394","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07394"}}}},{"rank_in_archive_order":32,"model":"NCR (ResNet-50)","metrics":{"Top-1 Accuracy":"77.1"},"uses_additional_data":false,"paper_date":"2022-02-04","paper":"/paper/learning-with-neighbor-consistency-for-noisy-1","paper_url":"https://arxiv.org/abs/2202.02200v2","paper_title":"Learning with Neighbor Consistency for Noisy Labels","code":"https://github.com/google-research/scenic","n_code_links":1,"official":{"repos":["google-research/scenic"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_samples":4,"n_pointer_only_licence":0,"sample_list":"/paper/learning-with-neighbor-consistency-for-noisy-1#ran","syntology_url":"https://syntology.ai/paper/2202.02200","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.02200"}}}},{"rank_in_archive_order":33,"model":"DivideMix (ResNet-50)","metrics":{"ImageNet Top-1 Accuracy":"74.42 ±0.29","ImageNet Top-5 Accuracy":"91.21 ±0.12","Top-1 Accuracy":"76.32 ±0.36","Top-5 Accuracy":"90.65 ±0.16"},"uses_additional_data":false,"paper_date":"2020-02-18","paper":"/paper/dividemix-learning-with-noisy-labels-as-semi-1","paper_url":"https://arxiv.org/abs/2002.07394v1","paper_title":"DivideMix: Learning with Noisy Labels as Semi-supervised Learning","code":"https://github.com/LiJunnan1992/DivideMix","n_code_links":2,"official":{"repos":["LiJunnan1992/DivideMix"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]},"syntology":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_samples":2,"n_pointer_only_licence":2,"sample_list":"/paper/dividemix-learning-with-noisy-labels-as-semi-1#ran","syntology_url":"https://syntology.ai/paper/2002.07394","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07394"}}}},{"rank_in_archive_order":34,"model":"DivideMix (ResNet-18)","metrics":{"Top-1 Accuracy":"76.08"},"uses_additional_data":false,"paper_date":"2020-02-18","paper":"/paper/dividemix-learning-with-noisy-labels-as-semi-1","paper_url":"https://arxiv.org/abs/2002.07394v1","paper_title":"DivideMix: Learning with Noisy Labels as Semi-supervised Learning","code":"https://github.com/LiJunnan1992/DivideMix","n_code_links":2,"official":{"repos":["LiJunnan1992/DivideMix"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]},"syntology":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_samples":2,"n_pointer_only_licence":2,"sample_list":"/paper/dividemix-learning-with-noisy-labels-as-semi-1#ran","syntology_url":"https://syntology.ai/paper/2002.07394","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07394"}}}},{"rank_in_archive_order":35,"model":"MentorMix (Inception-ResNet-v2)","metrics":{"ImageNet Top-1 Accuracy":"72.9","ImageNet Top-5 Accuracy":"91.1","Top-1 Accuracy":"76.0","Top-5 Accuracy":"90.2"},"uses_additional_data":false,"paper_date":"2019-11-21","paper":"/paper/synthetic-vs-real-deep-learning-on-controlled-1","paper_url":"https://arxiv.org/abs/1911.09781v3","paper_title":"Beyond Synthetic Noise: Deep Learning on Controlled Noisy Labels","code":"https://github.com/google-research/google-research/tree/master/mentormix","n_code_links":3,"official":null,"syntology":null},{"rank_in_archive_order":36,"model":"NCT (Inception-ResNet-v2)","metrics":{"ImageNet Top-1 Accuracy":"71.73","ImageNet Top-5 Accuracy":"91.61","Top-1 Accuracy":"75.16","Top-5 Accuracy":"90.77"},"uses_additional_data":false,"paper_date":"2020-09-17","paper":"/paper/noisy-concurrent-training-for-efficient","paper_url":"https://arxiv.org/abs/2009.08325v1","paper_title":"Noisy Concurrent Training for Efficient Learning under Label Noise","code":"https://github.com/NeurAI-Lab/UniNet","n_code_links":2,"official":{"repos":["NeurAI-Lab/NCT"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":1,"n_samples":6,"n_pointer_only_licence":0,"sample_list":"/paper/noisy-concurrent-training-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2009.08325","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.08325"}}}},{"rank_in_archive_order":37,"model":"ODD (Inception-ResNet-v2)","metrics":{"ImageNet Top-1 Accuracy":"66.7","ImageNet Top-5 Accuracy":"86.3","Top-1 Accuracy":"74.6","Top-5 Accuracy":"90.6"},"uses_additional_data":false,"paper_date":"2020-03-24","paper":"/paper/robust-and-on-the-fly-dataset-denoising-for","paper_url":"https://arxiv.org/abs/2003.10647v2","paper_title":"Robust and On-the-fly Dataset Denoising for Image Classification","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":38,"model":"Crust (Inception-ResNet-v2)","metrics":{"ImageNet Top-1 Accuracy":"67.36","ImageNet Top-5 Accuracy":"87.84","Top-1 Accuracy":"72.40","Top-5 Accuracy":"89.56"},"uses_additional_data":false,"paper_date":"2020-11-15","paper":"/paper/coresets-for-robust-training-of-neural","paper_url":"https://arxiv.org/abs/2011.07451v1","paper_title":"Coresets for Robust Training of Neural Networks against Noisy Labels","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":39,"model":"Iterative-CV (Inception-ResNet-v2)","metrics":{"ImageNet Top-1 Accuracy":"61.6","ImageNet Top-5 Accuracy":"85.0","Top-1 Accuracy":"65.2","Top-5 Accuracy":"85.3"},"uses_additional_data":false,"paper_date":"2019-05-13","paper":"/paper/understanding-and-utilizing-deep-neural","paper_url":"https://arxiv.org/abs/1905.05040v1","paper_title":"Understanding and Utilizing Deep Neural Networks Trained with Noisy Labels","code":"https://github.com/chenpf1025/noisy_label_understanding_utilizing","n_code_links":3,"official":{"repos":["chenpf1025/noisy_label_understanding_utilizing"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official","unlocated"]},"syntology":{"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":3,"sample_list":"/paper/understanding-and-utilizing-deep-neural#ran","syntology_url":"https://syntology.ai/paper/1905.05040","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05040"}}}},{"rank_in_archive_order":40,"model":"Co-teaching (Inception-ResNet-v2)","metrics":{"ImageNet Top-1 Accuracy":"61.48","ImageNet Top-5 Accuracy":"84.70","Top-1 Accuracy":"63.58","Top-5 Accuracy":"85.20"},"uses_additional_data":false,"paper_date":"2018-04-18","paper":"/paper/co-teaching-robust-training-of-deep-neural","paper_url":"http://arxiv.org/abs/1804.06872v3","paper_title":"Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labels","code":"https://github.com/bhanML/Co-teaching","n_code_links":5,"official":{"repos":["bhanML/Co-teaching"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"syntology":{"n_ran":7,"n_constructed":0,"n_ran_checked":1,"n_instrument":6,"n_unverified":0,"n_samples":7,"n_pointer_only_licence":7,"sample_list":"/paper/co-teaching-robust-training-of-deep-neural#ran","syntology_url":"https://syntology.ai/paper/1804.06872","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.06872"}}}},{"rank_in_archive_order":41,"model":"D2L (Inception-ResNet-v2)","metrics":{"ImageNet Top-1 Accuracy":"57.80","ImageNet Top-5 Accuracy":"81.36","Top-1 Accuracy":"62.68","Top-5 Accuracy":"84.00"},"uses_additional_data":false,"paper_date":"2018-06-07","paper":"/paper/dimensionality-driven-learning-with-noisy","paper_url":"http://arxiv.org/abs/1806.02612v2","paper_title":"Dimensionality-Driven Learning with Noisy Labels","code":"https://github.com/ansuini/IntrinsicDimDeep","n_code_links":3,"official":null,"syntology":null},{"rank_in_archive_order":42,"model":"F-Correction (Inception-ResNet-v2)","metrics":{"ImageNet Top-1 Accuracy":"57.36","ImageNet Top-5 Accuracy":"82.36","Top-1 Accuracy":"61.12","Top-5 Accuracy":"82.68"},"uses_additional_data":false,"paper_date":"2016-09-13","paper":"/paper/making-deep-neural-networks-robust-to-label","paper_url":"http://arxiv.org/abs/1609.03683v2","paper_title":"Making Deep Neural Networks Robust to Label Noise: a Loss Correction Approach","code":"https://github.com/yikun2019/PENCIL","n_code_links":2,"official":{"repos":["giorgiop/loss-correction"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]},"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":2,"sample_list":"/paper/making-deep-neural-networks-robust-to-label#ran","syntology_url":"https://syntology.ai/paper/1609.03683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.03683"}}}},{"rank_in_archive_order":43,"model":"RTE (Inception-ResNet-v2)","metrics":{"ImageNet Top-1 Accuracy":"80.84","ImageNet Top-5 Accuracy":"97.24"},"uses_additional_data":false,"paper_date":"2021-09-29","paper":"/paper/robust-temporal-ensembling-for-learning-with","paper_url":"https://arxiv.org/abs/2109.14563v1","paper_title":"Robust Temporal Ensembling for Learning with Noisy Labels","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":44,"model":"MentorNet (Inception-ResNet-v2)","metrics":{"ImageNet Top-1 Accuracy":"63.8","ImageNet Top-5 Accuracy":"85.8"},"uses_additional_data":false,"paper_date":"2017-12-14","paper":"/paper/mentornet-learning-data-driven-curriculum-for","paper_url":"http://arxiv.org/abs/1712.05055v2","paper_title":"MentorNet: Learning Data-Driven Curriculum for Very Deep Neural Networks on Corrupted Labels","code":"https://github.com/google/mentornet","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":45,"model":"NCE+RCE (ResNet-50)","metrics":{"ImageNet Top-1 Accuracy":"62.64"},"uses_additional_data":false,"paper_date":"2020-06-24","paper":"/paper/normalized-loss-functions-for-deep-learning","paper_url":"https://arxiv.org/abs/2006.13554v1","paper_title":"Normalized Loss Functions for Deep Learning with Noisy Labels","code":"https://github.com/HanxunH/Active-Passive-Losses","n_code_links":4,"official":{"repos":["HanxunH/Active-Passive-Losses"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]},"syntology":{"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":3,"n_samples":12,"n_pointer_only_licence":0,"sample_list":"/paper/normalized-loss-functions-for-deep-learning#ran","syntology_url":"https://syntology.ai/paper/2006.13554","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.13554"}}}},{"rank_in_archive_order":46,"model":"NCE+MAE (ResNet-50)","metrics":{"ImageNet Top-1 Accuracy":"62.36"},"uses_additional_data":false,"paper_date":"2020-06-24","paper":"/paper/normalized-loss-functions-for-deep-learning","paper_url":"https://arxiv.org/abs/2006.13554v1","paper_title":"Normalized Loss Functions for Deep Learning with Noisy Labels","code":"https://github.com/HanxunH/Active-Passive-Losses","n_code_links":4,"official":{"repos":["HanxunH/Active-Passive-Losses"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]},"syntology":{"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":3,"n_samples":12,"n_pointer_only_licence":0,"sample_list":"/paper/normalized-loss-functions-for-deep-learning#ran","syntology_url":"https://syntology.ai/paper/2006.13554","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.13554"}}}},{"rank_in_archive_order":47,"model":"CDR (Inception-ResNet-v2)","metrics":{"ImageNet Top-1 Accuracy":"61.85"},"uses_additional_data":false,"paper_date":"2021-01-01","paper":"/paper/robust-early-learning-hindering-the","paper_url":"https://openreview.net/forum?id=Eql5b1_hTE4","paper_title":"Robust early-learning: Hindering the memorization of noisy labels","code":null,"n_code_links":0,"official":null,"syntology":null}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"adjudicator":"Claude Opus 5.5","adjudicator_from":"groundwork/59_code_with_papers/LB_EXTRACTOR_PREREG.md (not recorded in lb_measurement.json; the file's frozen_commit, measured_on and counts equal the run the pre-registration records)","adjudicator_sensitivity":[69,70],"adjudicator_specificity":[101,103],"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication by a model (adjudicator) of accepted entries on a held-out split of archive papers, rules frozen before the test; adjudicator_sensitivity and adjudicator_specificity are its own controls as [judged right, of]; it was not measured on the newer papers placed here","measurement_sentence":"Measured before publishing, on held-out archive papers: the extractor was given 883 of them and produced output for 881 (the other 2 had no title and were excluded before any model call, so they are not part of this measurement). A model adjudicator (Claude Opus 5.5), blind to which entries were real, judged 108 of 110 accepted entries correct on those held-out archive papers; its own controls: 69 of 70 archive-confirmed entries judged true, 101 of 103 corrupted copies judged false. It was not measured on the newer papers whose results are placed on this site.","coverage":{"sentence":"Syntology has checked 8,886 of the 18,637 papers on this site that are newer than the archive (for 3,717 of them no archive leaderboard matched the paper's tables, so there was nothing further to check); 733 were read and have nothing to place (arXiv has no HTML version of the paper, or that version has no tables), 41 could not be read (the extractor's reply could not be parsed), and results from the other 8,977 appear after they are checked.","complete":false,"papers_newer_than_archive":18637,"papers_checked":8886,"papers_checked_no_leaderboard_matched":3717,"papers_read_nothing_to_place":733,"papers_could_not_be_read":41,"papers_could_not_be_read_by_status":{"unparseable":41},"papers_extracted_not_yet_verified":0,"boards_without_verdict":3,"papers_not_yet_extracted":8975},"board_status":{"sentence":"Of the 8,888 newer papers whose tables Syntology has read (8,886 checked in full and 2 with a leaderboard still awaiting a verdict), none had this board among the leaderboards the extractor considered for their tables yet (it keeps at most 10 boards per paper and 4 per dataset; the lists of 1,596 of the 8,888 were already full without this board, so if it was crowded out of them it is not counted), so none await a verdict here.","note":"papers, from the extractor's own records, over the newer papers whose tables were read; proposed = no_cell_passed_checks + rejected_by_independent_check + accepted_not_placed + awaiting_verdict + placed; counts, never a rate","eligible":true,"eligible_note":"false when the extractor never considers this board: it loads only boards with archive rows and at least one metric column (lb_extract.py Boards), so no newer paper can be proposed here; archive_rows and metric_columns say which","archive_rows":47,"metric_columns":4,"papers_read":8888,"papers_read_checked":8886,"papers_read_awaiting_verdict":2,"papers_read_verified":8888,"papers_read_not_yet_verified":0,"papers_read_at_candidate_cap":1596,"papers_read_list_full_without_this_board":1596,"candidates":0,"candidates_capped_note":"candidates = papers that had this board among the leaderboards the extractor considered for their tables; the extractor keeps at most 10 per paper and 4 per dataset, so a board crowded out of a paper's list is not counted and candidates is a floor; papers_read_list_full_without_this_board counts the read papers whose list did not hold this board and had reached 10, or held 4 boards of this board's dataset (the only papers that could have crowded it out); papers_read_at_candidate_cap counts, over every board, the papers whose list reached 10","proposed":0,"no_cell_passed_checks":0,"rejected_by_independent_check":0,"accepted_not_placed":0,"awaiting_verdict":0,"placed":0,"placed_entries_listed":0,"file_lines_unreadable_as_read":0,"since_line":"Since the archive (Syntology): none placed; no newer paper judged to report on this board so far"},"judged_to_report":{"heading":"Newer papers whose tables a model judged to report on this benchmark (a model's judgement, not a result; newest first by arXiv id)","judged_by":{"model":"a model","models_as_recorded":[],"a_record_without_a_model":false,"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here","order":"newest first by arXiv id (the identifier's order, not a rank)","outcomes":{"placed":"placed","no_cell_passed_checks":"no cell passed the extractor's checks","refused_by_rule":"refused by a rule","rejected":"rejected by the independent check","accepted_not_placed":"accepted by the independent check but not placed by this site","awaiting":"awaiting a verdict"},"reason_note":"for refused_by_rule, the rules' plain words for the reason codes the record gives (never the quoted or the actual cell text); null for every other outcome","total":0,"shown_on_page":0,"no_cell_split":{"no_cell_passed_checks_in_ledger":0,"rows_refused_by_rule":0,"rows_no_cell_passed_checks":0},"rows":[]},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per row: of M harvested code samples from that row's paper, n_ran executed on a synthesized fixture (n_ran = n_ran_checked + n_instrument; n_instrument counts failures of Syntology's instrument, not of the code); the other M - n_ran are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","key_notes":{"n_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_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)"},"rows_with_graph_line":21,"rows_with_any_sample_ran":18,"rows_with_a_run_with_no_instrument_failure":11,"official":{"state_rule":"the archive's official repositories have samples for this paper that ran: 'official (archive's flag): N ran' (N counts them, instrument failures included); they have samples, none ran: 'official: harvested, nothing ran'; they have no sample for this paper and another sample ran: 'community repositories only' when every sample that ran came from a repository the archive lists for the paper but neither marks official nor records as mentioned in it, or one Syntology harvested outside the archive's links, else 'official: no sample here; runs from other or unrecorded repositories' (a repository named in the paper or found in its text by Syntology, or no repository recorded); otherwise 'official: harvested for another paper' or 'official: not harvested'. Absent when the archive marks no repository official. Official is the archive's is_official flag, not an authorship verdict","flag":"the archive's is_official flag for the paper's code link; not a verdict on who wrote the code","rows_with_an_archive_official_repository":21,"rows_whose_official_repository_has_a_sample_that_ran":17,"rows_whose_official_repository_has_a_run_with_no_instrument_failure":10,"rows_community_repositories_only":1,"rows_runs_from_other_or_unrecorded_repositories":0,"note":"rows[].official, per row with a graph line: repos (marked official in the archive), state, n_ran and n_unverified (samples from those repositories), and ran_from_kinds (the kinds of repository the paper's samples that ran came from; 'unlocated' is no repository recorded)"},"filters":{"ran_modes":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"the page's filters hide rows and never renumber them; they read the Ran cell's counts, the same figures rows[].syntology and rows[].official carry"},"row_route":"rows[].syntology carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","distinct_papers_with_graph_line":15,"distinct_papers_with_any_sample_ran":14,"distinct_papers_with_a_run_with_no_instrument_failure":10,"samples_over_distinct_papers":{"n_ran":60,"n_constructed":6,"n_ran_checked":28,"n_instrument":32,"n_unverified":18,"n_samples":78,"n_pointer_only_licence":33,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":79,"n_constructed":6,"n_ran_checked":36,"n_instrument":43,"n_unverified":26,"n_samples":105,"n_pointer_only_licence":40,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}},"record_sha256":"57eaf74f77e230eeeb3dc0bb53b26a1f50bc09ff2e709b4204f6e2b1c518d3ae","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}