{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:WZ6DU5FCZEAZ53DX6IJH4AF3X3","short_pith_number":"pith:WZ6DU5FC","schema_version":"1.0","canonical_sha256":"b67c3a74a2c9019eec77f2127e00bbbefffd4b0c8cc292492f091eb020ec1e73","source":{"kind":"arxiv","id":"2010.12621","version":1},"attestation_state":"computed","paper":{"title":"Learning to Execute Programs with Instruction Pointer Attention Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Charles Sutton, Daniel Tarlow, David Bieber, Hugo Larochelle","submitted_at":"2020-10-23T19:12:30Z","abstract_excerpt":"Graph neural networks (GNNs) have emerged as a powerful tool for learning software engineering tasks including code completion, bug finding, and program repair. They benefit from leveraging program structure like control flow graphs, but they are not well-suited to tasks like program execution that require far more sequential reasoning steps than number of GNN propagation steps. Recurrent neural networks (RNNs), on the other hand, are well-suited to long sequential chains of reasoning, but they do not naturally incorporate program structure and generally perform worse on the above tasks. Our a"},"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":"2010.12621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-23T19:12:30Z","cross_cats_sorted":[],"title_canon_sha256":"7333e13ca46676d1dcce30179c59e649a7763164c1d2ac6c7cdb7486a03a77b0","abstract_canon_sha256":"10e31a336acad1f3df678a30291216e21095dfc341f9a582e8dc825b9693d9f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:45:46.537786Z","signature_b64":"1drTpSieWADE7O5z+UvtBJhkMktISHmbJ4Ut2Ext0JNiyYenPdmZs9xJVxvoazl0Z1YMY6Cq6Gh3A5OuXQ4xCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b67c3a74a2c9019eec77f2127e00bbbefffd4b0c8cc292492f091eb020ec1e73","last_reissued_at":"2026-07-05T01:45:46.537393Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:45:46.537393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Execute Programs with Instruction Pointer Attention Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Charles Sutton, Daniel Tarlow, David Bieber, Hugo Larochelle","submitted_at":"2020-10-23T19:12:30Z","abstract_excerpt":"Graph neural networks (GNNs) have emerged as a powerful tool for learning software engineering tasks including code completion, bug finding, and program repair. They benefit from leveraging program structure like control flow graphs, but they are not well-suited to tasks like program execution that require far more sequential reasoning steps than number of GNN propagation steps. Recurrent neural networks (RNNs), on the other hand, are well-suited to long sequential chains of reasoning, but they do not naturally incorporate program structure and generally perform worse on the above tasks. Our a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.12621","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/2010.12621/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":"2010.12621","created_at":"2026-07-05T01:45:46.537456+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.12621v1","created_at":"2026-07-05T01:45:46.537456+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.12621","created_at":"2026-07-05T01:45:46.537456+00:00"},{"alias_kind":"pith_short_12","alias_value":"WZ6DU5FCZEAZ","created_at":"2026-07-05T01:45:46.537456+00:00"},{"alias_kind":"pith_short_16","alias_value":"WZ6DU5FCZEAZ53DX","created_at":"2026-07-05T01:45:46.537456+00:00"},{"alias_kind":"pith_short_8","alias_value":"WZ6DU5FC","created_at":"2026-07-05T01:45:46.537456+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2503.05703","citing_title":"What I cannot execute, I do not understand: Training and Evaluating LLMs on Program Execution Traces","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WZ6DU5FCZEAZ53DX6IJH4AF3X3","json":"https://pith.science/pith/WZ6DU5FCZEAZ53DX6IJH4AF3X3.json","graph_json":"https://pith.science/api/pith-number/WZ6DU5FCZEAZ53DX6IJH4AF3X3/graph.json","events_json":"https://pith.science/api/pith-number/WZ6DU5FCZEAZ53DX6IJH4AF3X3/events.json","paper":"https://pith.science/paper/WZ6DU5FC"},"agent_actions":{"view_html":"https://pith.science/pith/WZ6DU5FCZEAZ53DX6IJH4AF3X3","download_json":"https://pith.science/pith/WZ6DU5FCZEAZ53DX6IJH4AF3X3.json","view_paper":"https://pith.science/paper/WZ6DU5FC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.12621&json=true","fetch_graph":"https://pith.science/api/pith-number/WZ6DU5FCZEAZ53DX6IJH4AF3X3/graph.json","fetch_events":"https://pith.science/api/pith-number/WZ6DU5FCZEAZ53DX6IJH4AF3X3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WZ6DU5FCZEAZ53DX6IJH4AF3X3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WZ6DU5FCZEAZ53DX6IJH4AF3X3/action/storage_attestation","attest_author":"https://pith.science/pith/WZ6DU5FCZEAZ53DX6IJH4AF3X3/action/author_attestation","sign_citation":"https://pith.science/pith/WZ6DU5FCZEAZ53DX6IJH4AF3X3/action/citation_signature","submit_replication":"https://pith.science/pith/WZ6DU5FCZEAZ53DX6IJH4AF3X3/action/replication_record"}},"created_at":"2026-07-05T01:45:46.537456+00:00","updated_at":"2026-07-05T01:45:46.537456+00:00"}