{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BMEN6OPXLICQQL3NITCOSWC6M7","short_pith_number":"pith:BMEN6OPX","schema_version":"1.0","canonical_sha256":"0b08df39f75a05082f6d44c4e9585e67c1cd8b4fab90ee4b5239d05e08a71220","source":{"kind":"arxiv","id":"1704.07535","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.07535","created_at":"2026-05-18T00:45:37.771295+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.07535v1","created_at":"2026-05-18T00:45:37.771295+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07535","created_at":"2026-05-18T00:45:37.771295+00:00"},{"alias_kind":"pith_short_12","alias_value":"BMEN6OPXLICQ","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BMEN6OPXLICQQL3N","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BMEN6OPX","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2502.05664","citing_title":"CODESIM: Multi-Agent Code Generation and Problem Solving through Simulation-Driven Planning and Debugging","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2009.08366","citing_title":"GraphCodeBERT: Pre-training Code Representations with Data Flow","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2009.10297","citing_title":"CodeBLEU: a Method for Automatic Evaluation of Code Synthesis","ref_index":95,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BMEN6OPXLICQQL3NITCOSWC6M7","json":"https://pith.science/pith/BMEN6OPXLICQQL3NITCOSWC6M7.json","graph_json":"https://pith.science/api/pith-number/BMEN6OPXLICQQL3NITCOSWC6M7/graph.json","events_json":"https://pith.science/api/pith-number/BMEN6OPXLICQQL3NITCOSWC6M7/events.json","paper":"https://pith.science/paper/BMEN6OPX"},"agent_actions":{"view_html":"https://pith.science/pith/BMEN6OPXLICQQL3NITCOSWC6M7","download_json":"https://pith.science/pith/BMEN6OPXLICQQL3NITCOSWC6M7.json","view_paper":"https://pith.science/paper/BMEN6OPX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.07535&json=true","fetch_graph":"https://pith.science/api/pith-number/BMEN6OPXLICQQL3NITCOSWC6M7/graph.json","fetch_events":"https://pith.science/api/pith-number/BMEN6OPXLICQQL3NITCOSWC6M7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BMEN6OPXLICQQL3NITCOSWC6M7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BMEN6OPXLICQQL3NITCOSWC6M7/action/storage_attestation","attest_author":"https://pith.science/pith/BMEN6OPXLICQQL3NITCOSWC6M7/action/author_attestation","sign_citation":"https://pith.science/pith/BMEN6OPXLICQQL3NITCOSWC6M7/action/citation_signature","submit_replication":"https://pith.science/pith/BMEN6OPXLICQQL3NITCOSWC6M7/action/replication_record"}},"created_at":"2026-05-18T00:45:37.771295+00:00","updated_at":"2026-05-18T00:45:37.771295+00:00"}