{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3QCMTX7KSETVTYMZ6VVKLSQT3P","short_pith_number":"pith:3QCMTX7K","schema_version":"1.0","canonical_sha256":"dc04c9dfea912759e199f56aa5ca13dbe543f9c2e19bd2ff2cef78792005e0f6","source":{"kind":"arxiv","id":"1808.07624","version":1},"attestation_state":"computed","paper":{"title":"Exploiting Rich Syntactic Information for Semantic Parsing with Graph-to-Sequence Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Kun Xu, Lingfei Wu, Liwei Chen, Mo Yu, Vadim Sheinin, Zhiguo Wang","submitted_at":"2018-08-23T03:58:21Z","abstract_excerpt":"Existing neural semantic parsers mainly utilize a sequence encoder, i.e., a sequential LSTM, to extract word order features while neglecting other valuable syntactic information such as dependency graph or constituent trees. In this paper, we first propose to use the \\textit{syntactic graph} to represent three types of syntactic information, i.e., word order, dependency and constituency features. We further employ a graph-to-sequence model to encode the syntactic graph and decode a logical form. Experimental results on benchmark datasets show that our model is comparable to the state-of-the-ar"},"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":"1808.07624","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-23T03:58:21Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3f6ce47d3ed5208678ec046f5bf3842bf2518f12dea9d8782d173bdbd86732b0","abstract_canon_sha256":"1e55a5fccb0e6a975773e4c0c6ed204c48c2afb9b79f433e87122e0eb6da5abd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:26.700420Z","signature_b64":"VmwPDMH8isdL+AMzHQIcXagia53MUhnjuecZH+4vFHYSKZ+cuHebwNMJ0Lci90YOa4gWr5oxemUs38JPC6/eDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc04c9dfea912759e199f56aa5ca13dbe543f9c2e19bd2ff2cef78792005e0f6","last_reissued_at":"2026-05-18T00:07:26.699760Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:26.699760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploiting Rich Syntactic Information for Semantic Parsing with Graph-to-Sequence Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Kun Xu, Lingfei Wu, Liwei Chen, Mo Yu, Vadim Sheinin, Zhiguo Wang","submitted_at":"2018-08-23T03:58:21Z","abstract_excerpt":"Existing neural semantic parsers mainly utilize a sequence encoder, i.e., a sequential LSTM, to extract word order features while neglecting other valuable syntactic information such as dependency graph or constituent trees. In this paper, we first propose to use the \\textit{syntactic graph} to represent three types of syntactic information, i.e., word order, dependency and constituency features. We further employ a graph-to-sequence model to encode the syntactic graph and decode a logical form. Experimental results on benchmark datasets show that our model is comparable to the state-of-the-ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.07624","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":"1808.07624","created_at":"2026-05-18T00:07:26.699843+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.07624v1","created_at":"2026-05-18T00:07:26.699843+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07624","created_at":"2026-05-18T00:07:26.699843+00:00"},{"alias_kind":"pith_short_12","alias_value":"3QCMTX7KSETV","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"3QCMTX7KSETVTYMZ","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"3QCMTX7K","created_at":"2026-05-18T12:32:02.567920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3QCMTX7KSETVTYMZ6VVKLSQT3P","json":"https://pith.science/pith/3QCMTX7KSETVTYMZ6VVKLSQT3P.json","graph_json":"https://pith.science/api/pith-number/3QCMTX7KSETVTYMZ6VVKLSQT3P/graph.json","events_json":"https://pith.science/api/pith-number/3QCMTX7KSETVTYMZ6VVKLSQT3P/events.json","paper":"https://pith.science/paper/3QCMTX7K"},"agent_actions":{"view_html":"https://pith.science/pith/3QCMTX7KSETVTYMZ6VVKLSQT3P","download_json":"https://pith.science/pith/3QCMTX7KSETVTYMZ6VVKLSQT3P.json","view_paper":"https://pith.science/paper/3QCMTX7K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.07624&json=true","fetch_graph":"https://pith.science/api/pith-number/3QCMTX7KSETVTYMZ6VVKLSQT3P/graph.json","fetch_events":"https://pith.science/api/pith-number/3QCMTX7KSETVTYMZ6VVKLSQT3P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3QCMTX7KSETVTYMZ6VVKLSQT3P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3QCMTX7KSETVTYMZ6VVKLSQT3P/action/storage_attestation","attest_author":"https://pith.science/pith/3QCMTX7KSETVTYMZ6VVKLSQT3P/action/author_attestation","sign_citation":"https://pith.science/pith/3QCMTX7KSETVTYMZ6VVKLSQT3P/action/citation_signature","submit_replication":"https://pith.science/pith/3QCMTX7KSETVTYMZ6VVKLSQT3P/action/replication_record"}},"created_at":"2026-05-18T00:07:26.699843+00:00","updated_at":"2026-05-18T00:07:26.699843+00:00"}