Papers › SIGN: Scalable Inception Graph Neural Networks

SIGN: Scalable Inception Graph Neural Networks

23 Apr 2020arXiv:2004.11198archive 2025-07-28

Fabrizio Frasca, Emanuele Rossi, Davide Eynard, Ben Chamberlain, Michael Bronstein, Federico Monti

Graph representation learning has recently been applied to a broad spectrum of problems ranging from computer graphics and chemistry to high energy physics and social media. The popularity of graph neural networks has sparked interest, both in academia and in industry, in developing methods that scale to very large graphs such as Facebook or Twitter social networks. In most of these approaches, the computational cost is alleviated by a sampling strategy retaining a subset of node neighbors or subgraphs at training time. In this paper we propose a new, efficient and scalable graph deep learning architecture which sidesteps the need for graph sampling by using graph convolutional filters of different size that are amenable to efficient precomputation, allowing extremely fast training and inference. Our architecture allows using different local graph operators (e.g. motif-induced adjacency matrices or Personalized Page Rank diffusion matrix) to best suit the task at hand. We conduct extensive experimental evaluation on various open benchmarks and show that our approach is competitive with other state-of-the-art architectures, while requiring a fraction of the training and inference time. Moreover, we obtain state-of-the-art results on ogbn-papers100M, the largest public graph dataset, with over 110 million nodes and 1.5 billion edges.

PaperPDFCodeCode Syntology ran

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):

Code

