{"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/look-before-you-hop-conversational-question","title":"Look before you Hop: Conversational Question Answering over Knowledge Graphs Using Judicious Context Expansion","arxiv_id":"1910.03262","date":"2019-10-08","proceeding":null,"authors":["Philipp Christmann","Rishiraj Saha Roy","Abdalghani Abujabal","Jyotsna Singh","Gerhard Weikum"],"abstract":"Fact-centric information needs are rarely one-shot; users typically ask follow-up questions to explore a topic. In such a conversational setting, the user's inputs are often incomplete, with entities or predicates left out, and ungrammatical phrases. This poses a huge challenge to question answering (QA) systems that typically rely on cues in full-fledged interrogative sentences. As a solution, we develop CONVEX: an unsupervised method that can answer incomplete questions over a knowledge graph (KG) by maintaining conversation context using entities and predicates seen so far and automatically inferring missing or ambiguous pieces for follow-up questions. The core of our method is a graph exploration algorithm that judiciously expands a frontier to find candidate answers for the current question. To evaluate CONVEX, we release ConvQuestions, a crowdsourced benchmark with 11,200 distinct conversations from five different domains. We show that CONVEX: (i) adds conversational support to any stand-alone QA system, and (ii) outperforms state-of-the-art baselines and question completion strategies.","url_abs":"https://arxiv.org/abs/1910.03262v3","url_pdf":"https://arxiv.org/pdf/1910.03262v3.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":"look-before-you-hop-conversational-question","repo_url":"https://github.com/PhilippChr/CONVEX","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"conversational-question-answering","task_name":"Conversational Question Answering"},{"task_slug":"knowledge-graphs","task_name":"Knowledge Graphs"},{"task_slug":"question-answering","task_name":"Question Answering"}],"methods":[],"datasets_introduced":[{"slug":"convquestions","name":"ConvQuestions","full_name":""}],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1910.03262","atlas_url":"https://app.syntology.ai/?focus=1910.03262","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.03262"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1910.03262"},"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":"1910.03262"},"call":"get_harvested_code_for_paper(arxiv_id=\"1910.03262\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1910.03262"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1910.03262\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1910.03262"},"call":"get_concepts_for_paper(arxiv_id=\"1910.03262\")"}],"by_repo":[{"repo":"PhilippChr/CONVEX","kind":"official","samples":7,"ran":7,"instrument":0,"unverified":0}],"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/1910.03262.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/1910.03262.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/PhilippChr/CONVEX","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":7},"n_samples":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"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":7,"ran":7,"n_ran_checked":7,"n_instrument":0,"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-25","last":"2026-09-25","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"},"samples":[{"code_sha256":"a050b095f878d0cb","code_sha256_prefix":"a050b095f878d0cb","entry":"expand_context_with_candidates","repo":"PhilippChr/CONVEX","repo_kind":"official","path":"library/graph_processing.py","file_url":"https://github.com/PhilippChr/CONVEX/blob/HEAD/library/graph_processing.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"graph:Graph/0/?, candidates:list/1/dict, turn:int/0/int","fixture_out_type":"Graph","level_recorded_at":"2026-09-25T11:37:59.709563+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"a050b095f878d0cb"}},{"code_sha256":"c8f7e81f1543afe7","code_sha256_prefix":"c8f7e81f1543afe7","entry":"expand_context_with_frontier","repo":"PhilippChr/CONVEX","repo_kind":"official","path":"library/graph_processing.py","file_url":"https://github.com/PhilippChr/CONVEX/blob/HEAD/library/graph_processing.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"context:Graph/0/?, frontier:str/0/str, frontier_statement:dict/0/?, turn:int/0/int","fixture_out_type":"tuple","level_recorded_at":"2026-09-25T11:37:59.709563+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"c8f7e81f1543afe7"}},{"code_sha256":"fc12a674d6d1c0b0","code_sha256_prefix":"fc12a674d6d1c0b0","entry":"expand_context_with_statements","repo":"PhilippChr/CONVEX","repo_kind":"official","path":"library/graph_processing.py","file_url":"https://github.com/PhilippChr/CONVEX/blob/HEAD/library/graph_processing.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"context:NoneType/0/?, statements:list/1/dict, turn:int/0/int, qa:bool/0/bool","fixture_out_type":"Graph","level_recorded_at":"2026-09-25T11:37:59.709563+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"fc12a674d6d1c0b0"}},{"code_sha256":"c6f148510f597285","code_sha256_prefix":"c6f148510f597285","entry":"is_entity_or_literal","repo":"PhilippChr/CONVEX","repo_kind":"official","path":"library/wikidata.py","file_url":"https://github.com/PhilippChr/CONVEX/blob/HEAD/library/wikidata.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"wd_object:str/0/str","fixture_out_type":"bool","level_recorded_at":"2026-09-25T11:37:59.709563+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"c6f148510f597285"}},{"code_sha256":"e551353ebb702dc5","code_sha256_prefix":"e551353ebb702dc5","entry":"is_literal_or_date","repo":"PhilippChr/CONVEX","repo_kind":"official","path":"library/string_conversions.py","file_url":"https://github.com/PhilippChr/CONVEX/blob/HEAD/library/string_conversions.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"answer:str/0/str","fixture_out_type":"bool","level_recorded_at":"2026-09-25T11:37:59.709563+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"e551353ebb702dc5"}},{"code_sha256":"5b216a411c982687","code_sha256_prefix":"5b216a411c982687","entry":"parse_answers","repo":"PhilippChr/CONVEX","repo_kind":"official","path":"library/string_conversions.py","file_url":"https://github.com/PhilippChr/CONVEX/blob/HEAD/library/string_conversions.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"answers_string:str/0/str","fixture_out_type":"list","level_recorded_at":"2026-09-25T11:37:59.709563+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"5b216a411c982687"}},{"code_sha256":"c26e9b6844f1c84b","code_sha256_prefix":"c26e9b6844f1c84b","entry":"wikidata_url_to_wikidata_id","repo":"PhilippChr/CONVEX","repo_kind":"official","path":"library/string_conversions.py","file_url":"https://github.com/PhilippChr/CONVEX/blob/HEAD/library/string_conversions.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"url:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-25T11:37:59.709563+00:00","retrieve_with":{"tool":"get_code","code_sha256":"c26e9b6844f1c84b"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"c26e9b6844f1c84b"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"17b6d73acf788b02f53c8c29ed05a3ed67fb100ffcff4e872d7b091df8f59567","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}