{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HZP65BUEM6OB4T72HS7VAUWM3B","short_pith_number":"pith:HZP65BUE","canonical_record":{"source":{"id":"1810.05237","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-10-11T20:24:13Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"fa9cc385bbd81dc6a9a6a340b9ae7cf36b4773ab232378bc45039961e55491eb","abstract_canon_sha256":"c754654e50d5cd97cd7bf0b2f1f9e8ca9df877862bf2d97150a1b86e219e536e"},"schema_version":"1.0"},"canonical_sha256":"3e5fee8684679c1e4ffa3cbf5052ccd8680967ff006169b597f9e0c17c3855f1","source":{"kind":"arxiv","id":"1810.05237","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05237","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05237v2","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05237","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"pith_short_12","alias_value":"HZP65BUEM6OB","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HZP65BUEM6OB4T72","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HZP65BUE","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HZP65BUEM6OB4T72HS7VAUWM3B","target":"record","payload":{"canonical_record":{"source":{"id":"1810.05237","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-10-11T20:24:13Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"fa9cc385bbd81dc6a9a6a340b9ae7cf36b4773ab232378bc45039961e55491eb","abstract_canon_sha256":"c754654e50d5cd97cd7bf0b2f1f9e8ca9df877862bf2d97150a1b86e219e536e"},"schema_version":"1.0"},"canonical_sha256":"3e5fee8684679c1e4ffa3cbf5052ccd8680967ff006169b597f9e0c17c3855f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:15.572591Z","signature_b64":"XtDQSkCVpTxHtxthsLMzX0qApAcMb62AhFAfhiV8jImcth7K06+CzEd4rwU8AyOuPlFIqt7YgE/TM7IO000PCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e5fee8684679c1e4ffa3cbf5052ccd8680967ff006169b597f9e0c17c3855f1","last_reissued_at":"2026-05-18T00:02:15.571878Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:15.571878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.05237","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-18T00:02:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5wlpF/QgXFNpS82Oe1HhLMRgYwsURsaj0bg7E716kFVrY1S6btRQ1N65yHPTafy3sFJXnFiwY5wlhaPqOnfZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:28:13.391636Z"},"content_sha256":"5b1dbb8f8d6ee401cd7cc35103e4f31230ec4ea36e62fb6b95da6bfff4ee0285","schema_version":"1.0","event_id":"sha256:5b1dbb8f8d6ee401cd7cc35103e4f31230ec4ea36e62fb6b95da6bfff4ee0285"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HZP65BUEM6OB4T72HS7VAUWM3B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SyntaxSQLNet: Syntax Tree Networks for Complex and Cross-DomainText-to-SQL Task","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Dongxu Wang, Dragomir Radev, Kai Yang, Michihiro Yasunaga, Rui Zhang, Tao Yu, Zifan Li","submitted_at":"2018-10-11T20:24:13Z","abstract_excerpt":"Most existing studies in text-to-SQL tasks do not require generating complex SQL queries with multiple clauses or sub-queries, and generalizing to new, unseen databases. In this paper we propose SyntaxSQLNet, a syntax tree network to address the complex and cross-domain text-to-SQL generation task. SyntaxSQLNet employs a SQL specific syntax tree-based decoder with SQL generation path history and table-aware column attention encoders. We evaluate SyntaxSQLNet on the Spider text-to-SQL task, which contains databases with multiple tables and complex SQL queries with multiple SQL clauses and neste"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05237","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-18T00:02:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CJWs/Z3zFkIQNkcmAauHWs5kW5JPyc3lEGZo1faH222lxd/jEXUcKkvBYv6tjADUSh8haD6vHHwX7sH3kpGIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:28:13.392239Z"},"content_sha256":"9be49a1b4d7c07895322ab5945eafaa978c7489a250cd53fbaafdf75cc6891cf","schema_version":"1.0","event_id":"sha256:9be49a1b4d7c07895322ab5945eafaa978c7489a250cd53fbaafdf75cc6891cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HZP65BUEM6OB4T72HS7VAUWM3B/bundle.json","state_url":"https://pith.science/pith/HZP65BUEM6OB4T72HS7VAUWM3B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HZP65BUEM6OB4T72HS7VAUWM3B/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-29T15:28:13Z","links":{"resolver":"https://pith.science/pith/HZP65BUEM6OB4T72HS7VAUWM3B","bundle":"https://pith.science/pith/HZP65BUEM6OB4T72HS7VAUWM3B/bundle.json","state":"https://pith.science/pith/HZP65BUEM6OB4T72HS7VAUWM3B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HZP65BUEM6OB4T72HS7VAUWM3B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HZP65BUEM6OB4T72HS7VAUWM3B","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":"c754654e50d5cd97cd7bf0b2f1f9e8ca9df877862bf2d97150a1b86e219e536e","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-10-11T20:24:13Z","title_canon_sha256":"fa9cc385bbd81dc6a9a6a340b9ae7cf36b4773ab232378bc45039961e55491eb"},"schema_version":"1.0","source":{"id":"1810.05237","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05237","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05237v2","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05237","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"pith_short_12","alias_value":"HZP65BUEM6OB","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HZP65BUEM6OB4T72","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HZP65BUE","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:9be49a1b4d7c07895322ab5945eafaa978c7489a250cd53fbaafdf75cc6891cf","target":"graph","created_at":"2026-05-18T00:02:15Z","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":"Most existing studies in text-to-SQL tasks do not require generating complex SQL queries with multiple clauses or sub-queries, and generalizing to new, unseen databases. In this paper we propose SyntaxSQLNet, a syntax tree network to address the complex and cross-domain text-to-SQL generation task. SyntaxSQLNet employs a SQL specific syntax tree-based decoder with SQL generation path history and table-aware column attention encoders. We evaluate SyntaxSQLNet on the Spider text-to-SQL task, which contains databases with multiple tables and complex SQL queries with multiple SQL clauses and neste","authors_text":"Dongxu Wang, Dragomir Radev, Kai Yang, Michihiro Yasunaga, Rui Zhang, Tao Yu, Zifan Li","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-10-11T20:24:13Z","title":"SyntaxSQLNet: Syntax Tree Networks for Complex and Cross-DomainText-to-SQL Task"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05237","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:5b1dbb8f8d6ee401cd7cc35103e4f31230ec4ea36e62fb6b95da6bfff4ee0285","target":"record","created_at":"2026-05-18T00:02:15Z","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":"c754654e50d5cd97cd7bf0b2f1f9e8ca9df877862bf2d97150a1b86e219e536e","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-10-11T20:24:13Z","title_canon_sha256":"fa9cc385bbd81dc6a9a6a340b9ae7cf36b4773ab232378bc45039961e55491eb"},"schema_version":"1.0","source":{"id":"1810.05237","kind":"arxiv","version":2}},"canonical_sha256":"3e5fee8684679c1e4ffa3cbf5052ccd8680967ff006169b597f9e0c17c3855f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e5fee8684679c1e4ffa3cbf5052ccd8680967ff006169b597f9e0c17c3855f1","first_computed_at":"2026-05-18T00:02:15.571878Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:15.571878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XtDQSkCVpTxHtxthsLMzX0qApAcMb62AhFAfhiV8jImcth7K06+CzEd4rwU8AyOuPlFIqt7YgE/TM7IO000PCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:15.572591Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.05237","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b1dbb8f8d6ee401cd7cc35103e4f31230ec4ea36e62fb6b95da6bfff4ee0285","sha256:9be49a1b4d7c07895322ab5945eafaa978c7489a250cd53fbaafdf75cc6891cf"],"state_sha256":"e897584fcf944612c2889cb5f0b952f10d29a30a073fcd597bf47edda66c23fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ErT/bEaAd82k0ut3Qlg8FCjH57bydpQF8fmXZ9ooapwM2ApEBJhLNiLivuxFhWBFkw4dUKnJ+rWd/btcxLouDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:28:13.395681Z","bundle_sha256":"04792458c78fbfef02d1036c71826465849629ee5ee5230719bcf173d2a5b7b5"}}