{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/n-ary-relation-extraction-using-graph-state","title":"N-ary Relation Extraction using Graph State LSTM","arxiv_id":"1808.09101","date":"2018-08-28","proceeding":null,"authors":["Linfeng Song","Yue Zhang","Zhiguo Wang","Daniel Gildea"],"abstract":"Cross-sentence $n$-ary relation extraction detects relations among $n$\nentities across multiple sentences. Typical methods formulate an input as a\n\\textit{document graph}, integrating various intra-sentential and\ninter-sentential dependencies. The current state-of-the-art method splits the\ninput graph into two DAGs, adopting a DAG-structured LSTM for each. Though\nbeing able to model rich linguistic knowledge by leveraging graph edges,\nimportant information can be lost in the splitting procedure. We propose a\ngraph-state LSTM model, which uses a parallel state to model each word,\nrecurrently enriching state values via message passing. Compared with DAG\nLSTMs, our graph LSTM keeps the original graph structure, and speeds up\ncomputation by allowing more parallelization. On a standard benchmark, our\nmodel shows the best result in the literature.","url_abs":"http://arxiv.org/abs/1808.09101v1","url_pdf":"http://arxiv.org/pdf/1808.09101v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"n-ary-relation-extraction-using-graph-state","repo_url":"https://github.com/freesunshine0316/nary-grn","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"n-ary-relation-extraction-using-graph-state","repo_url":"https://github.com/pencoa/state-lstm","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":null,"task_name":"Relation"},{"task_slug":"relation-extraction","task_name":"Relation Extraction"},{"task_slug":"sentence","task_name":"Sentence"}],"methods":[{"method_slug":"lstm","method_name":"LSTM"},{"method_slug":"sigmoid-activation","method_name":"Sigmoid Activation"},{"method_slug":"tanh-activation","method_name":"Tanh Activation"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1808.09101","atlas_url":"https://app.syntology.ai/?focus=1808.09101","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1808.09101"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1808.09101\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1808.09101"},"call":"get_concepts_for_paper(arxiv_id=\"1808.09101\")"}],"by_repo":[{"repo":"freesunshine0316/nary-grn","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"pencoa/state-lstm","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"ef9a90b8e650f474dc705f9a1571c897ca71b75876a72f14a9d94c468027f65a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}