{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TCSMF4Y5MFB54XEFNJ5PBI35DM","short_pith_number":"pith:TCSMF4Y5","schema_version":"1.0","canonical_sha256":"98a4c2f31d6143de5c856a7af0a37d1b18ba0d7ff1c9e38c541942d1f7856069","source":{"kind":"arxiv","id":"1608.01413","version":2},"attestation_state":"computed","paper":{"title":"Solving General Arithmetic Word Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Dan Roth, Subhro Roy","submitted_at":"2016-08-04T01:47:23Z","abstract_excerpt":"This paper presents a novel approach to automatically solving arithmetic word problems. This is the first algorithmic approach that can handle arithmetic problems with multiple steps and operations, without depending on additional annotations or predefined templates. We develop a theory for expression trees that can be used to represent and evaluate the target arithmetic expressions; we use it to uniquely decompose the target arithmetic problem to multiple classification problems; we then compose an expression tree, combining these with world knowledge through a constrained inference framework"},"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":"1608.01413","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2016-08-04T01:47:23Z","cross_cats_sorted":[],"title_canon_sha256":"2f3dea06f2195a37e273ce65ef559cf5848645491428f3bf03c050c74fe7b138","abstract_canon_sha256":"9e569081ee5c329a7f4298cb0fe22f772299d601e18886994316efddbcb3b2e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:23.517281Z","signature_b64":"rsC+pKb432K0tiU1EmmmwoR0Wi4Q77JMIjh5LpgmsBfsjkLw5lT2fJ0Oxs2gVE4/7p1fauLkfDhfDk+94aIxDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98a4c2f31d6143de5c856a7af0a37d1b18ba0d7ff1c9e38c541942d1f7856069","last_reissued_at":"2026-05-18T01:08:23.516745Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:23.516745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving General Arithmetic Word Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Dan Roth, Subhro Roy","submitted_at":"2016-08-04T01:47:23Z","abstract_excerpt":"This paper presents a novel approach to automatically solving arithmetic word problems. This is the first algorithmic approach that can handle arithmetic problems with multiple steps and operations, without depending on additional annotations or predefined templates. We develop a theory for expression trees that can be used to represent and evaluate the target arithmetic expressions; we use it to uniquely decompose the target arithmetic problem to multiple classification problems; we then compose an expression tree, combining these with world knowledge through a constrained inference framework"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01413","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":""},"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":"1608.01413","created_at":"2026-05-18T01:08:23.516839+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.01413v2","created_at":"2026-05-18T01:08:23.516839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01413","created_at":"2026-05-18T01:08:23.516839+00:00"},{"alias_kind":"pith_short_12","alias_value":"TCSMF4Y5MFB5","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"TCSMF4Y5MFB54XEF","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"TCSMF4Y5","created_at":"2026-05-18T12:30:44.179134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":10,"internal_anchor_count":9,"sample":[{"citing_arxiv_id":"2606.08728","citing_title":"Artificial Intelligence for Mathematical Reasoning: An Integrated Survey of Language Models, Neuro-symbolic Systems, and Verified Discovery","ref_index":101,"is_internal_anchor":true},{"citing_arxiv_id":"2606.03606","citing_title":"Testing LLM Arithmetic Reasoning Generalization with Automatic Numeric-Remapping Attacks","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2605.26178","citing_title":"ATOM: Instantiating Budget-Controllable Multi-Agent Collaboration via Nucleus-Electron Hierarchy","ref_index":26,"is_internal_anchor":true},{"citing_arxiv_id":"2211.01910","citing_title":"Large Language Models Are Human-Level Prompt Engineers","ref_index":30,"is_internal_anchor":true},{"citing_arxiv_id":"2410.14702","citing_title":"Polymath: A Challenging Multi-modal Mathematical Reasoning Benchmark","ref_index":34,"is_internal_anchor":true},{"citing_arxiv_id":"2410.13181","citing_title":"AdaSwitch: Adaptive Switching between Small and Large Agents for Effective Cloud-Local Collaborative Learning","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2509.18629","citing_title":"HyperAdapt: Simple High-Rank Adaptation","ref_index":33,"is_internal_anchor":true},{"citing_arxiv_id":"2403.14624","citing_title":"MathVerse: Does Your Multi-modal LLM Truly See the Diagrams in Visual Math Problems?","ref_index":50,"is_internal_anchor":true},{"citing_arxiv_id":"2309.03409","citing_title":"Large Language Models as Optimizers","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2604.23036","citing_title":"Preserving Long-Tailed Expert Information in Mixture-of-Experts Tuning","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TCSMF4Y5MFB54XEFNJ5PBI35DM","json":"https://pith.science/pith/TCSMF4Y5MFB54XEFNJ5PBI35DM.json","graph_json":"https://pith.science/api/pith-number/TCSMF4Y5MFB54XEFNJ5PBI35DM/graph.json","events_json":"https://pith.science/api/pith-number/TCSMF4Y5MFB54XEFNJ5PBI35DM/events.json","paper":"https://pith.science/paper/TCSMF4Y5"},"agent_actions":{"view_html":"https://pith.science/pith/TCSMF4Y5MFB54XEFNJ5PBI35DM","download_json":"https://pith.science/pith/TCSMF4Y5MFB54XEFNJ5PBI35DM.json","view_paper":"https://pith.science/paper/TCSMF4Y5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.01413&json=true","fetch_graph":"https://pith.science/api/pith-number/TCSMF4Y5MFB54XEFNJ5PBI35DM/graph.json","fetch_events":"https://pith.science/api/pith-number/TCSMF4Y5MFB54XEFNJ5PBI35DM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TCSMF4Y5MFB54XEFNJ5PBI35DM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TCSMF4Y5MFB54XEFNJ5PBI35DM/action/storage_attestation","attest_author":"https://pith.science/pith/TCSMF4Y5MFB54XEFNJ5PBI35DM/action/author_attestation","sign_citation":"https://pith.science/pith/TCSMF4Y5MFB54XEFNJ5PBI35DM/action/citation_signature","submit_replication":"https://pith.science/pith/TCSMF4Y5MFB54XEFNJ5PBI35DM/action/replication_record"}},"created_at":"2026-05-18T01:08:23.516839+00:00","updated_at":"2026-05-18T01:08:23.516839+00:00"}