Syntology 7 code samples harvested from 2 repositories linked to this paper: 4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 2 samples from 1 repository, 2 ran (2 with no instrument failure; 0 where Syntology's instrument failed); community (archive-listed): 5 samples from 1 repository, 2 ran (2 with no instrument failure; 0 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 1 of its repositories that Syntology harvested for other papers:

Levels written on 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 2 of the 4 samples that ran have no recorded date.

twitter-research/sign officialmentioned on GitHubpytorchApache-2.0Syntology: 2 samples, 2 ran (0 instrument-failed) · 0 unverified report
basiralab/falcon mentioned on GitHubpytorchMITSyntology: 5 samples, 2 ran (0 instrument-failed) · 3 unverified report
facebookresearch/NARS mentioned on GitHubpytorchSyntology: not harvested report
MindSpore-paper-code-2/code400 mindsporeSyntology: not harvested report
dmlc/dgl pytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to node2vec: Scalable Feature Learning for Networks (arXiv:1607.00653; that paper's own run record: 15 ran (of which 2 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 0 violated, 10 with no contract checked; 3 where Syntology's instrument failed) · 10 unverified), Interaction Networks for Learning about Objects, Relations and Physics (arXiv:1612.00222; that paper's own run record: 6 ran (of which 6 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 6 samples that ran constructed an object rather than computing a result), Junction Tree Variational Autoencoder for Molecular Graph Generation (arXiv:1802.04364; that paper's own run record: 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result) and 3 more (every one in this page's JSON twin); nothing checks that they implement this paper's method. report

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

7 samples harvested: 4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

2ran · honoured contract
2ran
3unverified

Licence: 0 of the 7 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 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.

twitter-research/sign official repository 2 samples, 2 ran (0 instrument-failed) · 0 unverified
test in 377 papers sign_training.py ran · honoured contract Apache-2.0 (permissive) · b40f6b945f2312d4 · report fixture: signature model:callable/0/?, device:device/0/?, loader:list/1/tuple, evaluator:SimpleEvaluator/0/? · returned float · level recorded, date not recorded
train in 522 papers sign_training.py ran · honoured contract Apache-2.0 (permissive) · 17c5046a153ae409 · report fixture: signature model:callable/0/?, device:device/0/?, train_loader:DataLoaderWrapper/1/tuple, optimizer:SGD/0/? · returned float · level recorded, date not recorded
basiralab/falcon community (archive-listed) 5 samples, 2 ran (0 instrument-failed) · 3 unverified
contract_graph contraction.py ran MIT (permissive) · 6a91767a75ebfc9c · report fixture: signature G:Graph/0/?, num_features:int/0/int, num_classes:int/0/int, centrality:str/0/str, constraint:str/0/str, N_cluster:int/0/int, gamma:float/0/float, steps:list/1/int, multilabel:bool/0/bool · returned Graph · level recorded 2026-09-24
precompute_SIGN_aggregation models.py ran fingerprinted MIT (permissive) · 51e2b6a3bef61bb0 · report fixture: signature x:Tensor/2/float, adj:Tensor/2/float, max_hop:int/0/int · returned Tensor · level recorded 2026-09-24
get_Organ datasets.py unverified MIT (permissive) · cb5893426cdb115a · report
get_PPI datasets.py unverified MIT (permissive) · aca0d2c78e119514 · report
get_Planetoid datasets.py unverified MIT (permissive) · 313d854c25c7e5dd · report

Tasks

Graph Representation LearningGraph SamplingNode ClassificationNode Property PredictionRepresentation Learning

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Node Classification AMZ Comp SIGN Accuracy 85.93 ± 1.21 #5 of 7 Archive leaderboard report
Node Classification AMZ Photo SIGN Accuracy 91.72 ± 1.20 #13 of 14 Archive leaderboard report
Node Classification Coauthor CS SIGN Accuracy 91.98 ± 0.50 #20 of 24 Archive leaderboard report
Node Classification PPI SIGN F1 96.50 #17 of 24 Archive leaderboard report
Node Classification Reddit SIGN Accuracy 96.60% #8 of 16 Archive leaderboard report
Node Property Prediction ogbn-arxiv SIGN Ext. data No #72 of 86 Archive leaderboard report
Node Property Prediction ogbn-arxiv SIGN Number of params 3566128 #72 of 86 Archive leaderboard report
Node Property Prediction ogbn-arxiv SIGN Test Accuracy 0.7195 ± 0.0011 #72 of 86 Archive leaderboard report
Node Property Prediction ogbn-arxiv SIGN Validation Accuracy 0.7323 ± 0.0006 #72 of 86 Archive leaderboard report
Node Property Prediction ogbn-mag SIGN Ext. data No #33 of 39 Archive leaderboard report
Node Property Prediction ogbn-mag SIGN Number of params 3724645 #33 of 39 Archive leaderboard report
Node Property Prediction ogbn-mag SIGN Test Accuracy 0.4046 ± 0.0012 #33 of 39 Archive leaderboard report
Node Property Prediction ogbn-mag SIGN Validation Accuracy 0.4068 ± 0.0010 #33 of 39 Archive leaderboard report
Node Property Prediction ogbn-papers100M SIGN-XL Ext. data No #15 of 20 Archive leaderboard report
Node Property Prediction ogbn-papers100M SIGN-XL Number of params 7180460 #15 of 20 Archive leaderboard report
Node Property Prediction ogbn-papers100M SIGN-XL Test Accuracy 0.6606 ± 0.0019 #15 of 20 Archive leaderboard report
Node Property Prediction ogbn-papers100M SIGN-XL Validation Accuracy 0.6984 ± 0.0006 #15 of 20 Archive leaderboard report
Node Property Prediction ogbn-papers100M SIGN Ext. data No #17 of 20 Archive leaderboard report
Node Property Prediction ogbn-papers100M SIGN Number of params 1008812 #17 of 20 Archive leaderboard report
Node Property Prediction ogbn-papers100M SIGN Test Accuracy 0.6568 ± 0.0006 #17 of 20 Archive leaderboard report
Node Property Prediction ogbn-papers100M SIGN Validation Accuracy 0.6932 ± 0.0006 #17 of 20 Archive leaderboard report
Node Property Prediction ogbn-products SIGN Ext. data No #43 of 64 Archive leaderboard report
Node Property Prediction ogbn-products SIGN Number of params 3483703 #43 of 64 Archive leaderboard report
Node Property Prediction ogbn-products SIGN Test Accuracy 0.8052 ± 0.0016 #43 of 64 Archive leaderboard report
Node Property Prediction ogbn-products SIGN Validation Accuracy 0.9299 ± 0.0004 #43 of 64 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

1x1 ConvolutionConvolutionInception ModuleMax Pooling

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