{"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":"/task/binary-classification","name":"Binary Classification","slug":"binary-classification","description_markdown":null,"categories":[{"name":"Computer Vision","url":"/area/computer-vision"},{"name":"Natural Language Processing","url":"/area/natural-language-processing"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":2574,"papers_with_code":710,"benchmarks":4,"benchmark_tables_in_archive":14,"benchmark_tables_shown":14,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":16,"subtasks":6,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/binary-classification-on-fake","slug":"binary-classification-on-fake","dataset":"fake","dataset_url":"/dataset/fake","rows_in_archive":8,"metrics":["AUROC"],"first_row_in_archive_order":{"model":"Trompt + OpenAI embedding","paper_title":"PyTorch Frame: A Modular Framework for Multi-Modal Tabular Learning","paper_url":"/paper/pytorch-frame-a-modular-framework-for-multi","paper_date":"2024-03-31","arxiv_id":"2404.00776","code_links":[{"title":"pyg-team/pytorch-frame","url":"https://github.com/pyg-team/pytorch-frame"}],"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pytorch-frame-a-modular-framework-for-multi#ran","syntology_url":"https://syntology.ai/paper/2404.00776","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.00776"}},"official":{"repos":["pyg-team/pytorch-frame"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/binary-classification-on-kickstarter","slug":"binary-classification-on-kickstarter","dataset":"kickstarter","dataset_url":"/dataset/kickstarter","rows_in_archive":4,"metrics":["AUROC"],"first_row_in_archive_order":{"model":"Trompt + OpenAI embedding","paper_title":"PyTorch Frame: A Modular Framework for Multi-Modal Tabular Learning","paper_url":"/paper/pytorch-frame-a-modular-framework-for-multi","paper_date":"2024-03-31","arxiv_id":"2404.00776","code_links":[{"title":"pyg-team/pytorch-frame","url":"https://github.com/pyg-team/pytorch-frame"}],"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pytorch-frame-a-modular-framework-for-multi#ran","syntology_url":"https://syntology.ai/paper/2404.00776","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.00776"}},"official":{"repos":["pyg-team/pytorch-frame"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/binary-classification-on-glyphnet-dataset","slug":"binary-classification-on-glyphnet-dataset","dataset":"Glyphnet Dataset","dataset_url":null,"rows_in_archive":1,"metrics":["F1 score"],"first_row_in_archive_order":{"model":"Attention based CNN","paper_title":"GlyphNet: Homoglyph domains dataset and detection using attention-based Convolutional Neural Networks","paper_url":"/paper/glyphnet-homoglyph-domains-dataset-and","paper_date":"2023-06-17","arxiv_id":"2306.10392","code_links":[{"title":"tb0hdan/domains","url":"https://github.com/tb0hdan/domains"},{"title":"akshat4112/glyphnet","url":"https://github.com/akshat4112/glyphnet"}],"syntology":null}},{"leaderboard":"/sota/binary-classification-on-tii-ssrc-23","slug":"binary-classification-on-tii-ssrc-23","dataset":"TII-SSRC-23","dataset_url":"/dataset/tii-ssrc-23","rows_in_archive":1,"metrics":["F1-Score"],"first_row_in_archive_order":{"model":"XGBoost","paper_title":"TII-SSRC-23 Dataset: Typological Exploration of Diverse Traffic Patterns for Intrusion Detection","paper_url":"/paper/tii-ssrc-23-dataset-typological-exploration","paper_date":"2023-09-14","arxiv_id":"2310.10661","code_links":[],"syntology":null}},{"leaderboard":null,"slug":"binary-classification-on-dev","dataset":"dev","dataset_url":null,"rows_in_archive":0,"metrics":["Cosine Accuracy","Cosine Accuracy Threshold","Cosine Ap","Cosine F1","Cosine F1 Threshold","Cosine Mcc","Cosine Precision","Cosine Recall"],"first_row_in_archive_order":null},{"leaderboard":null,"slug":"binary-classification-on-fiqa-tr","dataset":"fiqa tr","dataset_url":null,"rows_in_archive":0,"metrics":["Cosine Accuracy","Cosine Accuracy Threshold","Cosine Ap","Cosine F1","Cosine F1 Threshold","Cosine Mcc","Cosine Precision","Cosine Recall"],"first_row_in_archive_order":null},{"leaderboard":null,"slug":"binary-classification-on-msmarco-tr","dataset":"msmarco tr","dataset_url":null,"rows_in_archive":0,"metrics":["Cosine Accuracy","Cosine Accuracy Threshold","Cosine Ap","Cosine F1","Cosine F1 Threshold","Cosine Mcc","Cosine Precision","Cosine Recall"],"first_row_in_archive_order":null},{"leaderboard":null,"slug":"binary-classification-on-nfcorpus-tr","dataset":"nfcorpus tr","dataset_url":null,"rows_in_archive":0,"metrics":["Cosine Accuracy","Cosine Accuracy Threshold","Cosine Ap","Cosine F1","Cosine F1 Threshold","Cosine Mcc","Cosine Precision","Cosine Recall"],"first_row_in_archive_order":null},{"leaderboard":null,"slug":"binary-classification-on-quora-duplicates","dataset":"quora duplicates","dataset_url":null,"rows_in_archive":0,"metrics":["Cosine Accuracy","Cosine Accuracy Threshold","Cosine Ap","Cosine F1","Cosine F1 Threshold","Cosine Mcc","Cosine Precision","Cosine Recall"],"first_row_in_archive_order":null},{"leaderboard":null,"slug":"binary-classification-on-quora-tr","dataset":"quora tr","dataset_url":null,"rows_in_archive":0,"metrics":["Cosine Accuracy","Cosine Accuracy Threshold","Cosine Ap","Cosine F1","Cosine F1 Threshold","Cosine Mcc","Cosine Precision","Cosine Recall"],"first_row_in_archive_order":null},{"leaderboard":null,"slug":"binary-classification-on-sentence","dataset":"sentence transformers paraphrase multilingual MiniLM L12 v2","dataset_url":null,"rows_in_archive":0,"metrics":["Cosine Accuracy","Cosine Accuracy Threshold","Cosine Ap","Cosine F1","Cosine F1 Threshold","Cosine Mcc","Cosine Precision","Cosine Recall"],"first_row_in_archive_order":null},{"leaderboard":null,"slug":"binary-classification-on-snli-tr","dataset":"snli tr","dataset_url":null,"rows_in_archive":0,"metrics":["Cosine Accuracy","Cosine Accuracy Threshold","Cosine Ap","Cosine F1","Cosine F1 Threshold","Cosine Mcc","Cosine Precision","Cosine Recall"],"first_row_in_archive_order":null},{"leaderboard":null,"slug":"binary-classification-on-wmt16","dataset":"wmt16","dataset_url":"/dataset/wmt-2016","rows_in_archive":0,"metrics":["Cosine Accuracy","Cosine Accuracy Threshold","Cosine Ap","Cosine F1","Cosine F1 Threshold","Cosine Mcc","Cosine Precision","Cosine Recall"],"first_row_in_archive_order":null},{"leaderboard":null,"slug":"binary-classification-on-xnli-tr","dataset":"xnli tr","dataset_url":null,"rows_in_archive":0,"metrics":["Cosine Accuracy","Cosine Accuracy Threshold","Cosine Ap","Cosine F1","Cosine F1 Threshold","Cosine Mcc","Cosine Precision","Cosine Recall"],"first_row_in_archive_order":null}],"datasets":[{"url":"/dataset/wmt-2016","name":"WMT 2016","full_name":"","num_papers_in_archive":178},{"url":"/dataset/turingbench","name":"TURINGBENCH","full_name":"","num_papers_in_archive":18},{"url":"/dataset/adult-census-income","name":"Adult Census Income","full_name":"adult_census_income","num_papers_in_archive":6},{"url":"/dataset/inspire","name":"InspiRe","full_name":"Inspiring and non-inspiring posts from Reddit","num_papers_in_archive":2},{"url":"/dataset/kickstarter","name":"kickstarter","full_name":"Funding Successful Projects on Kickstarter","num_papers_in_archive":2},{"url":"/dataset/tii-ssrc-23","name":"TII-SSRC-23","full_name":"","num_papers_in_archive":2},{"url":"/dataset/titanic","name":"Titanic","full_name":"Titanic - Machine Learning from Disaster","num_papers_in_archive":2},{"url":"/dataset/amazon-multilingual-counterfactual-dataset","name":"Amazon Multilingual Counterfactual Dataset (AMCD)","full_name":"","num_papers_in_archive":1},{"url":"/dataset/fake","name":"fake","full_name":"Real / Fake Job Posting Prediction","num_papers_in_archive":1},{"url":"/dataset/student-s-eeg-brain-signal","name":"Student's EEG Brain Signal","full_name":"","num_papers_in_archive":1},{"url":"/dataset/tupye-dataset","name":"TuPyE-Dataset","full_name":"Portuguese Hate Speech Expanded Dataset","num_papers_in_archive":1},{"url":"/dataset/twinsynths","name":"TwinSynths","full_name":"","num_papers_in_archive":1},{"url":"/dataset/autorobust","name":"AutoRobust","full_name":"","num_papers_in_archive":0},{"url":"/dataset/eyepacs-light","name":"EyePACS-light (v1)","full_name":"EyePACS-AIROGS-light-v1","num_papers_in_archive":0},{"url":"/dataset/eyepacs-light-v2","name":"EyePACS-light (v2)","full_name":"EyePACS-AIROGS-light-v2","num_papers_in_archive":0},{"url":"/dataset/smdg","name":"SMDG","full_name":"Standardized Multi-Channel Dataset for Glaucoma","num_papers_in_archive":0}],"subtasks":[{"url":"/task/cancer-no-cancer-per-breast-classification","name":"Cancer-no cancer per breast classification"},{"url":"/task/cancer-no-cancer-per-image-classification","name":"Cancer-no cancer per image classification"},{"url":"/task/cancer-no-cancer-per-view-classification","name":"Cancer-no cancer per view classification"},{"url":"/task/llm-generated-text-detection","name":"LLM-generated Text Detection"},{"url":"/task/stable-mci-vs-progressive-mci","name":"Stable MCI vs Progressive MCI"},{"url":"/task/suspicous-birads-45-no-suspicous-birads-123","name":"Suspicous (BIRADS 4,5)-no suspicous (BIRADS 1,2,3) per image classification"}],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":26,"rows_per_page":100,"shown":100,"of":2574,"of_with_code":710,"tagged_in_all":2574,"counts":{"archive_papers_tagged":2574,"with_a_code_link":710,"where_syntology_ran_a_sample":115,"not_listed_spam_title":0,"listed":2574,"listed_where_code_ran":115,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":94,"every_run_a_failure_of_syntologys_instrument":21,"listed_with_a_run_with_no_instrument_failure":94,"listed_every_run_a_failure_of_syntologys_instrument":21,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/bayesian-regression-and-bitcoin","slug":"bayesian-regression-and-bitcoin","title":"Bayesian regression and Bitcoin","date":"2014-10-06","arxiv_id":"1410.1231","repositories_listed":15,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":3,"n_instrument":7,"n_unverified":3,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":8,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 7 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/bayesian-regression-and-bitcoin#ran","syntology_url":"https://syntology.ai/paper/1410.1231","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1410.1231"}},"official":null}},{"url":"/paper/sampling-generative-networks","slug":"sampling-generative-networks","title":"Sampling Generative Networks","date":"2016-09-14","arxiv_id":"1609.04468","repositories_listed":13,"syntology":{"n":15,"n_ran":15,"n_constructed":0,"n_ran_checked":14,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sampling-generative-networks#ran","syntology_url":"https://syntology.ai/paper/1609.04468","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.04468"}},"official":{"repos":["dribnet/plat"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/modeling-task-relationships-in-multi-task","slug":"modeling-task-relationships-in-multi-task","title":"Modeling Task Relationships in Multi-task Learning with Multi-gate Mixture-of-Experts","date":"2018-07-19","arxiv_id":null,"repositories_listed":11,"syntology":null},{"url":"/paper/wav2vec-unsupervised-pre-training-for-speech","slug":"wav2vec-unsupervised-pre-training-for-speech","title":"wav2vec: Unsupervised Pre-training for Speech Recognition","date":"2019-04-11","arxiv_id":"1904.05862","repositories_listed":7,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/wav2vec-unsupervised-pre-training-for-speech#ran","syntology_url":"https://syntology.ai/paper/1904.05862","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.05862"}},"official":{"repos":["pytorch/fairseq"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/a-neural-network-architecture-combining-gated","slug":"a-neural-network-architecture-combining-gated","title":"A Neural Network Architecture Combining Gated Recurrent Unit (GRU) and Support Vector Machine (SVM) for Intrusion Detection in Network Traffic Data","date":"2017-09-10","arxiv_id":"1709.03082","repositories_listed":5,"syntology":null},{"url":"/paper/cross-database-liveness-detection-insights","slug":"cross-database-liveness-detection-insights","title":"Cross-Database Liveness Detection: Insights from Comparative Biometric Analysis","date":"2024-01-29","arxiv_id":"2401.16232","repositories_listed":4,"syntology":null},{"url":"/paper/how-faithful-is-your-synthetic-data-sample","slug":"how-faithful-is-your-synthetic-data-sample","title":"How Faithful is your Synthetic Data? Sample-level Metrics for Evaluating and Auditing Generative Models","date":"2021-02-17","arxiv_id":"2102.08921","repositories_listed":4,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/how-faithful-is-your-synthetic-data-sample#ran","syntology_url":"https://syntology.ai/paper/2102.08921","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.08921"}},"official":{"repos":["vanderschaarlab/evaluating-generative-models"],"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"]}}},{"url":"/paper/the-hateful-memes-challenge-detecting-hate","slug":"the-hateful-memes-challenge-detecting-hate","title":"The Hateful Memes Challenge: Detecting Hate Speech in Multimodal Memes","date":"2020-05-10","arxiv_id":"2005.04790","repositories_listed":4,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/the-hateful-memes-challenge-detecting-hate#ran","syntology_url":"https://syntology.ai/paper/2005.04790","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.04790"}},"official":{"repos":["facebookresearch/mmf"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/consistent-rank-logits-for-ordinal-regression","slug":"consistent-rank-logits-for-ordinal-regression","title":"Rank consistent ordinal regression for neural networks with application to age estimation","date":"2019-01-20","arxiv_id":"1901.07884","repositories_listed":4,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/consistent-rank-logits-for-ordinal-regression#ran","syntology_url":"https://syntology.ai/paper/1901.07884","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.07884"}},"official":{"repos":["Raschka-research-group/coral-cnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/deepdta-deep-drug-target-binding-affinity","slug":"deepdta-deep-drug-target-binding-affinity","title":"DeepDTA: Deep Drug-Target Binding Affinity Prediction","date":"2018-01-30","arxiv_id":"1801.10193","repositories_listed":4,"syntology":null},{"url":"/paper/salgan-visual-saliency-prediction-with","slug":"salgan-visual-saliency-prediction-with","title":"SalGAN: Visual Saliency Prediction with Generative Adversarial Networks","date":"2017-01-04","arxiv_id":"1701.01081","repositories_listed":4,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/salgan-visual-saliency-prediction-with#ran","syntology_url":"https://syntology.ai/paper/1701.01081","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.01081"}},"official":{"repos":["imatge-upc/salgan"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/ensemble-of-generative-and-discriminative","slug":"ensemble-of-generative-and-discriminative","title":"Ensemble of Generative and Discriminative Techniques for Sentiment Analysis of Movie Reviews","date":"2014-12-17","arxiv_id":"1412.5335","repositories_listed":4,"syntology":null},{"url":"/paper/better-than-classical-the-subtle-art-of","slug":"better-than-classical-the-subtle-art-of","title":"Better than classical? The subtle art of benchmarking quantum machine learning models","date":"2024-03-11","arxiv_id":"2403.07059","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/better-than-classical-the-subtle-art-of#ran","syntology_url":"https://syntology.ai/paper/2403.07059","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.07059"}},"official":{"repos":["xanaduai/qml-benchmarks"],"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"]}}},{"url":"/paper/guardt2i-defending-text-to-image-models-from","slug":"guardt2i-defending-text-to-image-models-from","title":"GuardT2I: Defending Text-to-Image Models from Adversarial Prompts","date":"2024-03-03","arxiv_id":"2403.01446","repositories_listed":3,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":2,"n_instrument":7,"n_unverified":3,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":12,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 7 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/guardt2i-defending-text-to-image-models-from#ran","syntology_url":"https://syntology.ai/paper/2403.01446","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.01446"}},"official":{"repos":["cure-lab/guardt2i"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/a-closer-look-at-auroc-and-auprc-under-class","slug":"a-closer-look-at-auroc-and-auprc-under-class","title":"A Closer Look at AUROC and AUPRC under Class Imbalance","date":"2024-01-11","arxiv_id":"2401.06091","repositories_listed":3,"syntology":{"n":34,"n_ran":25,"n_constructed":0,"n_ran_checked":15,"n_instrument":10,"n_unverified":9,"n_honours":1,"n_violates":1,"n_no_contract":13,"n_pointer_only":21,"phrase":"25 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 1 honoured, 1 violated, 13 with no contract checked; 10 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/a-closer-look-at-auroc-and-auprc-under-class#ran","syntology_url":"https://syntology.ai/paper/2401.06091","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.06091"}},"official":{"repos":["lassehhansen/arxiv-search","hzhang0/auc_bias","mmcdermott/auc_is_all_you_need"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":7,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/paraphrase-types-for-generation-and-detection","slug":"paraphrase-types-for-generation-and-detection","title":"Paraphrase Types for Generation and Detection","date":"2023-10-23","arxiv_id":"2310.14863","repositories_listed":3,"syntology":null},{"url":"/paper/enhancing-mobile-face-anti-spoofing-a-robust","slug":"enhancing-mobile-face-anti-spoofing-a-robust","title":"Enhancing Mobile Face Anti-Spoofing: A Robust Framework for Diverse Attack Types under Screen Flash","date":"2023-08-29","arxiv_id":"2308.15346","repositories_listed":3,"syntology":null},{"url":"/paper/pidray-a-large-scale-x-ray-benchmark-for-real","slug":"pidray-a-large-scale-x-ray-benchmark-for-real","title":"PIDray: A Large-scale X-ray Benchmark for Real-World Prohibited Item Detection","date":"2022-11-19","arxiv_id":"2211.10763","repositories_listed":3,"syntology":null},{"url":"/paper/global-explanation-of-tree-ensembles-models","slug":"global-explanation-of-tree-ensembles-models","title":"Explanations Based on Item Response Theory (eXirt): A Model-Specific Method to Explain Tree-Ensemble Model in Trust Perspective","date":"2022-10-18","arxiv_id":"2210.09933","repositories_listed":3,"syntology":null},{"url":"/paper/generalizable-method-for-face-anti-spoofing","slug":"generalizable-method-for-face-anti-spoofing","title":"Generalizable Method for Face Anti-Spoofing with Semi-Supervised Learning","date":"2022-06-13","arxiv_id":"2206.06510","repositories_listed":3,"syntology":null},{"url":"/paper/fedlearn-algo-a-flexible-open-source-privacy","slug":"fedlearn-algo-a-flexible-open-source-privacy","title":"Fedlearn-Algo: A flexible open-source privacy-preserving machine learning platform","date":"2021-07-08","arxiv_id":"2107.04129","repositories_listed":3,"syntology":null},{"url":"/paper/strong-optimal-classification-trees","slug":"strong-optimal-classification-trees","title":"Strong Optimal Classification Trees","date":"2021-03-29","arxiv_id":"2103.15965","repositories_listed":3,"syntology":null},{"url":"/paper/efficient-and-compact-convolutional-neural","slug":"efficient-and-compact-convolutional-neural","title":"Efficient and Compact Convolutional Neural Network Architectures for Non-temporal Real-time Fire Detection","date":"2020-10-17","arxiv_id":"2010.08833","repositories_listed":3,"syntology":null},{"url":"/paper/uniformizing-techniques-to-process-ct-scans","slug":"uniformizing-techniques-to-process-ct-scans","title":"Uniformizing Techniques to Process CT scans with 3D CNNs for Tuberculosis Prediction","date":"2020-07-26","arxiv_id":"2007.13224","repositories_listed":3,"syntology":null},{"url":"/paper/the-mcc-f1-curve-a-performance-evaluation","slug":"the-mcc-f1-curve-a-performance-evaluation","title":"The MCC-F1 curve: a performance evaluation technique for binary classification","date":"2020-06-17","arxiv_id":"2006.11278","repositories_listed":3,"syntology":null},{"url":"/paper/on-the-learning-property-of-logistic-and","slug":"on-the-learning-property-of-logistic-and","title":"On the Learning Property of Logistic and Softmax Losses for Deep Neural Networks","date":"2020-03-04","arxiv_id":"2003.02309","repositories_listed":3,"syntology":null},{"url":"/paper/beyond-temperature-scaling-obtaining-well","slug":"beyond-temperature-scaling-obtaining-well","title":"Beyond temperature scaling: Obtaining well-calibrated multiclass probabilities with Dirichlet calibration","date":"2019-10-28","arxiv_id":"1910.12656","repositories_listed":3,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/beyond-temperature-scaling-obtaining-well#ran","syntology_url":"https://syntology.ai/paper/1910.12656","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.12656"}},"official":null}},{"url":"/paper/gaussianprocessesjl-a-nonparametric-bayes","slug":"gaussianprocessesjl-a-nonparametric-bayes","title":"GaussianProcesses.jl: A Nonparametric Bayes package for the Julia Language","date":"2018-12-21","arxiv_id":"1812.09064","repositories_listed":3,"syntology":null},{"url":"/paper/a-reductions-approach-to-fair-classification","slug":"a-reductions-approach-to-fair-classification","title":"A Reductions Approach to Fair Classification","date":"2018-03-06","arxiv_id":"1803.02453","repositories_listed":3,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-reductions-approach-to-fair-classification#ran","syntology_url":"https://syntology.ai/paper/1803.02453","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.02453"}},"official":null}},{"url":"/paper/the-marginal-value-of-adaptive-gradient","slug":"the-marginal-value-of-adaptive-gradient","title":"The Marginal Value of Adaptive Gradient Methods in Machine Learning","date":"2017-05-23","arxiv_id":"1705.08292","repositories_listed":3,"syntology":null},{"url":"/paper/learning-with-confident-examples-rank-pruning","slug":"learning-with-confident-examples-rank-pruning","title":"Learning with Confident Examples: Rank Pruning for Robust Classification with Noisy Labels","date":"2017-05-04","arxiv_id":"1705.01936","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-with-confident-examples-rank-pruning#ran","syntology_url":"https://syntology.ai/paper/1705.01936","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.01936"}},"official":{"repos":["cgnorthcutt/rankpruning"],"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"]}}},{"url":"/paper/text-classification-improved-by-integrating","slug":"text-classification-improved-by-integrating","title":"Text Classification Improved by Integrating Bidirectional LSTM with Two-dimensional Max Pooling","date":"2016-11-21","arxiv_id":"1611.06639","repositories_listed":3,"syntology":null},{"url":"/paper/predicting-domain-generation-algorithms-with","slug":"predicting-domain-generation-algorithms-with","title":"Predicting Domain Generation Algorithms with Long Short-Term Memory Networks","date":"2016-11-02","arxiv_id":"1611.00791","repositories_listed":3,"syntology":null},{"url":"/paper/distributed-and-parallel-time-series-feature","slug":"distributed-and-parallel-time-series-feature","title":"Distributed and parallel time series feature extraction for industrial big data applications","date":"2016-10-25","arxiv_id":"1610.07717","repositories_listed":3,"syntology":null},{"url":"/paper/revisiting-visual-question-answering","slug":"revisiting-visual-question-answering","title":"Revisiting Visual Question Answering Baselines","date":"2016-06-27","arxiv_id":"1606.08390","repositories_listed":3,"syntology":null},{"url":"/paper/notes-on-noise-contrastive-estimation-and","slug":"notes-on-noise-contrastive-estimation-and","title":"Notes on Noise Contrastive Estimation and Negative Sampling","date":"2014-10-30","arxiv_id":"1410.8251","repositories_listed":3,"syntology":null},{"url":"/paper/2506-08762","slug":"2506-08762","title":"EDINET-Bench: Evaluating LLMs on Complex Financial Tasks using Japanese Financial Statements","date":"2025-06-10","arxiv_id":"2506.08762","repositories_listed":2,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/2506-08762#ran","syntology_url":"https://syntology.ai/paper/2506.08762","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.08762"}},"official":{"repos":["sakanaai/edinet-bench","sakanaai/edinet2dataset"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/feature-selection-gates-with-gradient-routing","slug":"feature-selection-gates-with-gradient-routing","title":"Feature Selection Gates with Gradient Routing for Endoscopic Image Computing","date":"2024-10-07","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/tabkanet-tabular-data-modelling-with","slug":"tabkanet-tabular-data-modelling-with","title":"TabKANet: Tabular Data Modeling with Kolmogorov-Arnold Network and Transformer","date":"2024-09-13","arxiv_id":"2409.08806","repositories_listed":2,"syntology":null},{"url":"/paper/acrosticsleuth-probabilistic-identification","slug":"acrosticsleuth-probabilistic-identification","title":"AcrosticSleuth: Probabilistic Identification and Ranking of Acrostics in Multilingual Corpora","date":"2024-08-08","arxiv_id":"2408.04427","repositories_listed":2,"syntology":null},{"url":"/paper/expanding-the-horizon-enabling-hybrid-quantum","slug":"expanding-the-horizon-enabling-hybrid-quantum","title":"Expanding the Horizon: Enabling Hybrid Quantum Transfer Learning for Long-Tailed Chest X-Ray Classification","date":"2024-04-30","arxiv_id":"2405.00156","repositories_listed":2,"syntology":null},{"url":"/paper/consistent-algorithms-for-multi-label","slug":"consistent-algorithms-for-multi-label","title":"Consistent algorithms for multi-label classification with macro-at-$k$ metrics","date":"2024-01-29","arxiv_id":"2401.16594","repositories_listed":2,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/consistent-algorithms-for-multi-label#ran","syntology_url":"https://syntology.ai/paper/2401.16594","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.16594"}},"official":{"repos":["mwydmuch/xcolumns"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/category-wise-fine-tuning-for-image-multi","slug":"category-wise-fine-tuning-for-image-multi","title":"Category-Wise Fine-Tuning for Image Multi-label Classification with Partial Labels","date":"2023-11-27","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/a-comprehensive-python-library-for-deep","slug":"a-comprehensive-python-library-for-deep","title":"A Comprehensive Python Library for Deep Learning-Based Event Detection in Multivariate Time Series Data and Information Retrieval in NLP","date":"2023-10-25","arxiv_id":"2310.16485","repositories_listed":2,"syntology":null},{"url":"/paper/testing-the-consistency-of-performance-scores","slug":"testing-the-consistency-of-performance-scores","title":"Testing the Consistency of Performance Scores Reported for Binary Classification Problems","date":"2023-10-19","arxiv_id":"2310.12527","repositories_listed":2,"syntology":null},{"url":"/paper/dedode-detect-don-t-describe-describe-don-t","slug":"dedode-detect-don-t-describe-describe-don-t","title":"DeDoDe: Detect, Don't Describe -- Describe, Don't Detect for Local Feature Matching","date":"2023-08-16","arxiv_id":"2308.08479","repositories_listed":2,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/dedode-detect-don-t-describe-describe-don-t#ran","syntology_url":"https://syntology.ai/paper/2308.08479","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.08479"}},"official":{"repos":["parskatt/dedode"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/beyond-auroc-co-for-evaluating-out-of","slug":"beyond-auroc-co-for-evaluating-out-of","title":"Beyond AUROC & co. for evaluating out-of-distribution detection performance","date":"2023-06-26","arxiv_id":"2306.14658","repositories_listed":2,"syntology":null},{"url":"/paper/glyphnet-homoglyph-domains-dataset-and","slug":"glyphnet-homoglyph-domains-dataset-and","title":"GlyphNet: Homoglyph domains dataset and detection using attention-based Convolutional Neural Networks","date":"2023-06-17","arxiv_id":"2306.10392","repositories_listed":2,"syntology":null},{"url":"/paper/daccord-un-jeu-de-donnees-pour-la-detection","slug":"daccord-un-jeu-de-donnees-pour-la-detection","title":"DACCORD : un jeu de données pour la Détection Automatique d'énonCés COntRaDictoires en français","date":"2023-06-08","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/evaluating-factual-consistency-of-summaries","slug":"evaluating-factual-consistency-of-summaries","title":"Evaluating Factual Consistency of Summaries with Large Language Models","date":"2023-05-23","arxiv_id":"2305.14069","repositories_listed":2,"syntology":null},{"url":"/paper/neuro-symbolic-rule-learning-in-real-world","slug":"neuro-symbolic-rule-learning-in-real-world","title":"Neuro-symbolic Rule Learning in Real-world Classification Tasks","date":"2023-03-29","arxiv_id":"2303.16674","repositories_listed":2,"syntology":null},{"url":"/paper/masked-relation-learning-for-deepfake","slug":"masked-relation-learning-for-deepfake","title":"Masked Relation Learning for DeepFake Detection","date":"2023-02-27","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/rs-del-edit-distance-robustness-certificates-1","slug":"rs-del-edit-distance-robustness-certificates-1","title":"RS-Del: Edit Distance Robustness Certificates for Sequence Classifiers via Randomized Deletion","date":"2023-01-31","arxiv_id":"2302.01757","repositories_listed":2,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":3,"n_honours":3,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 3 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/rs-del-edit-distance-robustness-certificates-1#ran","syntology_url":"https://syntology.ai/paper/2302.01757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.01757"}},"official":{"repos":["dovermore/randomized-deletion"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/aggregating-layers-for-deepfake-detection","slug":"aggregating-layers-for-deepfake-detection","title":"Aggregating Layers for Deepfake Detection","date":"2022-10-11","arxiv_id":"2210.05478","repositories_listed":2,"syntology":null},{"url":"/paper/te2rules-extracting-rule-lists-from-tree","slug":"te2rules-extracting-rule-lists-from-tree","title":"TE2Rules: Explaining Tree Ensembles using Rules","date":"2022-06-29","arxiv_id":"2206.14359","repositories_listed":2,"syntology":null},{"url":"/paper/defending-against-reconstruction-attacks","slug":"defending-against-reconstruction-attacks","title":"Defending against Reconstruction Attacks through Differentially Private Federated Learning for Classification of Heterogeneous Chest X-Ray Data","date":"2022-05-06","arxiv_id":"2205.03168","repositories_listed":2,"syntology":null},{"url":"/paper/masked-discrimination-for-self-supervised","slug":"masked-discrimination-for-self-supervised","title":"Masked Discrimination for Self-Supervised Learning on Point Clouds","date":"2022-03-21","arxiv_id":"2203.11183","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/masked-discrimination-for-self-supervised#ran","syntology_url":"https://syntology.ai/paper/2203.11183","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.11183"}},"official":{"repos":["haotian-liu/maskpoint"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/the-gatedtabtransformer-an-enhanced-deep","slug":"the-gatedtabtransformer-an-enhanced-deep","title":"The GatedTabTransformer. An enhanced deep learning architecture for tabular modeling","date":"2022-01-01","arxiv_id":"2201.00199","repositories_listed":2,"syntology":null},{"url":"/paper/personalized-federated-learning-through-local","slug":"personalized-federated-learning-through-local","title":"Personalized Federated Learning through Local Memorization","date":"2021-11-17","arxiv_id":"2111.09360","repositories_listed":2,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/personalized-federated-learning-through-local#ran","syntology_url":"https://syntology.ai/paper/2111.09360","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.09360"}},"official":{"repos":["omarfoq/knn-per"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/benchmarking-multimodal-automl-for-tabular","slug":"benchmarking-multimodal-automl-for-tabular","title":"Benchmarking Multimodal AutoML for Tabular Data with Text Fields","date":"2021-11-04","arxiv_id":"2111.02705","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/benchmarking-multimodal-automl-for-tabular#ran","syntology_url":"https://syntology.ai/paper/2111.02705","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.02705"}},"official":{"repos":["sxjscience/automl_multimodal_benchmark","awslabs/autogluon"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/universally-rank-consistent-ordinal-1","slug":"universally-rank-consistent-ordinal-1","title":"Universally Rank Consistent Ordinal Regression in Neural Networks","date":"2021-10-14","arxiv_id":"2110.07470","repositories_listed":2,"syntology":null},{"url":"/paper/gccad-graph-contrastive-coding-for-anomaly","slug":"gccad-graph-contrastive-coding-for-anomaly","title":"Graph Contrastive Learning for Anomaly Detection","date":"2021-08-17","arxiv_id":"2108.07516","repositories_listed":2,"syntology":null},{"url":"/paper/optimizing-roc-curves-with-a-sort-based","slug":"optimizing-roc-curves-with-a-sort-based","title":"Optimizing ROC Curves with a Sort-Based Surrogate Loss Function for Binary Classification and Changepoint Detection","date":"2021-07-02","arxiv_id":"2107.01285","repositories_listed":2,"syntology":null},{"url":"/paper/predicting-gender-of-brazilian-names-using","slug":"predicting-gender-of-brazilian-names-using","title":"Predicting Gender by First Name Using Character-level Machine Learning","date":"2021-06-18","arxiv_id":"2106.10156","repositories_listed":2,"syntology":null},{"url":"/paper/localization-of-facial-images-manipulation-in","slug":"localization-of-facial-images-manipulation-in","title":"Localization of Facial Images Manipulation in Digital Forensics via Convolutional Neural Networks","date":"2021-05-28","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/aerial-imagery-pile-burn-detection-using-deep","slug":"aerial-imagery-pile-burn-detection-using-deep","title":"Aerial Imagery Pile burn detection using Deep Learning: the FLAME dataset","date":"2020-12-28","arxiv_id":"2012.14036","repositories_listed":2,"syntology":null},{"url":"/paper/upb-at-fincausal-2020-tasks-1-2-causality","slug":"upb-at-fincausal-2020-tasks-1-2-causality","title":"UPB at FinCausal-2020, Tasks 1 & 2: Causality Analysis in Financial Documents using Pretrained Language Models","date":"2020-12-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/rent-repeated-elastic-net-technique-for","slug":"rent-repeated-elastic-net-technique-for","title":"RENT -- Repeated Elastic Net Technique for Feature Selection","date":"2020-09-27","arxiv_id":"2009.12780","repositories_listed":2,"syntology":null},{"url":"/paper/a-rigorous-machine-learning-analysis-pipeline","slug":"a-rigorous-machine-learning-analysis-pipeline","title":"A Rigorous Machine Learning Analysis Pipeline for Biomedical Binary Classification: Application in Pancreatic Cancer Nested Case-control Studies with Implications for Bias Assessments","date":"2020-08-28","arxiv_id":"2008.12829","repositories_listed":2,"syntology":null},{"url":"/paper/hybrid-deep-learning-gaussian-process-for","slug":"hybrid-deep-learning-gaussian-process-for","title":"Hybrid Deep Learning Gaussian Process for Diabetic Retinopathy Diagnosis and Uncertainty Quantification","date":"2020-07-29","arxiv_id":"2007.14994","repositories_listed":2,"syntology":null},{"url":"/paper/gesture-recognition-for-initiating-human-to","slug":"gesture-recognition-for-initiating-human-to","title":"Gesture Recognition for Initiating Human-to-Robot Handovers","date":"2020-07-20","arxiv_id":"2007.09945","repositories_listed":2,"syntology":null},{"url":"/paper/acfd-asymmetric-cartoon-face-detector","slug":"acfd-asymmetric-cartoon-face-detector","title":"ACFD: Asymmetric Cartoon Face Detector","date":"2020-07-02","arxiv_id":"2007.00899","repositories_listed":2,"syntology":null},{"url":"/paper/achieving-robustness-in-classification-using","slug":"achieving-robustness-in-classification-using","title":"Achieving robustness in classification using optimal transport with hinge regularization","date":"2020-06-11","arxiv_id":"2006.06520","repositories_listed":2,"syntology":null},{"url":"/paper/is-deep-learning-necessary-for-simple","slug":"is-deep-learning-necessary-for-simple","title":"Is deep learning necessary for simple classification tasks?","date":"2020-06-11","arxiv_id":"2006.06730","repositories_listed":2,"syntology":null},{"url":"/paper/seeing-the-whole-patient-using-multi-label","slug":"seeing-the-whole-patient-using-multi-label","title":"Seeing The Whole Patient: Using Multi-Label Medical Text Classification Techniques to Enhance Predictions of Medical Codes","date":"2020-03-29","arxiv_id":"2004.00430","repositories_listed":2,"syntology":null},{"url":"/paper/191201956","slug":"191201956","title":"Receiver operating characteristic (ROC) movies, universal ROC (UROC) curves, and coefficient of predictive ability (CPA)","date":"2019-11-29","arxiv_id":"1912.01956","repositories_listed":2,"syntology":null},{"url":"/paper/ward2icu-a-vital-signs-dataset-of-inpatients","slug":"ward2icu-a-vital-signs-dataset-of-inpatients","title":"Ward2ICU: A Vital Signs Dataset of Inpatients from the General Ward","date":"2019-10-02","arxiv_id":"1910.00752","repositories_listed":2,"syntology":null},{"url":"/paper/epp-interpretable-score-of-model-predictive","slug":"epp-interpretable-score-of-model-predictive","title":"EPP: interpretable score of model predictive power","date":"2019-08-24","arxiv_id":"1908.09213","repositories_listed":2,"syntology":null},{"url":"/paper/matching-images-and-text-with-multi-modal","slug":"matching-images-and-text-with-multi-modal","title":"Matching Images and Text with Multi-modal Tensor Fusion and Re-ranking","date":"2019-08-12","arxiv_id":"1908.04011","repositories_listed":2,"syntology":null},{"url":"/paper/discriminative-active-learning-1","slug":"discriminative-active-learning-1","title":"Discriminative Active Learning","date":"2019-07-15","arxiv_id":"1907.06347","repositories_listed":2,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/discriminative-active-learning-1#ran","syntology_url":"https://syntology.ai/paper/1907.06347","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.06347"}},"official":{"repos":["dsgissin/DiscriminativeActiveLearning"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/learning-convolutional-transforms-for-lossy","slug":"learning-convolutional-transforms-for-lossy","title":"Learning Convolutional Transforms for Lossy Point Cloud Geometry Compression","date":"2019-03-20","arxiv_id":"1903.08548","repositories_listed":2,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/learning-convolutional-transforms-for-lossy#ran","syntology_url":"https://syntology.ai/paper/1903.08548","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.08548"}},"official":{"repos":["mauriceqch/pcc_geo_cnn"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-generative-learning-via-variational","slug":"deep-generative-learning-via-variational","title":"Deep Generative Learning via Variational Gradient Flow","date":"2019-01-24","arxiv_id":"1901.08469","repositories_listed":2,"syntology":null},{"url":"/paper/iris-presentation-attack-detection-based-on","slug":"iris-presentation-attack-detection-based-on","title":"Iris Presentation Attack Detection Based on Photometric Stereo Features","date":"2018-11-18","arxiv_id":"1811.07252","repositories_listed":2,"syntology":null},{"url":"/paper/adapting-multi-armed-bandits-policies-to","slug":"adapting-multi-armed-bandits-policies-to","title":"Adapting multi-armed bandits policies to contextual bandits scenarios","date":"2018-11-11","arxiv_id":"1811.04383","repositories_listed":2,"syntology":{"n":5,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 5 unverified","sample_list":"/paper/adapting-multi-armed-bandits-policies-to#ran","syntology_url":"https://syntology.ai/paper/1811.04383","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.04383"}},"official":{"repos":["david-cortes/contextualbandits"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":[]}}},{"url":"/paper/where-is-your-evidence-improving-fact","slug":"where-is-your-evidence-improving-fact","title":"Where is Your Evidence: Improving Fact-checking by Justification Modeling","date":"2018-11-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/generative-adversarial-active-learning-for","slug":"generative-adversarial-active-learning-for","title":"Generative Adversarial Active Learning for Unsupervised Outlier Detection","date":"2018-09-28","arxiv_id":"1809.10816","repositories_listed":2,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/generative-adversarial-active-learning-for#ran","syntology_url":"https://syntology.ai/paper/1809.10816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.10816"}},"official":{"repos":["leibinghe/GAAL-based-outlier-detection"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/boosting-binary-optimization-via-binary","slug":"boosting-binary-optimization-via-binary","title":"Boosting Binary Optimization via Binary Classification: A Case Study of Job Shop Scheduling","date":"2018-08-31","arxiv_id":"1808.10813","repositories_listed":2,"syntology":null},{"url":"/paper/training-classifiers-with-natural-language","slug":"training-classifiers-with-natural-language","title":"Training Classifiers with Natural Language Explanations","date":"2018-05-10","arxiv_id":"1805.03818","repositories_listed":2,"syntology":null},{"url":"/paper/unsupervised-evaluation-and-weighted","slug":"unsupervised-evaluation-and-weighted","title":"Unsupervised Evaluation and Weighted Aggregation of Ranked Predictions","date":"2018-02-13","arxiv_id":"1802.04684","repositories_listed":2,"syntology":null},{"url":"/paper/fast-meta-learning-for-adaptive-hierarchical","slug":"fast-meta-learning-for-adaptive-hierarchical","title":"Fast Meta-Learning for Adaptive Hierarchical Classifier Design","date":"2017-11-09","arxiv_id":"1711.03512","repositories_listed":2,"syntology":null},{"url":"/paper/penalizing-unfairness-in-binary","slug":"penalizing-unfairness-in-binary","title":"Penalizing Unfairness in Binary Classification","date":"2017-06-30","arxiv_id":"1707.00044","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/penalizing-unfairness-in-binary#ran","syntology_url":"https://syntology.ai/paper/1707.00044","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.00044"}},"official":{"repos":["jjgold012/lab-project-fairness"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-single-class-classification-and-the","slug":"fast-single-class-classification-and-the","title":"Fast Single-Class Classification and the Principle of Logit Separation","date":"2017-05-29","arxiv_id":"1705.10246","repositories_listed":2,"syntology":null},{"url":"/paper/adaptive-neural-networks-for-efficient","slug":"adaptive-neural-networks-for-efficient","title":"Adaptive Neural Networks for Efficient Inference","date":"2017-02-25","arxiv_id":"1702.07811","repositories_listed":2,"syntology":null},{"url":"/paper/spatially-supervised-recurrent-convolutional","slug":"spatially-supervised-recurrent-convolutional","title":"Spatially Supervised Recurrent Convolutional Neural Networks for Visual Object Tracking","date":"2016-07-19","arxiv_id":"1607.05781","repositories_listed":2,"syntology":null},{"url":"/paper/adanet-adaptive-structural-learning-of","slug":"adanet-adaptive-structural-learning-of","title":"AdaNet: Adaptive Structural Learning of Artificial Neural Networks","date":"2016-07-05","arxiv_id":"1607.01097","repositories_listed":2,"syntology":null},{"url":"/paper/precision-recall-gain-curves-pr-analysis-done","slug":"precision-recall-gain-curves-pr-analysis-done","title":"Precision-Recall-Gain Curves: PR Analysis Done Right","date":"2015-12-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/learning-visual-groups-from-co-occurrences-in","slug":"learning-visual-groups-from-co-occurrences-in","title":"Learning visual groups from co-occurrences in space and time","date":"2015-11-21","arxiv_id":"1511.06811","repositories_listed":2,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/learning-visual-groups-from-co-occurrences-in#ran","syntology_url":"https://syntology.ai/paper/1511.06811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.06811"}},"official":null}},{"url":"/paper/learning-multi-domain-convolutional-neural","slug":"learning-multi-domain-convolutional-neural","title":"Learning Multi-Domain Convolutional Neural Networks for Visual Tracking","date":"2015-10-27","arxiv_id":"1510.07945","repositories_listed":2,"syntology":null},{"url":"/paper/stereo-matching-by-training-a-convolutional","slug":"stereo-matching-by-training-a-convolutional","title":"Stereo Matching by Training a Convolutional Neural Network to Compare Image Patches","date":"2015-10-20","arxiv_id":"1510.05970","repositories_listed":2,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/stereo-matching-by-training-a-convolutional#ran","syntology_url":"https://syntology.ai/paper/1510.05970","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1510.05970"}},"official":{"repos":["jzbontar/mc-cnn"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/inverse-scene-text-removal","slug":"inverse-scene-text-removal","title":"Inverse Scene Text Removal","date":"2025-06-26","arxiv_id":"2506.21002","repositories_listed":1,"syntology":null}],"syntology_records":27,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"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; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":115,"papers_where_code_ran_first_page":"/task/binary-classification/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":26,"url":"/task/binary-classification/papers/2","json":"/task/binary-classification/papers/2.json","rows":100},{"order":"archive","page":3,"of":26,"url":"/task/binary-classification/papers/3","json":"/task/binary-classification/papers/3.json","rows":100},{"order":"archive","page":4,"of":26,"url":"/task/binary-classification/papers/4","json":"/task/binary-classification/papers/4.json","rows":100},{"order":"archive","page":5,"of":26,"url":"/task/binary-classification/papers/5","json":"/task/binary-classification/papers/5.json","rows":100},{"order":"archive","page":6,"of":26,"url":"/task/binary-classification/papers/6","json":"/task/binary-classification/papers/6.json","rows":100},{"order":"archive","page":7,"of":26,"url":"/task/binary-classification/papers/7","json":"/task/binary-classification/papers/7.json","rows":100},{"order":"archive","page":8,"of":26,"url":"/task/binary-classification/papers/8","json":"/task/binary-classification/papers/8.json","rows":100},{"order":"archive","page":9,"of":26,"url":"/task/binary-classification/papers/9","json":"/task/binary-classification/papers/9.json","rows":100},{"order":"archive","page":10,"of":26,"url":"/task/binary-classification/papers/10","json":"/task/binary-classification/papers/10.json","rows":100},{"order":"archive","page":11,"of":26,"url":"/task/binary-classification/papers/11","json":"/task/binary-classification/papers/11.json","rows":100},{"order":"archive","page":12,"of":26,"url":"/task/binary-classification/papers/12","json":"/task/binary-classification/papers/12.json","rows":100},{"order":"archive","page":13,"of":26,"url":"/task/binary-classification/papers/13","json":"/task/binary-classification/papers/13.json","rows":100},{"order":"archive","page":14,"of":26,"url":"/task/binary-classification/papers/14","json":"/task/binary-classification/papers/14.json","rows":100},{"order":"archive","page":15,"of":26,"url":"/task/binary-classification/papers/15","json":"/task/binary-classification/papers/15.json","rows":100},{"order":"archive","page":16,"of":26,"url":"/task/binary-classification/papers/16","json":"/task/binary-classification/papers/16.json","rows":100},{"order":"archive","page":17,"of":26,"url":"/task/binary-classification/papers/17","json":"/task/binary-classification/papers/17.json","rows":100},{"order":"archive","page":18,"of":26,"url":"/task/binary-classification/papers/18","json":"/task/binary-classification/papers/18.json","rows":100},{"order":"archive","page":19,"of":26,"url":"/task/binary-classification/papers/19","json":"/task/binary-classification/papers/19.json","rows":100},{"order":"archive","page":20,"of":26,"url":"/task/binary-classification/papers/20","json":"/task/binary-classification/papers/20.json","rows":100},{"order":"archive","page":21,"of":26,"url":"/task/binary-classification/papers/21","json":"/task/binary-classification/papers/21.json","rows":100},{"order":"archive","page":22,"of":26,"url":"/task/binary-classification/papers/22","json":"/task/binary-classification/papers/22.json","rows":100},{"order":"archive","page":23,"of":26,"url":"/task/binary-classification/papers/23","json":"/task/binary-classification/papers/23.json","rows":100},{"order":"archive","page":24,"of":26,"url":"/task/binary-classification/papers/24","json":"/task/binary-classification/papers/24.json","rows":100},{"order":"archive","page":25,"of":26,"url":"/task/binary-classification/papers/25","json":"/task/binary-classification/papers/25.json","rows":100},{"order":"archive","page":26,"of":26,"url":"/task/binary-classification/papers/26","json":"/task/binary-classification/papers/26.json","rows":74},{"order":"ran","page":1,"of":2,"url":"/task/binary-classification/papers/ran/1","json":"/task/binary-classification/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":2,"url":"/task/binary-classification/papers/ran/2","json":"/task/binary-classification/papers/ran/2.json","rows":15}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","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)"},"row_route":"each syntology object on a benchmark's first row and on a paper 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"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"254a33f7f6ed2605fc769b048b8a4d6109aa70507c862c7625170b110ea47483","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}