{"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":"/dataset/newsqa","name":"NewsQA","full_name":null,"description_markdown":"The **NewsQA** dataset is a crowd-sourced machine reading comprehension dataset of 120,000 question-answer pairs.\r\n\r\n* Documents are CNN news articles.\r\n* Questions are written by human users in natural language.\r\n* Answers may be multiword passages of the source text.\r\n* Questions may be unanswerable.\r\n* NewsQA is collected using a 3-stage, siloed process.\r\n* Questioners see only an article’s headline and highlights.\r\n* Answerers see the question and the full article, then select an answer passage.\r\n* Validators see the article, the question, and a set of answers that they rank.\r\n* NewsQA is more natural and more challenging than previous datasets.\r\n\r\nSource: [https://www.microsoft.com/en-us/research/project/newsqa-dataset/](https://www.microsoft.com/en-us/research/project/newsqa-dataset/)\r\nImage Source: [Trischler et al](https://arxiv.org/pdf/1611.09830v3.pdf)","description_withheld":null,"homepage":"https://www.microsoft.com/en-us/research/project/newsqa-dataset/","introduced_date":"2017-01-01","introduced_date_note":null,"introduced_by":{"paper":"/paper/newsqa-a-machine-comprehension-dataset","title":"NewsQA: A Machine Comprehension Dataset","first_author":"Adam Trischler","url":null},"license":{"name":"Custom","url":"https://www.microsoft.com/en-us/research/project/newsqa-dataset/#!download"},"modalities":[{"name":"Texts","url":"/datasets/modality/texts"}],"tasks":[{"name":"Question Answering","url":"/task/question-answering","datasets_with_task":"/datasets/task/question-answering"},{"name":"Reading Comprehension","url":"/task/reading-comprehension","datasets_with_task":"/datasets/task/reading-comprehension"}],"languages":[{"name":"English","url":"/datasets/language/english"}],"variants":["NewsQA"],"data_loaders":[{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/Maluuba/newsqa","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/newsqa","frameworks":["tf","pytorch","jax"]}],"num_papers_in_archive":272,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/question-answering-on-newsqa","task":"Question Answering","dataset_variant":"NewsQA","rows":18,"metrics":["EM","F1"],"first_row_in_archive_order":{"model":"OpenAI/o3-2025-01-31-high","paper":"/paper/o3-mini-vs-deepseek-r1-which-one-is-safer","metrics":{"EM":"92.52","F1":"93.13"},"code_links":[{"title":"trust4ai/astral","url":"https://github.com/trust4ai/astral"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":18,"of":18,"counts":{"papers_with_a_benchmark_row":18,"with_a_code_link":14,"where_syntology_ran_a_sample":6,"not_listed_spam_title":0,"listed":18,"listed_where_code_ran":6,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":6,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":6,"listed_every_run_a_failure_of_syntologys_instrument":0,"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 with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"paper":"/paper/o3-mini-vs-deepseek-r1-which-one-is-safer","slug":"o3-mini-vs-deepseek-r1-which-one-is-safer","title":"o3-mini vs DeepSeek-R1: Which One is Safer?","date":"2025-01-30","arxiv_id":"2501.18438","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/deepseek-r1-incentivizing-reasoning","slug":"deepseek-r1-incentivizing-reasoning","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","date":"2025-01-22","arxiv_id":"2501.12948","rows_on_this_dataset":1,"code_links":4,"syntology":null},{"paper":"/paper/sieve-general-purpose-data-filtering-system","slug":"sieve-general-purpose-data-filtering-system","title":"GPT-4o as the Gold Standard: A Scalable and General Purpose Approach to Filter Language Model Pretraining Data","date":"2024-10-03","arxiv_id":"2410.02755","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/claude-3-5-sonnet-model-card-addendum","slug":"claude-3-5-sonnet-model-card-addendum","title":"Claude 3.5 Sonnet Model Card Addendum","date":"2024-06-24","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/gemini-1-5-unlocking-multimodal-understanding","slug":"gemini-1-5-unlocking-multimodal-understanding","title":"Gemini 1.5: Unlocking multimodal understanding across millions of tokens of context","date":"2024-03-08","arxiv_id":"2403.05530","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/dyrex-dynamic-query-representation-for","slug":"dyrex-dynamic-query-representation-for","title":"DyREx: Dynamic Query Representation for Extractive Question Answering","date":"2022-10-26","arxiv_id":"2210.15048","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":3,"official":{"repos":["urchade/dyrex"],"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":["official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dyrex-dynamic-query-representation-for#ran","syntology_url":"https://syntology.ai/paper/2210.15048","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.15048"}}}},{"paper":"/paper/0-1-deep-neural-networks-via-block-coordinate","slug":"0-1-deep-neural-networks-via-block-coordinate","title":"0/1 Deep Neural Networks via Block Coordinate Descent","date":"2022-06-19","arxiv_id":"2206.09379","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/time-series-transformer-generative","slug":"time-series-transformer-generative","title":"Time-series Transformer Generative Adversarial Networks","date":"2022-05-23","arxiv_id":"2205.11164","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/linkbert-pretraining-language-models-with","slug":"linkbert-pretraining-language-models-with","title":"LinkBERT: Pretraining Language Models with Document Links","date":"2022-03-29","arxiv_id":"2203.15827","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":14,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":11,"pointer_only_for_licence":0,"official":{"repos":["michiyasunaga/LinkBERT"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":["found_in_text"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/linkbert-pretraining-language-models-with#ran","syntology_url":"https://syntology.ai/paper/2203.15827","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.15827"}}}},{"paper":"/paper/xai-for-transformers-better-explanations","slug":"xai-for-transformers-better-explanations","title":"XAI for Transformers: Better Explanations through Conservative Propagation","date":"2022-02-15","arxiv_id":"2202.07304","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":12,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["ameenali/xai_transformers"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/xai-for-transformers-better-explanations#ran","syntology_url":"https://syntology.ai/paper/2202.07304","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.07304"}}}},{"paper":"/paper/learning-to-generate-questions-by-learning-to","slug":"learning-to-generate-questions-by-learning-to","title":"Learning to Generate Questions by Learning to Recover Answer-containing Sentences","date":"2021-08-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/thinking-like-transformers-1","slug":"thinking-like-transformers-1","title":"Thinking Like Transformers","date":"2021-06-13","arxiv_id":"2106.06981","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":18,"samples_ran":11,"samples_constructed":3,"samples_ran_checked":7,"samples_ran_instrument_failed":4,"samples_unverified":7,"pointer_only_for_licence":5,"official":{"repos":["tech-srl/RASP"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":2,"n_ran_no_instrument_failure":4,"n_unverified":5,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/thinking-like-transformers-1#ran","syntology_url":"https://syntology.ai/paper/2106.06981","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06981"}}}},{"paper":"/paper/spanbert-improving-pre-training-by","slug":"spanbert-improving-pre-training-by","title":"SpanBERT: Improving Pre-training by Representing and Predicting Spans","date":"2019-07-24","arxiv_id":"1907.10529","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":4,"samples_unverified":6,"pointer_only_for_licence":6,"official":{"repos":["facebookresearch/SpanBERT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/spanbert-improving-pre-training-by#ran","syntology_url":"https://syntology.ai/paper/1907.10529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.10529"}}}},{"paper":"/paper/densely-connected-attention-propagation-for","slug":"densely-connected-attention-propagation-for","title":"Densely Connected Attention Propagation for Reading Comprehension","date":"2018-11-10","arxiv_id":"1811.04210","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/efficient-and-robust-question-answering-from","slug":"efficient-and-robust-question-answering-from","title":"Efficient and Robust Question Answering from Minimal Context over Documents","date":"2018-05-21","arxiv_id":"1805.08092","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-question-focused-multi-factor-attention","slug":"a-question-focused-multi-factor-attention","title":"A Question-Focused Multi-Factor Attention Network for Question Answering","date":"2018-01-25","arxiv_id":"1801.08290","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/making-neural-qa-as-simple-as-possible-but","slug":"making-neural-qa-as-simple-as-possible-but","title":"Making Neural QA as Simple as Possible but not Simpler","date":"2017-03-14","arxiv_id":"1703.04816","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/making-neural-qa-as-simple-as-possible-but#ran","syntology_url":"https://syntology.ai/paper/1703.04816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.04816"}}}},{"paper":"/paper/deepsense-a-unified-deep-learning-framework","slug":"deepsense-a-unified-deep-learning-framework","title":"DeepSense: A Unified Deep Learning Framework for Time-Series Mobile Sensing Data Processing","date":"2016-11-07","arxiv_id":"1611.01942","rows_on_this_dataset":1,"code_links":1,"syntology":null}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/o3-mini-vs-deepseek-r1-which-one-is-safer","slug":"o3-mini-vs-deepseek-r1-which-one-is-safer","title":"o3-mini vs DeepSeek-R1: Which One is Safer?","date":"2025-01-30","arxiv_id":"2501.18438","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/deepseek-r1-incentivizing-reasoning","slug":"deepseek-r1-incentivizing-reasoning","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","date":"2025-01-22","arxiv_id":"2501.12948","rows_on_this_dataset":1,"code_links":4,"syntology":null},{"paper":"/paper/sieve-general-purpose-data-filtering-system","slug":"sieve-general-purpose-data-filtering-system","title":"GPT-4o as the Gold Standard: A Scalable and General Purpose Approach to Filter Language Model Pretraining Data","date":"2024-10-03","arxiv_id":"2410.02755","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/claude-3-5-sonnet-model-card-addendum","slug":"claude-3-5-sonnet-model-card-addendum","title":"Claude 3.5 Sonnet Model Card Addendum","date":"2024-06-24","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/gemini-1-5-unlocking-multimodal-understanding","slug":"gemini-1-5-unlocking-multimodal-understanding","title":"Gemini 1.5: Unlocking multimodal understanding across millions of tokens of context","date":"2024-03-08","arxiv_id":"2403.05530","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/dyrex-dynamic-query-representation-for","slug":"dyrex-dynamic-query-representation-for","title":"DyREx: Dynamic Query Representation for Extractive Question Answering","date":"2022-10-26","arxiv_id":"2210.15048","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":3,"official":{"repos":["urchade/dyrex"],"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":["official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dyrex-dynamic-query-representation-for#ran","syntology_url":"https://syntology.ai/paper/2210.15048","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.15048"}}}},{"paper":"/paper/0-1-deep-neural-networks-via-block-coordinate","slug":"0-1-deep-neural-networks-via-block-coordinate","title":"0/1 Deep Neural Networks via Block Coordinate Descent","date":"2022-06-19","arxiv_id":"2206.09379","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/time-series-transformer-generative","slug":"time-series-transformer-generative","title":"Time-series Transformer Generative Adversarial Networks","date":"2022-05-23","arxiv_id":"2205.11164","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/linkbert-pretraining-language-models-with","slug":"linkbert-pretraining-language-models-with","title":"LinkBERT: Pretraining Language Models with Document Links","date":"2022-03-29","arxiv_id":"2203.15827","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":14,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":11,"pointer_only_for_licence":0,"official":{"repos":["michiyasunaga/LinkBERT"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":["found_in_text"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/linkbert-pretraining-language-models-with#ran","syntology_url":"https://syntology.ai/paper/2203.15827","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.15827"}}}},{"paper":"/paper/xai-for-transformers-better-explanations","slug":"xai-for-transformers-better-explanations","title":"XAI for Transformers: Better Explanations through Conservative Propagation","date":"2022-02-15","arxiv_id":"2202.07304","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":12,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["ameenali/xai_transformers"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/xai-for-transformers-better-explanations#ran","syntology_url":"https://syntology.ai/paper/2202.07304","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.07304"}}}},{"paper":"/paper/learning-to-generate-questions-by-learning-to","slug":"learning-to-generate-questions-by-learning-to","title":"Learning to Generate Questions by Learning to Recover Answer-containing Sentences","date":"2021-08-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/thinking-like-transformers-1","slug":"thinking-like-transformers-1","title":"Thinking Like Transformers","date":"2021-06-13","arxiv_id":"2106.06981","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":18,"samples_ran":11,"samples_constructed":3,"samples_ran_checked":7,"samples_ran_instrument_failed":4,"samples_unverified":7,"pointer_only_for_licence":5,"official":{"repos":["tech-srl/RASP"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":2,"n_ran_no_instrument_failure":4,"n_unverified":5,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/thinking-like-transformers-1#ran","syntology_url":"https://syntology.ai/paper/2106.06981","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06981"}}}},{"paper":"/paper/spanbert-improving-pre-training-by","slug":"spanbert-improving-pre-training-by","title":"SpanBERT: Improving Pre-training by Representing and Predicting Spans","date":"2019-07-24","arxiv_id":"1907.10529","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":4,"samples_unverified":6,"pointer_only_for_licence":6,"official":{"repos":["facebookresearch/SpanBERT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/spanbert-improving-pre-training-by#ran","syntology_url":"https://syntology.ai/paper/1907.10529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.10529"}}}},{"paper":"/paper/densely-connected-attention-propagation-for","slug":"densely-connected-attention-propagation-for","title":"Densely Connected Attention Propagation for Reading Comprehension","date":"2018-11-10","arxiv_id":"1811.04210","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/efficient-and-robust-question-answering-from","slug":"efficient-and-robust-question-answering-from","title":"Efficient and Robust Question Answering from Minimal Context over Documents","date":"2018-05-21","arxiv_id":"1805.08092","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-question-focused-multi-factor-attention","slug":"a-question-focused-multi-factor-attention","title":"A Question-Focused Multi-Factor Attention Network for Question Answering","date":"2018-01-25","arxiv_id":"1801.08290","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/making-neural-qa-as-simple-as-possible-but","slug":"making-neural-qa-as-simple-as-possible-but","title":"Making Neural QA as Simple as Possible but not Simpler","date":"2017-03-14","arxiv_id":"1703.04816","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/making-neural-qa-as-simple-as-possible-but#ran","syntology_url":"https://syntology.ai/paper/1703.04816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.04816"}}}},{"paper":"/paper/deepsense-a-unified-deep-learning-framework","slug":"deepsense-a-unified-deep-learning-framework","title":"DeepSense: A Unified Deep Learning Framework for Time-Series Mobile Sensing Data Processing","date":"2016-11-07","arxiv_id":"1611.01942","rows_on_this_dataset":1,"code_links":1,"syntology":null}],"papers_where_code_ran":6,"papers_where_code_ran_first_page":"/dataset/newsqa/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/dataset/newsqa/papers/ran/1","json":"/dataset/newsqa/papers/ran/1.json","rows":6}],"row_route":"each paper's syntology object 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","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":6,"samples_harvested":64,"samples_ran":36,"samples_constructed":3,"samples_ran_checked":27,"samples_ran_instrument_failed":9,"samples_unverified":28,"pointer_only_for_licence":14,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":6,"papers_with_a_run_with_no_instrument_failure":6,"papers_where_every_run_was_an_instrument_failure":0,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"aeb60b721d304cc4bd35851db212cd026cdd0d1870039aee817688e4023b81f9","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}