{"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/classification","name":"General Classification","slug":"classification","description_markdown":"Algorithms trying to solve the general task of classification.","categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":14581,"papers_with_code":3945,"benchmarks":11,"benchmark_tables_in_archive":11,"benchmark_tables_shown":11,"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":8,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/general-classification-on-shrutime","slug":"general-classification-on-shrutime","dataset":"Shrutime","dataset_url":null,"rows_in_archive":5,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CatBoost","paper_title":"Hopular: Modern Hopfield Networks for Tabular Data","paper_url":"/paper/hopular-modern-hopfield-networks-for-tabular-1","paper_date":"2022-06-01","arxiv_id":"2206.00664","code_links":[{"title":"ml-jku/hopular","url":"https://github.com/ml-jku/hopular"}],"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/hopular-modern-hopfield-networks-for-tabular-1#ran","syntology_url":"https://syntology.ai/paper/2206.00664","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.00664"}},"official":{"repos":["ml-jku/hopular"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}}},{"leaderboard":"/sota/classification-on-xor","slug":"classification-on-xor","dataset":"XOR","dataset_url":null,"rows_in_archive":4,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"KNN","paper_title":"SafeML: Safety Monitoring of Machine Learning Classifiers through Statistical Difference Measure","paper_url":"/paper/safeml-safety-monitoring-of-machine-learning","paper_date":"2020-05-27","arxiv_id":"2005.13166","code_links":[{"title":"ISorokos/SafeML","url":"https://github.com/ISorokos/SafeML"},{"title":"n-akram/SafeML","url":"https://github.com/n-akram/SafeML"}],"syntology":null}},{"leaderboard":"/sota/general-classification-on-iris","slug":"general-classification-on-iris","dataset":"iris","dataset_url":"/dataset/iris-1","rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"XBNET","paper_title":"XBNet : An Extremely Boosted Neural Network","paper_url":"/paper/xbnet-an-extremely-boosted-neural-network","paper_date":"2021-06-09","arxiv_id":"2106.05239","code_links":[{"title":"tusharsarkar3/XBNet","url":"https://github.com/tusharsarkar3/XBNet"}],"syntology":null}},{"leaderboard":"/sota/classification-on-wine","slug":"classification-on-wine","dataset":"Wine","dataset_url":"/dataset/wine","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"MONT3","paper_title":"Multi-Objective Optimisation of Multi-Output Neural Trees","paper_url":"/paper/multi-objective-optimisation-of-multi-output","paper_date":"2020-10-09","arxiv_id":"2010.04524","code_links":[{"title":"vojha-code/multi-output-neural-tree","url":"https://github.com/vojha-code/multi-output-neural-tree"}],"syntology":null}},{"leaderboard":"/sota/general-classification-on-activity","slug":"general-classification-on-activity","dataset":"Activity","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CAE","paper_title":"Concrete Autoencoders for Differentiable Feature Selection and Reconstruction","paper_url":"/paper/concrete-autoencoders-for-differentiable","paper_date":"2019-01-27","arxiv_id":"1901.09346","code_links":[{"title":"mfbalin/Concrete-Autoencoders","url":"https://github.com/mfbalin/Concrete-Autoencoders"},{"title":"BarathTamas/JetBot-Thesis","url":"https://github.com/BarathTamas/JetBot-Thesis"}],"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/concrete-autoencoders-for-differentiable#ran","syntology_url":"https://syntology.ai/paper/1901.09346","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.09346"}},"official":{"repos":["mfbalin/Concrete-Autoencoders"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}},{"leaderboard":"/sota/general-classification-on-cve-to-cwe-mapping","slug":"general-classification-on-cve-to-cwe-mapping","dataset":"CVE to CWE mapping","dataset_url":null,"rows_in_archive":1,"metrics":["5 fold cross validation"],"first_row_in_archive_order":{"model":"V2W-BERT","paper_title":"V2W-BERT: A Framework for Effective Hierarchical Multiclass Classification of Software Vulnerabilities","paper_url":"/paper/v2w-bert-a-framework-for-effective","paper_date":"2021-02-23","arxiv_id":"2102.11498","code_links":[{"title":"Cybersecurity-Tools/V2W-BERT","url":"https://github.com/Cybersecurity-Tools/V2W-BERT"}],"syntology":null}},{"leaderboard":"/sota/general-classification-on-cvr","slug":"general-classification-on-cvr","dataset":"CVR","dataset_url":"/dataset/cvr","rows_in_archive":1,"metrics":["Test error"],"first_row_in_archive_order":{"model":"Decision Trees","paper_title":"Missing Data Imputation for Supervised Learning","paper_url":"/paper/missing-data-imputation-for-supervised","paper_date":"2016-10-28","arxiv_id":"1610.09075","code_links":[{"title":"rafaelvalle/MDI","url":"https://github.com/rafaelvalle/MDI"}],"syntology":null}},{"leaderboard":"/sota/general-classification-on-fashion-mnist","slug":"general-classification-on-fashion-mnist","dataset":"Fashion-MNIST","dataset_url":"/dataset/fashion-mnist","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CAE","paper_title":"Concrete Autoencoders for Differentiable Feature Selection and Reconstruction","paper_url":"/paper/concrete-autoencoders-for-differentiable","paper_date":"2019-01-27","arxiv_id":"1901.09346","code_links":[{"title":"mfbalin/Concrete-Autoencoders","url":"https://github.com/mfbalin/Concrete-Autoencoders"},{"title":"BarathTamas/JetBot-Thesis","url":"https://github.com/BarathTamas/JetBot-Thesis"}],"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/concrete-autoencoders-for-differentiable#ran","syntology_url":"https://syntology.ai/paper/1901.09346","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.09346"}},"official":{"repos":["mfbalin/Concrete-Autoencoders"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}},{"leaderboard":"/sota/general-classification-on-isolet","slug":"general-classification-on-isolet","dataset":"ISOLET","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CAE","paper_title":"Concrete Autoencoders for Differentiable Feature Selection and Reconstruction","paper_url":"/paper/concrete-autoencoders-for-differentiable","paper_date":"2019-01-27","arxiv_id":"1901.09346","code_links":[{"title":"mfbalin/Concrete-Autoencoders","url":"https://github.com/mfbalin/Concrete-Autoencoders"},{"title":"BarathTamas/JetBot-Thesis","url":"https://github.com/BarathTamas/JetBot-Thesis"}],"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/concrete-autoencoders-for-differentiable#ran","syntology_url":"https://syntology.ai/paper/1901.09346","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.09346"}},"official":{"repos":["mfbalin/Concrete-Autoencoders"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}},{"leaderboard":"/sota/general-classification-on-mice-protein","slug":"general-classification-on-mice-protein","dataset":"Mice Protein","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CAE","paper_title":"Concrete Autoencoders for Differentiable Feature Selection and Reconstruction","paper_url":"/paper/concrete-autoencoders-for-differentiable","paper_date":"2019-01-27","arxiv_id":"1901.09346","code_links":[{"title":"mfbalin/Concrete-Autoencoders","url":"https://github.com/mfbalin/Concrete-Autoencoders"},{"title":"BarathTamas/JetBot-Thesis","url":"https://github.com/BarathTamas/JetBot-Thesis"}],"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/concrete-autoencoders-for-differentiable#ran","syntology_url":"https://syntology.ai/paper/1901.09346","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.09346"}},"official":{"repos":["mfbalin/Concrete-Autoencoders"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}},{"leaderboard":"/sota/general-classification-on-mnist","slug":"general-classification-on-mnist","dataset":"MNIST","dataset_url":"/dataset/mnist","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CAE","paper_title":"Concrete Autoencoders for Differentiable Feature Selection and Reconstruction","paper_url":"/paper/concrete-autoencoders-for-differentiable","paper_date":"2019-01-27","arxiv_id":"1901.09346","code_links":[{"title":"mfbalin/Concrete-Autoencoders","url":"https://github.com/mfbalin/Concrete-Autoencoders"},{"title":"BarathTamas/JetBot-Thesis","url":"https://github.com/BarathTamas/JetBot-Thesis"}],"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/concrete-autoencoders-for-differentiable#ran","syntology_url":"https://syntology.ai/paper/1901.09346","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.09346"}},"official":{"repos":["mfbalin/Concrete-Autoencoders"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}}],"datasets":[{"url":"/dataset/mnist","name":"MNIST","full_name":"","num_papers_in_archive":7651},{"url":"/dataset/fashion-mnist","name":"Fashion-MNIST","full_name":"","num_papers_in_archive":3202},{"url":"/dataset/adult-data-set","name":"Adult","full_name":"","num_papers_in_archive":56},{"url":"/dataset/iris-1","name":"iris","full_name":"iris","num_papers_in_archive":20},{"url":"/dataset/hyper-kvasir-dataset","name":"Hyper-Kvasir Dataset","full_name":"","num_papers_in_archive":12},{"url":"/dataset/wine","name":"Wine","full_name":"Wine Data Set","num_papers_in_archive":11},{"url":"/dataset/kvasir-capsule","name":"Kvasir-Capsule","full_name":"","num_papers_in_archive":2},{"url":"/dataset/cvr","name":"CVR","full_name":"Congressional Voting Records Data Set","num_papers_in_archive":1}],"subtasks":[],"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":146,"rows_per_page":100,"shown":100,"of":14581,"of_with_code":3945,"tagged_in_all":14581,"counts":{"archive_papers_tagged":14581,"with_a_code_link":3945,"where_syntology_ran_a_sample":713,"not_listed_spam_title":0,"listed":14581,"listed_where_code_ran":713,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":560,"every_run_a_failure_of_syntologys_instrument":153,"listed_with_a_run_with_no_instrument_failure":560,"listed_every_run_a_failure_of_syntologys_instrument":153,"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/very-deep-convolutional-networks-for-large","slug":"very-deep-convolutional-networks-for-large","title":"Very Deep Convolutional Networks for Large-Scale Image Recognition","date":"2014-09-04","arxiv_id":"1409.1556","repositories_listed":305,"syntology":{"n":122,"n_ran":81,"n_constructed":0,"n_ran_checked":69,"n_instrument":12,"n_unverified":41,"n_honours":0,"n_violates":0,"n_no_contract":69,"n_pointer_only":8,"phrase":"81 ran (of which 0 constructed an object rather than computing a result; 69 with no instrument failure: 0 honoured, 0 violated, 69 with no contract checked; 12 where Syntology's instrument failed) · 41 unverified","sample_list":"/paper/very-deep-convolutional-networks-for-large#ran","syntology_url":"https://syntology.ai/paper/1409.1556","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1409.1556"}},"official":null}},{"url":"/paper/yolo9000-better-faster-stronger","slug":"yolo9000-better-faster-stronger","title":"YOLO9000: Better, Faster, Stronger","date":"2016-12-25","arxiv_id":"1612.08242","repositories_listed":231,"syntology":{"n":60,"n_ran":44,"n_constructed":0,"n_ran_checked":33,"n_instrument":11,"n_unverified":16,"n_honours":1,"n_violates":4,"n_no_contract":28,"n_pointer_only":23,"phrase":"44 ran (of which 0 constructed an object rather than computing a result; 33 with no instrument failure: 1 honoured, 4 violated, 28 with no contract checked; 11 where Syntology's instrument failed) · 16 unverified","sample_list":"/paper/yolo9000-better-faster-stronger#ran","syntology_url":"https://syntology.ai/paper/1612.08242","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1612.08242"}},"official":null}},{"url":"/paper/grad-cam-visual-explanations-from-deep","slug":"grad-cam-visual-explanations-from-deep","title":"Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localization","date":"2016-10-07","arxiv_id":"1610.02391","repositories_listed":126,"syntology":{"n":141,"n_ran":90,"n_constructed":32,"n_ran_checked":62,"n_instrument":28,"n_unverified":51,"n_honours":6,"n_violates":4,"n_no_contract":52,"n_pointer_only":69,"phrase":"90 ran (of which 32 constructed an object rather than computing a result; 62 with no instrument failure: 6 honoured, 4 violated, 52 with no contract checked; 28 where Syntology's instrument failed) · 51 unverified","sample_list":"/paper/grad-cam-visual-explanations-from-deep#ran","syntology_url":"https://syntology.ai/paper/1610.02391","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1610.02391"}},"official":{"repos":["ramprs/grad-cam"],"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/convolutional-neural-networks-for-sentence","slug":"convolutional-neural-networks-for-sentence","title":"Convolutional Neural Networks for Sentence Classification","date":"2014-08-25","arxiv_id":"1408.5882","repositories_listed":118,"syntology":{"n":77,"n_ran":53,"n_constructed":0,"n_ran_checked":40,"n_instrument":13,"n_unverified":24,"n_honours":6,"n_violates":1,"n_no_contract":33,"n_pointer_only":21,"phrase":"53 ran (of which 0 constructed an object rather than computing a result; 40 with no instrument failure: 6 honoured, 1 violated, 33 with no contract checked; 13 where Syntology's instrument failed) · 24 unverified","sample_list":"/paper/convolutional-neural-networks-for-sentence#ran","syntology_url":"https://syntology.ai/paper/1408.5882","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1408.5882"}},"official":null}},{"url":"/paper/inception-v4-inception-resnet-and-the-impact","slug":"inception-v4-inception-resnet-and-the-impact","title":"Inception-v4, Inception-ResNet and the Impact of Residual Connections on Learning","date":"2016-02-23","arxiv_id":"1602.07261","repositories_listed":87,"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/inception-v4-inception-resnet-and-the-impact#ran","syntology_url":"https://syntology.ai/paper/1602.07261","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1602.07261"}},"official":null}},{"url":"/paper/model-agnostic-meta-learning-for-fast","slug":"model-agnostic-meta-learning-for-fast","title":"Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks","date":"2017-03-09","arxiv_id":"1703.03400","repositories_listed":85,"syntology":{"n":154,"n_ran":103,"n_constructed":35,"n_ran_checked":72,"n_instrument":31,"n_unverified":51,"n_honours":6,"n_violates":1,"n_no_contract":65,"n_pointer_only":57,"phrase":"103 ran (of which 35 constructed an object rather than computing a result; 72 with no instrument failure: 6 honoured, 1 violated, 65 with no contract checked; 31 where Syntology's instrument failed) · 51 unverified","sample_list":"/paper/model-agnostic-meta-learning-for-fast#ran","syntology_url":"https://syntology.ai/paper/1703.03400","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.03400"}},"official":{"repos":["cbfinn/maml","cbfinn/maml_rl"],"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":["listed","official","unlocated"]}}},{"url":"/paper/going-deeper-with-convolutions","slug":"going-deeper-with-convolutions","title":"Going Deeper with Convolutions","date":"2014-09-17","arxiv_id":"1409.4842","repositories_listed":83,"syntology":{"n":42,"n_ran":34,"n_constructed":19,"n_ran_checked":30,"n_instrument":4,"n_unverified":8,"n_honours":1,"n_violates":0,"n_no_contract":29,"n_pointer_only":21,"phrase":"34 ran (of which 19 constructed an object rather than computing a result; 30 with no instrument failure: 1 honoured, 0 violated, 29 with no contract checked; 4 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/going-deeper-with-convolutions#ran","syntology_url":"https://syntology.ai/paper/1409.4842","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1409.4842"}},"official":{"repos":["worksheets.codalab.org/worksheets/0xbcd424d2bf544c4786efcc0063759b1a"],"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/segnet-a-deep-convolutional-encoder-decoder","slug":"segnet-a-deep-convolutional-encoder-decoder","title":"SegNet: A Deep Convolutional Encoder-Decoder Architecture for Image Segmentation","date":"2015-11-02","arxiv_id":"1511.00561","repositories_listed":74,"syntology":{"n":44,"n_ran":22,"n_constructed":0,"n_ran_checked":14,"n_instrument":8,"n_unverified":22,"n_honours":1,"n_violates":0,"n_no_contract":13,"n_pointer_only":11,"phrase":"22 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 1 honoured, 0 violated, 13 with no contract checked; 8 where Syntology's instrument failed) · 22 unverified","sample_list":"/paper/segnet-a-deep-convolutional-encoder-decoder#ran","syntology_url":"https://syntology.ai/paper/1511.00561","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.00561"}},"official":null}},{"url":"/paper/batch-normalization-accelerating-deep-network","slug":"batch-normalization-accelerating-deep-network","title":"Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift","date":"2015-02-11","arxiv_id":"1502.03167","repositories_listed":70,"syntology":{"n":21,"n_ran":19,"n_constructed":5,"n_ran_checked":14,"n_instrument":5,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":5,"phrase":"19 ran (of which 5 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/batch-normalization-accelerating-deep-network#ran","syntology_url":"https://syntology.ai/paper/1502.03167","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1502.03167"}},"official":null}},{"url":"/paper/universal-language-model-fine-tuning-for-text","slug":"universal-language-model-fine-tuning-for-text","title":"Universal Language Model Fine-tuning for Text Classification","date":"2018-01-18","arxiv_id":"1801.06146","repositories_listed":66,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 3 unverified","sample_list":"/paper/universal-language-model-fine-tuning-for-text#ran","syntology_url":"https://syntology.ai/paper/1801.06146","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1801.06146"}},"official":{"repos":["fastai/fastai"],"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/bag-of-tricks-for-efficient-text","slug":"bag-of-tricks-for-efficient-text","title":"Bag of Tricks for Efficient Text Classification","date":"2016-07-06","arxiv_id":"1607.01759","repositories_listed":65,"syntology":{"n":9,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"3 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; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/bag-of-tricks-for-efficient-text#ran","syntology_url":"https://syntology.ai/paper/1607.01759","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1607.01759"}},"official":{"repos":["facebookresearch/fastText"],"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/aggregated-residual-transformations-for-deep","slug":"aggregated-residual-transformations-for-deep","title":"Aggregated Residual Transformations for Deep Neural Networks","date":"2016-11-16","arxiv_id":"1611.05431","repositories_listed":61,"syntology":{"n":80,"n_ran":51,"n_constructed":7,"n_ran_checked":31,"n_instrument":20,"n_unverified":29,"n_honours":0,"n_violates":0,"n_no_contract":31,"n_pointer_only":13,"phrase":"51 ran (of which 7 constructed an object rather than computing a result; 31 with no instrument failure: 0 honoured, 0 violated, 31 with no contract checked; 20 where Syntology's instrument failed) · 29 unverified","sample_list":"/paper/aggregated-residual-transformations-for-deep#ran","syntology_url":"https://syntology.ai/paper/1611.05431","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.05431"}},"official":{"repos":["facebookresearch/ResNeXt"],"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/darts-differentiable-architecture-search","slug":"darts-differentiable-architecture-search","title":"DARTS: Differentiable Architecture Search","date":"2018-06-24","arxiv_id":"1806.09055","repositories_listed":59,"syntology":{"n":156,"n_ran":74,"n_constructed":30,"n_ran_checked":59,"n_instrument":15,"n_unverified":82,"n_honours":10,"n_violates":1,"n_no_contract":48,"n_pointer_only":54,"phrase":"74 ran (of which 30 constructed an object rather than computing a result; 59 with no instrument failure: 10 honoured, 1 violated, 48 with no contract checked; 15 where Syntology's instrument failed) · 82 unverified","sample_list":"/paper/darts-differentiable-architecture-search#ran","syntology_url":"https://syntology.ai/paper/1806.09055","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.09055"}},"official":{"repos":["quark0/darts"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed"]}}},{"url":"/paper/semi-supervised-classification-with-graph","slug":"semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","arxiv_id":"1609.02907","repositories_listed":55,"syntology":{"n":58,"n_ran":39,"n_constructed":13,"n_ran_checked":34,"n_instrument":5,"n_unverified":19,"n_honours":0,"n_violates":1,"n_no_contract":33,"n_pointer_only":23,"phrase":"39 ran (of which 13 constructed an object rather than computing a result; 34 with no instrument failure: 0 honoured, 1 violated, 33 with no contract checked; 5 where Syntology's instrument failed) · 19 unverified","sample_list":"/paper/semi-supervised-classification-with-graph#ran","syntology_url":"https://syntology.ai/paper/1609.02907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.02907"}},"official":{"repos":["tkipf/pygcn"],"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-structured-self-attentive-sentence","slug":"a-structured-self-attentive-sentence","title":"A Structured Self-attentive Sentence Embedding","date":"2017-03-09","arxiv_id":"1703.03130","repositories_listed":52,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":6,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":3,"phrase":"10 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-structured-self-attentive-sentence#ran","syntology_url":"https://syntology.ai/paper/1703.03130","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.03130"}},"official":null}},{"url":"/paper/an-implementation-of-faster-rcnn-with-study","slug":"an-implementation-of-faster-rcnn-with-study","title":"An Implementation of Faster RCNN with Study for Region Sampling","date":"2017-02-07","arxiv_id":"1702.02138","repositories_listed":47,"syntology":null},{"url":"/paper/fasttextzip-compressing-text-classification","slug":"fasttextzip-compressing-text-classification","title":"FastText.zip: Compressing text classification models","date":"2016-12-12","arxiv_id":"1612.03651","repositories_listed":44,"syntology":{"n":18,"n_ran":11,"n_constructed":0,"n_ran_checked":8,"n_instrument":3,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":13,"phrase":"11 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; 3 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/fasttextzip-compressing-text-classification#ran","syntology_url":"https://syntology.ai/paper/1612.03651","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1612.03651"}},"official":{"repos":["facebookresearch/fastText"],"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/prototypical-networks-for-few-shot-learning","slug":"prototypical-networks-for-few-shot-learning","title":"Prototypical Networks for Few-shot Learning","date":"2017-03-15","arxiv_id":"1703.05175","repositories_listed":43,"syntology":{"n":64,"n_ran":50,"n_constructed":14,"n_ran_checked":29,"n_instrument":21,"n_unverified":14,"n_honours":5,"n_violates":0,"n_no_contract":24,"n_pointer_only":19,"phrase":"50 ran (of which 14 constructed an object rather than computing a result; 29 with no instrument failure: 5 honoured, 0 violated, 24 with no contract checked; 21 where Syntology's instrument failed) · 14 unverified","sample_list":"/paper/prototypical-networks-for-few-shot-learning#ran","syntology_url":"https://syntology.ai/paper/1703.05175","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.05175"}},"official":{"repos":["jakesnell/prototypical-networks"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/shufflenet-an-extremely-efficient","slug":"shufflenet-an-extremely-efficient","title":"ShuffleNet: An Extremely Efficient Convolutional Neural Network for Mobile Devices","date":"2017-07-04","arxiv_id":"1707.01083","repositories_listed":38,"syntology":null},{"url":"/paper/weight-uncertainty-in-neural-networks","slug":"weight-uncertainty-in-neural-networks","title":"Weight Uncertainty in Neural Networks","date":"2015-05-20","arxiv_id":"1505.05424","repositories_listed":38,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":5,"n_instrument":7,"n_unverified":3,"n_honours":4,"n_violates":1,"n_no_contract":0,"n_pointer_only":7,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 4 honoured, 1 violated, 0 with no contract checked; 7 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/weight-uncertainty-in-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1505.05424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1505.05424"}},"official":null}},{"url":"/paper/domain-adversarial-training-of-neural","slug":"domain-adversarial-training-of-neural","title":"Domain-Adversarial Training of Neural Networks","date":"2015-05-28","arxiv_id":"1505.07818","repositories_listed":37,"syntology":{"n":52,"n_ran":35,"n_constructed":11,"n_ran_checked":18,"n_instrument":17,"n_unverified":17,"n_honours":1,"n_violates":0,"n_no_contract":17,"n_pointer_only":22,"phrase":"35 ran (of which 11 constructed an object rather than computing a result; 18 with no instrument failure: 1 honoured, 0 violated, 17 with no contract checked; 17 where Syntology's instrument failed) · 17 unverified","sample_list":"/paper/domain-adversarial-training-of-neural#ran","syntology_url":"https://syntology.ai/paper/1505.07818","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1505.07818"}},"official":null}},{"url":"/paper/quo-vadis-action-recognition-a-new-model-and","slug":"quo-vadis-action-recognition-a-new-model-and","title":"Quo Vadis, Action Recognition? A New Model and the Kinetics Dataset","date":"2017-05-22","arxiv_id":"1705.07750","repositories_listed":34,"syntology":{"n":28,"n_ran":16,"n_constructed":7,"n_ran_checked":10,"n_instrument":6,"n_unverified":12,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":7,"phrase":"16 ran (of which 7 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 6 where Syntology's instrument failed) · 12 unverified","sample_list":"/paper/quo-vadis-action-recognition-a-new-model-and#ran","syntology_url":"https://syntology.ai/paper/1705.07750","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.07750"}},"official":null}},{"url":"/paper/cbam-convolutional-block-attention-module","slug":"cbam-convolutional-block-attention-module","title":"CBAM: Convolutional Block Attention Module","date":"2018-07-17","arxiv_id":"1807.06521","repositories_listed":31,"syntology":{"n":22,"n_ran":13,"n_constructed":0,"n_ran_checked":10,"n_instrument":3,"n_unverified":9,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":3,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 3 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/cbam-convolutional-block-attention-module#ran","syntology_url":"https://syntology.ai/paper/1807.06521","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.06521"}},"official":null}},{"url":"/paper/in-defense-of-the-triplet-loss-for-person-re","slug":"in-defense-of-the-triplet-loss-for-person-re","title":"In Defense of the Triplet Loss for Person Re-Identification","date":"2017-03-22","arxiv_id":"1703.07737","repositories_listed":31,"syntology":{"n":46,"n_ran":39,"n_constructed":0,"n_ran_checked":37,"n_instrument":2,"n_unverified":7,"n_honours":3,"n_violates":0,"n_no_contract":34,"n_pointer_only":2,"phrase":"39 ran (of which 0 constructed an object rather than computing a result; 37 with no instrument failure: 3 honoured, 0 violated, 34 with no contract checked; 2 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/in-defense-of-the-triplet-loss-for-person-re#ran","syntology_url":"https://syntology.ai/paper/1703.07737","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.07737"}},"official":null}},{"url":"/paper/emnist-an-extension-of-mnist-to-handwritten","slug":"emnist-an-extension-of-mnist-to-handwritten","title":"EMNIST: an extension of MNIST to handwritten letters","date":"2017-02-17","arxiv_id":"1702.05373","repositories_listed":31,"syntology":{"n":14,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":12,"n_pointer_only":1,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/emnist-an-extension-of-mnist-to-handwritten#ran","syntology_url":"https://syntology.ai/paper/1702.05373","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.05373"}},"official":null}},{"url":"/paper/character-level-convolutional-networks-for","slug":"character-level-convolutional-networks-for","title":"Character-level Convolutional Networks for Text Classification","date":"2015-09-04","arxiv_id":"1509.01626","repositories_listed":30,"syntology":{"n":20,"n_ran":17,"n_constructed":0,"n_ran_checked":13,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":5,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/character-level-convolutional-networks-for#ran","syntology_url":"https://syntology.ai/paper/1509.01626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1509.01626"}},"official":null}},{"url":"/paper/overcoming-catastrophic-forgetting-in-neural","slug":"overcoming-catastrophic-forgetting-in-neural","title":"Overcoming catastrophic forgetting in neural networks","date":"2016-12-02","arxiv_id":"1612.00796","repositories_listed":29,"syntology":{"n":22,"n_ran":16,"n_constructed":8,"n_ran_checked":12,"n_instrument":4,"n_unverified":6,"n_honours":2,"n_violates":0,"n_no_contract":10,"n_pointer_only":4,"phrase":"16 ran (of which 8 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 0 violated, 10 with no contract checked; 4 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/overcoming-catastrophic-forgetting-in-neural#ran","syntology_url":"https://syntology.ai/paper/1612.00796","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1612.00796"}},"official":null}},{"url":"/paper/adversarial-autoencoders","slug":"adversarial-autoencoders","title":"Adversarial Autoencoders","date":"2015-11-18","arxiv_id":"1511.05644","repositories_listed":29,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":5,"n_instrument":4,"n_unverified":3,"n_honours":3,"n_violates":1,"n_no_contract":1,"n_pointer_only":9,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 3 honoured, 1 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/adversarial-autoencoders#ran","syntology_url":"https://syntology.ai/paper/1511.05644","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.05644"}},"official":null}},{"url":"/paper/dropout-as-a-bayesian-approximation","slug":"dropout-as-a-bayesian-approximation","title":"Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learning","date":"2015-06-06","arxiv_id":"1506.02142","repositories_listed":29,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dropout-as-a-bayesian-approximation#ran","syntology_url":"https://syntology.ai/paper/1506.02142","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1506.02142"}},"official":null}},{"url":"/paper/bag-of-tricks-for-image-classification-with","slug":"bag-of-tricks-for-image-classification-with","title":"Bag of Tricks for Image Classification with Convolutional Neural Networks","date":"2018-12-04","arxiv_id":"1812.01187","repositories_listed":28,"syntology":{"n":15,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":4,"n_honours":2,"n_violates":0,"n_no_contract":7,"n_pointer_only":5,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 2 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/bag-of-tricks-for-image-classification-with#ran","syntology_url":"https://syntology.ai/paper/1812.01187","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.01187"}},"official":{"repos":["dmlc/gluon-cv"],"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/xgboost-a-scalable-tree-boosting-system","slug":"xgboost-a-scalable-tree-boosting-system","title":"XGBoost: A Scalable Tree Boosting System","date":"2016-03-09","arxiv_id":"1603.02754","repositories_listed":28,"syntology":{"n":17,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":10,"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) · 10 unverified","sample_list":"/paper/xgboost-a-scalable-tree-boosting-system#ran","syntology_url":"https://syntology.ai/paper/1603.02754","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.02754"}},"official":{"repos":["dmlc/xgboost"],"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/modeling-relational-data-with-graph","slug":"modeling-relational-data-with-graph","title":"Modeling Relational Data with Graph Convolutional Networks","date":"2017-03-17","arxiv_id":"1703.06103","repositories_listed":27,"syntology":{"n":32,"n_ran":18,"n_constructed":3,"n_ran_checked":13,"n_instrument":5,"n_unverified":14,"n_honours":1,"n_violates":1,"n_no_contract":11,"n_pointer_only":15,"phrase":"18 ran (of which 3 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 1 violated, 11 with no contract checked; 5 where Syntology's instrument failed) · 14 unverified","sample_list":"/paper/modeling-relational-data-with-graph#ran","syntology_url":"https://syntology.ai/paper/1703.06103","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.06103"}},"official":{"repos":["tkipf/relational-gcn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/chestx-ray8-hospital-scale-chest-x-ray","slug":"chestx-ray8-hospital-scale-chest-x-ray","title":"ChestX-ray8: Hospital-scale Chest X-ray Database and Benchmarks on Weakly-Supervised Classification and Localization of Common Thorax Diseases","date":"2017-05-05","arxiv_id":"1705.02315","repositories_listed":26,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/chestx-ray8-hospital-scale-chest-x-ray#ran","syntology_url":"https://syntology.ai/paper/1705.02315","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.02315"}},"official":null}},{"url":"/paper/revisiting-semi-supervised-learning-with","slug":"revisiting-semi-supervised-learning-with","title":"Revisiting Semi-Supervised Learning with Graph Embeddings","date":"2016-03-29","arxiv_id":"1603.08861","repositories_listed":26,"syntology":{"n":28,"n_ran":15,"n_constructed":4,"n_ran_checked":13,"n_instrument":2,"n_unverified":13,"n_honours":3,"n_violates":2,"n_no_contract":8,"n_pointer_only":11,"phrase":"15 ran (of which 4 constructed an object rather than computing a result; 13 with no instrument failure: 3 honoured, 2 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 13 unverified","sample_list":"/paper/revisiting-semi-supervised-learning-with#ran","syntology_url":"https://syntology.ai/paper/1603.08861","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.08861"}},"official":null}},{"url":"/paper/barlow-twins-self-supervised-learning-via","slug":"barlow-twins-self-supervised-learning-via","title":"Barlow Twins: Self-Supervised Learning via Redundancy Reduction","date":"2021-03-04","arxiv_id":"2103.03230","repositories_listed":24,"syntology":{"n":26,"n_ran":21,"n_constructed":6,"n_ran_checked":15,"n_instrument":6,"n_unverified":5,"n_honours":2,"n_violates":1,"n_no_contract":12,"n_pointer_only":10,"phrase":"21 ran (of which 6 constructed an object rather than computing a result; 15 with no instrument failure: 2 honoured, 1 violated, 12 with no contract checked; 6 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/barlow-twins-self-supervised-learning-via#ran","syntology_url":"https://syntology.ai/paper/2103.03230","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.03230"}},"official":{"repos":["facebookresearch/barlowtwins"],"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":["community","listed","official"]}}},{"url":"/paper/point-transformer-1","slug":"point-transformer-1","title":"Point Transformer","date":"2020-12-16","arxiv_id":"2012.09164","repositories_listed":24,"syntology":null},{"url":"/paper/solo-segmenting-objects-by-locations","slug":"solo-segmenting-objects-by-locations","title":"SOLO: Segmenting Objects by Locations","date":"2019-12-10","arxiv_id":"1912.04488","repositories_listed":24,"syntology":null},{"url":"/paper/very-deep-convolutional-networks-for-text","slug":"very-deep-convolutional-networks-for-text","title":"Very Deep Convolutional Networks for Text Classification","date":"2016-06-06","arxiv_id":"1606.01781","repositories_listed":24,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"3 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; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/very-deep-convolutional-networks-for-text#ran","syntology_url":"https://syntology.ai/paper/1606.01781","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.01781"}},"official":null}},{"url":"/paper/mine-mutual-information-neural-estimation","slug":"mine-mutual-information-neural-estimation","title":"MINE: Mutual Information Neural Estimation","date":"2018-01-12","arxiv_id":"1801.04062","repositories_listed":23,"syntology":{"n":24,"n_ran":9,"n_constructed":4,"n_ran_checked":8,"n_instrument":1,"n_unverified":15,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":6,"phrase":"9 ran (of which 4 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 15 unverified","sample_list":"/paper/mine-mutual-information-neural-estimation#ran","syntology_url":"https://syntology.ai/paper/1801.04062","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1801.04062"}},"official":null}},{"url":"/paper/deep-inside-convolutional-networks","slug":"deep-inside-convolutional-networks","title":"Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Maps","date":"2013-12-20","arxiv_id":"1312.6034","repositories_listed":23,"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/deep-inside-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/1312.6034","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1312.6034"}},"official":null}},{"url":"/paper/imagenet-classification-with-deep","slug":"imagenet-classification-with-deep","title":"ImageNet Classification with Deep Convolutional Neural Networks","date":"2012-12-01","arxiv_id":null,"repositories_listed":23,"syntology":null},{"url":"/paper/quantization-and-training-of-neural-networks","slug":"quantization-and-training-of-neural-networks","title":"Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inference","date":"2017-12-15","arxiv_id":"1712.05877","repositories_listed":21,"syntology":{"n":7,"n_ran":7,"n_constructed":3,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"7 ran (of which 3 constructed an object rather than computing a result; 6 with no instrument failure: 3 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/quantization-and-training-of-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1712.05877","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.05877"}},"official":null}},{"url":"/paper/the-inaturalist-species-classification-and","slug":"the-inaturalist-species-classification-and","title":"The iNaturalist Species Classification and Detection Dataset","date":"2017-07-20","arxiv_id":"1707.06642","repositories_listed":21,"syntology":null},{"url":"/paper/unsupervised-representation-learning-by-1","slug":"unsupervised-representation-learning-by-1","title":"Unsupervised Representation Learning by Predicting Image Rotations","date":"2018-03-21","arxiv_id":"1803.07728","repositories_listed":20,"syntology":{"n":22,"n_ran":16,"n_constructed":7,"n_ran_checked":14,"n_instrument":2,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":18,"phrase":"16 ran (of which 7 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/unsupervised-representation-learning-by-1#ran","syntology_url":"https://syntology.ai/paper/1803.07728","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.07728"}},"official":{"repos":["gidariss/FeatureLearningRotNet"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/adversarial-discriminative-domain-adaptation","slug":"adversarial-discriminative-domain-adaptation","title":"Adversarial Discriminative Domain Adaptation","date":"2017-02-17","arxiv_id":"1702.05464","repositories_listed":20,"syntology":{"n":48,"n_ran":14,"n_constructed":5,"n_ran_checked":7,"n_instrument":7,"n_unverified":34,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":12,"phrase":"14 ran (of which 5 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 7 where Syntology's instrument failed) · 34 unverified","sample_list":"/paper/adversarial-discriminative-domain-adaptation#ran","syntology_url":"https://syntology.ai/paper/1702.05464","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.05464"}},"official":null}},{"url":"/paper/categorical-reparameterization-with-gumbel","slug":"categorical-reparameterization-with-gumbel","title":"Categorical Reparameterization with Gumbel-Softmax","date":"2016-11-03","arxiv_id":"1611.01144","repositories_listed":20,"syntology":{"n":14,"n_ran":12,"n_constructed":2,"n_ran_checked":4,"n_instrument":8,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":8,"phrase":"12 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 8 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/categorical-reparameterization-with-gumbel#ran","syntology_url":"https://syntology.ai/paper/1611.01144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01144"}},"official":null}},{"url":"/paper/xnor-net-imagenet-classification-using-binary","slug":"xnor-net-imagenet-classification-using-binary","title":"XNOR-Net: ImageNet Classification Using Binary Convolutional Neural Networks","date":"2016-03-16","arxiv_id":"1603.05279","repositories_listed":20,"syntology":{"n":18,"n_ran":16,"n_constructed":0,"n_ran_checked":9,"n_instrument":7,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":3,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 7 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/xnor-net-imagenet-classification-using-binary#ran","syntology_url":"https://syntology.ai/paper/1603.05279","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.05279"}},"official":null}},{"url":"/paper/resmlp-feedforward-networks-for-image","slug":"resmlp-feedforward-networks-for-image","title":"ResMLP: Feedforward networks for image classification with data-efficient training","date":"2021-05-07","arxiv_id":"2105.03404","repositories_listed":19,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/resmlp-feedforward-networks-for-image#ran","syntology_url":"https://syntology.ai/paper/2105.03404","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.03404"}},"official":{"repos":["facebookresearch/deit"],"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/how-powerful-are-graph-neural-networks","slug":"how-powerful-are-graph-neural-networks","title":"How Powerful are Graph Neural Networks?","date":"2018-10-01","arxiv_id":"1810.00826","repositories_listed":19,"syntology":{"n":10,"n_ran":6,"n_constructed":2,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":5,"phrase":"6 ran (of which 2 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) · 4 unverified","sample_list":"/paper/how-powerful-are-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1810.00826","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.00826"}},"official":{"repos":["weihua916/powerful-gnns"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/multi-task-learning-using-uncertainty-to","slug":"multi-task-learning-using-uncertainty-to","title":"Multi-Task Learning Using Uncertainty to Weigh Losses for Scene Geometry and Semantics","date":"2017-05-19","arxiv_id":"1705.07115","repositories_listed":19,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/multi-task-learning-using-uncertainty-to#ran","syntology_url":"https://syntology.ai/paper/1705.07115","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.07115"}},"official":null}},{"url":"/paper/residual-attention-network-for-image","slug":"residual-attention-network-for-image","title":"Residual Attention Network for Image Classification","date":"2017-04-23","arxiv_id":"1704.06904","repositories_listed":19,"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":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) · 0 unverified","sample_list":"/paper/residual-attention-network-for-image#ran","syntology_url":"https://syntology.ai/paper/1704.06904","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.06904"}},"official":null}},{"url":"/paper/novel-feature-extraction-selection-and-fusion","slug":"novel-feature-extraction-selection-and-fusion","title":"Novel Feature Extraction, Selection and Fusion for Effective Malware Family Classification","date":"2015-11-13","arxiv_id":"1511.04317","repositories_listed":19,"syntology":null},{"url":"/paper/a-sensitivity-analysis-of-and-practitioners","slug":"a-sensitivity-analysis-of-and-practitioners","title":"A Sensitivity Analysis of (and Practitioners' Guide to) Convolutional Neural Networks for Sentence Classification","date":"2015-10-13","arxiv_id":"1510.03820","repositories_listed":19,"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/a-sensitivity-analysis-of-and-practitioners#ran","syntology_url":"https://syntology.ai/paper/1510.03820","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1510.03820"}},"official":null}},{"url":"/paper/progressive-neural-architecture-search","slug":"progressive-neural-architecture-search","title":"Progressive Neural Architecture Search","date":"2017-12-02","arxiv_id":"1712.00559","repositories_listed":18,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":3,"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; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/progressive-neural-architecture-search#ran","syntology_url":"https://syntology.ai/paper/1712.00559","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.00559"}},"official":{"repos":["chenxi116/PNASNet.TF","tensorflow/models","chenxi116/PNASNet.pytorch"],"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":["listed","official"]}}},{"url":"/paper/real-time-convolutional-neural-networks-for","slug":"real-time-convolutional-neural-networks-for","title":"Real-time Convolutional Neural Networks for Emotion and Gender Classification","date":"2017-10-20","arxiv_id":"1710.07557","repositories_listed":18,"syntology":{"n":17,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":1,"n_no_contract":8,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 1 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/real-time-convolutional-neural-networks-for#ran","syntology_url":"https://syntology.ai/paper/1710.07557","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.07557"}},"official":{"repos":["oarriaga/face_classification"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/random-erasing-data-augmentation","slug":"random-erasing-data-augmentation","title":"Random Erasing Data Augmentation","date":"2017-08-16","arxiv_id":"1708.04896","repositories_listed":18,"syntology":null},{"url":"/paper/visualizing-and-understanding-convolutional","slug":"visualizing-and-understanding-convolutional","title":"Visualizing and Understanding Convolutional Networks","date":"2013-11-12","arxiv_id":"1311.2901","repositories_listed":18,"syntology":{"n":4,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/visualizing-and-understanding-convolutional#ran","syntology_url":"https://syntology.ai/paper/1311.2901","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1311.2901"}},"official":null}},{"url":"/paper/network-in-network","slug":"network-in-network","title":"Network In Network","date":"2013-12-16","arxiv_id":"1312.4400","repositories_listed":17,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/network-in-network#ran","syntology_url":"https://syntology.ai/paper/1312.4400","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1312.4400"}},"official":{"repos":["worksheets.codalab.org/worksheets/0x7b8f6fbc6b5c49c18ac7ca94aafaa1a7"],"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/is-space-time-attention-all-you-need-for","slug":"is-space-time-attention-all-you-need-for","title":"Is Space-Time Attention All You Need for Video Understanding?","date":"2021-02-09","arxiv_id":"2102.05095","repositories_listed":16,"syntology":{"n":43,"n_ran":35,"n_constructed":17,"n_ran_checked":21,"n_instrument":14,"n_unverified":8,"n_honours":0,"n_violates":1,"n_no_contract":20,"n_pointer_only":14,"phrase":"35 ran (of which 17 constructed an object rather than computing a result; 21 with no instrument failure: 0 honoured, 1 violated, 20 with no contract checked; 14 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/is-space-time-attention-all-you-need-for#ran","syntology_url":"https://syntology.ai/paper/2102.05095","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.05095"}},"official":{"repos":["facebookresearch/TimeSformer"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}},{"url":"/paper/bert-for-joint-intent-classification-and-slot","slug":"bert-for-joint-intent-classification-and-slot","title":"BERT for Joint Intent Classification and Slot Filling","date":"2019-02-28","arxiv_id":"1902.10909","repositories_listed":16,"syntology":{"n":32,"n_ran":26,"n_constructed":0,"n_ran_checked":18,"n_instrument":8,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":17,"n_pointer_only":5,"phrase":"26 ran (of which 0 constructed an object rather than computing a result; 18 with no instrument failure: 1 honoured, 0 violated, 17 with no contract checked; 8 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/bert-for-joint-intent-classification-and-slot#ran","syntology_url":"https://syntology.ai/paper/1902.10909","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.10909"}},"official":null}},{"url":"/paper/eda-easy-data-augmentation-techniques-for","slug":"eda-easy-data-augmentation-techniques-for","title":"EDA: Easy Data Augmentation Techniques for Boosting Performance on Text Classification Tasks","date":"2019-01-31","arxiv_id":"1901.11196","repositories_listed":16,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"9 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; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/eda-easy-data-augmentation-techniques-for#ran","syntology_url":"https://syntology.ai/paper/1901.11196","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.11196"}},"official":{"repos":["jasonwei20/eda_nlp"],"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/cnn-architectures-for-large-scale-audio","slug":"cnn-architectures-for-large-scale-audio","title":"CNN Architectures for Large-Scale Audio Classification","date":"2016-09-29","arxiv_id":"1609.09430","repositories_listed":16,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cnn-architectures-for-large-scale-audio#ran","syntology_url":"https://syntology.ai/paper/1609.09430","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.09430"}},"official":null}},{"url":"/paper/fast-and-accurate-deep-network-learning-by","slug":"fast-and-accurate-deep-network-learning-by","title":"Fast and Accurate Deep Network Learning by Exponential Linear Units (ELUs)","date":"2015-11-23","arxiv_id":"1511.07289","repositories_listed":16,"syntology":{"n":7,"n_ran":5,"n_constructed":1,"n_ran_checked":3,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"5 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/fast-and-accurate-deep-network-learning-by#ran","syntology_url":"https://syntology.ai/paper/1511.07289","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.07289"}},"official":null}},{"url":"/paper/improved-semantic-representations-from-tree","slug":"improved-semantic-representations-from-tree","title":"Improved Semantic Representations From Tree-Structured Long Short-Term Memory Networks","date":"2015-02-28","arxiv_id":"1503.00075","repositories_listed":16,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":6,"n_instrument":6,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":6,"phrase":"12 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; 6 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/improved-semantic-representations-from-tree#ran","syntology_url":"https://syntology.ai/paper/1503.00075","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1503.00075"}},"official":{"repos":["stanfordnlp/treelstm"],"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/video-swin-transformer","slug":"video-swin-transformer","title":"Video Swin Transformer","date":"2021-06-24","arxiv_id":"2106.13230","repositories_listed":15,"syntology":{"n":32,"n_ran":19,"n_constructed":0,"n_ran_checked":14,"n_instrument":5,"n_unverified":13,"n_honours":1,"n_violates":0,"n_no_contract":13,"n_pointer_only":7,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 1 honoured, 0 violated, 13 with no contract checked; 5 where Syntology's instrument failed) · 13 unverified","sample_list":"/paper/video-swin-transformer#ran","syntology_url":"https://syntology.ai/paper/2106.13230","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.13230"}},"official":{"repos":["SwinTransformer/Video-Swin-Transformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/2103-14899","slug":"2103-14899","title":"CrossViT: Cross-Attention Multi-Scale Vision Transformer for Image Classification","date":"2021-03-27","arxiv_id":"2103.14899","repositories_listed":15,"syntology":{"n":26,"n_ran":17,"n_constructed":10,"n_ran_checked":17,"n_instrument":0,"n_unverified":9,"n_honours":0,"n_violates":1,"n_no_contract":16,"n_pointer_only":0,"phrase":"17 ran (of which 10 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 1 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/2103-14899#ran","syntology_url":"https://syntology.ai/paper/2103.14899","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.14899"}},"official":{"repos":["IBM/CrossViT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/how-to-fine-tune-bert-for-text-classification","slug":"how-to-fine-tune-bert-for-text-classification","title":"How to Fine-Tune BERT for Text Classification?","date":"2019-05-14","arxiv_id":"1905.05583","repositories_listed":15,"syntology":{"n":18,"n_ran":12,"n_constructed":0,"n_ran_checked":7,"n_instrument":5,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":5,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 5 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/how-to-fine-tune-bert-for-text-classification#ran","syntology_url":"https://syntology.ai/paper/1905.05583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05583"}},"official":{"repos":["xuyige/BERT4doc-Classification"],"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":["listed","official"]}}},{"url":"/paper/meta-dataset-a-dataset-of-datasets-for","slug":"meta-dataset-a-dataset-of-datasets-for","title":"Meta-Dataset: A Dataset of Datasets for Learning to Learn from Few Examples","date":"2019-03-07","arxiv_id":"1903.03096","repositories_listed":15,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/meta-dataset-a-dataset-of-datasets-for#ran","syntology_url":"https://syntology.ai/paper/1903.03096","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.03096"}},"official":{"repos":["google-research/meta-dataset"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/slowfast-networks-for-video-recognition","slug":"slowfast-networks-for-video-recognition","title":"SlowFast Networks for Video Recognition","date":"2018-12-10","arxiv_id":"1812.03982","repositories_listed":15,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/slowfast-networks-for-video-recognition#ran","syntology_url":"https://syntology.ai/paper/1812.03982","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.03982"}},"official":{"repos":["facebookresearch/SlowFast"],"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/unsupervised-feature-learning-via-non","slug":"unsupervised-feature-learning-via-non","title":"Unsupervised Feature Learning via Non-Parametric Instance-level Discrimination","date":"2018-05-05","arxiv_id":"1805.01978","repositories_listed":15,"syntology":{"n":23,"n_ran":19,"n_constructed":14,"n_ran_checked":17,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":16,"phrase":"19 ran (of which 14 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/unsupervised-feature-learning-via-non#ran","syntology_url":"https://syntology.ai/paper/1805.01978","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.01978"}},"official":{"repos":["zhirongw/lemniscate.pytorch"],"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/on-calibration-of-modern-neural-networks","slug":"on-calibration-of-modern-neural-networks","title":"On Calibration of Modern Neural Networks","date":"2017-06-14","arxiv_id":"1706.04599","repositories_listed":15,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"4 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-calibration-of-modern-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1706.04599","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.04599"}},"official":{"repos":["gpleiss/temperature_scaling"],"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/multinet-real-time-joint-semantic-reasoning","slug":"multinet-real-time-joint-semantic-reasoning","title":"MultiNet: Real-time Joint Semantic Reasoning for Autonomous Driving","date":"2016-12-22","arxiv_id":"1612.07695","repositories_listed":15,"syntology":{"n":42,"n_ran":18,"n_constructed":0,"n_ran_checked":14,"n_instrument":4,"n_unverified":24,"n_honours":2,"n_violates":0,"n_no_contract":12,"n_pointer_only":1,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 2 honoured, 0 violated, 12 with no contract checked; 4 where Syntology's instrument failed) · 24 unverified","sample_list":"/paper/multinet-real-time-joint-semantic-reasoning#ran","syntology_url":"https://syntology.ai/paper/1612.07695","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1612.07695"}},"official":{"repos":["MarvinTeichmann/MultiNet"],"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/delving-deep-into-rectifiers-surpassing-human","slug":"delving-deep-into-rectifiers-surpassing-human","title":"Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classification","date":"2015-02-06","arxiv_id":"1502.01852","repositories_listed":15,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/delving-deep-into-rectifiers-surpassing-human#ran","syntology_url":"https://syntology.ai/paper/1502.01852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1502.01852"}},"official":null}},{"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/regnet-self-regulated-network-for-image","slug":"regnet-self-regulated-network-for-image","title":"RegNet: Self-Regulated Network for Image Classification","date":"2021-01-03","arxiv_id":"2101.00590","repositories_listed":14,"syntology":null},{"url":"/paper/revisiting-foreground-background-imbalance-in","slug":"revisiting-foreground-background-imbalance-in","title":"Is Heuristic Sampling Necessary in Training Deep Object Detectors?","date":"2019-09-11","arxiv_id":"1909.04868","repositories_listed":14,"syntology":null},{"url":"/paper/190409925","slug":"190409925","title":"Attention Augmented Convolutional Networks","date":"2019-04-22","arxiv_id":"1904.09925","repositories_listed":14,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"3 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/190409925#ran","syntology_url":"https://syntology.ai/paper/1904.09925","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.09925"}},"official":null}},{"url":"/paper/hierarchical-graph-representation-learning","slug":"hierarchical-graph-representation-learning","title":"Hierarchical Graph Representation Learning with Differentiable Pooling","date":"2018-06-22","arxiv_id":"1806.08804","repositories_listed":14,"syntology":{"n":20,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/hierarchical-graph-representation-learning#ran","syntology_url":"https://syntology.ai/paper/1806.08804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.08804"}},"official":null}},{"url":"/paper/imagenet-large-scale-visual-recognition","slug":"imagenet-large-scale-visual-recognition","title":"ImageNet Large Scale Visual Recognition Challenge","date":"2014-09-01","arxiv_id":"1409.0575","repositories_listed":14,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/imagenet-large-scale-visual-recognition#ran","syntology_url":"https://syntology.ai/paper/1409.0575","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1409.0575"}},"official":null}},{"url":"/paper/spatial-pyramid-pooling-in-deep-convolutional","slug":"spatial-pyramid-pooling-in-deep-convolutional","title":"Spatial Pyramid Pooling in Deep Convolutional Networks for Visual Recognition","date":"2014-06-18","arxiv_id":"1406.4729","repositories_listed":14,"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/spatial-pyramid-pooling-in-deep-convolutional#ran","syntology_url":"https://syntology.ai/paper/1406.4729","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1406.4729"}},"official":null}},{"url":"/paper/self-training-with-noisy-student-improves","slug":"self-training-with-noisy-student-improves","title":"Self-training with Noisy Student improves ImageNet classification","date":"2019-11-11","arxiv_id":"1911.04252","repositories_listed":13,"syntology":{"n":24,"n_ran":13,"n_constructed":0,"n_ran_checked":10,"n_instrument":3,"n_unverified":11,"n_honours":2,"n_violates":0,"n_no_contract":8,"n_pointer_only":2,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 0 violated, 8 with no contract checked; 3 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/self-training-with-noisy-student-improves#ran","syntology_url":"https://syntology.ai/paper/1911.04252","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.04252"}},"official":{"repos":["google-research/noisystudent","tensorflow/tpu"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":10,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/a-closer-look-at-few-shot-classification-1","slug":"a-closer-look-at-few-shot-classification-1","title":"A Closer Look at Few-shot Classification","date":"2019-04-08","arxiv_id":"1904.04232","repositories_listed":13,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":2,"n_instrument":5,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-closer-look-at-few-shot-classification-1#ran","syntology_url":"https://syntology.ai/paper/1904.04232","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.04232"}},"official":{"repos":["wyharveychen/CloserLookFewShot"],"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/ecg-heartbeat-classification-a-deep","slug":"ecg-heartbeat-classification-a-deep","title":"ECG Heartbeat Classification: A Deep Transferable Representation","date":"2018-04-19","arxiv_id":"1805.00794","repositories_listed":13,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/ecg-heartbeat-classification-a-deep#ran","syntology_url":"https://syntology.ai/paper/1805.00794","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.00794"}},"official":null}},{"url":"/paper/the-kinetics-human-action-video-dataset","slug":"the-kinetics-human-action-video-dataset","title":"The Kinetics Human Action Video Dataset","date":"2017-05-19","arxiv_id":"1705.06950","repositories_listed":13,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"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, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-kinetics-human-action-video-dataset#ran","syntology_url":"https://syntology.ai/paper/1705.06950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.06950"}},"official":null}},{"url":"/paper/lipnet-end-to-end-sentence-level-lipreading","slug":"lipnet-end-to-end-sentence-level-lipreading","title":"LipNet: End-to-End Sentence-level Lipreading","date":"2016-11-05","arxiv_id":"1611.01599","repositories_listed":13,"syntology":{"n":15,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/lipnet-end-to-end-sentence-level-lipreading#ran","syntology_url":"https://syntology.ai/paper/1611.01599","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01599"}},"official":{"repos":["rizkiarm/LipNet"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/convolutional-recurrent-neural-networks-for-1","slug":"convolutional-recurrent-neural-networks-for-1","title":"Convolutional Recurrent Neural Networks for Music Classification","date":"2016-09-14","arxiv_id":"1609.04243","repositories_listed":13,"syntology":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/levit-a-vision-transformer-in-convnet-s","slug":"levit-a-vision-transformer-in-convnet-s","title":"LeViT: a Vision Transformer in ConvNet's Clothing for Faster Inference","date":"2021-04-02","arxiv_id":"2104.01136","repositories_listed":12,"syntology":{"n":30,"n_ran":23,"n_constructed":16,"n_ran_checked":21,"n_instrument":2,"n_unverified":7,"n_honours":3,"n_violates":1,"n_no_contract":17,"n_pointer_only":0,"phrase":"23 ran (of which 16 constructed an object rather than computing a result; 21 with no instrument failure: 3 honoured, 1 violated, 17 with no contract checked; 2 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/levit-a-vision-transformer-in-convnet-s#ran","syntology_url":"https://syntology.ai/paper/2104.01136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.01136"}},"official":{"repos":["facebookresearch/LeViT","rwightman/pytorch-image-models"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/learning-to-navigate-for-fine-grained","slug":"learning-to-navigate-for-fine-grained","title":"Learning to Navigate for Fine-grained Classification","date":"2018-09-02","arxiv_id":"1809.00287","repositories_listed":12,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":3,"phrase":"9 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-to-navigate-for-fine-grained#ran","syntology_url":"https://syntology.ai/paper/1809.00287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.00287"}},"official":{"repos":["yangze0930/NTS-Net"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/skin-lesion-analysis-toward-melanoma","slug":"skin-lesion-analysis-toward-melanoma","title":"Skin Lesion Analysis Toward Melanoma Detection: A Challenge at the 2017 International Symposium on Biomedical Imaging (ISBI), Hosted by the International Skin Imaging Collaboration (ISIC)","date":"2017-10-13","arxiv_id":"1710.05006","repositories_listed":12,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/skin-lesion-analysis-toward-melanoma#ran","syntology_url":"https://syntology.ai/paper/1710.05006","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.05006"}},"official":null}},{"url":"/paper/time-series-classification-from-scratch-with","slug":"time-series-classification-from-scratch-with","title":"Time Series Classification from Scratch with Deep Neural Networks: A Strong Baseline","date":"2016-11-20","arxiv_id":"1611.06455","repositories_listed":12,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"9 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/time-series-classification-from-scratch-with#ran","syntology_url":"https://syntology.ai/paper/1611.06455","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.06455"}},"official":{"repos":["cauchyturing/UCR_Time_Series_Classification_Deep_Learning_Baseline"],"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/adadelta-an-adaptive-learning-rate-method","slug":"adadelta-an-adaptive-learning-rate-method","title":"ADADELTA: An Adaptive Learning Rate Method","date":"2012-12-22","arxiv_id":"1212.5701","repositories_listed":12,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/adadelta-an-adaptive-learning-rate-method#ran","syntology_url":"https://syntology.ai/paper/1212.5701","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1212.5701"}},"official":null}},{"url":"/paper/deep-graph-infomax","slug":"deep-graph-infomax","title":"Deep Graph Infomax","date":"2018-09-27","arxiv_id":"1809.10341","repositories_listed":11,"syntology":{"n":35,"n_ran":26,"n_constructed":11,"n_ran_checked":22,"n_instrument":4,"n_unverified":9,"n_honours":2,"n_violates":1,"n_no_contract":19,"n_pointer_only":10,"phrase":"26 ran (of which 11 constructed an object rather than computing a result; 22 with no instrument failure: 2 honoured, 1 violated, 19 with no contract checked; 4 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/deep-graph-infomax#ran","syntology_url":"https://syntology.ai/paper/1809.10341","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.10341"}},"official":{"repos":["PetarV-/DGI"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/ecg-arrhythmia-classification-using-a-2-d","slug":"ecg-arrhythmia-classification-using-a-2-d","title":"ECG arrhythmia classification using a 2-D convolutional neural network","date":"2018-04-18","arxiv_id":"1804.06812","repositories_listed":11,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"8 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/ecg-arrhythmia-classification-using-a-2-d#ran","syntology_url":"https://syntology.ai/paper/1804.06812","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.06812"}},"official":null}},{"url":"/paper/senteval-an-evaluation-toolkit-for-universal","slug":"senteval-an-evaluation-toolkit-for-universal","title":"SentEval: An Evaluation Toolkit for Universal Sentence Representations","date":"2018-03-14","arxiv_id":"1803.05449","repositories_listed":11,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":2,"n_pointer_only":6,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 1 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/senteval-an-evaluation-toolkit-for-universal#ran","syntology_url":"https://syntology.ai/paper/1803.05449","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.05449"}},"official":{"repos":["facebookresearch/SentEval"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/interpretability-beyond-feature-attribution","slug":"interpretability-beyond-feature-attribution","title":"Interpretability Beyond Feature Attribution: Quantitative Testing with Concept Activation Vectors (TCAV)","date":"2017-11-30","arxiv_id":"1711.11279","repositories_listed":11,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/interpretability-beyond-feature-attribution#ran","syntology_url":"https://syntology.ai/paper/1711.11279","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.11279"}},"official":{"repos":["tensorflow/tcav"],"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/simple-recurrent-units-for-highly","slug":"simple-recurrent-units-for-highly","title":"Simple Recurrent Units for Highly Parallelizable Recurrence","date":"2017-09-08","arxiv_id":"1709.02755","repositories_listed":11,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"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, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/simple-recurrent-units-for-highly#ran","syntology_url":"https://syntology.ai/paper/1709.02755","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.02755"}},"official":{"repos":["asappresearch/sru"],"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/multitask-learning-and-benchmarking-with","slug":"multitask-learning-and-benchmarking-with","title":"Multitask learning and benchmarking with clinical time series data","date":"2017-03-22","arxiv_id":"1703.07771","repositories_listed":11,"syntology":{"n":40,"n_ran":25,"n_constructed":0,"n_ran_checked":18,"n_instrument":7,"n_unverified":15,"n_honours":1,"n_violates":0,"n_no_contract":17,"n_pointer_only":5,"phrase":"25 ran (of which 0 constructed an object rather than computing a result; 18 with no instrument failure: 1 honoured, 0 violated, 17 with no contract checked; 7 where Syntology's instrument failed) · 15 unverified","sample_list":"/paper/multitask-learning-and-benchmarking-with#ran","syntology_url":"https://syntology.ai/paper/1703.07771","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.07771"}},"official":{"repos":["yerevann/mimic3-benchmarks"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/membership-inference-attacks-against-machine","slug":"membership-inference-attacks-against-machine","title":"Membership Inference Attacks against Machine Learning Models","date":"2016-10-18","arxiv_id":"1610.05820","repositories_listed":11,"syntology":{"n":14,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"10 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; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/membership-inference-attacks-against-machine#ran","syntology_url":"https://syntology.ai/paper/1610.05820","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1610.05820"}},"official":{"repos":["csong27/membership-inference"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text","listed"]}}},{"url":"/paper/from-softmax-to-sparsemax-a-sparse-model-of","slug":"from-softmax-to-sparsemax-a-sparse-model-of","title":"From Softmax to Sparsemax: A Sparse Model of Attention and Multi-Label Classification","date":"2016-02-05","arxiv_id":"1602.02068","repositories_listed":11,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":0,"n_honours":4,"n_violates":2,"n_no_contract":0,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 4 honoured, 2 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/from-softmax-to-sparsemax-a-sparse-model-of#ran","syntology_url":"https://syntology.ai/paper/1602.02068","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1602.02068"}},"official":null}}],"syntology_records":89,"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":7,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"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":[{"leaderboard":"/sota/general-classification-on-iris","since_archive":"/sota/general-classification-on-iris#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/classification-on-wine","since_archive":"/sota/classification-on-wine#since-judged","papers_judged":2,"placed":0},{"leaderboard":"/sota/general-classification-on-activity","since_archive":"/sota/general-classification-on-activity#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/general-classification-on-cvr","since_archive":"/sota/general-classification-on-cvr#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/general-classification-on-isolet","since_archive":"/sota/general-classification-on-isolet#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/general-classification-on-mice-protein","since_archive":"/sota/general-classification-on-mice-protein#since-judged","papers_judged":1,"placed":0}]},"papers_where_code_ran":713,"papers_where_code_ran_first_page":"/task/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":146,"url":"/task/classification/papers/2","json":"/task/classification/papers/2.json","rows":100},{"order":"archive","page":3,"of":146,"url":"/task/classification/papers/3","json":"/task/classification/papers/3.json","rows":100},{"order":"archive","page":4,"of":146,"url":"/task/classification/papers/4","json":"/task/classification/papers/4.json","rows":100},{"order":"archive","page":5,"of":146,"url":"/task/classification/papers/5","json":"/task/classification/papers/5.json","rows":100},{"order":"archive","page":6,"of":146,"url":"/task/classification/papers/6","json":"/task/classification/papers/6.json","rows":100},{"order":"archive","page":7,"of":146,"url":"/task/classification/papers/7","json":"/task/classification/papers/7.json","rows":100},{"order":"archive","page":8,"of":146,"url":"/task/classification/papers/8","json":"/task/classification/papers/8.json","rows":100},{"order":"archive","page":9,"of":146,"url":"/task/classification/papers/9","json":"/task/classification/papers/9.json","rows":100},{"order":"archive","page":10,"of":146,"url":"/task/classification/papers/10","json":"/task/classification/papers/10.json","rows":100},{"order":"archive","page":11,"of":146,"url":"/task/classification/papers/11","json":"/task/classification/papers/11.json","rows":100},{"order":"archive","page":12,"of":146,"url":"/task/classification/papers/12","json":"/task/classification/papers/12.json","rows":100},{"order":"archive","page":13,"of":146,"url":"/task/classification/papers/13","json":"/task/classification/papers/13.json","rows":100},{"order":"archive","page":14,"of":146,"url":"/task/classification/papers/14","json":"/task/classification/papers/14.json","rows":100},{"order":"archive","page":15,"of":146,"url":"/task/classification/papers/15","json":"/task/classification/papers/15.json","rows":100},{"order":"archive","page":16,"of":146,"url":"/task/classification/papers/16","json":"/task/classification/papers/16.json","rows":100},{"order":"archive","page":17,"of":146,"url":"/task/classification/papers/17","json":"/task/classification/papers/17.json","rows":100},{"order":"archive","page":18,"of":146,"url":"/task/classification/papers/18","json":"/task/classification/papers/18.json","rows":100},{"order":"archive","page":19,"of":146,"url":"/task/classification/papers/19","json":"/task/classification/papers/19.json","rows":100},{"order":"archive","page":20,"of":146,"url":"/task/classification/papers/20","json":"/task/classification/papers/20.json","rows":100},{"order":"archive","page":21,"of":146,"url":"/task/classification/papers/21","json":"/task/classification/papers/21.json","rows":100},{"order":"archive","page":22,"of":146,"url":"/task/classification/papers/22","json":"/task/classification/papers/22.json","rows":100},{"order":"archive","page":23,"of":146,"url":"/task/classification/papers/23","json":"/task/classification/papers/23.json","rows":100},{"order":"archive","page":24,"of":146,"url":"/task/classification/papers/24","json":"/task/classification/papers/24.json","rows":100},{"order":"archive","page":25,"of":146,"url":"/task/classification/papers/25","json":"/task/classification/papers/25.json","rows":100},{"order":"archive","page":26,"of":146,"url":"/task/classification/papers/26","json":"/task/classification/papers/26.json","rows":100},{"order":"archive","page":27,"of":146,"url":"/task/classification/papers/27","json":"/task/classification/papers/27.json","rows":100},{"order":"archive","page":28,"of":146,"url":"/task/classification/papers/28","json":"/task/classification/papers/28.json","rows":100},{"order":"archive","page":29,"of":146,"url":"/task/classification/papers/29","json":"/task/classification/papers/29.json","rows":100},{"order":"archive","page":30,"of":146,"url":"/task/classification/papers/30","json":"/task/classification/papers/30.json","rows":100},{"order":"archive","page":31,"of":146,"url":"/task/classification/papers/31","json":"/task/classification/papers/31.json","rows":100},{"order":"archive","page":32,"of":146,"url":"/task/classification/papers/32","json":"/task/classification/papers/32.json","rows":100},{"order":"archive","page":33,"of":146,"url":"/task/classification/papers/33","json":"/task/classification/papers/33.json","rows":100},{"order":"archive","page":34,"of":146,"url":"/task/classification/papers/34","json":"/task/classification/papers/34.json","rows":100},{"order":"archive","page":35,"of":146,"url":"/task/classification/papers/35","json":"/task/classification/papers/35.json","rows":100},{"order":"archive","page":36,"of":146,"url":"/task/classification/papers/36","json":"/task/classification/papers/36.json","rows":100},{"order":"archive","page":37,"of":146,"url":"/task/classification/papers/37","json":"/task/classification/papers/37.json","rows":100},{"order":"archive","page":38,"of":146,"url":"/task/classification/papers/38","json":"/task/classification/papers/38.json","rows":100},{"order":"archive","page":39,"of":146,"url":"/task/classification/papers/39","json":"/task/classification/papers/39.json","rows":100},{"order":"archive","page":40,"of":146,"url":"/task/classification/papers/40","json":"/task/classification/papers/40.json","rows":100},{"order":"archive","page":41,"of":146,"url":"/task/classification/papers/41","json":"/task/classification/papers/41.json","rows":100},{"order":"archive","page":42,"of":146,"url":"/task/classification/papers/42","json":"/task/classification/papers/42.json","rows":100},{"order":"archive","page":43,"of":146,"url":"/task/classification/papers/43","json":"/task/classification/papers/43.json","rows":100},{"order":"archive","page":44,"of":146,"url":"/task/classification/papers/44","json":"/task/classification/papers/44.json","rows":100},{"order":"archive","page":45,"of":146,"url":"/task/classification/papers/45","json":"/task/classification/papers/45.json","rows":100},{"order":"archive","page":46,"of":146,"url":"/task/classification/papers/46","json":"/task/classification/papers/46.json","rows":100},{"order":"archive","page":47,"of":146,"url":"/task/classification/papers/47","json":"/task/classification/papers/47.json","rows":100},{"order":"archive","page":48,"of":146,"url":"/task/classification/papers/48","json":"/task/classification/papers/48.json","rows":100},{"order":"archive","page":49,"of":146,"url":"/task/classification/papers/49","json":"/task/classification/papers/49.json","rows":100},{"order":"archive","page":50,"of":146,"url":"/task/classification/papers/50","json":"/task/classification/papers/50.json","rows":100},{"order":"archive","page":51,"of":146,"url":"/task/classification/papers/51","json":"/task/classification/papers/51.json","rows":100},{"order":"archive","page":52,"of":146,"url":"/task/classification/papers/52","json":"/task/classification/papers/52.json","rows":100},{"order":"archive","page":53,"of":146,"url":"/task/classification/papers/53","json":"/task/classification/papers/53.json","rows":100},{"order":"archive","page":54,"of":146,"url":"/task/classification/papers/54","json":"/task/classification/papers/54.json","rows":100},{"order":"archive","page":55,"of":146,"url":"/task/classification/papers/55","json":"/task/classification/papers/55.json","rows":100},{"order":"archive","page":56,"of":146,"url":"/task/classification/papers/56","json":"/task/classification/papers/56.json","rows":100},{"order":"archive","page":57,"of":146,"url":"/task/classification/papers/57","json":"/task/classification/papers/57.json","rows":100},{"order":"archive","page":58,"of":146,"url":"/task/classification/papers/58","json":"/task/classification/papers/58.json","rows":100},{"order":"archive","page":59,"of":146,"url":"/task/classification/papers/59","json":"/task/classification/papers/59.json","rows":100},{"order":"archive","page":60,"of":146,"url":"/task/classification/papers/60","json":"/task/classification/papers/60.json","rows":100},{"order":"archive","page":61,"of":146,"url":"/task/classification/papers/61","json":"/task/classification/papers/61.json","rows":100},{"order":"archive","page":62,"of":146,"url":"/task/classification/papers/62","json":"/task/classification/papers/62.json","rows":100},{"order":"archive","page":63,"of":146,"url":"/task/classification/papers/63","json":"/task/classification/papers/63.json","rows":100},{"order":"archive","page":64,"of":146,"url":"/task/classification/papers/64","json":"/task/classification/papers/64.json","rows":100},{"order":"archive","page":65,"of":146,"url":"/task/classification/papers/65","json":"/task/classification/papers/65.json","rows":100},{"order":"archive","page":66,"of":146,"url":"/task/classification/papers/66","json":"/task/classification/papers/66.json","rows":100},{"order":"archive","page":67,"of":146,"url":"/task/classification/papers/67","json":"/task/classification/papers/67.json","rows":100},{"order":"archive","page":68,"of":146,"url":"/task/classification/papers/68","json":"/task/classification/papers/68.json","rows":100},{"order":"archive","page":69,"of":146,"url":"/task/classification/papers/69","json":"/task/classification/papers/69.json","rows":100},{"order":"archive","page":70,"of":146,"url":"/task/classification/papers/70","json":"/task/classification/papers/70.json","rows":100},{"order":"archive","page":71,"of":146,"url":"/task/classification/papers/71","json":"/task/classification/papers/71.json","rows":100},{"order":"archive","page":72,"of":146,"url":"/task/classification/papers/72","json":"/task/classification/papers/72.json","rows":100},{"order":"archive","page":73,"of":146,"url":"/task/classification/papers/73","json":"/task/classification/papers/73.json","rows":100},{"order":"archive","page":74,"of":146,"url":"/task/classification/papers/74","json":"/task/classification/papers/74.json","rows":100},{"order":"archive","page":75,"of":146,"url":"/task/classification/papers/75","json":"/task/classification/papers/75.json","rows":100},{"order":"archive","page":76,"of":146,"url":"/task/classification/papers/76","json":"/task/classification/papers/76.json","rows":100},{"order":"archive","page":77,"of":146,"url":"/task/classification/papers/77","json":"/task/classification/papers/77.json","rows":100},{"order":"archive","page":78,"of":146,"url":"/task/classification/papers/78","json":"/task/classification/papers/78.json","rows":100},{"order":"archive","page":79,"of":146,"url":"/task/classification/papers/79","json":"/task/classification/papers/79.json","rows":100},{"order":"archive","page":80,"of":146,"url":"/task/classification/papers/80","json":"/task/classification/papers/80.json","rows":100},{"order":"archive","page":81,"of":146,"url":"/task/classification/papers/81","json":"/task/classification/papers/81.json","rows":100},{"order":"archive","page":82,"of":146,"url":"/task/classification/papers/82","json":"/task/classification/papers/82.json","rows":100},{"order":"archive","page":83,"of":146,"url":"/task/classification/papers/83","json":"/task/classification/papers/83.json","rows":100},{"order":"archive","page":84,"of":146,"url":"/task/classification/papers/84","json":"/task/classification/papers/84.json","rows":100},{"order":"archive","page":85,"of":146,"url":"/task/classification/papers/85","json":"/task/classification/papers/85.json","rows":100},{"order":"archive","page":86,"of":146,"url":"/task/classification/papers/86","json":"/task/classification/papers/86.json","rows":100},{"order":"archive","page":87,"of":146,"url":"/task/classification/papers/87","json":"/task/classification/papers/87.json","rows":100},{"order":"archive","page":88,"of":146,"url":"/task/classification/papers/88","json":"/task/classification/papers/88.json","rows":100},{"order":"archive","page":89,"of":146,"url":"/task/classification/papers/89","json":"/task/classification/papers/89.json","rows":100},{"order":"archive","page":90,"of":146,"url":"/task/classification/papers/90","json":"/task/classification/papers/90.json","rows":100},{"order":"archive","page":91,"of":146,"url":"/task/classification/papers/91","json":"/task/classification/papers/91.json","rows":100},{"order":"archive","page":92,"of":146,"url":"/task/classification/papers/92","json":"/task/classification/papers/92.json","rows":100},{"order":"archive","page":93,"of":146,"url":"/task/classification/papers/93","json":"/task/classification/papers/93.json","rows":100},{"order":"archive","page":94,"of":146,"url":"/task/classification/papers/94","json":"/task/classification/papers/94.json","rows":100},{"order":"archive","page":95,"of":146,"url":"/task/classification/papers/95","json":"/task/classification/papers/95.json","rows":100},{"order":"archive","page":96,"of":146,"url":"/task/classification/papers/96","json":"/task/classification/papers/96.json","rows":100},{"order":"archive","page":97,"of":146,"url":"/task/classification/papers/97","json":"/task/classification/papers/97.json","rows":100},{"order":"archive","page":98,"of":146,"url":"/task/classification/papers/98","json":"/task/classification/papers/98.json","rows":100},{"order":"archive","page":99,"of":146,"url":"/task/classification/papers/99","json":"/task/classification/papers/99.json","rows":100},{"order":"archive","page":100,"of":146,"url":"/task/classification/papers/100","json":"/task/classification/papers/100.json","rows":100},{"order":"archive","page":101,"of":146,"url":"/task/classification/papers/101","json":"/task/classification/papers/101.json","rows":100},{"order":"archive","page":102,"of":146,"url":"/task/classification/papers/102","json":"/task/classification/papers/102.json","rows":100},{"order":"archive","page":103,"of":146,"url":"/task/classification/papers/103","json":"/task/classification/papers/103.json","rows":100},{"order":"archive","page":104,"of":146,"url":"/task/classification/papers/104","json":"/task/classification/papers/104.json","rows":100},{"order":"archive","page":105,"of":146,"url":"/task/classification/papers/105","json":"/task/classification/papers/105.json","rows":100},{"order":"archive","page":106,"of":146,"url":"/task/classification/papers/106","json":"/task/classification/papers/106.json","rows":100},{"order":"archive","page":107,"of":146,"url":"/task/classification/papers/107","json":"/task/classification/papers/107.json","rows":100},{"order":"archive","page":108,"of":146,"url":"/task/classification/papers/108","json":"/task/classification/papers/108.json","rows":100},{"order":"archive","page":109,"of":146,"url":"/task/classification/papers/109","json":"/task/classification/papers/109.json","rows":100},{"order":"archive","page":110,"of":146,"url":"/task/classification/papers/110","json":"/task/classification/papers/110.json","rows":100},{"order":"archive","page":111,"of":146,"url":"/task/classification/papers/111","json":"/task/classification/papers/111.json","rows":100},{"order":"archive","page":112,"of":146,"url":"/task/classification/papers/112","json":"/task/classification/papers/112.json","rows":100},{"order":"archive","page":113,"of":146,"url":"/task/classification/papers/113","json":"/task/classification/papers/113.json","rows":100},{"order":"archive","page":114,"of":146,"url":"/task/classification/papers/114","json":"/task/classification/papers/114.json","rows":100},{"order":"archive","page":115,"of":146,"url":"/task/classification/papers/115","json":"/task/classification/papers/115.json","rows":100},{"order":"archive","page":116,"of":146,"url":"/task/classification/papers/116","json":"/task/classification/papers/116.json","rows":100},{"order":"archive","page":117,"of":146,"url":"/task/classification/papers/117","json":"/task/classification/papers/117.json","rows":100},{"order":"archive","page":118,"of":146,"url":"/task/classification/papers/118","json":"/task/classification/papers/118.json","rows":100},{"order":"archive","page":119,"of":146,"url":"/task/classification/papers/119","json":"/task/classification/papers/119.json","rows":100},{"order":"archive","page":120,"of":146,"url":"/task/classification/papers/120","json":"/task/classification/papers/120.json","rows":100},{"order":"archive","page":121,"of":146,"url":"/task/classification/papers/121","json":"/task/classification/papers/121.json","rows":100},{"order":"archive","page":122,"of":146,"url":"/task/classification/papers/122","json":"/task/classification/papers/122.json","rows":100},{"order":"archive","page":123,"of":146,"url":"/task/classification/papers/123","json":"/task/classification/papers/123.json","rows":100},{"order":"archive","page":124,"of":146,"url":"/task/classification/papers/124","json":"/task/classification/papers/124.json","rows":100},{"order":"archive","page":125,"of":146,"url":"/task/classification/papers/125","json":"/task/classification/papers/125.json","rows":100},{"order":"archive","page":126,"of":146,"url":"/task/classification/papers/126","json":"/task/classification/papers/126.json","rows":100},{"order":"archive","page":127,"of":146,"url":"/task/classification/papers/127","json":"/task/classification/papers/127.json","rows":100},{"order":"archive","page":128,"of":146,"url":"/task/classification/papers/128","json":"/task/classification/papers/128.json","rows":100},{"order":"archive","page":129,"of":146,"url":"/task/classification/papers/129","json":"/task/classification/papers/129.json","rows":100},{"order":"archive","page":130,"of":146,"url":"/task/classification/papers/130","json":"/task/classification/papers/130.json","rows":100},{"order":"archive","page":131,"of":146,"url":"/task/classification/papers/131","json":"/task/classification/papers/131.json","rows":100},{"order":"archive","page":132,"of":146,"url":"/task/classification/papers/132","json":"/task/classification/papers/132.json","rows":100},{"order":"archive","page":133,"of":146,"url":"/task/classification/papers/133","json":"/task/classification/papers/133.json","rows":100},{"order":"archive","page":134,"of":146,"url":"/task/classification/papers/134","json":"/task/classification/papers/134.json","rows":100},{"order":"archive","page":135,"of":146,"url":"/task/classification/papers/135","json":"/task/classification/papers/135.json","rows":100},{"order":"archive","page":136,"of":146,"url":"/task/classification/papers/136","json":"/task/classification/papers/136.json","rows":100},{"order":"archive","page":137,"of":146,"url":"/task/classification/papers/137","json":"/task/classification/papers/137.json","rows":100},{"order":"archive","page":138,"of":146,"url":"/task/classification/papers/138","json":"/task/classification/papers/138.json","rows":100},{"order":"archive","page":139,"of":146,"url":"/task/classification/papers/139","json":"/task/classification/papers/139.json","rows":100},{"order":"archive","page":140,"of":146,"url":"/task/classification/papers/140","json":"/task/classification/papers/140.json","rows":100},{"order":"archive","page":141,"of":146,"url":"/task/classification/papers/141","json":"/task/classification/papers/141.json","rows":100},{"order":"archive","page":142,"of":146,"url":"/task/classification/papers/142","json":"/task/classification/papers/142.json","rows":100},{"order":"archive","page":143,"of":146,"url":"/task/classification/papers/143","json":"/task/classification/papers/143.json","rows":100},{"order":"archive","page":144,"of":146,"url":"/task/classification/papers/144","json":"/task/classification/papers/144.json","rows":100},{"order":"archive","page":145,"of":146,"url":"/task/classification/papers/145","json":"/task/classification/papers/145.json","rows":100},{"order":"archive","page":146,"of":146,"url":"/task/classification/papers/146","json":"/task/classification/papers/146.json","rows":81},{"order":"ran","page":1,"of":8,"url":"/task/classification/papers/ran/1","json":"/task/classification/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":8,"url":"/task/classification/papers/ran/2","json":"/task/classification/papers/ran/2.json","rows":100},{"order":"ran","page":3,"of":8,"url":"/task/classification/papers/ran/3","json":"/task/classification/papers/ran/3.json","rows":100},{"order":"ran","page":4,"of":8,"url":"/task/classification/papers/ran/4","json":"/task/classification/papers/ran/4.json","rows":100},{"order":"ran","page":5,"of":8,"url":"/task/classification/papers/ran/5","json":"/task/classification/papers/ran/5.json","rows":100},{"order":"ran","page":6,"of":8,"url":"/task/classification/papers/ran/6","json":"/task/classification/papers/ran/6.json","rows":100},{"order":"ran","page":7,"of":8,"url":"/task/classification/papers/ran/7","json":"/task/classification/papers/ran/7.json","rows":100},{"order":"ran","page":8,"of":8,"url":"/task/classification/papers/ran/8","json":"/task/classification/papers/ran/8.json","rows":13}],"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":"09d20add862e66fdcaf74e8c3b346b03c5df780077b4188d03077057fe994e1a","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}