{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PVVCLPBLWEJQDUX3TAX75B6DBF","short_pith_number":"pith:PVVCLPBL","schema_version":"1.0","canonical_sha256":"7d6a25bc2bb11301d2fb982ffe87c30961932dc0702a73ada9fb55a13bbd9368","source":{"kind":"arxiv","id":"2505.11935","version":2},"attestation_state":"computed","paper":{"title":"ChartEdit: How Far Are MLLMs From Automating Chart Analysis? Evaluating MLLMs' Capability via Chart Editing","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Chi Chen, Fanhu Zeng, Haoyue Yang, Jianling Li, Qi Shi, Xianzhen Luo, Xuanle Zhao, Xuexin Liu","submitted_at":"2025-05-17T09:47:15Z","abstract_excerpt":"Although multimodal large language models (MLLMs) show promise in generating chart rendering code, editing charts via code presents a greater challenge. This task demands MLLMs to integrate chart understanding and reasoning capacities, which are labor-intensive. While many MLLMs claim such editing capabilities, current evaluations rely on limited case studies, highlighting the urgent need for a comprehensive evaluation framework. In this work, we propose \\textsc{ChartEdit}, a novel benchmark designed for chart editing tasks, featuring $1405$ diverse editing instructions applied to $233$ real-w"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2505.11935","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2025-05-17T09:47:15Z","cross_cats_sorted":[],"title_canon_sha256":"984f535b8b596de1ab5bd21faa9f24a0069fd4701a519a358aa61d61d7b98492","abstract_canon_sha256":"427957731bb05ca35966975fb6f845bdc21ff7d7ed2fbf89935cf0beff4a9b3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:47:23.060732Z","signature_b64":"B2IdMMDlpKe0pbgR/vrrdDoUZrL1z4WSYHP6v95yZIqmVRE257QatAjlrwXJwynTDxl5blSbGGt7LG8n5JIFBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d6a25bc2bb11301d2fb982ffe87c30961932dc0702a73ada9fb55a13bbd9368","last_reissued_at":"2026-07-05T11:47:23.060230Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:47:23.060230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ChartEdit: How Far Are MLLMs From Automating Chart Analysis? Evaluating MLLMs' Capability via Chart Editing","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Chi Chen, Fanhu Zeng, Haoyue Yang, Jianling Li, Qi Shi, Xianzhen Luo, Xuanle Zhao, Xuexin Liu","submitted_at":"2025-05-17T09:47:15Z","abstract_excerpt":"Although multimodal large language models (MLLMs) show promise in generating chart rendering code, editing charts via code presents a greater challenge. This task demands MLLMs to integrate chart understanding and reasoning capacities, which are labor-intensive. While many MLLMs claim such editing capabilities, current evaluations rely on limited case studies, highlighting the urgent need for a comprehensive evaluation framework. In this work, we propose \\textsc{ChartEdit}, a novel benchmark designed for chart editing tasks, featuring $1405$ diverse editing instructions applied to $233$ real-w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.11935","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.11935/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2505.11935","created_at":"2026-07-05T11:47:23.060285+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.11935v2","created_at":"2026-07-05T11:47:23.060285+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.11935","created_at":"2026-07-05T11:47:23.060285+00:00"},{"alias_kind":"pith_short_12","alias_value":"PVVCLPBLWEJQ","created_at":"2026-07-05T11:47:23.060285+00:00"},{"alias_kind":"pith_short_16","alias_value":"PVVCLPBLWEJQDUX3","created_at":"2026-07-05T11:47:23.060285+00:00"},{"alias_kind":"pith_short_8","alias_value":"PVVCLPBL","created_at":"2026-07-05T11:47:23.060285+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.14938","citing_title":"Octopus: History-Free Gradient Orthogonalization for Continual Learning in Multimodal Large Language Models","ref_index":71,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06079","citing_title":"Scientific Graphics Program Synthesis via Dual Self-Consistency Reinforcement Learning","ref_index":56,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PVVCLPBLWEJQDUX3TAX75B6DBF","json":"https://pith.science/pith/PVVCLPBLWEJQDUX3TAX75B6DBF.json","graph_json":"https://pith.science/api/pith-number/PVVCLPBLWEJQDUX3TAX75B6DBF/graph.json","events_json":"https://pith.science/api/pith-number/PVVCLPBLWEJQDUX3TAX75B6DBF/events.json","paper":"https://pith.science/paper/PVVCLPBL"},"agent_actions":{"view_html":"https://pith.science/pith/PVVCLPBLWEJQDUX3TAX75B6DBF","download_json":"https://pith.science/pith/PVVCLPBLWEJQDUX3TAX75B6DBF.json","view_paper":"https://pith.science/paper/PVVCLPBL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.11935&json=true","fetch_graph":"https://pith.science/api/pith-number/PVVCLPBLWEJQDUX3TAX75B6DBF/graph.json","fetch_events":"https://pith.science/api/pith-number/PVVCLPBLWEJQDUX3TAX75B6DBF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PVVCLPBLWEJQDUX3TAX75B6DBF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PVVCLPBLWEJQDUX3TAX75B6DBF/action/storage_attestation","attest_author":"https://pith.science/pith/PVVCLPBLWEJQDUX3TAX75B6DBF/action/author_attestation","sign_citation":"https://pith.science/pith/PVVCLPBLWEJQDUX3TAX75B6DBF/action/citation_signature","submit_replication":"https://pith.science/pith/PVVCLPBLWEJQDUX3TAX75B6DBF/action/replication_record"}},"created_at":"2026-07-05T11:47:23.060285+00:00","updated_at":"2026-07-05T11:47:23.060285+00:00"}