Papers › Combating Bilateral Edge Noise for Robust Link Prediction
Combating Bilateral Edge Noise for Robust Link Prediction
Zhanke Zhou, Jiangchao Yao, Jiaxu Liu, Xiawei Guo, Quanming Yao, Li He, Liang Wang, Bo Zheng, Bo Han
Although link prediction on graphs has achieved great success with the development of graph neural networks (GNNs), the potential robustness under the edge noise is still less investigated. To close this gap, we first conduct an empirical study to disclose that the edge noise bilaterally perturbs both input topology and target label, yielding severe performance degradation and representation collapse. To address this dilemma, we propose an information-theory-guided principle, Robust Graph Information Bottleneck (RGIB), to extract reliable supervision signals and avoid representation collapse. Different from the basic information bottleneck, RGIB further decouples and balances the mutual dependence among graph topology, target labels, and representation, building new learning objectives for robust representation against the bilateral noise. Two instantiations, RGIB-SSL and RGIB-REP, are explored to leverage the merits of different methodologies, i.e., self-supervised learning and data reparameterization, for implicit and explicit data denoising, respectively. Extensive experiments on six datasets and three GNNs with diverse noisy scenarios verify the effectiveness of our RGIB instantiations. The code is publicly available at: https://github.com/tmlr-group/RGIB.
In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.
Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, on Syntology's MCP service (how to connect):
get_harvested_code_for_paper(arxiv_id="2311.01196")get_code(code_sha256="…")with a sample'scode_sha256from the list belowget_citation_path(paper_1="2311.01196", paper_2="…")with another paper's arXiv id or titleget_concepts_for_paper(arxiv_id="2311.01196")
Code
Syntology 34 code samples harvested from 8 repositories linked to this paper: 20 ran (of which 2 constructed an object rather than computing a result; 15 with no instrument failure: 3 honoured, 1 violated, 11 with no contract checked; 5 where Syntology's instrument failed) · 14 unverified. Where Syntology's instrument failed: 4 where our contract draft was wrong; 1 where the contract check could not run; failures of Syntology's instrument, not of the code.
By repository: official repository: 9 samples from 1 repository, 5 ran (2 with no instrument failure; 3 where Syntology's instrument failed); found in paper text by Syntology: 25 samples from 7 repositories, 15 ran (13 with no instrument failure; 2 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
No sample is linked to this paper from 3 of its repositories that Syntology harvested for other papers:
- DropEdge/DropEdge, found in paper text by Syntology: Syntology's graph links these samples to Simple and Deep Graph Convolutional Networks (arXiv:2007.02133; that paper's own run record: 5 ran (of which 5 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 5 samples that ran constructed an object rather than computing a result); nothing checks that they implement this paper's method.
- weijiaheng/Multi-class-Peer-Loss-functions, found in paper text by Syntology: Syntology's graph links these samples to Peer Loss Functions: Learning from Noisy Labels without Knowing Noise Rates (arXiv:1910.03231; that paper's own run record: 4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 4 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified); nothing checks that they implement this paper's method.
- CRIPAC-DIG/GRACE, found in paper text by Syntology: Syntology's graph links these samples to Revisiting Positive Samples in Graph Contrastive Learning: From the Perspective of... (arXiv:2606.10284; that paper's own run record: 16 ran (of which 2 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 10 where Syntology's instrument failed) · 10 unverified); nothing checks that they implement this paper's method.
Levels written between 2026-09-22 and 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 4 of the 20 samples that ran have no recorded date.
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.
Code Syntology ran Syntology
34 samples harvested: 20 ran (of which 2 constructed an object rather than computing a result; 15 with no instrument failure: 3 honoured, 1 violated, 11 with no contract checked; 5 where Syntology's instrument failed) · 14 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. That date is not when the samples ran.
Licence: 19 of the 34 samples are pointer only, meaning Syntology does not serve that copy's text. For 3 of them, this paper's copy is under a permissive licence and cleared, but the stored copy of the same code that Syntology serves is not; the licence label's tooltip gives Syntology's recorded reason. This page shows no code text for any sample; each one links to its file in the repository.
Harvested from 8 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.
Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.
Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.
A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.
409c3864b5df44a2 · report
fixture: signature distance_matrix:ndarray/2/float, num_noisy_edges:int/0/int, filter_mask:NoneType/0/? · returned Tensor · level recorded, date not recorded d473d7ce4815a1f2 · report
fixture: signature G:Graph/0/? · returned ndarray · level recorded, date not recorded 8eb2022e63f3cdeb · report
fixture: signature p:list/1/float, q:list/1/float · returned float64 · level recorded 2026-09-24 4515b40a239b4ddc · report
fixture: signature x:Tensor/2/float, t:int/0/int · returned Tensor · level recorded 2026-09-24 ab6aec3ea2b97d07 · report
fixture: signature prob:Tensor/2/float, tau:float/0/float, reduction:str/0/str · returned Tensor · level recorded, date not recorded b7a7eb6330cc4bb7 · report
c4135a809c5eb290 · report
ba76b03db9248946 · report
fixture: returned GGCL_D · level recorded 2026-09-22 2bc8cab5c6ba3c6d · report
fixture: signature features:Tensor/2/float, adj_norm1:Tensor/2/float, adj_norm2:Tensor/2/float, gamma:float/0/float · returned tuple · level recorded 2026-09-24 113eaa2f60b75746 · report
fixture: returned RGCN · level recorded 2026-09-22 4dbcacad67a07f0e · report
fixture: signature x:EagerTensor/2/float, y:EagerTensor/2/float, sparse:bool/0/bool · returned EagerTensor · level recorded 2026-09-24 b82968db452628fd · report
fixture: signature layer_name:str/0/str · returned int · level recorded 2026-09-22 dfee757e2af344c6 · report
fixture: signature preds:EagerTensor/2/float, labels:EagerTensor/2/float, mask:EagerTensor/2/int · returned EagerTensor · level recorded 2026-09-24 c1d6392f89c5e495 · report
fixture: signature filename:str/0/str · returned list · level recorded, date not recorded census: 4 implementations from 5 papers, 4 distinct outputs on one shared input utils.py ran · violated contract fingerprinted no licence file found · pointer only ·
b32fd748b4bbe3bf · report
fixture: signature idx:int/0/int, l:int/0/int · returned ndarray · level recorded 2026-09-22 a2f118a9c3aab3ec · report
fixture: signature preds:EagerTensor/2/float, labels:EagerTensor/2/float · returned EagerTensor · level recorded 2026-09-24 b190ef9c60b2629a · report
fixture: signature shape:tuple/1/int, name:str/0/str · returned ResourceVariable · level recorded 2026-09-24 1b491f3f784b7cb0 · report
7e7158e6b82fa608 · report
107e7afdd93ee0b4 · report
b0d1b78daecde7e9 · report
01e22d114b1da6d8 · report
fixture: signature out_channels:int/0/int, reparam_mode:NoneType/0/? · returned int · level recorded 2026-09-24 62508539722283e0 · report
fixture: signature mean:Tensor/2/float, sigma:Tensor/2/float, sigma0:float/0/float · returned Tensor · level recorded 2026-09-24 census: 5 implementations from 5 papers, 2 distinct outputs across 2 buckets, one shared input per bucket graph_sparse.py unverified no licence file found · pointer only ·
ebac4362ac395e38 · report
0672693e7656212b · report
7937f88152d63f61 · report
fixture: signature bn:callable/0/?, x:Tensor/2/float · returned Tensor · level recorded 2026-09-22 4bb8724aa829258e · report
fixture: signature y_1:Tensor/2/float, y_2:Tensor/2/float, t:Tensor/1/int, forget_rate:float/0/float, ind:ndarray/1/int, noise_or_not:ndarray/1/int · returned tuple · level recorded 2026-09-24 a44a1925c2c778ba · report
fixture: signature opt:Options/0/?, model:callable/0/? · returned SGD · level recorded 2026-09-24 census: 8 implementations from 7 papers, 7 distinct outputs across 6 buckets, one shared input per bucket util.py unverified BSD-2-Clause (permissive) here; the stored copy is pointer only ·
913d82af53065418 · report
2297ed2ca4911b7c · report
Method as code Syntology
What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. Siblings are assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another.
4 assemblies on this paper: 4 harvested, 0 generated, listed in 1 groups (siblings lifted in one batch form one group).
4 sibling assemblies for Robust Graph Information Bottleneck (RGIB) (harvested), lifted in the same batch on 2026-09-09: alternative readings kept side by side; none replaces or supersedes another.
harvested Assembly for Robust Graph Information Bottleneck (RGIB) (graph method: Robust Graph Information Bottleneck (RGIB)). 2 bricks; individually on a fixture: 0 ran · 2 unverified. The assembly has not been run end-to-end.
one of 4 siblings
- entropy_loss entry · level 0 · unverified ·
ebac4362ac395e38 - vn_entropy helper · level 0 · unverified ·
0672693e7656212b
harvested Assembly for Robust Graph Information Bottleneck (RGIB) (graph method: Robust Graph Information Bottleneck (RGIB)). 1 brick; individually on a fixture: 1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified. The assembly has not been run end-to-end.
one of 4 siblings
- sampling_MI entry · level 1 · ran · our draft was wrong ·
ab6aec3ea2b97d07
harvested Assembly for Robust Graph Information Bottleneck (RGIB) (graph method: Robust Graph Information Bottleneck (RGIB)). 1 brick; individually on a fixture: 0 ran · 1 unverified. The assembly has not been run end-to-end.
one of 4 siblings
- VIBGSL entry · level 0 · unverified ·
681b733b07691df9
harvested Assembly for Robust Graph Information Bottleneck (RGIB) (graph method: Robust Graph Information Bottleneck (RGIB)). 3 bricks; individually on a fixture: 3 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. The assembly has not been run end-to-end.
one of 4 siblings
- RGCN entry · level 1 · ran ·
113eaa2f60b75746 - GGCL_D helper · level 1 · ran ·
ba76b03db9248946 - GGCL_F helper · level 1 · ran ·
2bc8cab5c6ba3c6d
Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2311.01196") returns these assemblies with each brick's role and wiring (how to connect).
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections