Generating realistic synthetic citation, patent, or component dependency networks is essential for benchmarking community detection, graph visualisation, and network data mining algorithms. We present a systematic comparison of generators of directed graphs that are nearly acyclic and have a ground-truth community structure. We evaluate 12 methods across 7 real citation networks and 26 metrics. We propose the practice of reversing the directions of edges in static generators to break cycles and induce a citation-like flow, which markedly improves the performance of a degree-corrected Stochastic Block Model. Our methodological approach to evaluating community detection benchmarks distinguishes between endogenous and exogenous mesoscopic similarities, with the latter proving more important. This distinction reveals that high-parameter models gain much of their advantage by memorising planted community statistics, which limits their fidelity when the evaluation is blind to those labels. Finally, we introduce the Citation Seeder (CS) algorithm, an iterative generator grounded in the Price-Pareto model of citation networks, with interpretable parameters and O(N+E) generation. CS achieves competitive results against the best-performing baselines while using up to four orders of magnitude fewer parameters, providing an interpretable account of a network's structure and, on a temporal hold-out, extrapolating its future in-degree distribution more faithfully than descriptive baselines.

翻译：暂无翻译