Papers › DG-Mamba: Robust and Efficient Dynamic Graph Structure Learning with Selective State...

DG-Mamba: Robust and Efficient Dynamic Graph Structure Learning with Selective State Space Models

11 Dec 2024arXiv:2412.08160archive 2025-07-28

Haonan Yuan, Qingyun Sun, Zhaonan Wang, Xingcheng Fu, Cheng Ji, Yongjian Wang, Bo Jin, JianXin Li

Dynamic graphs exhibit intertwined spatio-temporal evolutionary patterns, widely existing in the real world. Nevertheless, the structure incompleteness, noise, and redundancy result in poor robustness for Dynamic Graph Neural Networks (DGNNs). Dynamic Graph Structure Learning (DGSL) offers a promising way to optimize graph structures. However, aside from encountering unacceptable quadratic complexity, it overly relies on heuristic priors, making it hard to discover underlying predictive patterns. How to efficiently refine the dynamic structures, capture intrinsic dependencies, and learn robust representations, remains under-explored. In this work, we propose the novel DG-Mamba, a robust and efficient Dynamic Graph structure learning framework with the Selective State Space Models (Mamba). To accelerate the spatio-temporal structure learning, we propose a kernelized dynamic message-passing operator that reduces the quadratic time complexity to linear. To capture global intrinsic dynamics, we establish the dynamic graph as a self-contained system with State Space Model. By discretizing the system states with the cross-snapshot graph adjacency, we enable the long-distance dependencies capturing with the selective snapshot scan. To endow learned dynamic structures more expressive with informativeness, we propose the self-supervised Principle of Relevant Information for DGSL to regularize the most relevant yet least redundant information, enhancing global robustness. Extensive experiments demonstrate the superiority of the robustness and efficiency of our DG-Mamba compared with the state-of-the-art baselines against adversarial attacks.

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

By repository: official repository: 11 samples from 1 repository, 7 ran (3 with no instrument failure; 4 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-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 1 of the 7 samples that ran has no recorded date.

RingBDStack/DG-Mamba officialmentioned in paperpytorchMITSyntology: 11 samples, 7 ran (4 instrument-failed) · 4 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

11 samples harvested: 7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 4 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.

1ran · honoured contract
4ran · our draft was wrong
2ran
4unverified

Licence: 1 of the 11 samples is pointer only, meaning Syntology does not serve that copy's text. For that sample, 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 RingBDStack/DG-Mamba. “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.

RingBDStack/DG-Mamba official repository 11 samples, 7 ran (4 instrument-failed) · 4 unverified
all_gather_raw selective_modeling/distributed/distributed_utils.py ran MIT (permissive) · 0f2196b3902caf16 · report fixture: signature input_:Tensor/2/float, process_group:callable/0/?, async_op:bool/0/bool · returned tuple · level recorded 2026-09-25
create_projection_matrix in 5 papers REDGSL.py ran · honoured contract fingerprinted MIT (permissive) here; the stored copy is pointer only · 44fbc869db4685a6 · report fixture: signature m:int/0/int, d:int/0/int, seed:int/0/int, scaling:int/0/int, struct_mode:bool/0/bool · returned Tensor · level recorded, date not recorded
get_link_prediction_metrics metrics.py ran · our draft was wrong MIT (permissive) · 43ee72fc86c6a54e · report fixture: signature predicts:Tensor/1/float, labels:Tensor/1/float · returned dict · level recorded 2026-09-25
get_matrix in 18 papers data_util.py ran · our draft was wrong MIT (permissive) · 720cbfb1298fd6cf · report fixture: signature num_nodes:int/0/int, edges:list/1/Tensor · returned list · level recorded 2026-09-25
kl_divergence in 86 papers
census: 18 implementations from 18 papers, 15 distinct outputs across 7 buckets, one shared input per bucket
REDGSL.py ran · our draft was wrong fingerprinted MIT (permissive) · fd7d71e5939fb04a · report fixture: signature x:Tensor/2/float, y:Tensor/2/float · returned Tensor · level recorded 2026-09-25
reduce_scatter_raw selective_modeling/distributed/distributed_utils.py ran MIT (permissive) · 2d002bb9a87211b8 · report fixture: signature input_:Tensor/2/float, process_group:callable/0/?, async_op:bool/0/bool · returned tuple · level recorded 2026-09-25
shannon_entropy in 7 papers REDGSL.py ran · our draft was wrong fingerprinted MIT (permissive) · 2ae1ba362d8227fc · report fixture: signature matrix:Tensor/2/float · returned Tensor · level recorded 2026-09-25
all_reduce_raw selective_modeling/distributed/distributed_utils.py unverified MIT (permissive) · a06d70b09eb46b60 · report
evaluate_link_prediction_linear metrics.py unverified MIT (permissive) · 6986b70953e783f9 · report
load_attack_data data_util.py unverified MIT (permissive) · a56ff7781806f4b6 · report
load_data in 700 papers data_util.py unverified MIT (permissive) · b3c8e77c7200ce2a · report

Tasks

Graph structure learningInformativenessMambaState Space Models

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