{"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/message-passing-attention-networks-for","title":"Message Passing Attention Networks for Document Understanding","arxiv_id":"1908.06267","date":"2019-08-17","proceeding":null,"authors":["Giannis Nikolentzos","Antoine J. -P. Tixier","Michalis Vazirgiannis"],"abstract":"Graph neural networks have recently emerged as a very effective framework for processing graph-structured data. These models have achieved state-of-the-art performance in many tasks. Most graph neural networks can be described in terms of message passing, vertex update, and readout functions. In this paper, we represent documents as word co-occurrence networks and propose an application of the message passing framework to NLP, the Message Passing Attention network for Document understanding (MPAD). We also propose several hierarchical variants of MPAD. Experiments conducted on 10 standard text classification datasets show that our architectures are competitive with the state-of-the-art. Ablation studies reveal further insights about the impact of the different components on performance. Code is publicly available at: https://github.com/giannisnik/mpad .","url_abs":"https://arxiv.org/abs/1908.06267v2","url_pdf":"https://arxiv.org/pdf/1908.06267v2.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":"message-passing-attention-networks-for","repo_url":"https://github.com/giannisnik/mpad","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"message-passing-attention-networks-for","repo_url":"https://github.com/Tixierae/gow_tools","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"multi-modal-document-classification","task_name":"Multi-Modal Document Classification"},{"task_slug":"text-classification","task_name":"Text Classification"},{"task_slug":"document-understanding","task_name":"document understanding"},{"task_slug":"text-classification-1","task_name":"text-classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/document-classification-on-bbcsport","task":"Document Classification","dataset":"BBCSport","model":"MPAD-path","rank_in_archive_order":1,"of":4,"metrics":{"Accuracy":"99.59"},"uses_additional_data":false},{"leaderboard":"/sota/document-classification-on-mpqa","task":"Document Classification","dataset":"MPQA","model":"MPAD-path","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"89.81"},"uses_additional_data":false},{"leaderboard":"/sota/sentiment-analysis-on-sst-2-binary","task":"Sentiment Analysis","dataset":"SST-2 Binary classification","model":"MPAD-path","rank_in_archive_order":70,"of":87,"metrics":{"Accuracy":"87.75"},"uses_additional_data":false},{"leaderboard":"/sota/sentiment-analysis-on-sst-5-fine-grained","task":"Sentiment Analysis","dataset":"SST-5 Fine-grained classification","model":"MPAD-path","rank_in_archive_order":19,"of":31,"metrics":{"Accuracy":"49.68"},"uses_additional_data":false},{"leaderboard":"/sota/text-classification-on-imdb","task":"Text Classification","dataset":"IMDb","model":"MPAD-path","rank_in_archive_order":5,"of":13,"metrics":{},"uses_additional_data":false},{"leaderboard":"/sota/text-classification-on-trec-6","task":"Text Classification","dataset":"TREC-6","model":"MPAD-path","rank_in_archive_order":12,"of":19,"metrics":{"Error":"6.2"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1908.06267","atlas_url":"https://app.syntology.ai/?focus=1908.06267","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":"1908.06267"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1908.06267\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1908.06267"},"call":"get_concepts_for_paper(arxiv_id=\"1908.06267\")"}],"by_repo":[{"repo":"giannisnik/mpad","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Tixierae/gow_tools","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":"0536493cea0c54d76bf063fd655989f84b288021d99fcbbd256c3fb683abd267","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}