{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:KRKNGSD7X63NKJNUNUDHMMVWJ3","short_pith_number":"pith:KRKNGSD7","schema_version":"1.0","canonical_sha256":"5454d3487fbfb6d525b46d067632b64efe793cec213ed9ebd06b320dc248597d","source":{"kind":"arxiv","id":"2210.12432","version":2},"attestation_state":"computed","paper":{"title":"Structure-Unified M-Tree Coding Solver for MathWord Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Bin Wang, Jiajun Chen, Jiangzhou Ju, Shujian Huang, Xinyu Dai, Yang Fan","submitted_at":"2022-10-22T12:20:36Z","abstract_excerpt":"As one of the challenging NLP tasks, designing math word problem (MWP) solvers has attracted increasing research attention for the past few years. In previous work, models designed by taking into account the properties of the binary tree structure of mathematical expressions at the output side have achieved better performance. However, the expressions corresponding to a MWP are often diverse (e.g., $n_1+n_2 \\times n_3-n_4$, $n_3\\times n_2-n_4+n_1$, etc.), and so are the corresponding binary trees, which creates difficulties in model learning due to the non-deterministic output space. In this p"},"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":"2210.12432","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-10-22T12:20:36Z","cross_cats_sorted":[],"title_canon_sha256":"db04d985c44a8491fbcaae8dea42a6b83055eb969f6356259193ec523b811598","abstract_canon_sha256":"be2c84bf843103cc2d8a96baa0edb9f3612ccc8b7cd6d20c459dcc437307407f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:10:18.322379Z","signature_b64":"iE+LDdV69OW5c6Xu1l4wi1diNPhNe1cua31AvDnuAp11WkAxRQHmJCLgx3ZNwY3ys+6Jbv2s6DZlFy1eHzsBCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5454d3487fbfb6d525b46d067632b64efe793cec213ed9ebd06b320dc248597d","last_reissued_at":"2026-07-05T05:10:18.321950Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:10:18.321950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structure-Unified M-Tree Coding Solver for MathWord Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Bin Wang, Jiajun Chen, Jiangzhou Ju, Shujian Huang, Xinyu Dai, Yang Fan","submitted_at":"2022-10-22T12:20:36Z","abstract_excerpt":"As one of the challenging NLP tasks, designing math word problem (MWP) solvers has attracted increasing research attention for the past few years. In previous work, models designed by taking into account the properties of the binary tree structure of mathematical expressions at the output side have achieved better performance. However, the expressions corresponding to a MWP are often diverse (e.g., $n_1+n_2 \\times n_3-n_4$, $n_3\\times n_2-n_4+n_1$, etc.), and so are the corresponding binary trees, which creates difficulties in model learning due to the non-deterministic output space. In this p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.12432","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/2210.12432/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":"2210.12432","created_at":"2026-07-05T05:10:18.322004+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.12432v2","created_at":"2026-07-05T05:10:18.322004+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.12432","created_at":"2026-07-05T05:10:18.322004+00:00"},{"alias_kind":"pith_short_12","alias_value":"KRKNGSD7X63N","created_at":"2026-07-05T05:10:18.322004+00:00"},{"alias_kind":"pith_short_16","alias_value":"KRKNGSD7X63NKJNU","created_at":"2026-07-05T05:10:18.322004+00:00"},{"alias_kind":"pith_short_8","alias_value":"KRKNGSD7","created_at":"2026-07-05T05:10:18.322004+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KRKNGSD7X63NKJNUNUDHMMVWJ3","json":"https://pith.science/pith/KRKNGSD7X63NKJNUNUDHMMVWJ3.json","graph_json":"https://pith.science/api/pith-number/KRKNGSD7X63NKJNUNUDHMMVWJ3/graph.json","events_json":"https://pith.science/api/pith-number/KRKNGSD7X63NKJNUNUDHMMVWJ3/events.json","paper":"https://pith.science/paper/KRKNGSD7"},"agent_actions":{"view_html":"https://pith.science/pith/KRKNGSD7X63NKJNUNUDHMMVWJ3","download_json":"https://pith.science/pith/KRKNGSD7X63NKJNUNUDHMMVWJ3.json","view_paper":"https://pith.science/paper/KRKNGSD7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.12432&json=true","fetch_graph":"https://pith.science/api/pith-number/KRKNGSD7X63NKJNUNUDHMMVWJ3/graph.json","fetch_events":"https://pith.science/api/pith-number/KRKNGSD7X63NKJNUNUDHMMVWJ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KRKNGSD7X63NKJNUNUDHMMVWJ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KRKNGSD7X63NKJNUNUDHMMVWJ3/action/storage_attestation","attest_author":"https://pith.science/pith/KRKNGSD7X63NKJNUNUDHMMVWJ3/action/author_attestation","sign_citation":"https://pith.science/pith/KRKNGSD7X63NKJNUNUDHMMVWJ3/action/citation_signature","submit_replication":"https://pith.science/pith/KRKNGSD7X63NKJNUNUDHMMVWJ3/action/replication_record"}},"created_at":"2026-07-05T05:10:18.322004+00:00","updated_at":"2026-07-05T05:10:18.322004+00:00"}