A new (k,δ)-dense subhypergraph model with fair-stable algorithms reduces decomposition complexity and yields smoother, less redundant layers than k-core baselines on real hypergraphs.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
TransXion introduces a synthetic AML transaction benchmark with rich entity profiles and non-template adversarial anomaly synthesis that lowers detection model performance compared to prior benchmarks.
citing papers explorer
-
Density Decomposition on Hypergraphs
A new (k,δ)-dense subhypergraph model with fair-stable algorithms reduces decomposition complexity and yields smoother, less redundant layers than k-core baselines on real hypergraphs.