Graph Foundation Models (GFMs) aim to learn transferable knowledge from multi-domain graphs and adapt to unseen scenarios. As a fundamental source of relational semantics in graphs, the transferability of topological patterns has long been central to GFM research.
arXiv:2607. 26533v1 Announce Type: new Abstract: Graph Foundation Models (GFMs) aim to learn transferable knowledge from multi-domain graphs and adapt to unseen scenarios.
arXiv:2609.05774v1 Announce Type: new Abstract: Recent multi-agent LLM systems increasingly rely on graph-structured communication to coordinate specialized agents. We revisit multi-agent orchestrati...
LLMs have evolved from language generators to autonomous agents capable of complex, long-horizon tasks. This evolution has produced paradigms including Prompt Engineering to elicit model capabilities,...
arXiv:2608.21156v1 Announce Type: cross Abstract: LLMs have evolved from language generators to autonomous agents capable of complex, long-horizon tasks. This evolution has produced paradigms includi...
arXiv:2609.39777v1 Announce Type: new Abstract: LLM-based multi-agent systems coordinate specialized reasoning through aggregation, interaction, and adaptive control, yet their potential for graph le...
The paper surveys self‑evolving agents, highlighting that their states—memories, tools, skills, workflows, and inter‑agent relations—are dynamic and can be modeled as evolving graphs. It critiques existing surveys for treating graphs merely as support structures and proposes a framework that views agent evolution as dynamic graph transformation, categorizing methods into node/feature, edge/topology, subgraph activation, and cross‑component co‑evolution. The authors further map dynamic‑graph learning subfields to agent capabilities, discuss potential failure modes, and outline graph‑aware evaluation and governance protocols to guide the design and oversight of self‑evolving agents.
arXiv:2509. 24256v2 Announce Type: replace-cross Abstract: The pretrain-transfer paradigm, which underpins the success of large language models (LLMs), has demonstrated the immense power of creating foundation models that learn generalizable representations from vast datasets.
arXiv:2606. 28781v1 Announce Type: new Abstract: Every existing vector database and agent memory framework treats memory as passive storage that agents query explicitly.
The paper presents a graph-based framework for large-scale railway network management, combining a hierarchical Bayesian model with a Gaussian Process on a graph kernel to infer spatially correlated maintenance environments from Swiss Federal Railways data. It introduces a topology-aware Multi-Agent Reinforcement Learning system that uses graph neural networks and Transformers to optimize network-level policies. The approach demonstrates scalability via zero-shot transfer learning, enabling agents trained on small network segments to perform effectively on unseen large networks, outperforming heuristics and standard MARL baselines while reducing training time.
arXiv:2606. 14155v1 Announce Type: new Abstract: Context adaptation automates prompt engineering in LLM-based systems by iteratively revising tunable prompts from task feedback, without modifying model weights.
arXiv:2606. 16328v1 Announce Type: new Abstract: Large Language Models (LLMs) demonstrate remarkable potential in dynamic graph reasoning, but suffer from a scaling bottleneck: current models can only handle graphs with tens of nodes, constrained by exponential reasoning overhead and finite context windows.
arXiv:2508. 00429v5 Announce Type: replace-cross Abstract: Graph Neural Networks (GNNs) have achieved remarkable success in graph-based learning by propagating information among neighbor nodes via predefined aggregation mechanisms.