{"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":"/paper/evidence-aggregation-for-answer-re-ranking-in","title":"Evidence Aggregation for Answer Re-Ranking in Open-Domain Question Answering","arxiv_id":"1711.05116","date":"2017-11-14","proceeding":"ICLR 2018 1","authors":["Shuohang Wang","Mo Yu","Jing Jiang","Wei zhang","Xiaoxiao Guo","Shiyu Chang","Zhiguo Wang","Tim Klinger","Gerald Tesauro","Murray Campbell"],"abstract":"A popular recent approach to answering open-domain questions is to first\nsearch for question-related passages and then apply reading comprehension\nmodels to extract answers. Existing methods usually extract answers from single\npassages independently. But some questions require a combination of evidence\nfrom across different sources to answer correctly. In this paper, we propose\ntwo models which make use of multiple passages to generate their answers. Both\nuse an answer-reranking approach which reorders the answer candidates generated\nby an existing state-of-the-art QA model. We propose two methods, namely,\nstrength-based re-ranking and coverage-based re-ranking, to make use of the\naggregated evidence from different passages to better determine the answer. Our\nmodels have achieved state-of-the-art results on three public open-domain QA\ndatasets: Quasar-T, SearchQA and the open-domain version of TriviaQA, with\nabout 8 percentage points of improvement over the former two datasets.","url_abs":"http://arxiv.org/abs/1711.05116v2","url_pdf":"http://arxiv.org/pdf/1711.05116v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"evidence-aggregation-for-answer-re-ranking-in","repo_url":"https://github.com/shuohangwang/mprc","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"torch","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"open-domain-question-answering","task_name":"Open-Domain Question Answering"},{"task_slug":"question-answering","task_name":"Question Answering"},{"task_slug":"re-ranking","task_name":"Re-Ranking"},{"task_slug":"reading-comprehension","task_name":"Reading Comprehension"},{"task_slug":"reranking","task_name":"Reranking"},{"task_slug":"triviaqa","task_name":"TriviaQA"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/open-domain-question-answering-on-quasar","task":"Open-Domain Question Answering","dataset":"Quasar","model":"Evidence Aggregation via R^3 Re-Ranking","rank_in_archive_order":1,"of":6,"metrics":{"EM (Quasar-T)":"42.3","F1 (Quasar-T)":"49.6"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1711.05116","atlas_url":"https://app.syntology.ai/?focus=1711.05116","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.05116"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1711.05116"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1711.05116"},"call":"get_harvested_code_for_paper(arxiv_id=\"1711.05116\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1711.05116"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1711.05116\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1711.05116"},"call":"get_concepts_for_paper(arxiv_id=\"1711.05116\")"}],"by_repo":[{"repo":"shuohangwang/mprc","kind":"official","samples":8,"ran":7,"instrument":3,"unverified":1}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/1711.05116.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/1711.05116.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/shuohangwang/mprc","reach":{"status":"ok","spdx":"Apache-2.0"}}],"summary":{"ran_draft_wrong":3,"ran_violates":2,"ran_honours":2,"unverified":1},"n_samples":8,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":1,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"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)"},"by_repo_kind":{"official":{"samples":8,"ran":7,"n_ran_checked":4,"n_instrument":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":7,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-22","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"147e0ae162d88334","code_sha256_prefix":"147e0ae162d88334","entry":"add_triple_data","repo":"shuohangwang/mprc","repo_kind":"official","path":"trainedmodel/evaluation/unftriviaqa/utils/convert_to_squad_format.py","file_url":"https://github.com/shuohangwang/mprc/blob/HEAD/trainedmodel/evaluation/unftriviaqa/utils/convert_to_squad_format.py","link_basis":"plan_row","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"datum:dict/0/?, page:dict/0/?, domain:str/0/str","fixture_out_type":"dict","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"147e0ae162d88334"}},{"code_sha256":"f6c275d6a18330a9","code_sha256_prefix":"f6c275d6a18330a9","entry":"exact_match_score","repo":"shuohangwang/mprc","repo_kind":"official","path":"trainedmodel/evaluation/quasart/evaluate-v1.1.py","file_url":"https://github.com/shuohangwang/mprc/blob/HEAD/trainedmodel/evaluation/quasart/evaluate-v1.1.py","link_basis":"harvester_set","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"signature":"prediction:str/0/str, ground_truth:str/0/str","fixture_out_type":"bool","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"f6c275d6a18330a9"},"code_page":"/code/exact-match-score","census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"f6c275d6a18330a9"}},{"code_sha256":"2c66ac5f9374f1f7","code_sha256_prefix":"2c66ac5f9374f1f7","entry":"exact_match_score","repo":"shuohangwang/mprc","repo_kind":"official","path":"trainedmodel/evaluation/unftriviaqa/triviaqa_evaluation.py","file_url":"https://github.com/shuohangwang/mprc/blob/HEAD/trainedmodel/evaluation/unftriviaqa/triviaqa_evaluation.py","link_basis":"plan_row","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"signature":"prediction:str/0/str, ground_truth:str/0/str","fixture_out_type":"bool","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"2c66ac5f9374f1f7"},"code_page":"/code/exact-match-score","census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"2c66ac5f9374f1f7"}},{"code_sha256":"2112c433b9c6d343","code_sha256_prefix":"2112c433b9c6d343","entry":"f1_score","repo":"shuohangwang/mprc","repo_kind":"official","path":"trainedmodel/evaluation/quasart/evaluate-v1.1.py","file_url":"https://github.com/shuohangwang/mprc/blob/HEAD/trainedmodel/evaluation/quasart/evaluate-v1.1.py","link_basis":"harvester_set","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"signature":"prediction:str/0/str, ground_truth:str/0/str","fixture_out_type":"float","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"2112c433b9c6d343"},"code_page":"/code/f1-score","census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"2112c433b9c6d343"}},{"code_sha256":"5d0a37a7c59decf8","code_sha256_prefix":"5d0a37a7c59decf8","entry":"f1_score","repo":"shuohangwang/mprc","repo_kind":"official","path":"trainedmodel/evaluation/unftriviaqa/triviaqa_evaluation.py","file_url":"https://github.com/shuohangwang/mprc/blob/HEAD/trainedmodel/evaluation/unftriviaqa/triviaqa_evaluation.py","link_basis":"plan_row","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"signature":"prediction:str/0/str, ground_truth:str/0/str","fixture_out_type":"float","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"5d0a37a7c59decf8"},"code_page":"/code/f1-score","census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"5d0a37a7c59decf8"}},{"code_sha256":"c6a80c065d2e4851","code_sha256_prefix":"c6a80c065d2e4851","entry":"normalize_answer","repo":"shuohangwang/mprc","repo_kind":"official","path":"trainedmodel/evaluation/quasart/evaluate-v1.1.py","file_url":"https://github.com/shuohangwang/mprc/blob/HEAD/trainedmodel/evaluation/quasart/evaluate-v1.1.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"signature":"s:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"c6a80c065d2e4851"},"code_page":"/code/normalize-answer","census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"c6a80c065d2e4851"}},{"code_sha256":"2879260bc19381c8","code_sha256_prefix":"2879260bc19381c8","entry":"normalize_answer","repo":"shuohangwang/mprc","repo_kind":"official","path":"trainedmodel/evaluation/unftriviaqa/triviaqa_evaluation.py","file_url":"https://github.com/shuohangwang/mprc/blob/HEAD/trainedmodel/evaluation/unftriviaqa/triviaqa_evaluation.py","link_basis":"plan_row","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"signature":"s:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"2879260bc19381c8"},"code_page":"/code/normalize-answer","census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"2879260bc19381c8"}},{"code_sha256":"b009e6d552a30ed2","code_sha256_prefix":"b009e6d552a30ed2","entry":"select_relevant_portion","repo":"shuohangwang/mprc","repo_kind":"official","path":"trainedmodel/evaluation/unftriviaqa/utils/convert_to_squad_format.py","file_url":"https://github.com/shuohangwang/mprc/blob/HEAD/trainedmodel/evaluation/unftriviaqa/utils/convert_to_squad_format.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"b009e6d552a30ed2"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"86ae9799697845149ae59a701eaaa058422a2dafedc1dbe3d83e01c3828fb69f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}