{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3MLLKMMWYRJ3H7QVBOMHVGY53L","short_pith_number":"pith:3MLLKMMW","canonical_record":{"source":{"id":"1805.08490","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T10:38:41Z","cross_cats_sorted":["cs.PL","stat.ML"],"title_canon_sha256":"4eb0344e55cda1d97492d25b2b52ca427af17811b19a46e75754ac03c618489c","abstract_canon_sha256":"dd461b41accaa1bf45de3fe4aebfdc3ffa2c3abeb16b134ce472f3368cc29031"},"schema_version":"1.0"},"canonical_sha256":"db16b53196c453b3fe150b987a9b1ddadbe1c3ff54897864ea2be7434f701ff9","source":{"kind":"arxiv","id":"1805.08490","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08490","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08490v2","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08490","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"pith_short_12","alias_value":"3MLLKMMWYRJ3","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3MLLKMMWYRJ3H7QV","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3MLLKMMW","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3MLLKMMWYRJ3H7QVBOMHVGY53L","target":"record","payload":{"canonical_record":{"source":{"id":"1805.08490","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T10:38:41Z","cross_cats_sorted":["cs.PL","stat.ML"],"title_canon_sha256":"4eb0344e55cda1d97492d25b2b52ca427af17811b19a46e75754ac03c618489c","abstract_canon_sha256":"dd461b41accaa1bf45de3fe4aebfdc3ffa2c3abeb16b134ce472f3368cc29031"},"schema_version":"1.0"},"canonical_sha256":"db16b53196c453b3fe150b987a9b1ddadbe1c3ff54897864ea2be7434f701ff9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:22.689574Z","signature_b64":"m0eLzXhtKiQUH4gb3jPtSr/p8XZfhTl6HnpjM2re7/6cIJhFaLxunyWO1FEm/8kdQHxMMgphws3vt+l/ztuaDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db16b53196c453b3fe150b987a9b1ddadbe1c3ff54897864ea2be7434f701ff9","last_reissued_at":"2026-05-17T23:48:22.688917Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:22.688917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.08490","source_version":2,"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-17T23:48:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ngEGgrJ5T5WALz76kONxhIXPQ59vvFdug90lHo9GVyFynbrPXyod6wTFAXLwNh7/W5HYSqWZ62f3ix+WliqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:43:02.486028Z"},"content_sha256":"f610967bcbd50f584a966ab2f7b0cd9216b7520142266b684457f08a0f4bfe23","schema_version":"1.0","event_id":"sha256:f610967bcbd50f584a966ab2f7b0cd9216b7520142266b684457f08a0f4bfe23"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3MLLKMMWYRJ3H7QVBOMHVGY53L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generative Code Modeling with Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander L. Gaunt, Marc Brockschmidt, Miltiadis Allamanis, Oleksandr Polozov","submitted_at":"2018-05-22T10:38:41Z","abstract_excerpt":"Generative models for source code are an interesting structured prediction problem, requiring to reason about both hard syntactic and semantic constraints as well as about natural, likely programs. We present a novel model for this problem that uses a graph to represent the intermediate state of the generated output. The generative procedure interleaves grammar-driven expansion steps with graph augmentation and neural message passing steps. An experimental evaluation shows that our new model can generate semantically meaningful expressions, outperforming a range of strong baselines."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08490","kind":"arxiv","version":2},"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-17T23:48:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I3N1IE/CUBkROM70ZAc+lWvpPqn7lLCIQ5Cor8ZM+8qrf36hQcbIL3kWKVYT8b9Y72skJpAi8GIyvoVwc5C3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:43:02.486710Z"},"content_sha256":"09be5171bcd9b38e21203f6e763cbd99410670fae281975b60d2dd619362b51f","schema_version":"1.0","event_id":"sha256:09be5171bcd9b38e21203f6e763cbd99410670fae281975b60d2dd619362b51f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3MLLKMMWYRJ3H7QVBOMHVGY53L/bundle.json","state_url":"https://pith.science/pith/3MLLKMMWYRJ3H7QVBOMHVGY53L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3MLLKMMWYRJ3H7QVBOMHVGY53L/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-06-07T20:43:02Z","links":{"resolver":"https://pith.science/pith/3MLLKMMWYRJ3H7QVBOMHVGY53L","bundle":"https://pith.science/pith/3MLLKMMWYRJ3H7QVBOMHVGY53L/bundle.json","state":"https://pith.science/pith/3MLLKMMWYRJ3H7QVBOMHVGY53L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3MLLKMMWYRJ3H7QVBOMHVGY53L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3MLLKMMWYRJ3H7QVBOMHVGY53L","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":"dd461b41accaa1bf45de3fe4aebfdc3ffa2c3abeb16b134ce472f3368cc29031","cross_cats_sorted":["cs.PL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T10:38:41Z","title_canon_sha256":"4eb0344e55cda1d97492d25b2b52ca427af17811b19a46e75754ac03c618489c"},"schema_version":"1.0","source":{"id":"1805.08490","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08490","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08490v2","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08490","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"pith_short_12","alias_value":"3MLLKMMWYRJ3","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3MLLKMMWYRJ3H7QV","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3MLLKMMW","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:09be5171bcd9b38e21203f6e763cbd99410670fae281975b60d2dd619362b51f","target":"graph","created_at":"2026-05-17T23:48:22Z","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":"Generative models for source code are an interesting structured prediction problem, requiring to reason about both hard syntactic and semantic constraints as well as about natural, likely programs. We present a novel model for this problem that uses a graph to represent the intermediate state of the generated output. The generative procedure interleaves grammar-driven expansion steps with graph augmentation and neural message passing steps. An experimental evaluation shows that our new model can generate semantically meaningful expressions, outperforming a range of strong baselines.","authors_text":"Alexander L. Gaunt, Marc Brockschmidt, Miltiadis Allamanis, Oleksandr Polozov","cross_cats":["cs.PL","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T10:38:41Z","title":"Generative Code Modeling with Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08490","kind":"arxiv","version":2},"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:f610967bcbd50f584a966ab2f7b0cd9216b7520142266b684457f08a0f4bfe23","target":"record","created_at":"2026-05-17T23:48:22Z","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":"dd461b41accaa1bf45de3fe4aebfdc3ffa2c3abeb16b134ce472f3368cc29031","cross_cats_sorted":["cs.PL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T10:38:41Z","title_canon_sha256":"4eb0344e55cda1d97492d25b2b52ca427af17811b19a46e75754ac03c618489c"},"schema_version":"1.0","source":{"id":"1805.08490","kind":"arxiv","version":2}},"canonical_sha256":"db16b53196c453b3fe150b987a9b1ddadbe1c3ff54897864ea2be7434f701ff9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db16b53196c453b3fe150b987a9b1ddadbe1c3ff54897864ea2be7434f701ff9","first_computed_at":"2026-05-17T23:48:22.688917Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:22.688917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m0eLzXhtKiQUH4gb3jPtSr/p8XZfhTl6HnpjM2re7/6cIJhFaLxunyWO1FEm/8kdQHxMMgphws3vt+l/ztuaDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:22.689574Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.08490","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f610967bcbd50f584a966ab2f7b0cd9216b7520142266b684457f08a0f4bfe23","sha256:09be5171bcd9b38e21203f6e763cbd99410670fae281975b60d2dd619362b51f"],"state_sha256":"d07f84ec8fbeff5393b4332cfe923fdaa3993ed031b0db3a5ea5f3bb3bfe8707"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gf0C3swXd+CbczBFvpdJBPI9EinHUeYQSefJ/dSaSycxtZtwRSut19KhtMZ0KjNjfUlUNB1iaVVQmQ5BiB+NDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T20:43:02.490121Z","bundle_sha256":"5e2233ce7eedaac51c4e73c85f447af837e5ad809f654e0271c914b7ee322a96"}}