{"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/information-extraction-from-visually-rich-1","title":"Information Extraction from Visually Rich Documents Using Directed Weighted Graph Neural Network","arxiv_id":null,"date":"2024-09-11","proceeding":"International Conference on Document Analysis and Recognition 2024 9","authors":["Hamza Gbada","Karim Kalti","Mohamed Ali Mahjoub"],"abstract":"This paper presents a novel approach to information extraction (IE) from visually rich documents (VRD) by employing a directed weighted graph representation to capture relationships among various VRD components. In contrast to conventional methods relying on spatial proximity through Euclidean distance, our approach aims to enhance performance by introducing a novel representation of relationships using directed weighted graphs. The information extraction task from VRD is treated as a node classification problem, leveraging graph convolutional networks that process the VRD graphs. We conducted evaluations on five real-world datasets, showcasing notable results and performances that align with established norms.","url_abs":"https://link.springer.com/chapter/10.1007/978-3-031-70552-6_15","url_pdf":"https://link.springer.com/chapter/10.1007/978-3-031-70552-6_15","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":"information-extraction-from-visually-rich-1","repo_url":"https://github.com/HamzaGbada/direct-neighbor-vrd","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"document-layout-analysis","task_name":"Document Layout Analysis"},{"task_slug":"graph-neural-network","task_name":"Graph Neural Network"},{"task_slug":"information-retrieval","task_name":"Information Retrieval"},{"task_slug":"key-information-extraction","task_name":"Key Information Extraction"},{"task_slug":"node-classification","task_name":"Node Classification"},{"task_slug":"document-understanding","task_name":"document understanding"}],"methods":[{"method_slug":"align","method_name":"ALIGN"},{"method_slug":"gcn","method_name":"GCN"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"HamzaGbada/direct-neighbor-vrd","kind":"official","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":"3abfed3e38671b6ccf8eaf821edf9ac343ede6e222d34f3cee21cbfb65b45cf5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}