Papers › LightDiC: A Simple yet Effective Approach for Large-scale Digraph Representation Learning

LightDiC: A Simple yet Effective Approach for Large-scale Digraph Representation Learning

22 Jan 2024arXiv:2401.11772archive 2025-07-28

Xunkai Li, Meihao Liao, Zhengyu Wu, Daohan Su, Wentao Zhang, Rong-Hua Li, Guoren Wang

Most existing graph neural networks (GNNs) are limited to undirected graphs, whose restricted scope of the captured relational information hinders their expressive capabilities and deployments in real-world scenarios. Compared with undirected graphs, directed graphs (digraphs) fit the demand for modeling more complex topological systems by capturing more intricate relationships between nodes, such as formulating transportation and financial networks. While some directed GNNs have been introduced, their inspiration mainly comes from deep learning architectures, which lead to redundant complexity and computation, making them inapplicable to large-scale databases. To address these issues, we propose LightDiC, a scalable variant of the digraph convolution based on the magnetic Laplacian. Since topology-related computations are conducted solely during offline pre-processing, LightDiC achieves exceptional scalability, enabling downstream predictions to be trained separately without incurring recursive computational costs. Theoretical analysis shows that LightDiC utilizes directed information to achieve message passing based on the complex field, which corresponds to the proximal gradient descent process of the Dirichlet energy optimization function from the perspective of digraph signal denoising, ensuring its expressiveness. Experimental results demonstrate that LightDiC performs comparably well or even outperforms other SOTA methods in various downstream tasks, with fewer learnable parameters and higher training efficiency. Notably, LightDiC is the first DiGNN to provide satisfactory results in the most representative large-scale database (ogbn-papers100M).

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 10 code samples harvested from 1 repository linked to this paper: 7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified. Where Syntology's instrument failed: 2 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 10 samples from 1 repository, 7 ran (5 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.

Levels written on 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

xkli-allen/lightdic officialmentioned in paperpytorchSyntology: 10 samples, 7 ran (2 instrument-failed) · 3 unverified 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.

Code Syntology ran Syntology

10 samples harvested: 7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 2 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 last changed ; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

2ran · honoured contract
2ran · our draft was wrong
3ran
3unverified

Licence: 10 of the 10 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 xkli-allen/lightdic. “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.

xkli-allen/lightdic official repository 10 samples, 7 ran (2 instrument-failed) · 3 unverified
calculate_gain in 14 papers models/init.py ran · honoured contract no licence file found · pointer only · 3f1dc5723dc35555 · report fixture: signature nonlinearity:str/0/str, param:NoneType/0/? · returned int · level recorded 2026-09-24
complex_kaiming_uniform_ models/init.py ran no licence file found · pointer only · 5d52fa58cca9e33a · report fixture: signature tensor:Tensor/2/complex, a:float/0/float, mode:str/0/str, nonlinearity:str/0/str · returned Tensor · level recorded 2026-09-24
complex_xavier_uniform_ models/init.py ran · our draft was wrong no licence file found · pointer only · 8fc074d0e631d038 · report fixture: signature tensor:Tensor/2/complex, gain:float/0/float · returned Tensor · level recorded 2026-09-24
get_params in 53 papers utils.py ran · honoured contract no licence file found · pointer only · 91d49ad9b60806e7 · report fixture: signature model:callable/0/? · returned int · level recorded 2026-09-24
get_train_val_test_seed_split datasets/node_split.py ran no licence file found · pointer only · 06f2cb68de5d95b2 · report fixture: signature random_state:RandomState/0/?, labels:ndarray/1/int, train_size_per_class:int/0/int, val_size_per_class:int/0/int, test_size_per_class:int/0/int, seed_size_per_class:int/0/int, train_size:NoneType/0/?, val_size:NoneType/0/?, test_size:NoneType/0/?, seed_size:NoneType/0/? · returned tuple · level recorded 2026-09-24
sample_per_class datasets/node_split.py ran no licence file found · pointer only · 4a5a079ded64467a · report fixture: signature random_state:RandomState/0/?, labels:ndarray/1/int, num_examples_per_class:int/0/int, forbidden_indices:set/0/?, force_indices:set/0/? · returned ndarray · level recorded 2026-09-24
scipy_sparse_mat_to_torch_sparse_tensor models/utils.py ran · our draft was wrong no licence file found · pointer only · 4eb73f563815b7cb · report fixture: signature sparse_mx:coo_matrix/2/float · returned Tensor · level recorded 2026-09-24
link_class_split datasets/link_split.py unverified no licence file found · pointer only · 09eb1273099bf8fd · report
node_class_split in 5 papers datasets/node_split.py unverified no licence file found · pointer only · f1ed5651447c0e00 · report
undirected_label2directed_label datasets/link_split.py unverified no licence file found · pointer only · 61c6cb6d4eeb7fa1 · report

Tasks

DenoisingRepresentation Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Convolution

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