SAGA (Synthetic Agentic Graph Architecture), a system for generating large-scale, semantically rich temporal graphs via a four-phase pipeline, achieves structural realism, semantic richness, and automatic anomaly labeling in a unified framework.
Abstract
High quality temporal graph benchmarks with rich semantics and ground-truth anomaly labels are essential for training graph neural networks, yet remain scarce due to privacy constraints and annotation costs. We present SAGA (Synthetic Agentic Graph Architecture), a system for generating large-scale, semantically rich temporal graphs via a four-phase pipeline. Our Skeleton-First, Semantics-Second architecture decouples structure from semantics: (S) an O(1)-per-edge skeleton generator produces power-law graphs; (A) a dispatcher partitions causally ordered time blocks for parallel execution; (G) LLM agents inject domain semantics using RAG-based rule bases across four domains; and (A) a state alignment engine resolves conflicts via temporal replay, yielding anomaly labels as natural byproducts. Unlike structural generators (e.g., LDBC SNB, Kronecker/R-MAT) or purely LLM-based approaches, SAGA achieves structural realism, semantic richness, and automatic anomaly labeling in a unified framework. On a single H100 GPU with vLLM batching, SAGA generates 500,000 temporal edges with controlled anomalies in under 90 minutes, scaling to 100,000 nodes while maintaining clustering coefficients above 0.99. The system supports real-time pipeline visualization, interactive multi-domain tuning (Finance/AML, Network/IDS, Cyber/APT, Transportation), and a CLI for large-scale GPU-based experiments.
ClosureBench is introduced, a constructive benchmark for compositional graph-relational reasoning with programmatically verified ground truth with programmatically verified ground truth: each task's reference answer is computed by executing a program in the Ein tensor-logic language, ensuring machine-verified correctne...
GRAIN models reasoning as a semantic parsing and tool-execution pipeline, guided by a Structure Invariance Reward, which forces the LLM to learn robust text-to-structure mappings rather than memorizing linguistic artifacts.
Zi-Ke Yuan, Han Zhang, Jianzhi Yan et al.· 0 citations
Noesis, a decoupled Graph-RAG architecture addressing limitations through four algorithms: Bidirectional Graph Traversal with a Graph-Feedback Context Resolver simulating human reading with degrading memory, an AIMD Concurrency Controller adapted from TCP congestion control, and Moesis, domain-aware selective quantizat...
TGL-APT effectively balances detection performance, computational efficiency, and investigation capability for provenance-based APT analysis, and is demonstrated to reduce training time, detection latency, and memory usage compared with KAIROS.
Jing Chen, Ayong Ye, Yuan-Huang Liu et al.· 0 citations
GraphIR, an architecture-aware intermediate representation that supplements executable programs with a mutation-aligned candidate state, achieves the best overall search performance while maintaining comparable model size and favorable end-to-end NAS efficiency when integrated into OpenEvolve.
Zhen Liu, Wanqi Zhou, Shuanghao Bai et al.· 1 citation
DeepSeq3 is introduced, a novel hierarchical framework that abstracts circuits into a two-level representation: fine-grained combinational subgraphs partitioned by flip-flops (FFs) and a high-level Super-Node Graph (SNG) that models the register-transfer structure.
Jing-Yi Zhou, Zhengyuan Shi, Jiaying Zhu et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.