Signals 4 · free daily AI digest

Your Discrete Graph Diffusion Model is Secretly Memorizing

Paper recorded by Signals 4 on 2026-10-09 in cs.AI. Abstract reproduced from arXiv; link to the original below.

Published 2026-10-09 on arXiv · recorded by Signals 4 on 2026-10-12

Category: cs.AI · 人工智能 · first seen 2026-10-12

Abstract

Discrete graph diffusion models (GDMs) corrupt the graph structure by adding noise independently to nodes and edges under a Markovian noise model. In the unconditional setting without node features, an equivariant denoiser trained on a single graph is able to generate novel graphs and sample-level metrics such as edge overlap and WL kernel similarity find no evidence of memorization. In this work,

Read on arXiv →

#352 most recent of 960 cs.AI papers we have recorded · ↑ newer: FORTE: A Production Framework for Feature Evaluation and Deprecation i · ↓ older: UkrMeme: Multimodal Explainable Persuasion Detection in Ukrainian Meme
Cite this page: Your Discrete Graph Diffusion Model is Secretly Memorizing: the #352 most recent of 960 cs.AI papers we have recorded (as of 2026-10-09). Source: Signals 4 (Signals API) — https://data.jiangzhang.ca/signals4/t/papers/your-discrete-graph-diffusion-model-is-secretly-memorizing.html
Free to quote with attribution to “Signals 4 (Signals API)”. Machine-readable: papers.json
Related: More cs.AI papers · arXiv signals · All papers · Today in AI
Get 4 AI signals a day by email — free.
Subscribe free → See all plans →
Get 4 AI signals a day by email — free
All models · All repos · By company · Daily editions