{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JPDZE3F4QXQSGRTNAXUL23ESPJ","short_pith_number":"pith:JPDZE3F4","canonical_record":{"source":{"id":"1711.00740","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-01T09:48:06Z","cross_cats_sorted":["cs.AI","cs.PL","cs.SE"],"title_canon_sha256":"564b22c1e0ea4d8c6eb6fdd20f950812a5505b5841075c970b5d42d4297dc8bc","abstract_canon_sha256":"5fefac26894355b93ae017177532e02b0427c81d143c51f2b51b930b6d0425a5"},"schema_version":"1.0"},"canonical_sha256":"4bc7926cbc85e123466d05e8bd6c927a74e09bb9d41f87f12c1c393188d1fb98","source":{"kind":"arxiv","id":"1711.00740","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00740","created_at":"2026-05-18T00:16:44Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00740v3","created_at":"2026-05-18T00:16:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00740","created_at":"2026-05-18T00:16:44Z"},{"alias_kind":"pith_short_12","alias_value":"JPDZE3F4QXQS","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JPDZE3F4QXQSGRTN","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JPDZE3F4","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JPDZE3F4QXQSGRTNAXUL23ESPJ","target":"record","payload":{"canonical_record":{"source":{"id":"1711.00740","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-01T09:48:06Z","cross_cats_sorted":["cs.AI","cs.PL","cs.SE"],"title_canon_sha256":"564b22c1e0ea4d8c6eb6fdd20f950812a5505b5841075c970b5d42d4297dc8bc","abstract_canon_sha256":"5fefac26894355b93ae017177532e02b0427c81d143c51f2b51b930b6d0425a5"},"schema_version":"1.0"},"canonical_sha256":"4bc7926cbc85e123466d05e8bd6c927a74e09bb9d41f87f12c1c393188d1fb98","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:44.712494Z","signature_b64":"YWgx/qr3VSktPWYnLMYZMwmFpZ+MQh3An6l+cbDO4j0gOEf9vQOmUey2GHmIdZRF4gh9u0w4STkYA3fuS0EECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bc7926cbc85e123466d05e8bd6c927a74e09bb9d41f87f12c1c393188d1fb98","last_reissued_at":"2026-05-18T00:16:44.711872Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:44.711872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.00740","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:16:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ygO/Lmu2HS0vZI+Lc5IB58n6al15GDdZFeNKFhxqd+KfzWuS7VTujxcEJMuvd5dxxE5Ye2OkCgs5JNL4ZqXMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:05:36.277444Z"},"content_sha256":"333f5beed534da072ae5213ef6bf8be9234e46c247f421e69672b35c64bfda3b","schema_version":"1.0","event_id":"sha256:333f5beed534da072ae5213ef6bf8be9234e46c247f421e69672b35c64bfda3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JPDZE3F4QXQSGRTNAXUL23ESPJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning to Represent Programs with Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.PL","cs.SE"],"primary_cat":"cs.LG","authors_text":"Mahmoud Khademi, Marc Brockschmidt, Miltiadis Allamanis","submitted_at":"2017-11-01T09:48:06Z","abstract_excerpt":"Learning tasks on source code (i.e., formal languages) have been considered recently, but most work has tried to transfer natural language methods and does not capitalize on the unique opportunities offered by code's known syntax. For example, long-range dependencies induced by using the same variable or function in distant locations are often not considered. We propose to use graphs to represent both the syntactic and semantic structure of code and use graph-based deep learning methods to learn to reason over program structures.\n  In this work, we present how to construct graphs from source c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00740","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:16:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9UYzTIacQ2u61whE45unZZsWhrThO0oNuMcc7sBE1KcwlNrV+zdrOGd2d5AGwphvG7bDtIH/l9+xw8KyR83xAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:05:36.278019Z"},"content_sha256":"4860d365ea8815ef87a678877c4658483c0c8ffe6ce9d1f19f6e941481757cc6","schema_version":"1.0","event_id":"sha256:4860d365ea8815ef87a678877c4658483c0c8ffe6ce9d1f19f6e941481757cc6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JPDZE3F4QXQSGRTNAXUL23ESPJ/bundle.json","state_url":"https://pith.science/pith/JPDZE3F4QXQSGRTNAXUL23ESPJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JPDZE3F4QXQSGRTNAXUL23ESPJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T21:05:36Z","links":{"resolver":"https://pith.science/pith/JPDZE3F4QXQSGRTNAXUL23ESPJ","bundle":"https://pith.science/pith/JPDZE3F4QXQSGRTNAXUL23ESPJ/bundle.json","state":"https://pith.science/pith/JPDZE3F4QXQSGRTNAXUL23ESPJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JPDZE3F4QXQSGRTNAXUL23ESPJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JPDZE3F4QXQSGRTNAXUL23ESPJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5fefac26894355b93ae017177532e02b0427c81d143c51f2b51b930b6d0425a5","cross_cats_sorted":["cs.AI","cs.PL","cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-01T09:48:06Z","title_canon_sha256":"564b22c1e0ea4d8c6eb6fdd20f950812a5505b5841075c970b5d42d4297dc8bc"},"schema_version":"1.0","source":{"id":"1711.00740","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00740","created_at":"2026-05-18T00:16:44Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00740v3","created_at":"2026-05-18T00:16:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00740","created_at":"2026-05-18T00:16:44Z"},{"alias_kind":"pith_short_12","alias_value":"JPDZE3F4QXQS","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JPDZE3F4QXQSGRTN","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JPDZE3F4","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:4860d365ea8815ef87a678877c4658483c0c8ffe6ce9d1f19f6e941481757cc6","target":"graph","created_at":"2026-05-18T00:16:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Learning tasks on source code (i.e., formal languages) have been considered recently, but most work has tried to transfer natural language methods and does not capitalize on the unique opportunities offered by code's known syntax. For example, long-range dependencies induced by using the same variable or function in distant locations are often not considered. We propose to use graphs to represent both the syntactic and semantic structure of code and use graph-based deep learning methods to learn to reason over program structures.\n  In this work, we present how to construct graphs from source c","authors_text":"Mahmoud Khademi, Marc Brockschmidt, Miltiadis Allamanis","cross_cats":["cs.AI","cs.PL","cs.SE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-01T09:48:06Z","title":"Learning to Represent Programs with Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00740","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:333f5beed534da072ae5213ef6bf8be9234e46c247f421e69672b35c64bfda3b","target":"record","created_at":"2026-05-18T00:16:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5fefac26894355b93ae017177532e02b0427c81d143c51f2b51b930b6d0425a5","cross_cats_sorted":["cs.AI","cs.PL","cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-01T09:48:06Z","title_canon_sha256":"564b22c1e0ea4d8c6eb6fdd20f950812a5505b5841075c970b5d42d4297dc8bc"},"schema_version":"1.0","source":{"id":"1711.00740","kind":"arxiv","version":3}},"canonical_sha256":"4bc7926cbc85e123466d05e8bd6c927a74e09bb9d41f87f12c1c393188d1fb98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4bc7926cbc85e123466d05e8bd6c927a74e09bb9d41f87f12c1c393188d1fb98","first_computed_at":"2026-05-18T00:16:44.711872Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:44.711872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YWgx/qr3VSktPWYnLMYZMwmFpZ+MQh3An6l+cbDO4j0gOEf9vQOmUey2GHmIdZRF4gh9u0w4STkYA3fuS0EECQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:44.712494Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.00740","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:333f5beed534da072ae5213ef6bf8be9234e46c247f421e69672b35c64bfda3b","sha256:4860d365ea8815ef87a678877c4658483c0c8ffe6ce9d1f19f6e941481757cc6"],"state_sha256":"8218168559fffa138cdbeef173f72a3670be620f2e6744ecb9a4b0ffddcd01bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Gs/B6hMdRcXL+IDsLs8tZBo/yIiRcwppgap3QtJY/e51oD7cXylvX2OHzwFASruiB8UwyBtBWORlyce/OlsCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:05:36.280989Z","bundle_sha256":"383329ce5f905b49a6ae5e5857b6e19e55bbd936a5d04bb1724b1f403cb5f6f4"}}