{"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/diffwire-inductive-graph-rewiring-via-the","title":"DiffWire: Inductive Graph Rewiring via the Lovász Bound","arxiv_id":"2206.07369","date":"2022-06-15","proceeding":null,"authors":["Adrian Arnaiz-Rodriguez","Ahmed Begga","Francisco Escolano","Nuria Oliver"],"abstract":"Graph Neural Networks (GNNs) have been shown to achieve competitive results to tackle graph-related tasks, such as node and graph classification, link prediction and node and graph clustering in a variety of domains. Most GNNs use a message passing framework and hence are called MPNNs. Despite their promising results, MPNNs have been reported to suffer from over-smoothing, over-squashing and under-reaching. Graph rewiring and graph pooling have been proposed in the literature as solutions to address these limitations. However, most state-of-the-art graph rewiring methods fail to preserve the global topology of the graph, are neither differentiable nor inductive, and require the tuning of hyper-parameters. In this paper, we propose DiffWire, a novel framework for graph rewiring in MPNNs that is principled, fully differentiable and parameter-free by leveraging the Lov\\'asz bound. The proposed approach provides a unified theory for graph rewiring by proposing two new, complementary layers in MPNNs: CT-Layer, a layer that learns the commute times and uses them as a relevance function for edge re-weighting; and GAP-Layer, a layer to optimize the spectral gap, depending on the nature of the network and the task at hand. We empirically validate the value of each of these layers separately with benchmark datasets for graph classification. We also perform preliminary studies on the use of CT-Layer for homophilic and heterophilic node classification tasks. DiffWire brings together the learnability of commute times to related definitions of curvature, opening the door to creating more expressive MPNNs.","url_abs":"https://arxiv.org/abs/2206.07369v3","url_pdf":"https://arxiv.org/pdf/2206.07369v3.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":"diffwire-inductive-graph-rewiring-via-the","repo_url":"https://github.com/AdrianArnaiz/DiffWire","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"diffwire-inductive-graph-rewiring-via-the","repo_url":"https://github.com/ellisalicante/GraphRewiring-Tutorial","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"graph-classification","task_name":"Graph Classification"},{"task_slug":"node-classification","task_name":"Node Classification"}],"methods":[{"method_slug":"ct-layer","method_name":"CT-Layer"},{"method_slug":"gap-layer","method_name":"GAP-Layer"}],"datasets_introduced":[],"methods_introduced":[{"slug":"ct-layer","name":"CT-Layer","full_name":"Commute Times Layer"},{"slug":"gap-layer","name":"GAP-Layer","full_name":"Spectral Gap Rewiring Layer"}],"results":[{"leaderboard":"/sota/graph-classification-on-collab","task":"Graph Classification","dataset":"COLLAB","model":"DiffWire","rank_in_archive_order":29,"of":39,"metrics":{"Accuracy":"72.24%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-collab","task":"Graph Classification","dataset":"COLLAB","model":"CT-Layer","rank_in_archive_order":32,"of":39,"metrics":{"Accuracy":"69.87%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-collab","task":"Graph Classification","dataset":"COLLAB","model":"GAP-Layer (Ncut)","rank_in_archive_order":37,"of":39,"metrics":{"Accuracy":"65.89%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-collab","task":"Graph Classification","dataset":"COLLAB","model":"GAP-Layer (Rcut)","rank_in_archive_order":39,"of":39,"metrics":{"Accuracy":"64.47%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-imdb-binary","task":"Graph Classification","dataset":"IMDB-BINARY","model":"GAP-Layer (Rcut)","rank_in_archive_order":4,"of":8,"metrics":{"Accuracy":"69.93"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-imdb-binary","task":"Graph Classification","dataset":"IMDB-BINARY","model":"CT-Layer","rank_in_archive_order":5,"of":8,"metrics":{"Accuracy":"69.84"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-imdb-binary","task":"Graph Classification","dataset":"IMDB-BINARY","model":"GAP-Layer (Ncut)","rank_in_archive_order":6,"of":8,"metrics":{"Accuracy":"68.8"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-mutag","task":"Graph Classification","dataset":"MUTAG","model":"CT-Layer","rank_in_archive_order":45,"of":74,"metrics":{"Accuracy":"87.58%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-mutag","task":"Graph Classification","dataset":"MUTAG","model":"GAP-Layer (Rcut)","rank_in_archive_order":52,"of":74,"metrics":{"Accuracy":"86.9%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-mutag","task":"Graph Classification","dataset":"MUTAG","model":"GAP-Layer (Ncut)","rank_in_archive_order":53,"of":74,"metrics":{"Accuracy":"86.9%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-proteins","task":"Graph Classification","dataset":"PROTEINS","model":"CT-Layer","rank_in_archive_order":66,"of":103,"metrics":{"Accuracy":"75.38%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-proteins","task":"Graph Classification","dataset":"PROTEINS","model":"GAP-Layer (Ncut)","rank_in_archive_order":68,"of":103,"metrics":{"Accuracy":"75.34%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-proteins","task":"Graph Classification","dataset":"PROTEINS","model":"GAP-Layer (Rcut)","rank_in_archive_order":72,"of":103,"metrics":{"Accuracy":"75.03%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-proteins","task":"Graph Classification","dataset":"PROTEINS","model":"DiffWire","rank_in_archive_order":74,"of":103,"metrics":{"Accuracy":"74.91%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-reddit-binary","task":"Graph Classification","dataset":"REDDIT-BINARY","model":"CT-Layer","rank_in_archive_order":6,"of":9,"metrics":{"Accuracy":"78.45"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-reddit-binary","task":"Graph Classification","dataset":"REDDIT-BINARY","model":"GAP-Layer (Rcut)","rank_in_archive_order":7,"of":9,"metrics":{"Accuracy":"77.63"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-reddit-binary","task":"Graph Classification","dataset":"REDDIT-BINARY","model":"DiffWire","rank_in_archive_order":8,"of":9,"metrics":{"Accuracy":"77.17"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-reddit-binary","task":"Graph Classification","dataset":"REDDIT-BINARY","model":"GAP-Layer (Ncut)","rank_in_archive_order":9,"of":9,"metrics":{"Accuracy":"76"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-actor","task":"Node Classification","dataset":"Actor","model":"CT-Layer","rank_in_archive_order":55,"of":62,"metrics":{"Accuracy":"31.98"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-actor","task":"Node Classification","dataset":"Actor","model":"CT-Layer (PE)","rank_in_archive_order":60,"of":62,"metrics":{"Accuracy":"29.35"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-citeseer","task":"Node Classification","dataset":"Citeseer","model":"CT-Layer (PE)","rank_in_archive_order":43,"of":71,"metrics":{"Accuracy":"72.26"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-citeseer","task":"Node Classification","dataset":"Citeseer","model":"CT-Layer","rank_in_archive_order":63,"of":71,"metrics":{"Accuracy":"66.71"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cora","task":"Node Classification","dataset":"Cora","model":"CT-Layer (PE)","rank_in_archive_order":36,"of":73,"metrics":{"Accuracy":"83.66%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cora","task":"Node Classification","dataset":"Cora","model":"CT-Layer","rank_in_archive_order":71,"of":73,"metrics":{"Accuracy":"67.96%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cornell","task":"Node Classification","dataset":"Cornell","model":"CT-Layer","rank_in_archive_order":50,"of":60,"metrics":{"Accuracy":"69.04"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cornell","task":"Node Classification","dataset":"Cornell","model":"CT-Layer (PE)","rank_in_archive_order":54,"of":60,"metrics":{"Accuracy":"58.02"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-pubmed","task":"Node Classification","dataset":"Pubmed","model":"CT-Layer (PE)","rank_in_archive_order":20,"of":70,"metrics":{"Accuracy":"86.07"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-pubmed","task":"Node Classification","dataset":"Pubmed","model":"CT-Layer","rank_in_archive_order":65,"of":70,"metrics":{"Accuracy":"68.19"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-wisconsin","task":"Node Classification","dataset":"Wisconsin","model":"CT-Layer","rank_in_archive_order":54,"of":63,"metrics":{"Accuracy":"79.05"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-wisconsin","task":"Node Classification","dataset":"Wisconsin","model":"CT-Layer (PE)","rank_in_archive_order":57,"of":63,"metrics":{"Accuracy":"69.25"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2206.07369","atlas_url":"https://app.syntology.ai/?focus=2206.07369","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":"2206.07369"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2206.07369\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2206.07369"},"call":"get_concepts_for_paper(arxiv_id=\"2206.07369\")"}],"by_repo":[{"repo":"AdrianArnaiz/DiffWire","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"ellisalicante/GraphRewiring-Tutorial","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":"d9f49725c60f1e0c603b344174bd335dd50c2fda590e83d0933d6bea3e458518","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}