{"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/ms-marco","name":"MS MARCO","full_name":"Microsoft Machine Reading Comprehension Dataset","description_markdown":"The **MS MARCO** (Microsoft MAchine Reading Comprehension) is a collection of datasets focused on deep learning in search.\r\nThe first dataset was a question answering dataset featuring 100,000 real Bing questions and a human generated answer. Over time the collection was extended with a 1,000,000 question dataset, a natural language generation dataset, a passage ranking dataset, keyphrase extraction dataset, crawling dataset, and a conversational search.\r\n\r\nSource: [https://microsoft.github.io/msmarco/](https://microsoft.github.io/msmarco/)\r\nImage Source: [https://arxiv.org/pdf/1809.08267.pdf](https://arxiv.org/pdf/1809.08267.pdf)","description_withheld":null,"homepage":"https://microsoft.github.io/msmarco/","introduced_date":"2016-01-01","introduced_date_note":null,"introduced_by":{"paper":"/paper/ms-marco-a-human-generated-machine-reading","title":"MS MARCO: A Human Generated MAchine Reading COmprehension Dataset","first_author":"Payal Bajaj","url":null},"license":{"name":"Custom (research-only, non-commercial)","url":"https://microsoft.github.io/msmarco/#:~:text=Terms%20and%20Conditions"},"modalities":[{"name":"Texts","url":"/datasets/modality/texts"}],"tasks":[{"name":"Question Answering","url":"/task/question-answering","datasets_with_task":"/datasets/task/question-answering"},{"name":"Information Retrieval","url":"/task/information-retrieval","datasets_with_task":"/datasets/task/information-retrieval"},{"name":"Reading Comprehension","url":"/task/reading-comprehension","datasets_with_task":"/datasets/task/reading-comprehension"},{"name":"Passage Retrieval","url":"/task/passage-retrieval","datasets_with_task":"/datasets/task/passage-retrieval"},{"name":"Text Retrieval","url":"/task/text-retrieval","datasets_with_task":"/datasets/task/text-retrieval"},{"name":"Passage Re-Ranking","url":"/task/passage-re-ranking","datasets_with_task":"/datasets/task/passage-re-ranking"},{"name":"TREC 2019 Passage Ranking","url":"/task/trec-2019-passage-ranking","datasets_with_task":"/datasets/task/trec-2019-passage-ranking"},{"name":"Passage Ranking","url":"/task/passage-ranking","datasets_with_task":"/datasets/task/passage-ranking"}],"languages":[{"name":"English","url":"/datasets/language/english"}],"variants":["MS MARCO","MSMARCO"],"data_loaders":[{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/microsoft/ms_marco","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/ms_marco","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/facebookresearch/ParlAI","url":"https://parl.ai/docs/tasks.html#ms_marco","frameworks":["pytorch"]}],"num_papers_in_archive":1036,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/passage-ranking-on-ms-marco","task":"Passage Ranking","dataset_variant":"MS MARCO","rows":4,"metrics":["MRR@10"],"first_row_in_archive_order":{"model":"Fine-tuned SOTA","paper":"/paper/text-and-code-embeddings-by-contrastive-pre","metrics":{"MRR@10":"44.3"},"code_links":[{"title":"openmatch/coco-dr","url":"https://github.com/openmatch/coco-dr"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/passage-re-ranking-on-ms-marco","task":"Passage Re-Ranking","dataset_variant":"MS MARCO","rows":4,"metrics":["MRR"],"first_row_in_archive_order":{"model":"HLATR","paper":"/paper/hlatr-enhance-multi-stage-text-retrieval-with","metrics":{"MRR":"0.42"},"code_links":[{"title":"Alibaba-NLP/HLATR","url":"https://github.com/Alibaba-NLP/HLATR"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/question-answering-on-ms-marco","task":"Question Answering","dataset_variant":"MS MARCO","rows":4,"metrics":["Rouge-L","BLEU-1"],"first_row_in_archive_order":{"model":"Masque Q&A Style","paper":"/paper/multi-style-generative-reading-comprehension","metrics":{"BLEU-1":"43.77","Rouge-L":"52.2"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/information-retrieval-on-ms-marco","task":"Information Retrieval","dataset_variant":"MS MARCO","rows":3,"metrics":["Time (ms)","MRR@10"],"first_row_in_archive_order":{"model":"ConAE-128","paper":"/paper/dimension-reduction-for-efficient-dense","metrics":{"Time (ms)":"0.3245"},"code_links":[{"title":"neuir/conae","url":"https://github.com/neuir/conae"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/information-retrieval-on-msmarco","task":"Information Retrieval","dataset_variant":"MSMARCO","rows":1,"metrics":["MRR@10"],"first_row_in_archive_order":{"model":"RetroMAE","paper":"/paper/retromae-pre-training-retrieval-oriented","metrics":{"MRR@10":"0.416"},"code_links":[{"title":"staoxiao/retromae","url":"https://github.com/staoxiao/retromae"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/passage-retrieval-on-ms-marco-1","task":"Passage Retrieval","dataset_variant":"MS MARCO","rows":1,"metrics":["MAP"],"first_row_in_archive_order":{"model":"TW-BERT","paper":"/paper/end-to-end-query-term-weighting","metrics":{"MAP":"0.2025"},"code_links":[{"title":"ledmaster/tw-bert","url":"https://github.com/ledmaster/tw-bert"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/text-retrieval-on-ms-marco","task":"Text Retrieval","dataset_variant":"MS MARCO","rows":1,"metrics":["NDCG@10"],"first_row_in_archive_order":{"model":"Lucene (BM25S)","paper":"/paper/bm25s-orders-of-magnitude-faster-lexical","metrics":{"NDCG@10":"22.8"},"code_links":[{"title":"xhluca/bm25s","url":"https://github.com/xhluca/bm25s"},{"title":"xhluca/bm25-benchmarks","url":"https://github.com/xhluca/bm25-benchmarks"},{"title":"conda-forge/bm25s-feedstock","url":"https://github.com/conda-forge/bm25s-feedstock"}]},"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":14,"of":14,"counts":{"papers_with_a_benchmark_row":14,"with_a_code_link":11,"where_syntology_ran_a_sample":5,"not_listed_spam_title":0,"listed":14,"listed_where_code_ran":5,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":4,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":4,"listed_every_run_a_failure_of_syntologys_instrument":1,"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/bm25s-orders-of-magnitude-faster-lexical","slug":"bm25s-orders-of-magnitude-faster-lexical","title":"BM25S: Orders of magnitude faster lexical search via eager sparse scoring","date":"2024-07-04","arxiv_id":"2407.03618","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":22,"samples_ran":15,"samples_constructed":0,"samples_ran_checked":12,"samples_ran_instrument_failed":3,"samples_unverified":7,"pointer_only_for_licence":0,"official":{"repos":["xhluca/bm25s"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":7,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/bm25s-orders-of-magnitude-faster-lexical#ran","syntology_url":"https://syntology.ai/paper/2407.03618","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.03618"}}}},{"paper":"/paper/end-to-end-query-term-weighting","slug":"end-to-end-query-term-weighting","title":"End-to-End Query Term Weighting","date":"2023-08-06","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/retromae-v2-duplex-masked-auto-encoder-for","slug":"retromae-v2-duplex-masked-auto-encoder-for","title":"RetroMAE v2: Duplex Masked Auto-Encoder For Pre-Training Retrieval-Oriented Language Models","date":"2022-11-16","arxiv_id":"2211.08769","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/retromae-pre-training-retrieval-oriented","slug":"retromae-pre-training-retrieval-oriented","title":"RetroMAE: Pre-Training Retrieval-oriented Language Models Via Masked Auto-Encoder","date":"2022-05-24","arxiv_id":"2205.12035","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/hlatr-enhance-multi-stage-text-retrieval-with","slug":"hlatr-enhance-multi-stage-text-retrieval-with","title":"HLATR: Enhance Multi-stage Text Retrieval with Hybrid List Aware Transformer Reranking","date":"2022-05-21","arxiv_id":"2205.10569","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/dimension-reduction-for-efficient-dense","slug":"dimension-reduction-for-efficient-dense","title":"Dimension Reduction for Efficient Dense Retrieval via Conditional Autoencoder","date":"2022-05-06","arxiv_id":"2205.03284","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":1,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["neuir/conae"],"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":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dimension-reduction-for-efficient-dense#ran","syntology_url":"https://syntology.ai/paper/2205.03284","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.03284"}}}},{"paper":"/paper/text-and-code-embeddings-by-contrastive-pre","slug":"text-and-code-embeddings-by-contrastive-pre","title":"Text and Code Embeddings by Contrastive Pre-Training","date":"2022-01-24","arxiv_id":"2201.10005","rows_on_this_dataset":4,"code_links":1,"syntology":null},{"paper":"/paper/document-expansion-by-query-prediction","slug":"document-expansion-by-query-prediction","title":"Document Expansion by Query Prediction","date":"2019-04-17","arxiv_id":"1904.08375","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["nyu-dl/dl4ir-doc2query"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/document-expansion-by-query-prediction#ran","syntology_url":"https://syntology.ai/paper/1904.08375","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.08375"}}}},{"paper":"/paper/an-updated-duet-model-for-passage-re-ranking","slug":"an-updated-duet-model-for-passage-re-ranking","title":"An Updated Duet Model for Passage Re-ranking","date":"2019-03-18","arxiv_id":"1903.07666","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/passage-re-ranking-with-bert","slug":"passage-re-ranking-with-bert","title":"Passage Re-ranking with BERT","date":"2019-01-13","arxiv_id":"1901.04085","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":3,"samples_unverified":2,"pointer_only_for_licence":2,"official":{"repos":["nyu-dl/dl4marco-bert"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/passage-re-ranking-with-bert#ran","syntology_url":"https://syntology.ai/paper/1901.04085","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.04085"}}}},{"paper":"/paper/multi-style-generative-reading-comprehension","slug":"multi-style-generative-reading-comprehension","title":"Multi-style Generative Reading Comprehension","date":"2019-01-08","arxiv_id":"1901.02262","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/a-deep-cascade-model-for-multi-document","slug":"a-deep-cascade-model-for-multi-document","title":"A Deep Cascade Model for Multi-Document Reading Comprehension","date":"2018-11-28","arxiv_id":"1811.11374","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/multi-passage-machine-reading-comprehension","slug":"multi-passage-machine-reading-comprehension","title":"Multi-Passage Machine Reading Comprehension with Cross-Passage Answer Verification","date":"2018-05-06","arxiv_id":"1805.02220","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/bidirectional-attention-flow-for-machine","slug":"bidirectional-attention-flow-for-machine","title":"Bidirectional Attention Flow for Machine Comprehension","date":"2016-11-05","arxiv_id":"1611.01603","rows_on_this_dataset":1,"code_links":27,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":5,"samples_unverified":2,"pointer_only_for_licence":7,"official":{"repos":["allenai/bi-att-flow"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/bidirectional-attention-flow-for-machine#ran","syntology_url":"https://syntology.ai/paper/1611.01603","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01603"}}}}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/bm25s-orders-of-magnitude-faster-lexical","slug":"bm25s-orders-of-magnitude-faster-lexical","title":"BM25S: Orders of magnitude faster lexical search via eager sparse scoring","date":"2024-07-04","arxiv_id":"2407.03618","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":22,"samples_ran":15,"samples_constructed":0,"samples_ran_checked":12,"samples_ran_instrument_failed":3,"samples_unverified":7,"pointer_only_for_licence":0,"official":{"repos":["xhluca/bm25s"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":7,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/bm25s-orders-of-magnitude-faster-lexical#ran","syntology_url":"https://syntology.ai/paper/2407.03618","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.03618"}}}},{"paper":"/paper/end-to-end-query-term-weighting","slug":"end-to-end-query-term-weighting","title":"End-to-End Query Term Weighting","date":"2023-08-06","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/retromae-v2-duplex-masked-auto-encoder-for","slug":"retromae-v2-duplex-masked-auto-encoder-for","title":"RetroMAE v2: Duplex Masked Auto-Encoder For Pre-Training Retrieval-Oriented Language Models","date":"2022-11-16","arxiv_id":"2211.08769","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/retromae-pre-training-retrieval-oriented","slug":"retromae-pre-training-retrieval-oriented","title":"RetroMAE: Pre-Training Retrieval-oriented Language Models Via Masked Auto-Encoder","date":"2022-05-24","arxiv_id":"2205.12035","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/hlatr-enhance-multi-stage-text-retrieval-with","slug":"hlatr-enhance-multi-stage-text-retrieval-with","title":"HLATR: Enhance Multi-stage Text Retrieval with Hybrid List Aware Transformer Reranking","date":"2022-05-21","arxiv_id":"2205.10569","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/dimension-reduction-for-efficient-dense","slug":"dimension-reduction-for-efficient-dense","title":"Dimension Reduction for Efficient Dense Retrieval via Conditional Autoencoder","date":"2022-05-06","arxiv_id":"2205.03284","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":1,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["neuir/conae"],"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":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dimension-reduction-for-efficient-dense#ran","syntology_url":"https://syntology.ai/paper/2205.03284","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.03284"}}}},{"paper":"/paper/text-and-code-embeddings-by-contrastive-pre","slug":"text-and-code-embeddings-by-contrastive-pre","title":"Text and Code Embeddings by Contrastive Pre-Training","date":"2022-01-24","arxiv_id":"2201.10005","rows_on_this_dataset":4,"code_links":1,"syntology":null},{"paper":"/paper/document-expansion-by-query-prediction","slug":"document-expansion-by-query-prediction","title":"Document Expansion by Query Prediction","date":"2019-04-17","arxiv_id":"1904.08375","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["nyu-dl/dl4ir-doc2query"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/document-expansion-by-query-prediction#ran","syntology_url":"https://syntology.ai/paper/1904.08375","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.08375"}}}},{"paper":"/paper/an-updated-duet-model-for-passage-re-ranking","slug":"an-updated-duet-model-for-passage-re-ranking","title":"An Updated Duet Model for Passage Re-ranking","date":"2019-03-18","arxiv_id":"1903.07666","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/passage-re-ranking-with-bert","slug":"passage-re-ranking-with-bert","title":"Passage Re-ranking with BERT","date":"2019-01-13","arxiv_id":"1901.04085","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":3,"samples_unverified":2,"pointer_only_for_licence":2,"official":{"repos":["nyu-dl/dl4marco-bert"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/passage-re-ranking-with-bert#ran","syntology_url":"https://syntology.ai/paper/1901.04085","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.04085"}}}},{"paper":"/paper/multi-style-generative-reading-comprehension","slug":"multi-style-generative-reading-comprehension","title":"Multi-style Generative Reading Comprehension","date":"2019-01-08","arxiv_id":"1901.02262","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/a-deep-cascade-model-for-multi-document","slug":"a-deep-cascade-model-for-multi-document","title":"A Deep Cascade Model for Multi-Document Reading Comprehension","date":"2018-11-28","arxiv_id":"1811.11374","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/multi-passage-machine-reading-comprehension","slug":"multi-passage-machine-reading-comprehension","title":"Multi-Passage Machine Reading Comprehension with Cross-Passage Answer Verification","date":"2018-05-06","arxiv_id":"1805.02220","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/bidirectional-attention-flow-for-machine","slug":"bidirectional-attention-flow-for-machine","title":"Bidirectional Attention Flow for Machine Comprehension","date":"2016-11-05","arxiv_id":"1611.01603","rows_on_this_dataset":1,"code_links":27,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":5,"samples_unverified":2,"pointer_only_for_licence":7,"official":{"repos":["allenai/bi-att-flow"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/bidirectional-attention-flow-for-machine#ran","syntology_url":"https://syntology.ai/paper/1611.01603","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01603"}}}}],"papers_where_code_ran":5,"papers_where_code_ran_first_page":"/dataset/ms-marco/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/ms-marco/papers/ran/1","json":"/dataset/ms-marco/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":50,"samples_ran":39,"samples_constructed":1,"samples_ran_checked":25,"samples_ran_instrument_failed":14,"samples_unverified":11,"pointer_only_for_licence":10,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":5,"papers_with_a_run_with_no_instrument_failure":4,"papers_where_every_run_was_an_instrument_failure":1,"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":8,"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/passage-ranking-on-ms-marco","since_archive":"/sota/passage-ranking-on-ms-marco#since-judged","papers_judged":6,"placed":0},{"leaderboard":"/sota/question-answering-on-ms-marco","since_archive":"/sota/question-answering-on-ms-marco#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/information-retrieval-on-ms-marco","since_archive":"/sota/information-retrieval-on-ms-marco#since-judged","papers_judged":3,"placed":0},{"leaderboard":"/sota/information-retrieval-on-msmarco","since_archive":"/sota/information-retrieval-on-msmarco#since-judged","papers_judged":6,"placed":0},{"leaderboard":"/sota/text-retrieval-on-ms-marco","since_archive":"/sota/text-retrieval-on-ms-marco#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":"7b063d85ecbb5ae9407fd128ff16d483886b39aeef7c386abb24e613f2e8dbcb","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}