{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WWLYGNZCRNBWT3TQ3FLD2KOR5G","short_pith_number":"pith:WWLYGNZC","schema_version":"1.0","canonical_sha256":"b5978337228b4369ee70d9563d29d1e9a34137cad70046fc6a70eeaeec9994ab","source":{"kind":"arxiv","id":"1804.06610","version":3},"attestation_state":"computed","paper":{"title":"End-to-end Graph-based TAG Parsing with Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jungo Kasai, Owen Rambow, Pauli Xu, Robert Frank, William Merrill","submitted_at":"2018-04-18T09:07:16Z","abstract_excerpt":"We present a graph-based Tree Adjoining Grammar (TAG) parser that uses BiLSTMs, highway connections, and character-level CNNs. Our best end-to-end parser, which jointly performs supertagging, POS tagging, and parsing, outperforms the previously reported best results by more than 2.2 LAS and UAS points. The graph-based parsing architecture allows for global inference and rich feature representations for TAG parsing, alleviating the fundamental trade-off between transition-based and graph-based parsing systems. We also demonstrate that the proposed parser achieves state-of-the-art performance in"},"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":"1804.06610","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-04-18T09:07:16Z","cross_cats_sorted":[],"title_canon_sha256":"329e874d745d35c3727833fc9188d3e5d51083b7a3f42a0eb8d048d77a5e8987","abstract_canon_sha256":"27243f1ce5f8e443bcc4dbc11480d9e2ffdf3ecf85ce18a5fd600efb816ce450"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:16.314401Z","signature_b64":"NOe8WLeRE2iQSLam8Paiwpy6kRwURjSdlDL4X5vcFX40SDSHgMRMFPAmzRal09lFwQrn9w6QaxyMTJHrDuA7CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5978337228b4369ee70d9563d29d1e9a34137cad70046fc6a70eeaeec9994ab","last_reissued_at":"2026-05-18T00:17:16.313732Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:16.313732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"End-to-end Graph-based TAG Parsing with Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jungo Kasai, Owen Rambow, Pauli Xu, Robert Frank, William Merrill","submitted_at":"2018-04-18T09:07:16Z","abstract_excerpt":"We present a graph-based Tree Adjoining Grammar (TAG) parser that uses BiLSTMs, highway connections, and character-level CNNs. Our best end-to-end parser, which jointly performs supertagging, POS tagging, and parsing, outperforms the previously reported best results by more than 2.2 LAS and UAS points. The graph-based parsing architecture allows for global inference and rich feature representations for TAG parsing, alleviating the fundamental trade-off between transition-based and graph-based parsing systems. We also demonstrate that the proposed parser achieves state-of-the-art performance in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06610","kind":"arxiv","version":3},"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":"1804.06610","created_at":"2026-05-18T00:17:16.313835+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.06610v3","created_at":"2026-05-18T00:17:16.313835+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06610","created_at":"2026-05-18T00:17:16.313835+00:00"},{"alias_kind":"pith_short_12","alias_value":"WWLYGNZCRNBW","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WWLYGNZCRNBWT3TQ","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WWLYGNZC","created_at":"2026-05-18T12:33:01.666342+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/WWLYGNZCRNBWT3TQ3FLD2KOR5G","json":"https://pith.science/pith/WWLYGNZCRNBWT3TQ3FLD2KOR5G.json","graph_json":"https://pith.science/api/pith-number/WWLYGNZCRNBWT3TQ3FLD2KOR5G/graph.json","events_json":"https://pith.science/api/pith-number/WWLYGNZCRNBWT3TQ3FLD2KOR5G/events.json","paper":"https://pith.science/paper/WWLYGNZC"},"agent_actions":{"view_html":"https://pith.science/pith/WWLYGNZCRNBWT3TQ3FLD2KOR5G","download_json":"https://pith.science/pith/WWLYGNZCRNBWT3TQ3FLD2KOR5G.json","view_paper":"https://pith.science/paper/WWLYGNZC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.06610&json=true","fetch_graph":"https://pith.science/api/pith-number/WWLYGNZCRNBWT3TQ3FLD2KOR5G/graph.json","fetch_events":"https://pith.science/api/pith-number/WWLYGNZCRNBWT3TQ3FLD2KOR5G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WWLYGNZCRNBWT3TQ3FLD2KOR5G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WWLYGNZCRNBWT3TQ3FLD2KOR5G/action/storage_attestation","attest_author":"https://pith.science/pith/WWLYGNZCRNBWT3TQ3FLD2KOR5G/action/author_attestation","sign_citation":"https://pith.science/pith/WWLYGNZCRNBWT3TQ3FLD2KOR5G/action/citation_signature","submit_replication":"https://pith.science/pith/WWLYGNZCRNBWT3TQ3FLD2KOR5G/action/replication_record"}},"created_at":"2026-05-18T00:17:16.313835+00:00","updated_at":"2026-05-18T00:17:16.313835+00:00"}