{"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/double-graph-based-reasoning-for-document","title":"Double Graph Based Reasoning for Document-level Relation Extraction","arxiv_id":"2009.13752","date":"2020-09-29","proceeding":"EMNLP 2020 11","authors":["Shuang Zeng","Runxin Xu","Baobao Chang","Lei LI"],"abstract":"Document-level relation extraction aims to extract relations among entities within a document. Different from sentence-level relation extraction, it requires reasoning over multiple sentences across a document. In this paper, we propose Graph Aggregation-and-Inference Network (GAIN) featuring double graphs. GAIN first constructs a heterogeneous mention-level graph (hMG) to model complex interaction among different mentions across the document. It also constructs an entity-level graph (EG), based on which we propose a novel path reasoning mechanism to infer relations between entities. Experiments on the public dataset, DocRED, show GAIN achieves a significant performance improvement (2.85 on F1) over the previous state-of-the-art. Our code is available at https://github.com/DreamInvoker/GAIN .","url_abs":"https://arxiv.org/abs/2009.13752v1","url_pdf":"https://arxiv.org/pdf/2009.13752v1.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":"double-graph-based-reasoning-for-document","repo_url":"https://github.com/DreamInvoker/GAIN","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"double-graph-based-reasoning-for-document","repo_url":"https://github.com/pkunlp-icler/gain","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"document-level-relation-extraction","task_name":"Document-level Relation Extraction"},{"task_slug":null,"task_name":"Relation"},{"task_slug":"relation-extraction","task_name":"Relation Extraction"},{"task_slug":"sentence","task_name":"Sentence"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/relation-extraction-on-docred","task":"Relation Extraction","dataset":"DocRED","model":"GAIN-BERT-large","rank_in_archive_order":12,"of":62,"metrics":{"F1":"62.76","Ign F1":"60.31"},"uses_additional_data":false},{"leaderboard":"/sota/relation-extraction-on-docred","task":"Relation Extraction","dataset":"DocRED","model":"GAIN-BERT","rank_in_archive_order":27,"of":62,"metrics":{"F1":"61.24","Ign F1":"59.00"},"uses_additional_data":false},{"leaderboard":"/sota/relation-extraction-on-docred","task":"Relation Extraction","dataset":"DocRED","model":"GAIN-GloVe","rank_in_archive_order":53,"of":62,"metrics":{"F1":"55.08","Ign F1":"52.66"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2009.13752","atlas_url":"https://app.syntology.ai/?focus=2009.13752","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":"2009.13752"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2009.13752\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2009.13752"},"call":"get_concepts_for_paper(arxiv_id=\"2009.13752\")"}],"by_repo":[{"repo":"DreamInvoker/GAIN","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"pkunlp-icler/gain","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":"affcf35a7f3c371207c87114d0e7b44163209c474602c43c265ea8841e6ece2f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}