{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:MVFKEXKNBUKXCBGEY3TNVRHQBO","short_pith_number":"pith:MVFKEXKN","schema_version":"1.0","canonical_sha256":"654aa25d4d0d157104c4c6e6dac4f00ba975bd51edf2026047202172befcef0d","source":{"kind":"arxiv","id":"2009.13752","version":1},"attestation_state":"computed","paper":{"title":"Double Graph Based Reasoning for Document-level Relation Extraction","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Baobao Chang, Lei Li, Runxin Xu, Shuang Zeng","submitted_at":"2020-09-29T03:41:01Z","abstract_excerpt":"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. Experimen"},"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":"2009.13752","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2020-09-29T03:41:01Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"009114c6f5be9639a0860d7b9742dd22210f2c7ae207882a10719f9c2e458139","abstract_canon_sha256":"07d8e22ce00111c50684f778d56797fef54b6800e7ca26fc988acd298defcd11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:38:44.639226Z","signature_b64":"/lOwI/6S31eCfKuESYsAimg3/iBlnBMS4nwRpC+WMwWwJ6AcRwcQOgzlx2Jif2YXaeg5ChYWl4oso3EsDjUPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"654aa25d4d0d157104c4c6e6dac4f00ba975bd51edf2026047202172befcef0d","last_reissued_at":"2026-07-05T01:38:44.638830Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:38:44.638830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Double Graph Based Reasoning for Document-level Relation Extraction","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Baobao Chang, Lei Li, Runxin Xu, Shuang Zeng","submitted_at":"2020-09-29T03:41:01Z","abstract_excerpt":"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. Experimen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.13752","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2009.13752/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2009.13752","created_at":"2026-07-05T01:38:44.638889+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.13752v1","created_at":"2026-07-05T01:38:44.638889+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.13752","created_at":"2026-07-05T01:38:44.638889+00:00"},{"alias_kind":"pith_short_12","alias_value":"MVFKEXKNBUKX","created_at":"2026-07-05T01:38:44.638889+00:00"},{"alias_kind":"pith_short_16","alias_value":"MVFKEXKNBUKXCBGE","created_at":"2026-07-05T01:38:44.638889+00:00"},{"alias_kind":"pith_short_8","alias_value":"MVFKEXKN","created_at":"2026-07-05T01:38:44.638889+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.22926","citing_title":"Multi-Relation Extraction in Entity Pairs using Global Context","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MVFKEXKNBUKXCBGEY3TNVRHQBO","json":"https://pith.science/pith/MVFKEXKNBUKXCBGEY3TNVRHQBO.json","graph_json":"https://pith.science/api/pith-number/MVFKEXKNBUKXCBGEY3TNVRHQBO/graph.json","events_json":"https://pith.science/api/pith-number/MVFKEXKNBUKXCBGEY3TNVRHQBO/events.json","paper":"https://pith.science/paper/MVFKEXKN"},"agent_actions":{"view_html":"https://pith.science/pith/MVFKEXKNBUKXCBGEY3TNVRHQBO","download_json":"https://pith.science/pith/MVFKEXKNBUKXCBGEY3TNVRHQBO.json","view_paper":"https://pith.science/paper/MVFKEXKN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.13752&json=true","fetch_graph":"https://pith.science/api/pith-number/MVFKEXKNBUKXCBGEY3TNVRHQBO/graph.json","fetch_events":"https://pith.science/api/pith-number/MVFKEXKNBUKXCBGEY3TNVRHQBO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MVFKEXKNBUKXCBGEY3TNVRHQBO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MVFKEXKNBUKXCBGEY3TNVRHQBO/action/storage_attestation","attest_author":"https://pith.science/pith/MVFKEXKNBUKXCBGEY3TNVRHQBO/action/author_attestation","sign_citation":"https://pith.science/pith/MVFKEXKNBUKXCBGEY3TNVRHQBO/action/citation_signature","submit_replication":"https://pith.science/pith/MVFKEXKNBUKXCBGEY3TNVRHQBO/action/replication_record"}},"created_at":"2026-07-05T01:38:44.638889+00:00","updated_at":"2026-07-05T01:38:44.638889+00:00"}