{"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/structure-aware-interactive-graph-neural","title":"Structure-aware Interactive Graph Neural Networks for the Prediction of Protein-Ligand Binding Affinity","arxiv_id":"2107.10670","date":"2021-07-21","proceeding":null,"authors":["Shuangli Li","Jingbo Zhou","Tong Xu","Liang Huang","Fan Wang","Haoyi Xiong","Weili Huang","Dejing Dou","Hui Xiong"],"abstract":"Drug discovery often relies on the successful prediction of protein-ligand binding affinity. Recent advances have shown great promise in applying graph neural networks (GNNs) for better affinity prediction by learning the representations of protein-ligand complexes. However, existing solutions usually treat protein-ligand complexes as topological graph data, thus the biomolecular structural information is not fully utilized. The essential long-range interactions among atoms are also neglected in GNN models. To this end, we propose a structure-aware interactive graph neural network (SIGN) which consists of two components: polar-inspired graph attention layers (PGAL) and pairwise interactive pooling (PiPool). Specifically, PGAL iteratively performs the node-edge aggregation process to update embeddings of nodes and edges while preserving the distance and angle information among atoms. Then, PiPool is adopted to gather interactive edges with a subsequent reconstruction loss to reflect the global interactions. Exhaustive experimental study on two benchmarks verifies the superiority of SIGN.","url_abs":"https://arxiv.org/abs/2107.10670v1","url_pdf":"https://arxiv.org/pdf/2107.10670v1.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":"structure-aware-interactive-graph-neural","repo_url":"https://github.com/agave233/SIGN","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"paddle","reach":{"status":"ok"}}],"tasks":[{"task_slug":"drug-discovery","task_name":"Drug Discovery"},{"task_slug":"graph-attention","task_name":"Graph Attention"},{"task_slug":"graph-neural-network","task_name":"Graph Neural Network"},{"task_slug":"protein-ligand-affinity-prediction","task_name":"Protein-Ligand Affinity Prediction"}],"methods":[{"method_slug":"graph-neural-network","method_name":"Graph Neural Network"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/protein-ligand-affinity-prediction-on-pdbbind","task":"Protein-Ligand Affinity Prediction","dataset":"PDBbind","model":"SIGN","rank_in_archive_order":5,"of":7,"metrics":{"RMSE":"1.316"},"uses_additional_data":false},{"leaderboard":"/sota/protein-ligand-affinity-prediction-on-pdbbind","task":"Protein-Ligand Affinity Prediction","dataset":"PDBbind","model":"DimeNet","rank_in_archive_order":6,"of":7,"metrics":{"RMSE":"1.453"},"uses_additional_data":false},{"leaderboard":"/sota/protein-ligand-affinity-prediction-on-pdbbind","task":"Protein-Ligand Affinity Prediction","dataset":"PDBbind","model":"GraphDTA","rank_in_archive_order":7,"of":7,"metrics":{"RMSE":"1.562"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2107.10670","atlas_url":"https://app.syntology.ai/?focus=2107.10670","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":"2107.10670"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2107.10670\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2107.10670"},"call":"get_concepts_for_paper(arxiv_id=\"2107.10670\")"}],"by_repo":[{"repo":"agave233/SIGN","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":"b2064a7fb4dab5030a913a17010df860dc276888521de10046b75bb39a425516","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}