{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T09:07:03Z","timestamp":1778663223693,"version":"3.51.4"},"publisher-location":"Stroudsburg, PA, USA","reference-count":0,"publisher":"Association for Computational Linguistics","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.18653\/v1\/n19-1298","type":"proceedings-article","created":{"date-parts":[[2019,7,21]],"date-time":"2019-07-21T13:26:41Z","timestamp":1563715601000},"page":"2902-2912","source":"Crossref","is-referenced-by-count":8,"title":["A Richer-but-Smarter Shortest Dependency Path with Attentive Augmentation for Relation Extraction"],"prefix":"10.18653","author":[{"given":"Duy-Cat","family":"Can","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hoang-Quynh","family":"Le","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quang-Thuy","family":"Ha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nigel","family":"Collier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1643","event":{"name":"Proceedings of the 2019 Conference of the North","location":"Minneapolis, Minnesota","start":{"date-parts":[[2019,6]]},"end":{"date-parts":[[2019,6]]}},"container-title":["Proceedings of the 2019 Conference of the North"],"original-title":[],"deposited":{"date-parts":[[2019,7,21]],"date-time":"2019-07-21T13:28:48Z","timestamp":1563715728000},"score":1,"resource":{"primary":{"URL":"http:\/\/aclweb.org\/anthology\/N19-1298"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":0,"URL":"https:\/\/doi.org\/10.18653\/v1\/n19-1298","relation":{},"subject":[],"published":{"date-parts":[[2019]]}}}