{"url":"/task/multi-choice-mrc","name":"Multi-Choice MRC","slug":"multi-choice-mrc","description_markdown":null,"categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":9,"papers_with_code":5,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"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":1,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/expmrc","name":"ExpMRC","full_name":"","num_papers_in_archive":2}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":5,"of":5,"tagged_in_all":9,"items":[{"url":"/paper/dual-multi-head-co-attention-for-multi-choice","title":"DUMA: Reading Comprehension with Transposition Thinking","date":"2020-01-26","arxiv_id":"2001.09415","repositories_listed":3,"syntology":null},{"url":"/paper/lite-unified-modeling-for-discriminative","title":"Lite Unified Modeling for Discriminative Reading Comprehension","date":"2022-03-26","arxiv_id":"2203.14103","repositories_listed":1,"syntology":null},{"url":"/paper/expmrc-explainability-evaluation-for-machine","title":"ExpMRC: Explainability Evaluation for Machine Reading Comprehension","date":"2021-05-10","arxiv_id":"2105.04126","repositories_listed":1,"syntology":null},{"url":"/paper/reference-knowledgeable-network-for-machine","title":"Reference Knowledgeable Network for Machine Reading Comprehension","date":"2020-12-07","arxiv_id":"2012.03709","repositories_listed":1,"syntology":null},{"url":"/paper/a-self-training-method-for-machine-reading","title":"A Self-Training Method for Machine Reading Comprehension with Soft Evidence Extraction","date":"2020-05-11","arxiv_id":"2005.05189","repositories_listed":1,"syntology":null}],"syntology_records":0,"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"},"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-09-24T18:15:14+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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"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"}}