{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BMEN6OPXLICQQL3NITCOSWC6M7","short_pith_number":"pith:BMEN6OPX","canonical_record":{"source":{"id":"1704.07535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-25T04:37:35Z","cross_cats_sorted":["cs.AI","cs.LG","stat.ML"],"title_canon_sha256":"c34efe589b7db4e1eb43c77689f02292958739f97f88083a996c52b915dcbc57","abstract_canon_sha256":"00652d122c699d6e6e752e9c2f7df7c1716361ca8dccacdbb9b95241bbab2238"},"schema_version":"1.0"},"canonical_sha256":"0b08df39f75a05082f6d44c4e9585e67c1cd8b4fab90ee4b5239d05e08a71220","source":{"kind":"arxiv","id":"1704.07535","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.07535","created_at":"2026-05-18T00:45:37Z"},{"alias_kind":"arxiv_version","alias_value":"1704.07535v1","created_at":"2026-05-18T00:45:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07535","created_at":"2026-05-18T00:45:37Z"},{"alias_kind":"pith_short_12","alias_value":"BMEN6OPXLICQ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BMEN6OPXLICQQL3N","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BMEN6OPX","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BMEN6OPXLICQQL3NITCOSWC6M7","target":"record","payload":{"canonical_record":{"source":{"id":"1704.07535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-25T04:37:35Z","cross_cats_sorted":["cs.AI","cs.LG","stat.ML"],"title_canon_sha256":"c34efe589b7db4e1eb43c77689f02292958739f97f88083a996c52b915dcbc57","abstract_canon_sha256":"00652d122c699d6e6e752e9c2f7df7c1716361ca8dccacdbb9b95241bbab2238"},"schema_version":"1.0"},"canonical_sha256":"0b08df39f75a05082f6d44c4e9585e67c1cd8b4fab90ee4b5239d05e08a71220","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:37.771924Z","signature_b64":"r2ILs6R/aqXIjoq3oC8XFybU1gFzr1dxBCptOKvxGeunDJ73ILSFhZ6OK7RBGRHY7e1qRe7pea2OrB5k9wBMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b08df39f75a05082f6d44c4e9585e67c1cd8b4fab90ee4b5239d05e08a71220","last_reissued_at":"2026-05-18T00:45:37.771092Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:37.771092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.07535","source_version":1,"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:45:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M7cQR5GHS02n5xtzVxiUT6utW/hA76PTvP4aOxsux5BTRJoC3xQ+b5iMkkX4HZQcL6PUWufLsft/2+eTBKaQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:21:57.601105Z"},"content_sha256":"c099acb30b916659a8ceecaf23f24da6d87404410ddfcdcd8eab14f244cd6b31","schema_version":"1.0","event_id":"sha256:c099acb30b916659a8ceecaf23f24da6d87404410ddfcdcd8eab14f244cd6b31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BMEN6OPXLICQQL3NITCOSWC6M7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Abstract Syntax Networks for Code Generation and Semantic Parsing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","stat.ML"],"primary_cat":"cs.CL","authors_text":"Dan Klein, Maxim Rabinovich, Mitchell Stern","submitted_at":"2017-04-25T04:37:35Z","abstract_excerpt":"Tasks like code generation and semantic parsing require mapping unstructured (or partially structured) inputs to well-formed, executable outputs. We introduce abstract syntax networks, a modeling framework for these problems. The outputs are represented as abstract syntax trees (ASTs) and constructed by a decoder with a dynamically-determined modular structure paralleling the structure of the output tree. On the benchmark Hearthstone dataset for code generation, our model obtains 79.2 BLEU and 22.7% exact match accuracy, compared to previous state-of-the-art values of 67.1 and 6.1%. Furthermor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07535","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":""},"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:45:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l1zPRTe6SYLaEiCEKRmAT9LwOOOOY4xRTZatZkQCNRxpiPeIRXh6E+VBsuSWPC9KtQIjk84674bSqmz4bPBTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:21:57.601839Z"},"content_sha256":"600eb8433a093c33fff7b6e23307c872e06e0d2bdc5853e5bd679e715bb8e09a","schema_version":"1.0","event_id":"sha256:600eb8433a093c33fff7b6e23307c872e06e0d2bdc5853e5bd679e715bb8e09a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BMEN6OPXLICQQL3NITCOSWC6M7/bundle.json","state_url":"https://pith.science/pith/BMEN6OPXLICQQL3NITCOSWC6M7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BMEN6OPXLICQQL3NITCOSWC6M7/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-25T12:21:57Z","links":{"resolver":"https://pith.science/pith/BMEN6OPXLICQQL3NITCOSWC6M7","bundle":"https://pith.science/pith/BMEN6OPXLICQQL3NITCOSWC6M7/bundle.json","state":"https://pith.science/pith/BMEN6OPXLICQQL3NITCOSWC6M7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BMEN6OPXLICQQL3NITCOSWC6M7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BMEN6OPXLICQQL3NITCOSWC6M7","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":"00652d122c699d6e6e752e9c2f7df7c1716361ca8dccacdbb9b95241bbab2238","cross_cats_sorted":["cs.AI","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-25T04:37:35Z","title_canon_sha256":"c34efe589b7db4e1eb43c77689f02292958739f97f88083a996c52b915dcbc57"},"schema_version":"1.0","source":{"id":"1704.07535","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.07535","created_at":"2026-05-18T00:45:37Z"},{"alias_kind":"arxiv_version","alias_value":"1704.07535v1","created_at":"2026-05-18T00:45:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07535","created_at":"2026-05-18T00:45:37Z"},{"alias_kind":"pith_short_12","alias_value":"BMEN6OPXLICQ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BMEN6OPXLICQQL3N","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BMEN6OPX","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:600eb8433a093c33fff7b6e23307c872e06e0d2bdc5853e5bd679e715bb8e09a","target":"graph","created_at":"2026-05-18T00:45:37Z","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":"Tasks like code generation and semantic parsing require mapping unstructured (or partially structured) inputs to well-formed, executable outputs. We introduce abstract syntax networks, a modeling framework for these problems. The outputs are represented as abstract syntax trees (ASTs) and constructed by a decoder with a dynamically-determined modular structure paralleling the structure of the output tree. On the benchmark Hearthstone dataset for code generation, our model obtains 79.2 BLEU and 22.7% exact match accuracy, compared to previous state-of-the-art values of 67.1 and 6.1%. Furthermor","authors_text":"Dan Klein, Maxim Rabinovich, Mitchell Stern","cross_cats":["cs.AI","cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-25T04:37:35Z","title":"Abstract Syntax Networks for Code Generation and Semantic Parsing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07535","kind":"arxiv","version":1},"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:c099acb30b916659a8ceecaf23f24da6d87404410ddfcdcd8eab14f244cd6b31","target":"record","created_at":"2026-05-18T00:45:37Z","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":"00652d122c699d6e6e752e9c2f7df7c1716361ca8dccacdbb9b95241bbab2238","cross_cats_sorted":["cs.AI","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-25T04:37:35Z","title_canon_sha256":"c34efe589b7db4e1eb43c77689f02292958739f97f88083a996c52b915dcbc57"},"schema_version":"1.0","source":{"id":"1704.07535","kind":"arxiv","version":1}},"canonical_sha256":"0b08df39f75a05082f6d44c4e9585e67c1cd8b4fab90ee4b5239d05e08a71220","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b08df39f75a05082f6d44c4e9585e67c1cd8b4fab90ee4b5239d05e08a71220","first_computed_at":"2026-05-18T00:45:37.771092Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:37.771092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r2ILs6R/aqXIjoq3oC8XFybU1gFzr1dxBCptOKvxGeunDJ73ILSFhZ6OK7RBGRHY7e1qRe7pea2OrB5k9wBMAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:37.771924Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.07535","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c099acb30b916659a8ceecaf23f24da6d87404410ddfcdcd8eab14f244cd6b31","sha256:600eb8433a093c33fff7b6e23307c872e06e0d2bdc5853e5bd679e715bb8e09a"],"state_sha256":"7489d97e2b5657a570110c42d443538cc0eb777d2de9a85e8b9e2c406d554169"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hzW7VnOxH4685oe2k+H1erELdQQIcQzqaquI4O6up/cYJ9J/ef+5x3rL0nojTGEK6b911zbl8KBZcac4HIyIBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:21:57.605527Z","bundle_sha256":"1233dad679ea0b533efec2f7b781c76ae43ddc0b0498e9855d04b7b79183db1a"}}