{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EH3GOJHKCWLAP3QJ74HN6AMFFI","short_pith_number":"pith:EH3GOJHK","schema_version":"1.0","canonical_sha256":"21f66724ea159607ee09ff0edf01852a2f23f1d9d3b6f9813d99005258b6f148","source":{"kind":"arxiv","id":"1410.4615","version":3},"attestation_state":"computed","paper":{"title":"Learning to Execute","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.NE","authors_text":"Ilya Sutskever, Wojciech Zaremba","submitted_at":"2014-10-17T01:35:12Z","abstract_excerpt":"Recurrent Neural Networks (RNNs) with Long Short-Term Memory units (LSTM) are widely used because they are expressive and are easy to train. Our interest lies in empirically evaluating the expressiveness and the learnability of LSTMs in the sequence-to-sequence regime by training them to evaluate short computer programs, a domain that has traditionally been seen as too complex for neural networks. We consider a simple class of programs that can be evaluated with a single left-to-right pass using constant memory. Our main result is that LSTMs can learn to map the character-level representations"},"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":"1410.4615","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-10-17T01:35:12Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"27809cbc0e5706684b9c70d6d338d914cdce47b5ec283d5d39093a83b73fd473","abstract_canon_sha256":"ab1417af639fe22ce51202e9eacc06a69ea4a451c94c1e3046f34cb130246359"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:18.923034Z","signature_b64":"zHbGY/WajYixkgM38hUDlB5xyOREOGXs+DiMCYm0JGlEyQrkb2WRL8jBhP6RSRzvBwQKMInlsIYZtq1kCEmPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21f66724ea159607ee09ff0edf01852a2f23f1d9d3b6f9813d99005258b6f148","last_reissued_at":"2026-05-18T01:26:18.922535Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:18.922535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Execute","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.NE","authors_text":"Ilya Sutskever, Wojciech Zaremba","submitted_at":"2014-10-17T01:35:12Z","abstract_excerpt":"Recurrent Neural Networks (RNNs) with Long Short-Term Memory units (LSTM) are widely used because they are expressive and are easy to train. Our interest lies in empirically evaluating the expressiveness and the learnability of LSTMs in the sequence-to-sequence regime by training them to evaluate short computer programs, a domain that has traditionally been seen as too complex for neural networks. We consider a simple class of programs that can be evaluated with a single left-to-right pass using constant memory. Our main result is that LSTMs can learn to map the character-level representations"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4615","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":"1410.4615","created_at":"2026-05-18T01:26:18.922607+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.4615v3","created_at":"2026-05-18T01:26:18.922607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4615","created_at":"2026-05-18T01:26:18.922607+00:00"},{"alias_kind":"pith_short_12","alias_value":"EH3GOJHKCWLA","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"EH3GOJHKCWLAP3QJ","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"EH3GOJHK","created_at":"2026-05-18T12:28:25.294606+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":11,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"1906.12266","citing_title":"Growing Action Spaces","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"2108.07732","citing_title":"Program Synthesis with Large Language Models","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2403.16032","citing_title":"DeepFWI: Identifying Bug-Sensitive Warnings with Multi-Modal Code-Warning Semantics","ref_index":68,"is_internal_anchor":true},{"citing_arxiv_id":"2508.05015","citing_title":"SPaCe: Unlocking Sample-Efficient Large Language Models Training With Self-Pace Curriculum Learning","ref_index":37,"is_internal_anchor":true},{"citing_arxiv_id":"1807.03819","citing_title":"Universal Transformers","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2104.13478","citing_title":"Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges","ref_index":103,"is_internal_anchor":false},{"citing_arxiv_id":"2112.00114","citing_title":"Show Your Work: Scratchpads for Intermediate Computation with Language Models","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2305.10403","citing_title":"PaLM 2 Technical Report","ref_index":199,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10237","citing_title":"The Benefits of Temporal Correlations: SGD Learns k-Juntas from Random Walks Efficiently","ref_index":87,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25166","citing_title":"Training Transformers as a Universal Computer","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2201.11903","citing_title":"Chain-of-Thought Prompting Elicits Reasoning in Large Language Models","ref_index":83,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EH3GOJHKCWLAP3QJ74HN6AMFFI","json":"https://pith.science/pith/EH3GOJHKCWLAP3QJ74HN6AMFFI.json","graph_json":"https://pith.science/api/pith-number/EH3GOJHKCWLAP3QJ74HN6AMFFI/graph.json","events_json":"https://pith.science/api/pith-number/EH3GOJHKCWLAP3QJ74HN6AMFFI/events.json","paper":"https://pith.science/paper/EH3GOJHK"},"agent_actions":{"view_html":"https://pith.science/pith/EH3GOJHKCWLAP3QJ74HN6AMFFI","download_json":"https://pith.science/pith/EH3GOJHKCWLAP3QJ74HN6AMFFI.json","view_paper":"https://pith.science/paper/EH3GOJHK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.4615&json=true","fetch_graph":"https://pith.science/api/pith-number/EH3GOJHKCWLAP3QJ74HN6AMFFI/graph.json","fetch_events":"https://pith.science/api/pith-number/EH3GOJHKCWLAP3QJ74HN6AMFFI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EH3GOJHKCWLAP3QJ74HN6AMFFI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EH3GOJHKCWLAP3QJ74HN6AMFFI/action/storage_attestation","attest_author":"https://pith.science/pith/EH3GOJHKCWLAP3QJ74HN6AMFFI/action/author_attestation","sign_citation":"https://pith.science/pith/EH3GOJHKCWLAP3QJ74HN6AMFFI/action/citation_signature","submit_replication":"https://pith.science/pith/EH3GOJHKCWLAP3QJ74HN6AMFFI/action/replication_record"}},"created_at":"2026-05-18T01:26:18.922607+00:00","updated_at":"2026-05-18T01:26:18.922607+00:00"}