{"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":"/method/graph2tree","slug":"graph2tree","name":"Graph2Tree","full_name":"Graph-to-Tree MWP Solver","full_name_withheld":false,"description_markdown":null,"description_state":"absent","introduced_year":null,"introduced_by":{"title":"Graph-to-Tree Learning for Solving Math Word Problems","paper":"/paper/graph-to-tree-learning-for-solving-math-word","first_author":"Jipeng Zhang","n_authors":7,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/graph-to-tree-learning-for-solving-math-word"},"source":{"url":"https://aclanthology.org/2020.acl-main.362","title":"Graph-to-Tree Learning for Solving Math Word Problems","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Sequential","area_id":"sequential","collection":"Sequence To Sequence Models","url":"/methods/category/sequence-to-sequence-models","pwc_aliases":[]}],"n_papers_tagged":4,"archive_num_papers":4,"papers_newest_first":[{"paper":null,"slug":"towards-robust-numerical-question-answering","title":"Towards Robust Numerical Question Answering: Diagnosing Numerical Capabilities of NLP Systems","date":"2022-11-14","arxiv_id":"2211.07455","n_code_links":0,"syntology":null},{"paper":null,"slug":"mmtm-multi-tasking-multi-decoder-transformer","title":"MMTM: Multi-Tasking Multi-Decoder Transformer for Math Word Problems","date":"2022-06-02","arxiv_id":"2206.01268","n_code_links":0,"syntology":null},{"paper":"/paper/are-nlp-models-really-able-to-solve-simple","slug":"are-nlp-models-really-able-to-solve-simple","title":"Are NLP Models really able to Solve Simple Math Word Problems?","date":"2021-03-12","arxiv_id":"2103.07191","n_code_links":3,"syntology":null},{"paper":"/paper/graph-to-tree-learning-for-solving-math-word","slug":"graph-to-tree-learning-for-solving-math-word","title":"Graph-to-Tree Learning for Solving Math Word Problems","date":"2020-07-01","arxiv_id":null,"n_code_links":1,"syntology":null}],"papers_shown":4,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":4,"with_a_code_link":2,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":4,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"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 the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[],"tasks":[{"task":"/task/math","name":"Math","papers":3},{"task":"/task/decoder","name":"Decoder","papers":2},{"task":"/task/math-word-problem-solving","name":"Math Word Problem Solving","papers":2},{"task":"/task/data-augmentation","name":"Data Augmentation","papers":1},{"task":"/task/math-word-problem-solvingo","name":"Math Word Problem SolvingΩ","papers":1},{"task":"/task/mathematical-reasoning","name":"Mathematical Reasoning","papers":1},{"task":"/task/open-question","name":"Open-Ended Question Answering","papers":1},{"task":"/task/question-answering","name":"Question Answering","papers":1}],"tasks_shown":8,"n_tasks":8,"usage_by_year":[{"year":"2020","papers":1},{"year":"2021","papers":1},{"year":"2022","papers":2}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/graph2tree"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=Graph2Tree","read_at":"2026-10-05T00:57:15+00:00","query":"Graph2Tree","kind":"method","have":"declared_code","tier":"repo_known","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"Graph2Tree","origin_arxiv_id":"2004.13781"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"unknown","archive_paper_arxiv_id":null,"repositories":{"listed":1,"in_graph":1,"list_truncated":false,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"2004.13781","citations":83},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'Graph2Tree'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2004.13781","page":"/paper/graph-to-tree-neural-networks-for-learning","syntology_url":"https://syntology.ai/paper/2004.13781","in_graph_layer":true,"samples":4,"ran":4,"n_ran_checked":4,"n_instrument":0,"unverified":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"repository known, no verified implementation (declared_code; repositories: 1 listed of 1 in the graph, strongest link: official). The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:2004.13781) is about this method is not checked.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"0e02790f6f89d37223d7b10c43b2a95d7f4fcd90fe68b563c7983c5a80f3740c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}