Kang Li, Qiaoyu Tan, Yuanfu Sun, Jiajin Liu, Dongzhe Fan
We lifted 7 functions out of this paper's own repositories and ran 5 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| sunyuanfu/AgentGL | — | 5 of 7 |
| Function | Status | Where it lives |
|---|---|---|
| _detect_search_type | Ran | sunyuanfu/AgentGL/OpenRLHF-RAG/openrlhf/utils/graph_retriever.py code served (permissive licence) · get_code("8d11bde89dbe6386") |
| _l2_normalize | Ran | sunyuanfu/AgentGL/OpenRLHF-RAG/openrlhf/utils/graph_retriever.py code served (permissive licence) · get_code("b7af5fdf4e39a55d") |
| _preview_text | Ran | sunyuanfu/AgentGL/OpenRLHF-RAG/openrlhf/utils/graph_retriever.py code served (permissive licence) · get_code("c490429a9dcf2287") |
| _safe_candidate_set | Ran | sunyuanfu/AgentGL/OpenRLHF-RAG/openrlhf/utils/graph_retriever.py code served (permissive licence) · get_code("8a43aaa03bd23035") |
| _topk_by_similarity | Ran | sunyuanfu/AgentGL/OpenRLHF-RAG/openrlhf/utils/graph_retriever.py code served (permissive licence) · get_code("c59dfd0c5f5fe5c2") |
| GraphRetriever | Not yet run | sunyuanfu/AgentGL/OpenRLHF-RAG/openrlhf/utils/graph_retriever.py code served (permissive licence) · get_code("e591b1b83b6c5107") |
| GraphRetrieverConfig | Not yet run | sunyuanfu/AgentGL/OpenRLHF-RAG/openrlhf/utils/graph_retriever.py code served (permissive licence) · get_code("3ffe325c0f66efc9") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Large Language Models (LLMs) increasingly rely on agentic capabilities-iterative retrieval, tool use, and decision-making-to overcome the limits of static, parametric knowledge. Yet existing agentic frameworks treat external information as unstructured text and fail to leverage the topological dependencies inherent in real-world data. To bridge this gap, we introduce Agentic Graph Learning (AGL), a paradigm that reframes graph learning as an interleaved process of topology-aware navigation and LLM-based inference. Specifically, we propose AgentGL, the first reinforcement learning (RL)-driven framework for AGL. AgentGL equips an LLM agent with graphnative tools for multi-scale exploration, regulates tool usage via search-constrained thinking to balance accuracy and efficiency, and employs a graph-conditioned curriculum RL strategy to stabilize long-horizon policy learning without step-wise supervision. Across diverse Text-Attributed Graph (TAG) benchmarks and multiple LLM backbones, AgentGL substantially outperforms strong GraphLLMs and GraphRAG baselines, achieving absolute improvements of up to 17.5% in node classification and 28.4% in link prediction. These results demonstrate that AGL is a promising frontier for enabling LLMs to autonomously navigate and reason over complex relational environments. The code is publicly available at https://github.com/sunyuanfu/AgentGL.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2604.05846")
get_code_for_paper("2604.05846")
have("2604.05846")
Connect an agent — have() is free.