Pith. sign in

REVIEW 1 cited by

NetDiff: Graph Diffusion with Improved Global Capabilities to Generate and Update Mobile Network Topologies

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.08238 v2 pith:ZEYYBKEB submitted 2024-10-09 cs.SI cs.LGcs.NI

NetDiff: Graph Diffusion with Improved Global Capabilities to Generate and Update Mobile Network Topologies

classification cs.SI cs.LGcs.NI
keywords diffusionnetdiffglobaldenoisingdirectionalimproveslinkmobile
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

We introduce NetDiff, a node-conditioned denoising diffusion model that generates directional link topologies and a two-slot transmit/receive parity for mobile ad hoc networks. Directional antennas can yield high throughput but require globally consistent link decisions under sector, interference, connectivity, and half-duplex constraints. NetDiff improves global coherence with Absolute Cross-Attentive Modulation (ACAM) tokens, which provide permutation-invariant global signals and help the model match graph-level counts (e.g., density and sector usage). We also propose partial diffusion to update an existing topology with a small number of denoising steps, enabling fast reconfiguration under mobility. NetDiff reaches over 95 % of target performance with constant inference time, outperforms heuristic and omnidirectional baselines, and improves over a strong diffusion graph-transformer baseline in key metrics.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Graph Convolutional Attention: A Spectral Perspective on Graph Denoising and Diffusion

    cs.LG 2026-07 conditional novelty 6.5

    Under a denoising objective, linear attention is suboptimal; Graph Convolutional Attention matches idealized spectral attention on SBMs and improves graph denoising and diffusion in proportion to spectral diversity.