{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:IXNZ5HEZN3LS6WR62Y76NMHD3F","short_pith_number":"pith:IXNZ5HEZ","schema_version":"1.0","canonical_sha256":"45db9e9c996ed72f5a3ed63fe6b0e3d94d611766adc887e412185f83a1024780","source":{"kind":"arxiv","id":"2204.04686","version":1},"attestation_state":"computed","paper":{"title":"DISK: Domain-constrained Instance Sketch for Math Word Problem Generation","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Baobao Chang, Mairgup Mansur, Shuang Zeng, Tianyang Cao, Xiaodan Xu","submitted_at":"2022-04-10T13:54:23Z","abstract_excerpt":"A math word problem (MWP) is a coherent narrative which reflects the underlying logic of math equations. Successful MWP generation can automate the writing of mathematics questions. Previous methods mainly generate MWP text based on inflexible pre-defined templates. In this paper, we propose a neural model for generating MWP text from math equations. Firstly, we incorporate a matching model conditioned on the domain knowledge to retrieve a MWP instance which is most consistent with the ground-truth, where the domain is a latent variable extracted with a domain summarizer. Secondly, by construc"},"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":"2204.04686","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2022-04-10T13:54:23Z","cross_cats_sorted":[],"title_canon_sha256":"578a2d57f4ca8696f6467a2ee97b0dcb0eb5845a30dd2f75fce85b45bb1ea7e4","abstract_canon_sha256":"1087e41d051bc2f14c1d3a8eaea18df9dadb52a57f37143c6450f9d1d17568ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:13:00.542092Z","signature_b64":"QLJBdPy8ZwsqUs5E0DOcJV8RHpaGfb4uZBVmdpCtghHq1LROrVTtEweAYwXXNV8N9DYbd4V1ZimquuIWJf0kCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45db9e9c996ed72f5a3ed63fe6b0e3d94d611766adc887e412185f83a1024780","last_reissued_at":"2026-07-05T04:13:00.541727Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:13:00.541727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DISK: Domain-constrained Instance Sketch for Math Word Problem Generation","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Baobao Chang, Mairgup Mansur, Shuang Zeng, Tianyang Cao, Xiaodan Xu","submitted_at":"2022-04-10T13:54:23Z","abstract_excerpt":"A math word problem (MWP) is a coherent narrative which reflects the underlying logic of math equations. Successful MWP generation can automate the writing of mathematics questions. Previous methods mainly generate MWP text based on inflexible pre-defined templates. In this paper, we propose a neural model for generating MWP text from math equations. Firstly, we incorporate a matching model conditioned on the domain knowledge to retrieve a MWP instance which is most consistent with the ground-truth, where the domain is a latent variable extracted with a domain summarizer. Secondly, by construc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.04686","kind":"arxiv","version":1},"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/2204.04686/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":"2204.04686","created_at":"2026-07-05T04:13:00.541793+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.04686v1","created_at":"2026-07-05T04:13:00.541793+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.04686","created_at":"2026-07-05T04:13:00.541793+00:00"},{"alias_kind":"pith_short_12","alias_value":"IXNZ5HEZN3LS","created_at":"2026-07-05T04:13:00.541793+00:00"},{"alias_kind":"pith_short_16","alias_value":"IXNZ5HEZN3LS6WR6","created_at":"2026-07-05T04:13:00.541793+00:00"},{"alias_kind":"pith_short_8","alias_value":"IXNZ5HEZ","created_at":"2026-07-05T04:13:00.541793+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.02565","citing_title":"Towards Generating Controllable and Solvable Geometry Problem by Leveraging Symbolic Deduction Engine","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IXNZ5HEZN3LS6WR62Y76NMHD3F","json":"https://pith.science/pith/IXNZ5HEZN3LS6WR62Y76NMHD3F.json","graph_json":"https://pith.science/api/pith-number/IXNZ5HEZN3LS6WR62Y76NMHD3F/graph.json","events_json":"https://pith.science/api/pith-number/IXNZ5HEZN3LS6WR62Y76NMHD3F/events.json","paper":"https://pith.science/paper/IXNZ5HEZ"},"agent_actions":{"view_html":"https://pith.science/pith/IXNZ5HEZN3LS6WR62Y76NMHD3F","download_json":"https://pith.science/pith/IXNZ5HEZN3LS6WR62Y76NMHD3F.json","view_paper":"https://pith.science/paper/IXNZ5HEZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.04686&json=true","fetch_graph":"https://pith.science/api/pith-number/IXNZ5HEZN3LS6WR62Y76NMHD3F/graph.json","fetch_events":"https://pith.science/api/pith-number/IXNZ5HEZN3LS6WR62Y76NMHD3F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IXNZ5HEZN3LS6WR62Y76NMHD3F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IXNZ5HEZN3LS6WR62Y76NMHD3F/action/storage_attestation","attest_author":"https://pith.science/pith/IXNZ5HEZN3LS6WR62Y76NMHD3F/action/author_attestation","sign_citation":"https://pith.science/pith/IXNZ5HEZN3LS6WR62Y76NMHD3F/action/citation_signature","submit_replication":"https://pith.science/pith/IXNZ5HEZN3LS6WR62Y76NMHD3F/action/replication_record"}},"created_at":"2026-07-05T04:13:00.541793+00:00","updated_at":"2026-07-05T04:13:00.541793+00:00"}