{"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/chartqa-a-benchmark-for-question-answering","title":"ChartQA: A Benchmark for Question Answering about Charts with Visual and Logical Reasoning","arxiv_id":"2203.10244","date":"2022-03-19","proceeding":"Findings (ACL) 2022 5","authors":["Ahmed Masry","Do Xuan Long","Jia Qing Tan","Shafiq Joty","Enamul Hoque"],"abstract":"Charts are very popular for analyzing data. When exploring charts, people often ask a variety of complex reasoning questions that involve several logical and arithmetic operations. They also commonly refer to visual features of a chart in their questions. However, most existing datasets do not focus on such complex reasoning questions as their questions are template-based and answers come from a fixed-vocabulary. In this work, we present a large-scale benchmark covering 9.6K human-written questions as well as 23.1K questions generated from human-written chart summaries. To address the unique challenges in our benchmark involving visual and logical reasoning over charts, we present two transformer-based models that combine visual features and the data table of the chart in a unified way to answer questions. While our models achieve the state-of-the-art results on the previous datasets as well as on our benchmark, the evaluation also reveals several challenges in answering complex reasoning questions.","url_abs":"https://arxiv.org/abs/2203.10244v1","url_pdf":"https://arxiv.org/pdf/2203.10244v1.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":"chartqa-a-benchmark-for-question-answering","repo_url":"https://github.com/vis-nlp/chartqa","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"GPL-3.0"}}],"tasks":[{"task_slug":"chart-question-answering","task_name":"Chart Question Answering"},{"task_slug":"logical-reasoning","task_name":"Logical Reasoning"},{"task_slug":"question-answering","task_name":"Question Answering"}],"methods":[],"datasets_introduced":[{"slug":"chartqa","name":"ChartQA","full_name":""}],"methods_introduced":[],"results":[{"leaderboard":"/sota/chart-question-answering-on-chartqa","task":"Chart Question Answering","dataset":"ChartQA","model":"VisionTapas-OCR","rank_in_archive_order":25,"of":27,"metrics":{"1:1 Accuracy":"45.5"},"uses_additional_data":false},{"leaderboard":"/sota/chart-question-answering-on-plotqa","task":"Chart Question Answering","dataset":"PlotQA","model":"VL-T5-OCR","rank_in_archive_order":4,"of":6,"metrics":{"1:1 Accuracy":"66.0"},"uses_additional_data":false},{"leaderboard":"/sota/chart-question-answering-on-plotqa","task":"Chart Question Answering","dataset":"PlotQA","model":"VisionTapas-OCR","rank_in_archive_order":6,"of":6,"metrics":{"1:1 Accuracy":"53.9"},"uses_additional_data":false},{"leaderboard":"/sota/chart-question-answering-on-realcqa","task":"Chart Question Answering","dataset":"RealCQA","model":"crct - baseline","rank_in_archive_order":1,"of":5,"metrics":{"1:1 Accuracy":"0.178733575026565"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2203.10244","atlas_url":"https://app.syntology.ai/?focus=2203.10244","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2203.10244"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2203.10244\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2203.10244"},"call":"get_concepts_for_paper(arxiv_id=\"2203.10244\")"}],"by_repo":[{"repo":"vis-nlp/chartqa","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2605.27311"],"harvested_for_calls":[{"arxiv_id":"2605.27311","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2605.27311"},"call":"get_harvested_code_for_paper(arxiv_id=\"2605.27311\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"f89166d3e71212245b208f0a083d97f025c18850abe631e13aefde4168dee130","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}