{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QCU7OKIQD23P4JY3DK2ZGVLS5J","short_pith_number":"pith:QCU7OKIQ","schema_version":"1.0","canonical_sha256":"80a9f729101eb6fe271b1ab5935572ea41ce997877f745d4139c567ea69112fb","source":{"kind":"arxiv","id":"1705.04146","version":3},"attestation_state":"computed","paper":{"title":"Program Induction by Rationale Generation : Learning to Solve and Explain Algebraic Word Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Chris Dyer, Dani Yogatama, Phil Blunsom, Wang Ling","submitted_at":"2017-05-11T13:04:47Z","abstract_excerpt":"Solving algebraic word problems requires executing a series of arithmetic operations---a program---to obtain a final answer. However, since programs can be arbitrarily complicated, inducing them directly from question-answer pairs is a formidable challenge. To make this task more feasible, we solve these problems by generating answer rationales, sequences of natural language and human-readable mathematical expressions that derive the final answer through a series of small steps. Although rationales do not explicitly specify programs, they provide a scaffolding for their structure via intermedi"},"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":"1705.04146","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-11T13:04:47Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"7b38e810c58879b6457f6e7d84633b56f31364107148b131fc80ebcd21285147","abstract_canon_sha256":"49bd19890107becd5bd7c4024cb55180808eddc79ba4b05693e18bc807e0aa93"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:20.562245Z","signature_b64":"Xe19mN3AK0zIqlz78RPTH7pZSWuW1YmsKx3Ow9WOOw2NHsspn8EL2zQsxp2DubcAROeaGq5bxKOt3DICFn4QBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80a9f729101eb6fe271b1ab5935572ea41ce997877f745d4139c567ea69112fb","last_reissued_at":"2026-05-18T00:32:20.561643Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:20.561643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Program Induction by Rationale Generation : Learning to Solve and Explain Algebraic Word Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Chris Dyer, Dani Yogatama, Phil Blunsom, Wang Ling","submitted_at":"2017-05-11T13:04:47Z","abstract_excerpt":"Solving algebraic word problems requires executing a series of arithmetic operations---a program---to obtain a final answer. However, since programs can be arbitrarily complicated, inducing them directly from question-answer pairs is a formidable challenge. To make this task more feasible, we solve these problems by generating answer rationales, sequences of natural language and human-readable mathematical expressions that derive the final answer through a series of small steps. Although rationales do not explicitly specify programs, they provide a scaffolding for their structure via intermedi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04146","kind":"arxiv","version":3},"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":"1705.04146","created_at":"2026-05-18T00:32:20.561726+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.04146v3","created_at":"2026-05-18T00:32:20.561726+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04146","created_at":"2026-05-18T00:32:20.561726+00:00"},{"alias_kind":"pith_short_12","alias_value":"QCU7OKIQD23P","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"QCU7OKIQD23P4JY3","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"QCU7OKIQ","created_at":"2026-05-18T12:31:37.085036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":16,"internal_anchor_count":14,"sample":[{"citing_arxiv_id":"2110.14168","citing_title":"Training Verifiers to Solve Math Word Problems","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2211.14275","citing_title":"Solving math word problems with process- and outcome-based feedback","ref_index":26,"is_internal_anchor":true},{"citing_arxiv_id":"2411.18104","citing_title":"Training and Evaluating Language Models with Template-based Data Generation","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2009.03393","citing_title":"Generative Language Modeling for Automated Theorem Proving","ref_index":37,"is_internal_anchor":true},{"citing_arxiv_id":"2502.19559","citing_title":"Stay Focused: Problem Drift in Multi-Agent Debate","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2603.14184","citing_title":"Deeper Thought, Weaker Aim: Understanding and Mitigating Perceptual Impairment during Reasoning in Multimodal Large Language Models","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2503.11926","citing_title":"Monitoring Reasoning Models for Misbehavior and the Risks of Promoting Obfuscation","ref_index":39,"is_internal_anchor":true},{"citing_arxiv_id":"2406.18629","citing_title":"Step-DPO: Step-wise Preference Optimization for Long-chain Reasoning of LLMs","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2509.18629","citing_title":"HyperAdapt: Simple High-Rank Adaptation","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2512.20856","citing_title":"NVIDIA Nemotron 3: Efficient and Open Intelligence","ref_index":141,"is_internal_anchor":true},{"citing_arxiv_id":"2604.04944","citing_title":"Inclusion-of-Thoughts: Mitigating Preference Instability via Purifying the Decision Space","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"2211.10435","citing_title":"PAL: Program-aided Language Models","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2410.05229","citing_title":"GSM-Symbolic: Understanding the Limitations of Mathematical Reasoning in Large Language Models","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"2309.03409","citing_title":"Large Language Models as Optimizers","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2604.23036","citing_title":"Preserving Long-Tailed Expert Information in Mixture-of-Experts Tuning","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2310.13548","citing_title":"Towards Understanding Sycophancy in Language Models","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QCU7OKIQD23P4JY3DK2ZGVLS5J","json":"https://pith.science/pith/QCU7OKIQD23P4JY3DK2ZGVLS5J.json","graph_json":"https://pith.science/api/pith-number/QCU7OKIQD23P4JY3DK2ZGVLS5J/graph.json","events_json":"https://pith.science/api/pith-number/QCU7OKIQD23P4JY3DK2ZGVLS5J/events.json","paper":"https://pith.science/paper/QCU7OKIQ"},"agent_actions":{"view_html":"https://pith.science/pith/QCU7OKIQD23P4JY3DK2ZGVLS5J","download_json":"https://pith.science/pith/QCU7OKIQD23P4JY3DK2ZGVLS5J.json","view_paper":"https://pith.science/paper/QCU7OKIQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.04146&json=true","fetch_graph":"https://pith.science/api/pith-number/QCU7OKIQD23P4JY3DK2ZGVLS5J/graph.json","fetch_events":"https://pith.science/api/pith-number/QCU7OKIQD23P4JY3DK2ZGVLS5J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QCU7OKIQD23P4JY3DK2ZGVLS5J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QCU7OKIQD23P4JY3DK2ZGVLS5J/action/storage_attestation","attest_author":"https://pith.science/pith/QCU7OKIQD23P4JY3DK2ZGVLS5J/action/author_attestation","sign_citation":"https://pith.science/pith/QCU7OKIQD23P4JY3DK2ZGVLS5J/action/citation_signature","submit_replication":"https://pith.science/pith/QCU7OKIQD23P4JY3DK2ZGVLS5J/action/replication_record"}},"created_at":"2026-05-18T00:32:20.561726+00:00","updated_at":"2026-05-18T00:32:20.561726+00:00"}