{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3QCMTX7KSETVTYMZ6VVKLSQT3P","short_pith_number":"pith:3QCMTX7K","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"},"canonical_sha256":"dc04c9dfea912759e199f56aa5ca13dbe543f9c2e19bd2ff2cef78792005e0f6","source":{"kind":"arxiv","id":"1808.07624","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.07624","created_at":"2026-05-18T00:07:26Z"},{"alias_kind":"arxiv_version","alias_value":"1808.07624v1","created_at":"2026-05-18T00:07:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07624","created_at":"2026-05-18T00:07:26Z"},{"alias_kind":"pith_short_12","alias_value":"3QCMTX7KSETV","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3QCMTX7KSETVTYMZ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3QCMTX7K","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3QCMTX7KSETVTYMZ6VVKLSQT3P","target":"record","payload":{"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"},"canonical_sha256":"dc04c9dfea912759e199f56aa5ca13dbe543f9c2e19bd2ff2cef78792005e0f6","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"},"source_kind":"arxiv","source_id":"1808.07624","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:07:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZP1JfiIznjXEVZQL/4beqrBHlhJBX2TqwLPaQ7I9G28zo2C0SFIfVlmgnMsLuJ7i96088YBSLcovsL2wJHNTAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:34:17.331324Z"},"content_sha256":"52cdf56adef30755952c38073c3b397eaa0e905f5f0a30c5f8ba2cb5cf83f9f8","schema_version":"1.0","event_id":"sha256:52cdf56adef30755952c38073c3b397eaa0e905f5f0a30c5f8ba2cb5cf83f9f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3QCMTX7KSETVTYMZ6VVKLSQT3P","target":"graph","payload":{"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"},"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:07:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JQV08201DSnPFRLSJMPwbRZLdsle2DJFh6iP6J1Kaw+JoM4+EcStDmy2cTGj/UhQD0k71FsiFDCqQtIm5vY5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:34:17.331783Z"},"content_sha256":"b803f1ddcb3e1199bb8b5aae6ef0df5bd7721f0cdb8db75b4497a260c321ec49","schema_version":"1.0","event_id":"sha256:b803f1ddcb3e1199bb8b5aae6ef0df5bd7721f0cdb8db75b4497a260c321ec49"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3QCMTX7KSETVTYMZ6VVKLSQT3P/bundle.json","state_url":"https://pith.science/pith/3QCMTX7KSETVTYMZ6VVKLSQT3P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3QCMTX7KSETVTYMZ6VVKLSQT3P/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-27T16:34:17Z","links":{"resolver":"https://pith.science/pith/3QCMTX7KSETVTYMZ6VVKLSQT3P","bundle":"https://pith.science/pith/3QCMTX7KSETVTYMZ6VVKLSQT3P/bundle.json","state":"https://pith.science/pith/3QCMTX7KSETVTYMZ6VVKLSQT3P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3QCMTX7KSETVTYMZ6VVKLSQT3P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3QCMTX7KSETVTYMZ6VVKLSQT3P","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":"1e55a5fccb0e6a975773e4c0c6ed204c48c2afb9b79f433e87122e0eb6da5abd","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-23T03:58:21Z","title_canon_sha256":"3f6ce47d3ed5208678ec046f5bf3842bf2518f12dea9d8782d173bdbd86732b0"},"schema_version":"1.0","source":{"id":"1808.07624","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.07624","created_at":"2026-05-18T00:07:26Z"},{"alias_kind":"arxiv_version","alias_value":"1808.07624v1","created_at":"2026-05-18T00:07:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07624","created_at":"2026-05-18T00:07:26Z"},{"alias_kind":"pith_short_12","alias_value":"3QCMTX7KSETV","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3QCMTX7KSETVTYMZ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3QCMTX7K","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:b803f1ddcb3e1199bb8b5aae6ef0df5bd7721f0cdb8db75b4497a260c321ec49","target":"graph","created_at":"2026-05-18T00:07:26Z","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":"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","authors_text":"Kun Xu, Lingfei Wu, Liwei Chen, Mo Yu, Vadim Sheinin, Zhiguo Wang","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-23T03:58:21Z","title":"Exploiting Rich Syntactic Information for Semantic Parsing with Graph-to-Sequence Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.07624","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:52cdf56adef30755952c38073c3b397eaa0e905f5f0a30c5f8ba2cb5cf83f9f8","target":"record","created_at":"2026-05-18T00:07:26Z","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":"1e55a5fccb0e6a975773e4c0c6ed204c48c2afb9b79f433e87122e0eb6da5abd","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-23T03:58:21Z","title_canon_sha256":"3f6ce47d3ed5208678ec046f5bf3842bf2518f12dea9d8782d173bdbd86732b0"},"schema_version":"1.0","source":{"id":"1808.07624","kind":"arxiv","version":1}},"canonical_sha256":"dc04c9dfea912759e199f56aa5ca13dbe543f9c2e19bd2ff2cef78792005e0f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc04c9dfea912759e199f56aa5ca13dbe543f9c2e19bd2ff2cef78792005e0f6","first_computed_at":"2026-05-18T00:07:26.699760Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:26.699760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VmwPDMH8isdL+AMzHQIcXagia53MUhnjuecZH+4vFHYSKZ+cuHebwNMJ0Lci90YOa4gWr5oxemUs38JPC6/eDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:26.700420Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.07624","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52cdf56adef30755952c38073c3b397eaa0e905f5f0a30c5f8ba2cb5cf83f9f8","sha256:b803f1ddcb3e1199bb8b5aae6ef0df5bd7721f0cdb8db75b4497a260c321ec49"],"state_sha256":"33fc26d1ad997d30bd7728efbb973006d0b679c38adb1ad8f68d6aa586d09cf7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VjDJl9P4HKSmNTPZsbkqdHKLZIZKXqQTZZTB0KkGsGdIT9emxuPibjHVUjOmlWf6X69iM4MLu6kukIuLoKjnCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:34:17.335714Z","bundle_sha256":"6c8efb220be703682e952b160e9f7a7512b31794d0abcc8e553fd04c7b67020b"}}