{"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/searchqa","name":"SearchQA","full_name":null,"description_markdown":"SearchQA was built using an in-production, commercial search engine. It closely reflects the full pipeline of a (hypothetical) general question-answering system, which consists of information retrieval and answer synthesis. \r\n\r\nSource: [SearchQA: A New Q&A Dataset Augmented with Context from a Search Engine](https://arxiv.org/pdf/1704.05179.pdf)","description_withheld":null,"homepage":"https://github.com/nyu-dl/dl4ir-searchQA","introduced_date":"2017-04-18","introduced_date_note":null,"introduced_by":{"paper":"/paper/searchqa-a-new-qa-dataset-augmented-with","title":"SearchQA: A New Q&A Dataset Augmented with Context from a Search Engine","first_author":"Matthew Dunn","url":null},"license":{"name":"Unknown","url":null},"modalities":[{"name":"Texts","url":"/datasets/modality/texts"}],"tasks":[{"name":"Open-Domain Question Answering","url":"/task/open-domain-question-answering","datasets_with_task":"/datasets/task/open-domain-question-answering"}],"languages":[{"name":"English","url":"/datasets/language/english"}],"variants":["SearchQA"],"data_loaders":[{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/kyunghyuncho/search_qa","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/search_qa","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/nyu-dl/dl4ir-searchQA","url":"https://github.com/nyu-dl/dl4ir-searchQA","frameworks":["pytorch"]}],"num_papers_in_archive":133,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/open-domain-question-answering-on-searchqa","task":"Open-Domain Question Answering","dataset_variant":"SearchQA","rows":14,"metrics":["EM","N-gram F1","Unigram Acc","F1"],"first_row_in_archive_order":{"model":"Cluster-Former (#C=512)","paper":"/paper/cluster-former-clustering-based-sparse","metrics":{"EM":"68.0"},"code_links":[]},"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":13,"of":13,"counts":{"papers_with_a_benchmark_row":13,"with_a_code_link":9,"where_syntology_ran_a_sample":5,"not_listed_spam_title":0,"listed":13,"listed_where_code_ran":5,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":5,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":5,"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/cluster-former-clustering-based-sparse","slug":"cluster-former-clustering-based-sparse","title":"Cluster-Former: Clustering-based Sparse Transformer for Long-Range Dependency Encoding","date":"2020-09-13","arxiv_id":"2009.06097","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/reformer-the-efficient-transformer-1","slug":"reformer-the-efficient-transformer-1","title":"Reformer: The Efficient Transformer","date":"2020-01-13","arxiv_id":"2001.04451","rows_on_this_dataset":1,"code_links":10,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":6,"samples_constructed":1,"samples_ran_checked":1,"samples_ran_instrument_failed":5,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["google/trax"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/reformer-the-efficient-transformer-1#ran","syntology_url":"https://syntology.ai/paper/2001.04451","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.04451"}}}},{"paper":"/paper/multi-passage-bert-a-globally-normalized-bert","slug":"multi-passage-bert-a-globally-normalized-bert","title":"Multi-passage BERT: A Globally Normalized BERT Model for Open-domain Question Answering","date":"2019-08-22","arxiv_id":"1908.08167","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"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/190410509","slug":"190410509","title":"Generating Long Sequences with Sparse Transformers","date":"2019-04-23","arxiv_id":"1904.10509","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":5,"samples_constructed":4,"samples_ran_checked":4,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["openai/sparse_attention"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/190410509#ran","syntology_url":"https://syntology.ai/paper/1904.10509","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.10509"}}}},{"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":2,"code_links":2,"syntology":null},{"paper":"/paper/multi-granular-sequence-encoding-via-dilated","slug":"multi-granular-sequence-encoding-via-dilated","title":"Multi-Granular Sequence Encoding via Dilated Compositional Units for Reading Comprehension","date":"2018-10-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/denoising-distantly-supervised-open-domain","slug":"denoising-distantly-supervised-open-domain","title":"Denoising Distantly Supervised Open-Domain Question Answering","date":"2018-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/focused-hierarchical-rnns-for-conditional","slug":"focused-hierarchical-rnns-for-conditional","title":"Focused Hierarchical RNNs for Conditional Sequence Processing","date":"2018-06-12","arxiv_id":"1806.04342","rows_on_this_dataset":1,"code_links":0,"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/r3-reinforced-reader-ranker-for-open-domain","slug":"r3-reinforced-reader-ranker-for-open-domain","title":"R$^3$: Reinforced Reader-Ranker for Open-Domain Question Answering","date":"2017-08-31","arxiv_id":"1709.00023","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/reading-wikipedia-to-answer-open-domain","slug":"reading-wikipedia-to-answer-open-domain","title":"Reading Wikipedia to Answer Open-Domain Questions","date":"2017-03-31","arxiv_id":"1704.00051","rows_on_this_dataset":1,"code_links":10,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["facebookresearch/DrQA"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/reading-wikipedia-to-answer-open-domain#ran","syntology_url":"https://syntology.ai/paper/1704.00051","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.00051"}}}},{"paper":"/paper/text-understanding-with-the-attention-sum","slug":"text-understanding-with-the-attention-sum","title":"Text Understanding with the Attention Sum Reader Network","date":"2016-03-04","arxiv_id":"1603.01547","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":8,"pointer_only_for_licence":1,"official":{"repos":["rkadlec/asreader"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/text-understanding-with-the-attention-sum#ran","syntology_url":"https://syntology.ai/paper/1603.01547","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.01547"}}}}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/cluster-former-clustering-based-sparse","slug":"cluster-former-clustering-based-sparse","title":"Cluster-Former: Clustering-based Sparse Transformer for Long-Range Dependency Encoding","date":"2020-09-13","arxiv_id":"2009.06097","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/reformer-the-efficient-transformer-1","slug":"reformer-the-efficient-transformer-1","title":"Reformer: The Efficient Transformer","date":"2020-01-13","arxiv_id":"2001.04451","rows_on_this_dataset":1,"code_links":10,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":6,"samples_constructed":1,"samples_ran_checked":1,"samples_ran_instrument_failed":5,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["google/trax"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/reformer-the-efficient-transformer-1#ran","syntology_url":"https://syntology.ai/paper/2001.04451","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.04451"}}}},{"paper":"/paper/multi-passage-bert-a-globally-normalized-bert","slug":"multi-passage-bert-a-globally-normalized-bert","title":"Multi-passage BERT: A Globally Normalized BERT Model for Open-domain Question Answering","date":"2019-08-22","arxiv_id":"1908.08167","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"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/190410509","slug":"190410509","title":"Generating Long Sequences with Sparse Transformers","date":"2019-04-23","arxiv_id":"1904.10509","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":5,"samples_constructed":4,"samples_ran_checked":4,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["openai/sparse_attention"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/190410509#ran","syntology_url":"https://syntology.ai/paper/1904.10509","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.10509"}}}},{"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":2,"code_links":2,"syntology":null},{"paper":"/paper/multi-granular-sequence-encoding-via-dilated","slug":"multi-granular-sequence-encoding-via-dilated","title":"Multi-Granular Sequence Encoding via Dilated Compositional Units for Reading Comprehension","date":"2018-10-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/denoising-distantly-supervised-open-domain","slug":"denoising-distantly-supervised-open-domain","title":"Denoising Distantly Supervised Open-Domain Question Answering","date":"2018-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/focused-hierarchical-rnns-for-conditional","slug":"focused-hierarchical-rnns-for-conditional","title":"Focused Hierarchical RNNs for Conditional Sequence Processing","date":"2018-06-12","arxiv_id":"1806.04342","rows_on_this_dataset":1,"code_links":0,"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/r3-reinforced-reader-ranker-for-open-domain","slug":"r3-reinforced-reader-ranker-for-open-domain","title":"R$^3$: Reinforced Reader-Ranker for Open-Domain Question Answering","date":"2017-08-31","arxiv_id":"1709.00023","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/reading-wikipedia-to-answer-open-domain","slug":"reading-wikipedia-to-answer-open-domain","title":"Reading Wikipedia to Answer Open-Domain Questions","date":"2017-03-31","arxiv_id":"1704.00051","rows_on_this_dataset":1,"code_links":10,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["facebookresearch/DrQA"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/reading-wikipedia-to-answer-open-domain#ran","syntology_url":"https://syntology.ai/paper/1704.00051","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.00051"}}}},{"paper":"/paper/text-understanding-with-the-attention-sum","slug":"text-understanding-with-the-attention-sum","title":"Text Understanding with the Attention Sum Reader Network","date":"2016-03-04","arxiv_id":"1603.01547","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":8,"pointer_only_for_licence":1,"official":{"repos":["rkadlec/asreader"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/text-understanding-with-the-attention-sum#ran","syntology_url":"https://syntology.ai/paper/1603.01547","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.01547"}}}}],"papers_where_code_ran":5,"papers_where_code_ran_first_page":"/dataset/searchqa/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/searchqa/papers/ran/1","json":"/dataset/searchqa/papers/ran/1.json","rows":5}],"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":5,"samples_harvested":40,"samples_ran":23,"samples_constructed":5,"samples_ran_checked":13,"samples_ran_instrument_failed":10,"samples_unverified":17,"pointer_only_for_licence":8,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":5,"papers_with_a_run_with_no_instrument_failure":5,"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":1,"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/open-domain-question-answering-on-searchqa","since_archive":"/sota/open-domain-question-answering-on-searchqa#since-judged","papers_judged":1,"placed":0}]},"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":"043347ca02b4571258b71f0a580ca6420219c3dd0ec88b8f084b068700cc0c0b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}