{"id":23497,"date":"2012-06-24T12:27:12","date_gmt":"2012-06-24T12:27:12","guid":{"rendered":"https:\/\/scannn.com\/deep-jlu-awesome-graph-engineering-a-survey-on-graph-engineering-in-the-era-of-llm-agents-from-individual-intelligence-to-system-intelligence-%c2%b7-github\/"},"modified":"2012-06-24T12:27:12","modified_gmt":"2012-06-24T12:27:12","slug":"deep-jlu-awesome-graph-engineering-a-survey-on-graph-engineering-in-the-era-of-llm-agents-from-individual-intelligence-to-system-intelligence-%c2%b7-github","status":"publish","type":"post","link":"https:\/\/scannn.com\/lv\/deep-jlu-awesome-graph-engineering-a-survey-on-graph-engineering-in-the-era-of-llm-agents-from-individual-intelligence-to-system-intelligence-%c2%b7-github\/","title":{"rendered":"DEEP-JLU\/Awesome-Graph-Engineering: A Survey on Graph Engineering in the Era of LLM Agents: From Individual Intelligence to System Intelligence \u00b7 GitHub"},"content":{"rendered":"\n<div id=\"\">\n<p dir=\"auto\">A curated collection of research papers, benchmarks, and open-source projects on <strong>Graph Engineering in the era of LLM Agents<\/strong>. This repository accompanies the survey <em><a href=\"https:\/\/arxiv.org\/abs\/2608.21156\" rel=\"nofollow\">Graph Engineering in the Era of LLM Agents: From Individual Intelligence to System Intelligence<\/a><\/em> and will be continuously updated.<\/p>\n<p dir=\"auto\">Graph Engineering studies how explicit, dynamic, and evolving graph structures can organize tasks, coordinate heterogeneous agents, maintain runtime state, and support system evolution. The collection follows the survey&#8217;s progression from <strong>Model Intelligence<\/strong>, through <strong>Individual Intelligence<\/strong>, to <strong>System Intelligence<\/strong>.<\/p>\n<p dir=\"auto\"> <strong>Contributions are welcome.<\/strong> If you find a missing resource or a relevant new work, please open an issue or submit a pull request.<\/p>\n<p dir=\"auto\"><strong> Please <a href=\"#-citation\">cite our paper<\/a><\/strong> if you find this survey or repository helpful.<\/p>\n<div class=\"highlight highlight-text-bibtex notranslate position-relative overflow-auto\" dir=\"auto\" data-snippet-clipboard-copy-content=\"@misc{feng2026graphengineeringerallm,&#10;      title={Graph Engineering in the Era of LLM Agents: From Individual Intelligence to System Intelligence},&#10;      author={Yuyuan Feng and Zhishang Xiang and Chaobin Yang and Qichao Ma and Zerui Chen and Yujing Zhang and Ke Huang and Chuanjie Wu and Zhaoxu Liu and Yili Wang and Xin He and Jiapu Wang and Zijin Hong and Hao Chen and Yuanchen Bei and Kun Wang and Shengyuan Chen and Ningyu Zhang and Enyan Dai and Linhao Luo and Qingyi Pan and Qi Wang and Wenqi Fan and Guangjing Wang and Na Zou and Yangqiu Song and Xin Wang and Zechao Li and Xia Hu and Qing Li and Xiao Huang and Zhihong Zhang and Jinsong Su and Qinggang Zhang and Yi Chang},&#10;      year={2026},&#10;      eprint={2608.21156},&#10;      archivePrefix={arXiv},&#10;      primaryClass={cs.IR},&#10;      url={https:\/\/arxiv.org\/abs\/2608.21156},&#10;}\">\n<pre><span class=\"pl-k\">@misc<\/span>{<span class=\"pl-en\">feng2026graphengineeringerallm<\/span>,\n      <span class=\"pl-s\">title<\/span>=<span class=\"pl-s\"><span class=\"pl-pds\">{<\/span>Graph Engineering in the Era of LLM Agents: From Individual Intelligence to System Intelligence<span class=\"pl-pds\">}<\/span><\/span>,\n      <span class=\"pl-s\">author<\/span>=<span class=\"pl-s\"><span class=\"pl-pds\">{<\/span>Yuyuan Feng and Zhishang Xiang and Chaobin Yang and Qichao Ma and Zerui Chen and Yujing Zhang and Ke Huang and Chuanjie Wu and Zhaoxu Liu and Yili Wang and Xin He and Jiapu Wang and Zijin Hong and Hao Chen and Yuanchen Bei and Kun Wang and Shengyuan Chen and Ningyu Zhang and Enyan Dai and Linhao Luo and Qingyi Pan and Qi Wang and Wenqi Fan and Guangjing Wang and Na Zou and Yangqiu Song and Xin Wang and Zechao Li and Xia Hu and Qing Li and Xiao Huang and Zhihong Zhang and Jinsong Su and Qinggang Zhang and Yi Chang<span class=\"pl-pds\">}<\/span><\/span>,\n      <span class=\"pl-s\">year<\/span>=<span class=\"pl-s\"><span class=\"pl-pds\">{<\/span>2026<span class=\"pl-pds\">}<\/span><\/span>,\n      <span class=\"pl-s\">eprint<\/span>=<span class=\"pl-s\"><span class=\"pl-pds\">{<\/span>2608.21156<span class=\"pl-pds\">}<\/span><\/span>,\n      <span class=\"pl-s\">archivePrefix<\/span>=<span class=\"pl-s\"><span class=\"pl-pds\">{<\/span>arXiv<span class=\"pl-pds\">}<\/span><\/span>,\n      <span class=\"pl-s\">primaryClass<\/span>=<span class=\"pl-s\"><span class=\"pl-pds\">{<\/span>cs.IR<span class=\"pl-pds\">}<\/span><\/span>,\n      <span class=\"pl-s\">url<\/span>=<span class=\"pl-s\"><span class=\"pl-pds\">{<\/span>https:\/\/arxiv.org\/abs\/2608.21156<span class=\"pl-pds\">}<\/span><\/span>,\n}<\/pre>\n<\/div>\n<hr\/>\n<p dir=\"auto\">Graph Engineering provides a structured path from standalone model capability to coordinated system-level intelligence:<\/p>\n<ul dir=\"auto\">\n<li><strong>Model Intelligence<\/strong> builds and adapts foundation-model capabilities through parameterized training, prompt engineering, and context engineering.<\/li>\n<li><strong>Individual Intelligence<\/strong> equips a single agent with tools, memory, skills, runtime orchestration, and persistent interaction loops.<\/li>\n<li><strong>System Intelligence<\/strong> organizes tasks, agents, runtime state, and system evolution through explicit graph structures, with ontology engineering providing a shared semantic layer.<\/li>\n<\/ul>\n<div align=\"center\" dir=\"auto\">\n  <a target=\"_blank\" rel=\"noopener noreferrer\" href=\"https:\/\/github.com\/DEEP-JLU\/Awesome-Graph-Engineering\/blob\/main\/images\/image3.png\"><\/a><\/p>\n<p dir=\"auto\"><em>The evolution of engineering paradigms from Foundation Models to Graph and Ontology Engineering.<\/em><\/p>\n<\/div>\n<div class=\"markdown-heading\" dir=\"auto\">\n<h2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"> Related Survey Papers<\/h2>\n<p><a id=\"user-content--related-survey-papers\" class=\"anchor\" aria-label=\"Permalink: &#x1f4da; Related Survey Papers\" href=\"#-related-survey-papers\"><svg data-component=\"Octicon\" class=\"octicon octicon-link\" viewbox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"><path d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\/><\/svg><\/a><\/div>\n<ul dir=\"auto\">\n<li>(arXiv 2024) Graph Retrieval-Augmented Generation: A Survey <a href=\"https:\/\/arxiv.org\/abs\/2408.08921\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) Agent Harness Engineering: A Survey <a href=\"https:\/\/openreview.net\/forum?id=eONq7FdiHa\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(TechRxiv 2026) A Systematic Survey of Self-Evolving Agents: From Model-Centric to Environment-Driven Co-Evolution <a href=\"https:\/\/www.techrxiv.org\/doi\/full\/10.36227\/techrxiv.177203250.05832634\/v2\" rel=\"nofollow\">[Paper]<\/a> <a href=\"https:\/\/scholar.google.com\/citations?view_op=view_citation&amp;hl=zh-CN&amp;user=YDgbj6cAAAAJ&amp;citation_for_view=YDgbj6cAAAAJ:zYLM7Y9cAGgC\" rel=\"nofollow\">[Google Scholar]<\/a><\/li>\n<li>(arXiv 2025) Graphs Meet AI Agents: Taxonomy, Progress, and Future Opportunities <a href=\"https:\/\/arxiv.org\/abs\/2506.18019\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) Graph-Augmented Large Language Model Agents: Current Progress and Future Prospects <a href=\"https:\/\/arxiv.org\/abs\/2507.21407\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) Integrating Graphs, Large Language Models, and Agents: Reasoning and Retrieval <a href=\"https:\/\/arxiv.org\/abs\/2604.15951\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2024) Understanding the Planning of LLM Agents: A Survey <a href=\"https:\/\/arxiv.org\/abs\/2402.02716\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Paper 2025) A Survey on Agent Workflow\u2014Status and Future <a href=\"https:\/\/arxiv.org\/abs\/2508.01186\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) From Agent Loops to Structured Graphs: A Scheduler-Theoretic Framework for LLM Agent Execution <a href=\"https:\/\/arxiv.org\/abs\/2604.11378\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Vicinagearth 2024) A Survey on LLM-Based Multi-Agent Systems: Workflow, Infrastructure, and Challenges <a href=\"https:\/\/link.springer.com\/article\/10.1007\/s44336-024-00009-2\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Frontiers of Computer Science 2026) Beyond Self-Talk: A Communication-Centric Survey of LLM-Based Multi-Agent Systems <a href=\"https:\/\/arxiv.org\/abs\/2502.14321\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) Graph-Based Agent Memory: Taxonomy, Techniques, and Applications <a href=\"https:\/\/arxiv.org\/abs\/2602.05665\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(TMLR 2026) A Survey of Self-Evolving Agents: What, When, How, and Where to Evolve on the Path to Artificial Super Intelligence <a href=\"https:\/\/arxiv.org\/abs\/2507.21046\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(OpenReview Archive 2026) Self-Improving Agents in the Era of Experience: A Survey of Self- to Meta-Evolution <a href=\"https:\/\/openreview.net\/forum?id=IUltZSgLMm\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) Multi-Agent Collaboration Mechanisms: A Survey of LLMs <a href=\"https:\/\/arxiv.org\/abs\/2501.06322\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) Beyond Individual Intelligence: Surveying Collaboration, Failure Attribution, and Self-Evolution in LLM-based Multi-Agent Systems <a href=\"https:\/\/arxiv.org\/abs\/2605.14892\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<\/ul>\n<div align=\"center\" dir=\"auto\">\n  <a target=\"_blank\" rel=\"noopener noreferrer\" href=\"https:\/\/github.com\/DEEP-JLU\/Awesome-Graph-Engineering\/blob\/main\/images\/image1.png\"><img decoding=\"async\" width=\"100%\" src=\"https:\/\/github.com\/DEEP-JLU\/Awesome-Graph-Engineering\/raw\/main\/images\/image1.png\" alt=\"A comprehensive taxonomy of Graph Engineering in the era of LLM agents\" style=\"max-width: 100%;\"\/><\/a><\/p>\n<p dir=\"auto\"><em>A comprehensive taxonomy spanning Model, Individual, and System Intelligence.<\/em><\/p>\n<\/div>\n<div align=\"center\" dir=\"auto\">\n  <a target=\"_blank\" rel=\"noopener noreferrer\" href=\"https:\/\/github.com\/DEEP-JLU\/Awesome-Graph-Engineering\/blob\/main\/images\/image2.png\"><img decoding=\"async\" width=\"100%\" src=\"https:\/\/github.com\/DEEP-JLU\/Awesome-Graph-Engineering\/raw\/main\/images\/image2.png\" alt=\"From Model Intelligence to Individual Intelligence\" style=\"max-width: 100%;\"\/><\/a><\/p>\n<p dir=\"auto\"><em>From Model Intelligence to Individual Intelligence through Prompt, Context, Harness, and Loop Engineering.<\/em><\/p>\n<\/div>\n<ul dir=\"auto\">\n<li>(NeurIPS 2020) <strong>GPT-3<\/strong> \u2014 Language Models are Few-Shot Learners <a href=\"https:\/\/scholar.google.com\/scholar?q=Language+Models+are+Few-Shot+Learners\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2021) <strong>Gopher<\/strong> \u2014 Scaling Language Models: Methods, Analysis &amp; Insights from Training Gopher <a href=\"https:\/\/arxiv.org\/abs\/2112.11446\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(JMLR 2023) <strong>PaLM<\/strong> \u2014 PaLM: Scaling Language Modeling with Pathways <a href=\"https:\/\/scholar.google.com\/scholar?q=PaLM%3A+Scaling+Language+Modeling+with+Pathways\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2023) <strong>LLaMA<\/strong> \u2014 LLaMA: Open and Efficient Foundation Language Models <a href=\"https:\/\/arxiv.org\/abs\/2302.13971\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2020) <strong>Scaling Laws<\/strong> \u2014 Scaling Laws for Neural Language Models <a href=\"https:\/\/arxiv.org\/abs\/2001.08361\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(NeurIPS 2022) <strong>Chinchilla<\/strong> \u2014 Training Compute-Optimal Large Language Models <a href=\"https:\/\/scholar.google.com\/scholar?q=Training+Compute-Optimal+Large+Language+Models\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(JMLR 2022) <strong>Switch Transformer<\/strong> \u2014 Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity <a href=\"https:\/\/scholar.google.com\/scholar?q=Switch+Transformers%3A+Scaling+to+Trillion+Parameter+Models+with+Simple+and+Efficient+Sparsity\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2024) <strong>Mixtral<\/strong> \u2014 Mixtral of Experts <a href=\"https:\/\/arxiv.org\/abs\/2401.04088\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Paper 2024) <strong>DeepSeekMoE<\/strong> \u2014 DeepSeekMoE: Towards Ultimate Expert Specialization in Mixture-of-Experts Language Models <a href=\"https:\/\/scholar.google.com\/scholar?q=DeepSeekMoE%3A+Towards+Ultimate+Expert+Specialization+in+Mixture-of-Experts+Language+Models\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2024) <strong>Llama 3<\/strong> \u2014 The Llama 3 Herd of Models <a href=\"https:\/\/arxiv.org\/abs\/2407.21783\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2024) <strong>DeepSeek-V3<\/strong> \u2014 DeepSeek-V3 Technical Report <a href=\"https:\/\/arxiv.org\/abs\/2412.19437\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Paper 2022) <strong>Deduplication<\/strong> \u2014 Deduplicating Training Data Makes Language Models Better <a href=\"https:\/\/scholar.google.com\/scholar?q=Deduplicating+Training+Data+Makes+Language+Models+Better\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(NeurIPS 2024) <strong>FineWeb<\/strong> \u2014 The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scale <a href=\"https:\/\/scholar.google.com\/scholar?q=The+FineWeb+Datasets%3A+Decanting+the+Web+for+the+Finest+Text+Data+at+Scale\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(NeurIPS 2024) <strong>DataComp-LM<\/strong> \u2014 DataComp-LM: In Search of the Next Generation of Training Sets for Language Models <a href=\"https:\/\/scholar.google.com\/scholar?q=DataComp-LM%3A+In+Search+of+the+Next+Generation+of+Training+Sets+for+Language+Models\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2024) <strong>Qwen2.5<\/strong> \u2014 Qwen2.5 Technical Report <a href=\"https:\/\/arxiv.org\/abs\/2412.15115\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>Qwen3<\/strong> \u2014 Qwen3 Technical Report <a href=\"https:\/\/arxiv.org\/abs\/2505.09388\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>Kimi K2<\/strong> \u2014 Kimi K2: Open Agentic Intelligence <a href=\"https:\/\/arxiv.org\/abs\/2507.20534\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<\/ul>\n<ul dir=\"auto\">\n<li>(ICLR 2022) <strong>FLAN<\/strong> \u2014 Finetuned Language Models Are Zero-Shot Learners <a href=\"https:\/\/scholar.google.com\/scholar?q=Finetuned+Language+Models+Are+Zero-Shot+Learners\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2022) <strong>T0<\/strong> \u2014 Multitask Prompted Training Enables Zero-Shot Task Generalization <a href=\"https:\/\/scholar.google.com\/scholar?q=Multitask+Prompted+Training+Enables+Zero-Shot+Task+Generalization\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(NeurIPS 2022) <strong>InstructGPT<\/strong> \u2014 Training Language Models to Follow Instructions with Human Feedback <a href=\"https:\/\/scholar.google.com\/scholar?q=Training+Language+Models+to+Follow+Instructions+with+Human+Feedback\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICML 2023) <strong>Flan Collection<\/strong> \u2014 The Flan Collection: Designing Data and Methods for Effective Instruction Tuning <a href=\"https:\/\/scholar.google.com\/scholar?q=The+Flan+Collection%3A+Designing+Data+and+Methods+for+Effective+Instruction+Tuning\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2022) <strong>Constitutional AI<\/strong> \u2014 Constitutional AI: Harmlessness from AI Feedback <a href=\"https:\/\/arxiv.org\/abs\/2212.08073\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2023) <strong>RLAIF<\/strong> \u2014 RLAIF vs. RLHF: Scaling Reinforcement Learning from Human Feedback with AI Feedback <a href=\"https:\/\/arxiv.org\/abs\/2309.00267\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(NeurIPS 2023) <strong>DPO<\/strong> \u2014 Direct Preference Optimization: Your Language Model is Secretly a Reward Model <a href=\"https:\/\/scholar.google.com\/scholar?q=Direct+Preference+Optimization%3A+Your+Language+Model+is+Secretly+a+Reward+Model\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2024) <strong>Tulu 3<\/strong> \u2014 Tulu 3: Pushing Frontiers in Open Language Model Post-Training <a href=\"https:\/\/arxiv.org\/abs\/2411.15124\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2024) <strong>DeepSeekMath<\/strong> \u2014 DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models <a href=\"https:\/\/arxiv.org\/abs\/2402.03300\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Nature 2025) <strong>DeepSeek-R1<\/strong> \u2014 DeepSeek-R1 Incentivizes Reasoning in LLMs through Reinforcement Learning <a href=\"https:\/\/scholar.google.com\/scholar?q=DeepSeek-R1+Incentivizes+Reasoning+in+LLMs+through+Reinforcement+Learning\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>DAPO<\/strong> \u2014 DAPO: An Open-Source LLM Reinforcement Learning System at Scale <a href=\"https:\/\/arxiv.org\/abs\/2503.14476\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2025) <strong>WebRL<\/strong> \u2014 WebRL: Training LLM Web Agents via Self-Evolving Online Curriculum Reinforcement Learning <a href=\"https:\/\/scholar.google.com\/scholar?q=WebRL%3A+Training+LLM+Web+Agents+via+Self-Evolving+Online+Curriculum+Reinforcement+Learning\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>Search-R1<\/strong> \u2014 Search-R1: Training LLMs to Reason and Leverage Search Engines with Reinforcement Learning <a href=\"https:\/\/arxiv.org\/abs\/2503.09516\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>ReTool<\/strong> \u2014 ReTool: Reinforcement Learning for Strategic Tool Use in LLMs <a href=\"https:\/\/arxiv.org\/abs\/2504.11536\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>ToolRL<\/strong> \u2014 ToolRL: Reward is All Tool Learning Needs <a href=\"https:\/\/arxiv.org\/abs\/2504.13958\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>RAGEN<\/strong> \u2014 RAGEN: Understanding Self-Evolution in LLM Agents via Multi-Turn Reinforcement Learning <a href=\"https:\/\/arxiv.org\/abs\/2504.20073\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>Agent-R1<\/strong> \u2014 Agent-R1: Training Powerful LLM Agents with End-to-End Reinforcement Learning <a href=\"https:\/\/arxiv.org\/abs\/2511.14460\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>Agent Lightning<\/strong> \u2014 Agent Lightning: Train ANY AI Agents with Reinforcement Learning <a href=\"https:\/\/arxiv.org\/abs\/2508.03680\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>DynaWeb<\/strong> \u2014 DynaWeb: Model-Based Reinforcement Learning of Web Agents <a href=\"https:\/\/arxiv.org\/abs\/2601.22149\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<\/ul>\n<ul dir=\"auto\">\n<li>(arXiv 2021) <strong>Prompt Programming<\/strong> \u2014 Prompt Programming for Large Language Models: Beyond the Few-Shot Paradigm <a href=\"https:\/\/arxiv.org\/abs\/2102.07350\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Paper 2022) <strong>Demonstrations<\/strong> \u2014 Rethinking the Role of Demonstrations: What Makes In-Context Learning Work? <a href=\"https:\/\/scholar.google.com\/scholar?q=Rethinking+the+Role+of+Demonstrations%3A+What+Makes+In-Context+Learning+Work%3F\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Paper 2022) <strong>In-Context Examples<\/strong> \u2014 What Makes Good In-Context Examples for GPT-3? <a href=\"https:\/\/scholar.google.com\/scholar?q=What+Makes+Good+In-Context+Examples+for+GPT-3%3F\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(NeurIPS 2022) <strong>Chain-of-Thought<\/strong> \u2014 Chain-of-Thought Prompting Elicits Reasoning in Large Language Models <a href=\"https:\/\/scholar.google.com\/scholar?q=Chain-of-Thought+Prompting+Elicits+Reasoning+in+Large+Language+Models\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2023) <strong>Self-Consistency<\/strong> \u2014 Self-Consistency Improves Chain of Thought Reasoning in Language Models <a href=\"https:\/\/scholar.google.com\/scholar?q=Self-Consistency+Improves+Chain+of+Thought+Reasoning+in+Language+Models\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2023) <strong>Least-to-Most<\/strong> \u2014 Least-to-Most Prompting Enables Complex Reasoning in Large Language Models <a href=\"https:\/\/scholar.google.com\/scholar?q=Least-to-Most+Prompting+Enables+Complex+Reasoning+in+Large+Language+Models\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(NeurIPS 2023) <strong>Tree of Thoughts<\/strong> \u2014 Tree of Thoughts: Deliberate Problem Solving with Large Language Models <a href=\"https:\/\/scholar.google.com\/scholar?q=Tree+of+Thoughts%3A+Deliberate+Problem+Solving+with+Large+Language+Models\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(NeurIPS 2023) <strong>Self-Refine<\/strong> \u2014 Self-Refine: Iterative Refinement with Self-Feedback <a href=\"https:\/\/scholar.google.com\/scholar?q=Self-Refine%3A+Iterative+Refinement+with+Self-Feedback\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(AAAI 2024) <strong>Graph of Thoughts<\/strong> \u2014 Graph of Thoughts: Solving Elaborate Problems with Large Language Models <a href=\"https:\/\/scholar.google.com\/scholar?q=Graph+of+Thoughts%3A+Solving+Elaborate+Problems+with+Large+Language+Models\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Paper 2020) <strong>AutoPrompt<\/strong> \u2014 AutoPrompt: Eliciting Knowledge from Language Models with Automatically Generated Prompts <a href=\"https:\/\/scholar.google.com\/scholar?q=AutoPrompt%3A+Eliciting+Knowledge+from+Language+Models+with+Automatically+Generated+Prompts\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2023) <strong>APE<\/strong> \u2014 Large Language Models Are Human-Level Prompt Engineers <a href=\"https:\/\/scholar.google.com\/scholar?q=Large+Language+Models+Are+Human-Level+Prompt+Engineers\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2024) <strong>OPRO<\/strong> \u2014 Large Language Models as Optimizers <a href=\"https:\/\/scholar.google.com\/scholar?q=Large+Language+Models+as+Optimizers\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2024) <strong>Promptbreeder<\/strong> \u2014 Promptbreeder: Self-Referential Self-Improvement via Prompt Evolution <a href=\"https:\/\/scholar.google.com\/scholar?q=Promptbreeder%3A+Self-Referential+Self-Improvement+via+Prompt+Evolution\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2024) <strong>TextGrad<\/strong> \u2014 TextGrad: Automatic &#8220;Differentiation&#8221; via Text <a href=\"https:\/\/arxiv.org\/abs\/2406.07496\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<\/ul>\n<ul dir=\"auto\">\n<li>(Paper 2020) <strong>DPR<\/strong> \u2014 Dense Passage Retrieval for Open-Domain Question Answering <a href=\"https:\/\/scholar.google.com\/scholar?q=Dense+Passage+Retrieval+for+Open-Domain+Question+Answering\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(NeurIPS 2020) <strong>RAG<\/strong> \u2014 Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks <a href=\"https:\/\/scholar.google.com\/scholar?q=Retrieval-Augmented+Generation+for+Knowledge-Intensive+NLP+Tasks\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Paper 2021) <strong>FiD<\/strong> \u2014 Leveraging Passage Retrieval with Generative Models for Open Domain Question Answering <a href=\"https:\/\/scholar.google.com\/scholar?q=Leveraging+Passage+Retrieval+with+Generative+Models+for+Open+Domain+Question+Answering\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Paper 2023) <strong>HyDE<\/strong> \u2014 Precise Zero-Shot Dense Retrieval without Relevance Labels <a href=\"https:\/\/scholar.google.com\/scholar?q=Precise+Zero-Shot+Dense+Retrieval+without+Relevance+Labels\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Paper 2023) <strong>IRCoT<\/strong> \u2014 Interleaving Retrieval with Chain-of-Thought Reasoning for Knowledge-Intensive Multi-Step Questions <a href=\"https:\/\/scholar.google.com\/scholar?q=Interleaving+Retrieval+with+Chain-of-Thought+Reasoning+for+Knowledge-Intensive+Multi-Step+Questions\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2024) <strong>Self-RAG<\/strong> \u2014 Self-RAG: Learning to Retrieve, Generate, and Critique through Self-Reflection <a href=\"https:\/\/scholar.google.com\/scholar?q=Self-RAG%3A+Learning+to+Retrieve%2C+Generate%2C+and+Critique+through+Self-Reflection\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(NeurIPS 2025) <strong>CoRAG<\/strong> \u2014 Chain-of-Retrieval Augmented Generation <a href=\"https:\/\/scholar.google.com\/scholar?q=Chain-of-Retrieval+Augmented+Generation\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(NeurIPS 2024) <strong>RankRAG<\/strong> \u2014 RankRAG: Unifying Context Ranking with Retrieval-Augmented Generation in LLMs <a href=\"https:\/\/scholar.google.com\/scholar?q=RankRAG%3A+Unifying+Context+Ranking+with+Retrieval-Augmented+Generation+in+LLMs\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Paper 2023) <strong>LLMLingua<\/strong> \u2014 LLMLingua: Compressing Prompts for Accelerated Inference of Large Language Models <a href=\"https:\/\/scholar.google.com\/scholar?q=LLMLingua%3A+Compressing+Prompts+for+Accelerated+Inference+of+Large+Language+Models\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2024) <strong>RECOMP<\/strong> \u2014 RECOMP: Improving Retrieval-Augmented LMs with Compression and Selective Augmentation <a href=\"https:\/\/scholar.google.com\/scholar?q=RECOMP%3A+Improving+Retrieval-Augmented+LMs+with+Compression+and+Selective+Augmentation\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2024) <strong>GraphRAG<\/strong> \u2014 From Local to Global: A Graph RAG Approach to Query-Focused Summarization <a href=\"https:\/\/arxiv.org\/abs\/2404.16130\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2025) <strong>Provence<\/strong> \u2014 Provence: Efficient and Robust Context Pruning for Retrieval-Augmented Generation <a href=\"https:\/\/scholar.google.com\/scholar?q=Provence%3A+Efficient+and+Robust+Context+Pruning+for+Retrieval-Augmented+Generation\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Paper 2024) <strong>Lost in the Middle<\/strong> \u2014 Lost in the Middle: How Language Models Use Long Contexts <a href=\"https:\/\/scholar.google.com\/scholar?q=Lost+in+the+Middle%3A+How+Language+Models+Use+Long+Contexts\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2023) <strong>MemGPT<\/strong> \u2014 MemGPT: Towards LLMs as Operating Systems <a href=\"https:\/\/arxiv.org\/abs\/2310.08560\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2024) <strong>HiAgent<\/strong> \u2014 HiAgent: Hierarchical Working Memory Management for Solving Long-Horizon Agent Tasks with Large Language Model <a href=\"https:\/\/arxiv.org\/abs\/2408.09559\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICML 2026) <strong>ACON<\/strong> \u2014 ACON: Optimizing Context Compression for Long-horizon LLM Agents <a href=\"https:\/\/arxiv.org\/abs\/2510.00615\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2026) <strong>ACE<\/strong> \u2014 Agentic Context Engineering: Evolving Contexts for Self-Improving Language Models <a href=\"https:\/\/arxiv.org\/abs\/2510.04618\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>ContextCurator<\/strong> \u2014 Escaping the Context Bottleneck: Active Context Curation for LLM Agents via Reinforcement Learning <a href=\"https:\/\/arxiv.org\/abs\/2604.11462\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>AdaCoM<\/strong> \u2014 Learning Agent-Compatible Context Management for Long-Horizon Tasks <a href=\"https:\/\/arxiv.org\/abs\/2605.30785\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<\/ul>\n<ul dir=\"auto\">\n<li>(arXiv 2022) <strong>MRKL<\/strong> \u2014 MRKL Systems: A Modular, Neuro-Symbolic Architecture that Combines Large Language Models, External Knowledge Sources and Discrete Reasoning <a href=\"https:\/\/arxiv.org\/abs\/2205.00445\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2022) <strong>TALM<\/strong> \u2014 TALM: Tool Augmented Language Models <a href=\"https:\/\/arxiv.org\/abs\/2205.12255\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2023) <strong>ReAct<\/strong> \u2014 ReAct: Synergizing Reasoning and Acting in Language Models <a href=\"https:\/\/openreview.net\/forum?id=WE_vluYUL-X\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(NeurIPS 2023) <strong>Toolformer<\/strong> \u2014 Toolformer: Language Models Can Teach Themselves to Use Tools <a href=\"https:\/\/scholar.google.com\/scholar?q=Toolformer%3A+Language+Models+Can+Teach+Themselves+to+Use+Tools\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Paper 2023) <strong>API-Bank<\/strong> \u2014 API-Bank: A Comprehensive Benchmark for Tool-Augmented LLMs <a href=\"https:\/\/scholar.google.com\/scholar?q=API-Bank%3A+A+Comprehensive+Benchmark+for+Tool-Augmented+LLMs\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2024) <strong>ToolLLM<\/strong> \u2014 ToolLLM: Facilitating Large Language Models to Master 16000+ Real-world APIs <a href=\"https:\/\/scholar.google.com\/scholar?q=ToolLLM%3A+Facilitating+Large+Language+Models+to+Master+16000%2B+Real-world+APIs\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(NeurIPS 2024) <strong>Gorilla<\/strong> \u2014 Gorilla: Large Language Model Connected with Massive APIs <a href=\"https:\/\/scholar.google.com\/scholar?q=Gorilla%3A+Large+Language+Model+Connected+with+Massive+APIs\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Anthropic 2024) <strong>MCP<\/strong> \u2014 Introducing the Model Context Protocol <a href=\"https:\/\/scholar.google.com\/scholar?q=Introducing+the+Model+Context+Protocol\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2024) <strong>CodeAct<\/strong> \u2014 Executable Code Actions Elicit Better LLM Agents <a href=\"https:\/\/arxiv.org\/abs\/2402.01030\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2024) <strong>SWE-agent<\/strong> \u2014 SWE-agent: Agent-Computer Interfaces Enable Automated Software Engineering <a href=\"https:\/\/arxiv.org\/abs\/2405.15793\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2024) <strong>OpenHands<\/strong> \u2014 OpenHands: An Open Platform for AI Software Developers as Generalist Agents <a href=\"https:\/\/arxiv.org\/abs\/2407.16741\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>ToolMaker<\/strong> \u2014 LLM Agents Making Agent Tools <a href=\"https:\/\/arxiv.org\/abs\/2502.11705\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(OpenAI 2025) <strong>Codex<\/strong> \u2014 Introducing Codex <a href=\"https:\/\/scholar.google.com\/scholar?q=Introducing+Codex\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Anthropic 2025) <strong>Claude Code<\/strong> \u2014 Claude 3.7 Sonnet and Claude Code <a href=\"https:\/\/scholar.google.com\/scholar?q=Claude+3.7+Sonnet+and+Claude+Code\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Google 2025) <strong>Gemini CLI<\/strong> \u2014 Gemini CLI: Your Open-Source AI Agent <a href=\"https:\/\/scholar.google.com\/scholar?q=Gemini+CLI%3A+Your+Open-Source+AI+Agent\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(GitHub Blog 2025) <strong>Copilot Coding Agent<\/strong> \u2014 GitHub Copilot: Meet the New Coding Agent <a href=\"https:\/\/scholar.google.com\/scholar?q=GitHub+Copilot%3A+Meet+the+New+Coding+Agent\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(OpenAI Engineering 2026) <strong>Symphony<\/strong> \u2014 An Open-Source Spec for Codex Orchestration: Symphony <a href=\"https:\/\/scholar.google.com\/scholar?q=An+Open-Source+Spec+for+Codex+Orchestration%3A+Symphony\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<\/ul>\n<ul dir=\"auto\">\n<li>(Paper 2023) <strong>Generative Agents<\/strong> \u2014 Generative Agents: Interactive Simulacra of Human Behavior <a href=\"https:\/\/scholar.google.com\/scholar?q=Generative+Agents%3A+Interactive+Simulacra+of+Human+Behavior\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(AAAI 2024) <strong>MemoryBank<\/strong> \u2014 MemoryBank: Enhancing Large Language Models with Long-Term Memory <a href=\"https:\/\/scholar.google.com\/scholar?q=MemoryBank%3A+Enhancing+Large+Language+Models+with+Long-Term+Memory\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2023) <strong>MemGPT<\/strong> \u2014 MemGPT: Towards LLMs as Operating Systems <a href=\"https:\/\/arxiv.org\/abs\/2310.08560\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>A-MEM<\/strong> \u2014 A-MEM: Agentic Memory for LLM Agents <a href=\"https:\/\/arxiv.org\/abs\/2502.12110\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>Mem0<\/strong> \u2014 Mem0: Building Production-Ready AI Agents with Scalable Long-Term Memory <a href=\"https:\/\/arxiv.org\/abs\/2504.19413\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>Zep<\/strong> \u2014 Zep: A Temporal Knowledge Graph Architecture for Agent Memory <a href=\"https:\/\/arxiv.org\/abs\/2501.13956\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>MemoryOS<\/strong> \u2014 Memory OS of AI Agent <a href=\"https:\/\/arxiv.org\/abs\/2506.06326\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>Memoria<\/strong> \u2014 Memoria: A Scalable Agentic Memory Framework for Personalized Conversational AI <a href=\"https:\/\/arxiv.org\/abs\/2512.12686\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Paper 2026) <strong>AgeMem<\/strong> \u2014 Agentic Memory: Learning Unified Long-Term and Short-Term Memory Management for Large Language Model Agents <a href=\"https:\/\/doi.org\/10.18653\/v1\/2026.acl-long.981\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Memori<\/strong> \u2014 Memori: A Persistent Memory Layer for Efficient, Context-Aware LLM Agents <a href=\"https:\/\/arxiv.org\/abs\/2603.19935\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>LycheeMemory V2<\/strong> \u2014 LycheeMemory V2: Efficient Long-Term Memory for LLM Agents via Semantic Segment-Level Consolidation <a href=\"https:\/\/arxiv.org\/abs\/2608.12990\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2024) <strong>Agent Workflow Memory<\/strong> \u2014 Agent Workflow Memory <a href=\"https:\/\/arxiv.org\/abs\/2409.07429\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<\/ul>\n<ul dir=\"auto\">\n<li>(arXiv 2023) <strong>Voyager<\/strong> \u2014 Voyager: An Open-Ended Embodied Agent with Large Language Models <a href=\"https:\/\/arxiv.org\/abs\/2305.16291\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2024) <strong>CRAFT<\/strong> \u2014 CRAFT: Customizing LLMs by Creating and Retrieving from Specialized Toolsets <a href=\"https:\/\/scholar.google.com\/scholar?q=CRAFT%3A+Customizing+LLMs+by+Creating+and+Retrieving+from+Specialized+Toolsets\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Anthropic Engineering 2025) <strong>Agent Skills<\/strong> \u2014 Equipping Agents for the Real World with Agent Skills <a href=\"https:\/\/scholar.google.com\/scholar?q=Equipping+Agents+for+the+Real+World+with+Agent+Skills\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>SAGE<\/strong> \u2014 Reinforcement Learning for Self-Improving Agent with Skill Library <a href=\"https:\/\/arxiv.org\/abs\/2512.17102\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>HASP<\/strong> \u2014 Harnessing LLM Agents with Skill Programs <a href=\"https:\/\/arxiv.org\/abs\/2605.17734\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>SSL Skills<\/strong> \u2014 From Skill Text to Skill Structure: The Scheduling-Structural-Logical Representation for Agent Skills <a href=\"https:\/\/arxiv.org\/abs\/2604.24026\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>SkillComposer<\/strong> \u2014 SkillComposer: Learning to Evolve Agent Skills for Specification and Generalization <a href=\"https:\/\/arxiv.org\/abs\/2606.06079\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Generative Skill Composition<\/strong> \u2014 Generative Skill Composition for LLM Agents <a href=\"https:\/\/arxiv.org\/abs\/2606.32025\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Skill-Use<\/strong> \u2014 Skill-Use: Can LLMs Actually Use Skills in Agentic Harnesses? <a href=\"https:\/\/arxiv.org\/abs\/2608.04828\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>HDSO<\/strong> \u2014 Hypothesis-Driven Skill Optimization for LLM Agents <a href=\"https:\/\/arxiv.org\/abs\/2606.22330\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Demystifying Agent Skills<\/strong> \u2014 Demystifying Agent Skills: Why They Work\u2014Until They Don&#8217;t <a href=\"https:\/\/arxiv.org\/abs\/2608.14036\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<\/ul>\n<ul dir=\"auto\">\n<li>(Anthropic Engineering 2025) <strong>Long-Running Harness<\/strong> \u2014 Effective Harnesses for Long-Running Agents <a href=\"https:\/\/scholar.google.com\/scholar?q=Effective+Harnesses+for+Long-Running+Agents\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Externalization<\/strong> \u2014 Externalization in LLM Agents: A Unified Review of Memory, Skills, Protocols and Harness Engineering <a href=\"https:\/\/arxiv.org\/abs\/2604.08224\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Harness Engineering<\/strong> \u2014 AI Harness Engineering: A Runtime Substrate for Foundation-Model Software Agents <a href=\"https:\/\/arxiv.org\/abs\/2605.13357\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Code as Agent Harness<\/strong> \u2014 Code as Agent Harness <a href=\"https:\/\/arxiv.org\/abs\/2605.18747\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Harness Configuration<\/strong> \u2014 Configuring Agentic AI Coding Tools: An Exploratory Study <a href=\"https:\/\/arxiv.org\/abs\/2602.14690\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Harness-Bench<\/strong> \u2014 Harness-Bench: Measuring Harness Effects across Models in Realistic Agent Workflows <a href=\"https:\/\/arxiv.org\/abs\/2605.27922\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Prompts to Contracts<\/strong> \u2014 From Prompts to Contracts: Harness Engineering for Auditable Enterprise LLM Agents <a href=\"https:\/\/arxiv.org\/abs\/2607.08028\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2024) <strong>ToolSandbox<\/strong> \u2014 ToolSandbox: A Stateful, Conversational, Interactive Evaluation Benchmark for LLM Tool Use Capabilities <a href=\"https:\/\/arxiv.org\/abs\/2408.04682\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2023) <strong>ToolEmu<\/strong> \u2014 Identifying the Risks of LM Agents with an LM-Emulated Sandbox <a href=\"https:\/\/arxiv.org\/abs\/2309.15817\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>RHO<\/strong> \u2014 Evolving Agents in the Dark: Retrospective Harness Optimization via Self-Preference <a href=\"https:\/\/arxiv.org\/abs\/2606.05922\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>CaMeL<\/strong> \u2014 Defeating Prompt Injections by Design <a href=\"https:\/\/arxiv.org\/abs\/2503.18813\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>MCP Security Bench<\/strong> \u2014 MCP Security Bench (MSB): Benchmarking Attacks Against Model Context Protocol in LLM Agents <a href=\"https:\/\/arxiv.org\/abs\/2510.15994\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(OpenAI Engineering 2026) <strong>OpenAI Harness Engineering<\/strong> \u2014 Harness Engineering: Leveraging Codex in an Agent-First World <a href=\"https:\/\/scholar.google.com\/scholar?q=Harness+Engineering%3A+Leveraging+Codex+in+an+Agent-First+World\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Anthropic Engineering 2026) <strong>Anthropic Harness Design<\/strong> \u2014 Harness Design for Long-Running Application Development <a href=\"https:\/\/scholar.google.com\/scholar?q=Harness+Design+for+Long-Running+Application+Development\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Meta-Harness<\/strong> \u2014 Meta-Harness: End-to-End Optimization of Model Harnesses <a href=\"https:\/\/arxiv.org\/abs\/2603.28052\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Agentic Harness<\/strong> \u2014 Agentic Harness Engineering: Observability-Driven Automatic Evolution of Coding-Agent Harnesses <a href=\"https:\/\/arxiv.org\/abs\/2604.25850\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Self-Harness<\/strong> \u2014 Self-Harness: Harnesses That Improve Themselves <a href=\"https:\/\/arxiv.org\/abs\/2606.09498\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>HarnessFix<\/strong> \u2014 From Failed Trajectories to Reliable LLM Agents: Diagnosing and Repairing Harness Flaws <a href=\"https:\/\/arxiv.org\/abs\/2606.06324\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>HARBOR<\/strong> \u2014 HARBOR: Automated Harness Optimization <a href=\"https:\/\/arxiv.org\/abs\/2604.20938\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2024) <strong>AgentDojo<\/strong> \u2014 AgentDojo: A Dynamic Environment to Evaluate Prompt Injection Attacks and Defenses for LLM Agents <a href=\"https:\/\/arxiv.org\/abs\/2406.13352\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Harness Updating<\/strong> \u2014 Harness Updating Is Not Harness Benefit: Disentangling Evolution Capabilities in Self-Evolving LLM Agents <a href=\"https:\/\/arxiv.org\/abs\/2605.30621\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Adaptive Auto-Harness<\/strong> \u2014 Adaptive Auto-Harness: Sustained Self-Improvement for Agentic System Deployment on Open-Ended Task Streams <a href=\"https:\/\/arxiv.org\/abs\/2606.01770\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>LongHorizon-Harness<\/strong> \u2014 LongHorizon-Harness: Advancing Long-Horizon Agents for Real-World Tasks <a href=\"https:\/\/arxiv.org\/abs\/2608.01964\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>OneDayAgent<\/strong> \u2014 OneDayAgent: Towards a Long-Horizon Harness for Autonomous Agents <a href=\"https:\/\/arxiv.org\/abs\/2608.05013\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Evo-Harness<\/strong> \u2014 Evo-Harness: Context-to-Harness Skill Compilation for Self-Evolving Agents <a href=\"https:\/\/arxiv.org\/abs\/2608.15071\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Harness Handbook<\/strong> \u2014 Harness Handbook: Making Evolving Agent Harnesses Readable, Navigable, and Editable <a href=\"https:\/\/arxiv.org\/abs\/2607.13285\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>HarnessOpt-Bench<\/strong> \u2014 HarnessOpt-Bench: Evaluating LLMs at Harness Optimization <a href=\"https:\/\/arxiv.org\/abs\/2608.06301\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>The Scaffold Effect<\/strong> \u2014 The Scaffold Effect in Coding Agents: Harness Choice as a Hidden Variable in Coding-Agent Evaluation <a href=\"https:\/\/arxiv.org\/abs\/2607.22585\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Harness-IF<\/strong> \u2014 Harness-IF: Evaluating Instruction Following Across Instruction Surfaces in Coding Agents <a href=\"https:\/\/arxiv.org\/abs\/2608.11727\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Evo-Bench<\/strong> \u2014 Evo-Bench: Can Language Models Improve Agent Harness? <a href=\"https:\/\/arxiv.org\/abs\/2608.09096\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<\/ul>\n<ul dir=\"auto\">\n<li>(arXiv 2024) <strong>StateFlow<\/strong> \u2014 StateFlow: Enhancing LLM Task-Solving through State-Driven Workflows <a href=\"https:\/\/arxiv.org\/abs\/2403.11322\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2024) <strong>Magentic-One<\/strong> \u2014 Magentic-one: A generalist multi-agent system for solving complex tasks <a href=\"https:\/\/arxiv.org\/abs\/2411.04468\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2024) <strong>AIOS<\/strong> \u2014 AIOS: LLM Agent Operating System <a href=\"https:\/\/arxiv.org\/abs\/2403.16971\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2024) <strong>AgentBoard<\/strong> \u2014 AgentBoard: An Analytical Evaluation Board of Multi-turn LLM Agents <a href=\"https:\/\/arxiv.org\/abs\/2401.13178\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2023) <strong>AdaPlanner<\/strong> \u2014 AdaPlanner: Adaptive Planning from Feedback with Language Models <a href=\"https:\/\/arxiv.org\/abs\/2305.16653\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>When Agents Do Not Stop<\/strong> \u2014 When Agents Do Not Stop: Uncovering Infinite Agentic Loops in LLM Agents <a href=\"https:\/\/arxiv.org\/abs\/2607.01641\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Stop Hand-Holding Your Coding Agent<\/strong> \u2014 Stop Hand-Holding Your Coding Agent: Engineering the Loops That Replace Step-by-Step Prompting <a href=\"https:\/\/arxiv.org\/abs\/2607.00038\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>ResearchLoop<\/strong> \u2014 ResearchLoop: An Evidence-Gated Control Plane for AI-Assisted Research <a href=\"https:\/\/arxiv.org\/abs\/2605.28282\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Proof-or-Stop<\/strong> \u2014 Proof-or-Stop: Don&#8217;t Trust the Agent, Trust the Evidence \u2013 Loop Engineering for Verifiable Evidence-Gated Lifecycle Control <a href=\"https:\/\/arxiv.org\/abs\/2607.14890\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<\/ul>\n<ul dir=\"auto\">\n<li>(arXiv 2026) <strong>Beyond Message Passing<\/strong> \u2014 Beyond Message Passing: A Semantic View of Agent Communication Protocols <a href=\"https:\/\/arxiv.org\/abs\/2604.02369\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Paper 2025) <strong>Internet of Agents<\/strong> \u2014 Internet of Agents: Fundamentals, Applications, and Challenges <a href=\"https:\/\/arxiv.org\/abs\/2505.07176\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(NeurIPS 2025) <strong>LACP<\/strong> \u2014 LLM Agent Communication Protocol (LACP) Requires Urgent Standardization: A Telecom-Inspired Protocol Is Necessary <a href=\"https:\/\/arxiv.org\/abs\/2510.13821\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Paper 2026) <strong>Beyond the Protocol<\/strong> \u2014 Beyond the Protocol: Unveiling Attack Vectors in the Model Context Protocol (MCP) Ecosystem <a href=\"https:\/\/doi.org\/10.1109\/TSE.2026.3694876\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>AgentRx<\/strong> \u2014 AgentRx: Diagnosing AI Agent Failures from Execution Trajectories <a href=\"https:\/\/arxiv.org\/abs\/2602.02475\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Supervising Ralph Wiggum<\/strong> \u2014 Supervising Ralph Wiggum: Exploring a Metacognitive Co-Regulation Agentic AI Loop for Engineering Design <a href=\"https:\/\/arxiv.org\/abs\/2603.24768\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ZTE Communications 2025) <strong>From Function Calls to MCPs<\/strong> \u2014 From Function Calls to MCPs for Securing AI Agent Systems: Architecture, Challenges and Countermeasures <a href=\"https:\/\/doi.org\/10.12142\/ZTECOM.202503004\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Sovereign Agentic Loops<\/strong> \u2014 Sovereign Agentic Loops: Decoupling AI Reasoning from Execution in Real-World Systems <a href=\"https:\/\/arxiv.org\/abs\/2604.22136\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>The Log is the Agent<\/strong> \u2014 The Log is the Agent: Event-Sourced Reactive Graphs for Auditable, Forkable Agentic Systems <a href=\"https:\/\/arxiv.org\/abs\/2605.21997\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<\/ul>\n<ul dir=\"auto\">\n<li>(arXiv 2026) <strong>EEurekAgent<\/strong> \u2014 EurekAgent: Agent Environment Engineering is All You Need for Autonomous Scientific Discovery <a href=\"https:\/\/arxiv.org\/abs\/2606.13662\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2023) <strong>LEVER<\/strong> \u2014 LEVER: Learning to Verify Language-to-Code Generation with Execution <a href=\"https:\/\/arxiv.org\/abs\/2302.08468\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2023) <strong>CRITIC<\/strong> \u2014 CRITIC: Large Language Models Can Self-Correct with Tool-Interactive Critiquing <a href=\"https:\/\/arxiv.org\/abs\/2305.11738\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2024) <strong>Executable Code Actions<\/strong> \u2014 Executable Code Actions Elicit Better LLM Agents <a href=\"https:\/\/arxiv.org\/abs\/2402.01030\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2024) <strong>ToolSandbox<\/strong> \u2014 ToolSandbox: A Stateful, Conversational, Interactive Evaluation Benchmark for LLM Tool Use Capabilities <a href=\"https:\/\/arxiv.org\/abs\/2408.04682\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(NeurIPS 2024) <strong>OSWorld<\/strong> \u2014 OSWorld: Benchmarking Multimodal Agents for Open-Ended Tasks in Real Computer Environments <a href=\"https:\/\/arxiv.org\/abs\/2404.07972\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>DeltaBox<\/strong> \u2014 DeltaBox: Scaling Stateful AI Agents with Millisecond-Level Sandbox Checkpoint\/Rollback <a href=\"https:\/\/arxiv.org\/abs\/2605.22781\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<\/ul>\n<div align=\"center\" dir=\"auto\">\n  <a target=\"_blank\" rel=\"noopener noreferrer\" href=\"https:\/\/github.com\/DEEP-JLU\/Awesome-Graph-Engineering\/blob\/main\/images\/image4.png\"><img decoding=\"async\" width=\"100%\" src=\"https:\/\/github.com\/DEEP-JLU\/Awesome-Graph-Engineering\/raw\/main\/images\/image4.png\" alt=\"Graph Engineering overview\" style=\"max-width: 100%;\"\/><\/a><\/p>\n<p dir=\"auto\"><em>Graph Engineering organizes tasks, coordinates agents, and manages runtime state.<\/em><\/p>\n<\/div>\n<ul dir=\"auto\">\n<li>(NeurIPS 2023) <strong>HuggingGPT<\/strong> \u2014 HuggingGPT: Solving AI Tasks with ChatGPT and Its Friends in Hugging Face <a href=\"https:\/\/arxiv.org\/abs\/2303.17580\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2023) <strong>ReWOO<\/strong> \u2014 ReWOO: Decoupling Reasoning from Observations for Efficient Augmented Language Models <a href=\"https:\/\/arxiv.org\/abs\/2305.18323\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICML 2024) <strong>LLMCompiler<\/strong> \u2014 An LLM Compiler for Parallel Function Calling <a href=\"https:\/\/arxiv.org\/abs\/2312.04511\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>Plan-over-Graph<\/strong> \u2014 Plan-over-Graph: Towards Parallelable LLM Agent Schedule <a href=\"https:\/\/arxiv.org\/abs\/2502.14563\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Neural Networks 2025) <strong>TDAG<\/strong> \u2014 TDAG: A Multi-Agent Framework Based on Dynamic Task Decomposition and Agent Generation <a href=\"https:\/\/arxiv.org\/abs\/2402.10178\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2025) <strong>Flow<\/strong> \u2014 Flow: Modularized Agentic Workflow Automation <a href=\"https:\/\/proceedings.iclr.cc\/paper_files\/paper\/2025\/hash\/ba84da6921f3040b74ee163aa7451f53-Abstract-Conference.html\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>VFlow<\/strong> \u2014 VFlow: Discovering Optimal Agentic Workflows for Verilog Generation <a href=\"https:\/\/arxiv.org\/abs\/2504.03723\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICML 2024) <strong>GPTSwarm<\/strong> \u2014 GPTSwarm: Language Agents as Optimizable Graphs <a href=\"https:\/\/proceedings.mlr.press\/v235\/zhuge24a.html\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2025) <strong>ADAS<\/strong> \u2014 Automated Design of Agentic Systems <a href=\"https:\/\/arxiv.org\/abs\/2408.08435\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2024) <strong>AutoFlow<\/strong> \u2014 AutoFlow: Automated Workflow Generation for Large Language Model Agents <a href=\"https:\/\/arxiv.org\/abs\/2407.12821\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2025) <strong>AFlow<\/strong> \u2014 AFlow: Automating Agentic Workflow Generation <a href=\"https:\/\/openreview.net\/forum?id=z5uVAKwmjf\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>A2Flow<\/strong> \u2014 A2Flow: Automating Agentic Workflow Generation via Self-Adaptive Abstraction Operators <a href=\"https:\/\/arxiv.org\/abs\/2511.20693\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>MermaidFlow<\/strong> \u2014 MermaidFlow: Redefining Agentic Workflow Generation via Safety-Constrained Evolutionary Programming <a href=\"https:\/\/arxiv.org\/abs\/2505.22967\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Paper 2025) <strong>DynTaskMAS<\/strong> \u2014 Dyntaskmas: A dynamic task graph-driven framework for asynchronous and parallel llm-based multi-agent systems <a href=\"https:\/\/scholar.google.com\/scholar?q=Dyntaskmas%3A+A+dynamic+task+graph-driven+framework+for+asynchronous+and+parallel+llm-based+multi-agent+systems\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(NeurIPS 2025) <strong>DyFlow<\/strong> \u2014 DyFlow: Dynamic Workflow Framework for Agentic Reasoning <a href=\"https:\/\/arxiv.org\/abs\/2509.26062\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>EvoFlow<\/strong> \u2014 EvoFlow: Evolving Diverse Agentic Workflows On The Fly <a href=\"https:\/\/arxiv.org\/abs\/2502.07373\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>QualityFlow<\/strong> \u2014 QualityFlow: An Agentic Workflow for Program Synthesis Controlled by LLM Quality Checks <a href=\"https:\/\/arxiv.org\/abs\/2501.17167\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>FlowSteer<\/strong> \u2014 FlowSteer: Prompt-Only Workflow Steering Exposes Planning-Time Vulnerabilities in Multi-Agent LLM Systems <a href=\"https:\/\/arxiv.org\/abs\/2605.11514\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>AgenticLab<\/strong> \u2014 Towards a science of scaling agent systems <a href=\"https:\/\/arxiv.org\/abs\/2512.08296\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>ScalingAgent<\/strong> \u2014 Towards a science of scaling agent systems <a href=\"https:\/\/arxiv.org\/abs\/2512.08296\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<\/ul>\n<div align=\"center\" dir=\"auto\">\n  <a target=\"_blank\" rel=\"noopener noreferrer\" href=\"https:\/\/github.com\/DEEP-JLU\/Awesome-Graph-Engineering\/blob\/main\/images\/image5.png\"><img decoding=\"async\" width=\"100%\" src=\"https:\/\/github.com\/DEEP-JLU\/Awesome-Graph-Engineering\/raw\/main\/images\/image5.png\" alt=\"Agent coordination through capability, team, and communication graphs\" style=\"max-width: 100%;\"\/><\/a><\/p>\n<p dir=\"auto\"><em>Agent Coordination through capability mapping, team organization, and communication structures.<\/em><\/p>\n<\/div>\n<ul dir=\"auto\">\n<li>(COLM 2024) <strong>DyLAN<\/strong> \u2014 A dynamic LLM-powered agent network for task-oriented agent collaboration <a href=\"https:\/\/arxiv.org\/abs\/2310.02170\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2025) <strong>Agent-Oriented Planning<\/strong> \u2014 Agent-oriented planning in multi-agent systems <a href=\"https:\/\/arxiv.org\/abs\/2410.02189\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ACL 2025) <strong>MasRouter<\/strong> \u2014 Masrouter: Learning to route llms for multi-agent systems <a href=\"https:\/\/arxiv.org\/abs\/2502.11133\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(IJCAI 2024) <strong>AutoAgents<\/strong> \u2014 Autoagents: A framework for automatic agent generation <a href=\"https:\/\/arxiv.org\/abs\/2309.17288\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(NAACL 2025) <strong>EvoAgent<\/strong> \u2014 Evoagent: Towards automatic multi-agent generation via evolutionary algorithms <a href=\"https:\/\/arxiv.org\/abs\/2406.14228\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2026) <strong>Collaborative Gym<\/strong> \u2014 Collaborative gym: A framework for enabling and evaluating human-agent collaboration <a href=\"https:\/\/arxiv.org\/abs\/2412.15701\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICML 2026) <strong>AOrchestra<\/strong> \u2014 Aorchestra: Automating sub-agent creation for agentic orchestration <a href=\"https:\/\/arxiv.org\/abs\/2602.03786\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ECAI 2025) <strong>Captain Agent<\/strong> \u2014 Adaptive graph pruning for multi-agent communication <a href=\"https:\/\/arxiv.org\/abs\/2506.02951\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICML 2026) <strong>MaAS<\/strong> \u2014 Multi-agent architecture search via agentic supernet <a href=\"https:\/\/arxiv.org\/abs\/2502.04180\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>SkillGraph<\/strong> \u2014 SkillGraph: Self-Evolving Multi-Agent Collaboration with Multimodal Graph Topology <a href=\"https:\/\/arxiv.org\/abs\/2604.17503\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2024) <strong>MetaGPT<\/strong> \u2014 MetaGPT: Meta Programming for A Multi-Agent Collaborative Framework <a href=\"https:\/\/arxiv.org\/abs\/2308.00352\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ACL 2024) <strong>ChatDev<\/strong> \u2014 ChatDev: Communicative Agents for Software Development <a href=\"https:\/\/aclanthology.org\/2024.acl-long.810\/\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2024) <strong>Magentic-One<\/strong> \u2014 Magentic-one: A generalist multi-agent system for solving complex tasks <a href=\"https:\/\/arxiv.org\/abs\/2411.04468\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2024) <strong>AgentVerse<\/strong> \u2014 Agentverse: Facilitating multi-agent collaboration and exploring emergent behaviors <a href=\"https:\/\/arxiv.org\/abs\/2308.10848\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(NeurIPS 2025) <strong>Puppeteer<\/strong> \u2014 Multi-agent collaboration via evolving orchestration <a href=\"https:\/\/arxiv.org\/abs\/2505.19591\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(NeurIPS 2025) <strong>AgentNet<\/strong> \u2014 Agentnet: Decentralized evolutionary coordination for llm-based multi-agent systems <a href=\"https:\/\/arxiv.org\/abs\/2504.00587\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2025) <strong>MacNet<\/strong> \u2014 Scaling large language model-based multi-agent collaboration <a href=\"https:\/\/arxiv.org\/abs\/2406.07155\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(EMNLP 2025) <strong>SwarmAgentic<\/strong> \u2014 Swarmagentic: Towards fully automated agentic system generation via swarm intelligence <a href=\"https:\/\/arxiv.org\/abs\/2506.15672\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2025) <strong>Mixture-of-Agents<\/strong> \u2014 Mixture-of-agents enhances large language model capabilities <a href=\"https:\/\/arxiv.org\/abs\/2406.04692\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICML 2025) <strong>G-Designer<\/strong> \u2014 G-designer: Architecting multi-agent communication topologies via graph neural networks <a href=\"https:\/\/arxiv.org\/abs\/2410.11782\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(EMNLP-2025) <strong>AMAS<\/strong> \u2014 Amas: Adaptively determining communication topology for llm-based multi-agent system <a href=\"https:\/\/arxiv.org\/abs\/2510.01617\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2025) <strong>AgentPrune<\/strong> \u2014 Cut the crap: An economical communication pipeline for llm-based multi-agent systems <a href=\"https:\/\/arxiv.org\/abs\/2410.02506\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ACL 2025) <strong>AgentDropout<\/strong> \u2014 Agentdropout: Dynamic agent elimination for token-efficient and high-performance llm-based multi-agent collaboration <a href=\"https:\/\/arxiv.org\/abs\/2503.18891\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>DyTopo<\/strong> \u2014 Dytopo: Dynamic topology routing for multi-agent reasoning via semantic matching <a href=\"https:\/\/arxiv.org\/abs\/2602.06039\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(AAAI 2026) <strong>Adaptive Theory of Mind<\/strong> \u2014 Adaptive theory of mind for LLM-based multi-agent coordination <a href=\"https:\/\/arxiv.org\/abs\/2603.16264\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(AAAI 2026) <strong>Assemble Your Crew<\/strong> \u2014 Assemble your crew: Automatic multi-agent communication topology design via autoregressive graph generation <a href=\"https:\/\/arxiv.org\/abs\/2507.18224\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(AAAI 2026) <strong>Learning to Generate and Extract<\/strong> \u2014 Learning to Generate and Extract: A Multi-Agent Collaboration Framework For Zero-shot Document-level Event Arguments Extraction <a href=\"https:\/\/arxiv.org\/abs\/2603.02909\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Agent-World<\/strong> \u2014 Agent-world: Scaling real-world environment synthesis for evolving general agent intelligence <a href=\"https:\/\/arxiv.org\/abs\/2604.18292\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2026) <strong>Graph-of-Agents<\/strong> \u2014 Graph-of-agents: A graph-based framework for multi-agent LLM collaboration <a href=\"https:\/\/arxiv.org\/abs\/2604.17148\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2026) <strong>Emergent Coordination<\/strong> \u2014 Emergent coordination in multi-agent language models <a href=\"https:\/\/arxiv.org\/abs\/2510.05174\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2026) <strong>AgentPO<\/strong> \u2014 AgentPO: Enhancing Multi-Agent Collaboration via Reinforcement Learning <a href=\"https:\/\/openreview.net\/forum?id=5L8uyzjn2l\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2026) <strong>Multi-Agent Design<\/strong> \u2014 Multi-agent design: Optimizing agents with better prompts and topologies <a href=\"https:\/\/arxiv.org\/abs\/2502.02533\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(IEEE Network 2026) <strong>Agent Discovery<\/strong> \u2014 Agent Discovery in Internet of Agents: Challenges and Solutions <a href=\"https:\/\/arxiv.org\/abs\/2511.19113\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(SIGIR 2026) <strong>LLM Agents Factory<\/strong> \u2014 LLM Agents Factory: Retrieval of Domain-Specific LLM Agents <a href=\"https:\/\/arxiv.org\/abs\/2608.09934\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>TacoMAS<\/strong> \u2014 TacoMAS: Test-Time Co-Evolution of Topology and Capability in LLM-based Multi-Agent Systems <a href=\"https:\/\/arxiv.org\/abs\/2605.09539\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>EvolveRouter<\/strong> \u2014 Evolverouter: Co-evolving routing and prompt for multi-agent question answering <a href=\"https:\/\/arxiv.org\/abs\/2604.05149\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>MoRSE<\/strong> \u2014 MoRSE: Task-Oriented Multi-Agent System with Mixture of Role-Subtask Experts <a href=\"https:\/\/arxiv.org\/abs\/2608.09251\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2025) <strong>Internet of Agents<\/strong> \u2014 Internet of agents: Weaving a web of heterogeneous agents for collaborative intelligence <a href=\"https:\/\/arxiv.org\/abs\/2407.07061\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Organizational Science of Multi-Agent LLM Systems<\/strong> \u2014 Toward an Organizational Science of Multi-Agent LLM Systems: Decoupling Who, How, and Which Algorithm <a href=\"https:\/\/arxiv.org\/abs\/2607.25446\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Multi-Agent Teams Hold Experts Back<\/strong> \u2014 Multi-agent teams hold experts back <a href=\"https:\/\/arxiv.org\/abs\/2602.01011\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Dynamic Role Assignment<\/strong> \u2014 Dynamic role assignment for multi-agent debate <a href=\"https:\/\/arxiv.org\/abs\/2601.17152\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(NAACL 2025) <strong>WorkTeam<\/strong> \u2014 WorkTeam: Constructing Workflows from Natural Language with Multi-Agents <a href=\"https:\/\/aclanthology.org\/2025.naacl-industry.3\/\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Meta-Team<\/strong> \u2014 Evolve as a Team: Collaborative Self-Evolution for LLM-based Multi-Agent Systems <a href=\"https:\/\/arxiv.org\/abs\/2605.29790\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>WebSwarm<\/strong> \u2014 WebSwarm: Recursive Multi-Agent Orchestration for Deep-and-Wide Web Search <a href=\"https:\/\/arxiv.org\/abs\/2607.08662\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>OWL<\/strong> \u2014 Owl: Optimized workforce learning for general multi-agent assistance in real-world task automation <a href=\"https:\/\/arxiv.org\/abs\/2505.23885\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2025) <strong>AgentSquare<\/strong> \u2014 Agentsquare: Automatic llm agent search in modular design space <a href=\"https:\/\/arxiv.org\/abs\/2410.06153\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>MAS-on-the-Fly<\/strong> \u2014 MAS-on-the-Fly: Dynamic Adaptation of LLM-based Multi-Agent Systems at Test Time <a href=\"https:\/\/arxiv.org\/abs\/2602.13671\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Self-Organizing Agents<\/strong> \u2014 Drop the Hierarchy and Roles: How Self-Organizing LLM Agents Outperform Designed Structures <a href=\"https:\/\/arxiv.org\/abs\/2603.28990\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Swarm Skills<\/strong> \u2014 Swarm Skills: A Portable, Self-Evolving Multi-Agent System Specification for Coordination Engineering <a href=\"https:\/\/arxiv.org\/abs\/2605.10052\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>ATLAS<\/strong> \u2014 Atlas: Adaptive trading with llm agents through dynamic prompt optimization and multi-agent coordination <a href=\"https:\/\/arxiv.org\/abs\/2510.15949\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(EMNLP 2025) <strong>MAgICoRe<\/strong> \u2014 Magicore: Multi-agent, iterative, coarse-to-fine refinement for reasoning <a href=\"https:\/\/aclanthology.org\/2025.emnlp-main.1660\/\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(EMNLP 2025) <strong>Information Propagation Effects<\/strong> \u2014 Understanding the information propagation effects of communication topologies in llm-based multi-agent systems <a href=\"https:\/\/aclanthology.org\/2025.emnlp-main.623\/\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>CARD<\/strong> \u2014 CARD: Towards Conditional Design of Multi-agent Topological Structures <a href=\"https:\/\/arxiv.org\/abs\/2603.01089\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>QueenBee Planner<\/strong> \u2014 QueenBee Planner: Skill-Evolving Communication Topologies for Token-Efficient LLM Multi-Agent Systems <a href=\"https:\/\/arxiv.org\/abs\/2606.27492\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Agentic Aggregation<\/strong> \u2014 Agentic aggregation for parallel scaling of long-horizon agentic tasks <a href=\"https:\/\/arxiv.org\/abs\/2604.11753\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<\/ul>\n<div align=\"center\" dir=\"auto\">\n  <a target=\"_blank\" rel=\"noopener noreferrer\" href=\"https:\/\/github.com\/DEEP-JLU\/Awesome-Graph-Engineering\/blob\/main\/images\/image6.png\"><img decoding=\"async\" width=\"100%\" src=\"https:\/\/github.com\/DEEP-JLU\/Awesome-Graph-Engineering\/raw\/main\/images\/image6.png\" alt=\"Runtime state recording, fault localization, and failure recovery\" style=\"max-width: 100%;\"\/><\/a><\/p>\n<p dir=\"auto\"><em>Runtime State Management through state recording, fault localization, and failure recovery.<\/em><\/p>\n<\/div>\n<ul dir=\"auto\">\n<li>(arXiv 2024) <strong>StateFlow<\/strong> \u2014 StateFlow: Enhancing LLM Task-Solving through State-Driven Workflows <a href=\"https:\/\/arxiv.org\/abs\/2403.11322\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2024) <strong>AutoGRAMS<\/strong> \u2014 AutoGRAMS: Autonomous Graphical Agent Modeling Software <a href=\"https:\/\/arxiv.org\/abs\/2407.10049\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2024) <strong>Magentic-One<\/strong> \u2014 Magentic-one: A generalist multi-agent system for solving complex tasks <a href=\"https:\/\/arxiv.org\/abs\/2411.04468\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Graph of States<\/strong> \u2014 Graph of States: Solving Abductive Tasks with Large Language Models <a href=\"https:\/\/arxiv.org\/abs\/2603.21250\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Paper 2026) <strong>LangGraph<\/strong> \u2014 LangGraph: Low-Level Orchestration for Stateful Agents <a href=\"https:\/\/github.com\/langchain-ai\/langgraph\">[Paper]<\/a><\/li>\n<li>(Paper 2026) <strong>Burr<\/strong> \u2014 Apache Burr: Stateful Application and Agent Framework <a href=\"https:\/\/github.com\/apache\/burr\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>Aegis<\/strong> \u2014 Aegis: Taxonomy and Optimizations for Overcoming Agent-Environment Failures in LLM Agents <a href=\"https:\/\/arxiv.org\/abs\/2508.19504\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Paper 2026) <strong>LlamaIndex Workflows<\/strong> \u2014 LlamaIndex Workflows: Event-Driven Agent Workflows <a href=\"https:\/\/github.com\/run-llama\/workflows-py\">[Paper]<\/a><\/li>\n<li>(Paper 2026) <strong>Pydantic AI<\/strong> \u2014 Pydantic AI: Typed Agent Framework and Graph Runtime <a href=\"https:\/\/github.com\/pydantic\/pydantic-ai\">[Paper]<\/a><\/li>\n<li>(arXiv 2023) <strong>AutoGen<\/strong> \u2014 AutoGen: Enabling Next-Gen LLM Applications via Multi-Agent Conversation <a href=\"https:\/\/arxiv.org\/abs\/2308.08155\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Sovereign Agentic Loops<\/strong> \u2014 Sovereign Agentic Loops: Decoupling AI Reasoning from Execution in Real-World Systems <a href=\"https:\/\/arxiv.org\/abs\/2604.22136\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2023) <strong>LATS<\/strong> \u2014 Language Agent Tree Search Unifies Reasoning, Acting, and Planning in Language Models <a href=\"https:\/\/arxiv.org\/abs\/2310.04406\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>PatchBoard<\/strong> \u2014 PatchBoard: Schema-Grounded State Mutation for Reliable and Auditable LLM Multi-Agent Collaboration <a href=\"https:\/\/arxiv.org\/abs\/2605.29313\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>MemTX<\/strong> \u2014 MemTX: Transactional Belief Commit for Stateful Agent Memory <a href=\"https:\/\/arxiv.org\/abs\/2607.23929\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Cordon<\/strong> \u2014 Cordon: Semantic Transactions for Tool-Using LLM Agents <a href=\"https:\/\/arxiv.org\/abs\/2606.17573\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Atomix<\/strong> \u2014 Atomix: Timely, transactional tool use for reliable agentic workflows <a href=\"https:\/\/arxiv.org\/abs\/2602.14849\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>SagaLLM<\/strong> \u2014 SagaLLM: Context Management, Validation, and Transaction Guarantees for Multi-Agent LLM Planning <a href=\"https:\/\/arxiv.org\/abs\/2503.11951\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>ALAS<\/strong> \u2014 Alas: Transactional and dynamic multi-agent llm planning <a href=\"https:\/\/arxiv.org\/abs\/2511.03094\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(CAIS 2026) <strong>RAC<\/strong> \u2014 Robust Agent Compensation (RAC): Teaching AI Agents to Compensate <a href=\"https:\/\/dl.acm.org\/doi\/full\/10.1145\/3786335.3813141\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>ProPlay<\/strong> \u2014 ProPlay: Procedural World Models for Self-Evolving LLM Agents <a href=\"https:\/\/arxiv.org\/abs\/2606.12780\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>DART<\/strong> \u2014 DART: Semantic Recoverability for Structured Tool Agents <a href=\"https:\/\/arxiv.org\/abs\/2605.23311\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>AgentGit<\/strong> \u2014 AgentGit: A version control framework for reliable and scalable LLM-powered multi-agent systems <a href=\"https:\/\/arxiv.org\/abs\/2511.00628\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Shepherd<\/strong> \u2014 Shepherd: Enabling Programmable Meta-Agents via Reversible Agentic Execution Traces <a href=\"https:\/\/arxiv.org\/abs\/2605.10913\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>The Log is the Agent<\/strong> \u2014 The Log is the Agent: Event-Sourced Reactive Graphs for Auditable, Forkable Agentic Systems <a href=\"https:\/\/arxiv.org\/abs\/2605.21997\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Concurrency Anomaly Prevention<\/strong> \u2014 Verified Detection and Prevention of Concurrency Anomalies in Multi-Agent Large Language Model Systems <a href=\"https:\/\/arxiv.org\/abs\/2606.17182\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>CausalFlow<\/strong> \u2014 CausalFlow: Causal Attribution and Counterfactual Repair for LLM Agent Failures <a href=\"https:\/\/arxiv.org\/abs\/2605.25338\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>ReflexGrad<\/strong> \u2014 ReflexGrad: Within-Episode Failure Recovery in LLM Agents via Progress-Gated Dual-Process Routing <a href=\"https:\/\/arxiv.org\/abs\/2511.14584\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>TDAD<\/strong> \u2014 TDAD: Test-Driven Agentic Development &#8211; Reducing Code Regressions in AI Coding Agents via Graph-Based Impact Analysis <a href=\"https:\/\/arxiv.org\/abs\/2603.17973\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>Who &amp; When<\/strong> \u2014 Which Agent Causes Task Failures and When? On Automated Failure Attribution of LLM Multi-Agent Systems <a href=\"https:\/\/arxiv.org\/abs\/2505.00212\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(NeurIPS 2025) <strong>MAST<\/strong> \u2014 Why Do Multi-Agent LLM Systems Fail? <a href=\"https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2025\/hash\/b1041e52d3be19f0a9bc491657488e4a-Abstract-Datasets_and_Benchmarks_Track.html\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Living-Harness<\/strong> \u2014 Living-Harness Is an Interactive-Agent Evolver <a href=\"https:\/\/arxiv.org\/abs\/2607.26598\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>APEX<\/strong> \u2014 APEX: Autonomous Policy Exploration for Self-Evolving LLM Agents <a href=\"https:\/\/arxiv.org\/abs\/2605.21240\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<\/ul>\n<ul dir=\"auto\">\n<li>(arXiv 2026) <strong>QueenBee Planner<\/strong> \u2014 QueenBee Planner: Skill-Evolving Communication Topologies for Token-Efficient LLM Multi-Agent Systems <a href=\"https:\/\/arxiv.org\/abs\/2606.27492\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ACL 2026) <strong>ReCreate<\/strong> \u2014 Recreate: Reasoning and creating domain agents driven by experience <a href=\"https:\/\/aclanthology.org\/2026.acl-long.1432\/\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>SkillGraph<\/strong> \u2014 SkillGraph: Self-Evolving Multi-Agent Collaboration with Multimodal Graph Topology <a href=\"https:\/\/arxiv.org\/abs\/2604.17503\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Swarm Skills<\/strong> \u2014 Swarm Skills: A Portable, Self-Evolving Multi-Agent System Specification for Coordination Engineering <a href=\"https:\/\/arxiv.org\/abs\/2605.10052\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>MemTX<\/strong> \u2014 MemTX: Transactional Belief Commit for Stateful Agent Memory <a href=\"https:\/\/arxiv.org\/abs\/2607.23929\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>The Log is the Agent<\/strong> \u2014 The Log is the Agent: Event-Sourced Reactive Graphs for Auditable, Forkable Agentic Systems <a href=\"https:\/\/arxiv.org\/abs\/2605.21997\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Neural Networks 2025) <strong>TDAG<\/strong> \u2014 TDAG: A Multi-Agent Framework Based on Dynamic Task Decomposition and Agent Generation <a href=\"https:\/\/www.sciencedirect.com\/science\/article\/abs\/pii\/S0893608025000796\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICLR 2025) <strong>Flow<\/strong> \u2014 Flow: Modularized Agentic Workflow Automation <a href=\"https:\/\/proceedings.iclr.cc\/paper_files\/paper\/2025\/hash\/ba84da6921f3040b74ee163aa7451f53-Abstract-Conference.html\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(ICAPS 2025) <strong>DynTaskMAS<\/strong> \u2014 Dyntaskmas: A dynamic task graph-driven framework for asynchronous and parallel llm-based multi-agent systems <a href=\"https:\/\/scholar.google.com\/scholar?q=Dyntaskmas%3A+A+dynamic+task+graph-driven+framework+for+asynchronous+and+parallel+llm-based+multi-agent+systems\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(NeurIPS 2025) <strong>DyFlow<\/strong> \u2014 DyFlow: Dynamic Workflow Framework for Agentic Reasoning <a href=\"https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2025\/hash\/fe9910d2b03324faeb5371a9658277bb-Abstract-Conference.html\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>EvoFlow<\/strong> \u2014 EvoFlow: Evolving Diverse Agentic Workflows On The Fly <a href=\"https:\/\/arxiv.org\/abs\/2502.07373\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2025) <strong>QualityFlow<\/strong> \u2014 QualityFlow: An Agentic Workflow for Program Synthesis Controlled by LLM Quality Checks <a href=\"https:\/\/arxiv.org\/abs\/2501.17167\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>FlowSteer<\/strong> \u2014 FlowSteer: Prompt-Only Workflow Steering Exposes Planning-Time Vulnerabilities in Multi-Agent LLM Systems <a href=\"https:\/\/arxiv.org\/abs\/2605.11514\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(EMNLP 2025) <strong>SwarmAgentic<\/strong> \u2014 Swarmagentic: Towards fully automated agentic system generation via swarm intelligence <a href=\"https:\/\/aclanthology.org\/2025.emnlp-main.93\/\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(NeurIPS 2026) <strong>AgentNet<\/strong> \u2014 Agentnet: Decentralized evolutionary coordination for llm-based multi-agent systems <a href=\"https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2025\/hash\/9a379c1b05793d1c42dc832269834515-Abstract-Conference.html\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Self-Organizing Agents<\/strong> \u2014 Drop the Hierarchy and Roles: How Self-Organizing LLM Agents Outperform Designed Structures <a href=\"https:\/\/arxiv.org\/abs\/2603.28990\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Meta-Team<\/strong> \u2014 Evolve as a Team: Collaborative Self-Evolution for LLM-based Multi-Agent Systems <a href=\"https:\/\/arxiv.org\/abs\/2605.29790\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>DyTopo<\/strong> \u2014 Dytopo: Dynamic topology routing for multi-agent reasoning via semantic matching <a href=\"https:\/\/arxiv.org\/abs\/2602.06039\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>CARD<\/strong> \u2014 CARD: Towards Conditional Design of Multi-agent Topological Structures <a href=\"https:\/\/arxiv.org\/abs\/2603.01089\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<\/ul>\n<ul dir=\"auto\">\n<li>(arXiv 2026) <strong>OntoExtend<\/strong> \u2014 OntoExtend: A Framework for Requirement-driven and Scalable Ontology Extension with LLMs <a href=\"https:\/\/arxiv.org\/abs\/2607.17963\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Knowledge acquisition 1993) <strong>OntoSpecification<\/strong> \u2014 A translation approach to portable ontology specifications <a href=\"https:\/\/scholar.google.com\/scholar?q=A+translation+approach+to+portable+ontology+specifications\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Paper 2025) <strong>iCARE<\/strong> \u2014 iCARE: Ontology-Guided Intent Routing for Multi-Agent LLM-Based Dialogue Systems <a href=\"https:\/\/scholar.google.com\/scholar?q=iCARE%3A+Ontology-Guided+Intent+Routing+for+Multi-Agent+LLM-Based+Dialogue+Systems\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>OG-MAR<\/strong> \u2014 Toward Culturally Aligned LLMs through Ontology-Guided Multi-Agent Reasoning <a href=\"https:\/\/arxiv.org\/abs\/2601.21700\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Paper 2026) <strong>CAPAS<\/strong> \u2014 Agentic Information Architectures for Global Climate Governance: A Multi-Agent Decision-Support System for Cross-National Policy Analytics <a href=\"https:\/\/scholar.google.com\/scholar?q=Agentic+Information+Architectures+for+Global+Climate+Governance%3A+A+Multi-Agent+Decision-Support+System+for+Cross-National+Policy+Analytics\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Procedia CIRP 2026) <strong>LaMAS4PD<\/strong> \u2014 LaMAS4PD-A Multi-Agent LLM Approach for Ontology-Driven Structuring of Engineering Knowledge in Industry 4.0 <a href=\"https:\/\/scholar.google.com\/scholar?q=LaMAS4PD-A+Multi-Agent+LLM+Approach+for+Ontology-Driven+Structuring+of+Engineering+Knowledge+in+Industry+4.0\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Available at SSRN 6919461 2026) <strong>Agentology<\/strong> \u2014 Agentology: Ontology-Driven Operational Environments for Multi-Agent Systems <a href=\"https:\/\/scholar.google.com\/scholar?q=Agentology%3A+Ontology-Driven+Operational+Environments+for+Multi-Agent+Systems\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(npj Health Systems 2026) <strong>OntoCodex<\/strong> \u2014 OntoCodex: a multi-agent biomedical ontology enrichment framework <a href=\"https:\/\/scholar.google.com\/scholar?q=OntoCodex%3A+a+multi-agent+biomedical+ontology+enrichment+framework\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(European Semantic Web Conference 2026) <strong>AgentO<\/strong> \u2014 AgentO: An Ontology for Modeling Agentic AI Systems <a href=\"https:\/\/scholar.google.com\/scholar?q=AgentO%3A+An+Ontology+for+Modeling+Agentic+AI+Systems\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Ontology-to-Tools<\/strong> \u2014 Ontology-to-tools compilation for executable semantic constraint enforcement in LLM agents <a href=\"https:\/\/arxiv.org\/abs\/2602.03439\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(Semantic Web 2026) <strong>Ontology SLR<\/strong> \u2014 Large language models for ontology engineering: a systematic literature review <a href=\"https:\/\/scholar.google.com\/scholar?q=Large+language+models+for+ontology+engineering%3A+a+systematic+literature+review\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<li>(arXiv 2026) <strong>Palantir Ontology<\/strong> \u2014 The Ontology System <a href=\"https:\/\/www.palantir.com\/docs\/foundry\/architecture-center\/ontology-system\" rel=\"nofollow\">[Paper]<\/a><\/li>\n<\/ul>\n<div class=\"markdown-heading\" dir=\"auto\">\n<h2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"> Benchmarks, Datasets, and Environments<\/h2>\n<p><a id=\"user-content--benchmarks-datasets-and-environments\" class=\"anchor\" aria-label=\"Permalink: &#x1f3c6; Benchmarks, Datasets, and Environments\" href=\"#-benchmarks-datasets-and-environments\"><svg data-component=\"Octicon\" class=\"octicon octicon-link\" viewbox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"><path d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\/><\/svg><\/a><\/div>\n<p dir=\"auto\">Representative evaluation resources from the survey:<\/p>\n<div class=\"markdown-heading\" dir=\"auto\">\n<h2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"> Open-Source Libraries<\/h2>\n<p><a id=\"user-content--open-source-libraries\" class=\"anchor\" aria-label=\"Permalink: &#x1f4bb; Open-Source Libraries\" href=\"#-open-source-libraries\"><svg data-component=\"Octicon\" class=\"octicon octicon-link\" viewbox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"><path d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\/><\/svg><\/a><\/div>\n<p dir=\"auto\">Reusable projects grouped by their primary engineering target:<\/p>\n<p dir=\"auto\">Representative systems and application domains covered by the survey:<\/p>\n<div class=\"markdown-heading\" dir=\"auto\">\n<h3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\">Software Engineering and IT Operations<\/h3>\n<p><a id=\"user-content-software-engineering-and-it-operations\" class=\"anchor\" aria-label=\"Permalink: Software Engineering and IT Operations\" href=\"#software-engineering-and-it-operations\"><svg data-component=\"Octicon\" class=\"octicon octicon-link\" viewbox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"><path d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\/><\/svg><\/a><\/div>\n<div class=\"markdown-heading\" dir=\"auto\">\n<h3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\">Scientific Discovery and Laboratory Automation<\/h3>\n<p><a id=\"user-content-scientific-discovery-and-laboratory-automation\" class=\"anchor\" aria-label=\"Permalink: Scientific Discovery and Laboratory Automation\" href=\"#scientific-discovery-and-laboratory-automation\"><svg data-component=\"Octicon\" class=\"octicon octicon-link\" viewbox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"><path d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\/><\/svg><\/a><\/div>\n<div class=\"markdown-heading\" dir=\"auto\">\n<h3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\">Healthcare and Clinical Decision Support<\/h3>\n<p><a id=\"user-content-healthcare-and-clinical-decision-support\" class=\"anchor\" aria-label=\"Permalink: Healthcare and Clinical Decision Support\" href=\"#healthcare-and-clinical-decision-support\"><svg data-component=\"Octicon\" class=\"octicon octicon-link\" viewbox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"><path d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\/><\/svg><\/a><\/div>\n<div class=\"markdown-heading\" dir=\"auto\">\n<h3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\">Enterprise Workflows and Digital Organizations<\/h3>\n<p><a id=\"user-content-enterprise-workflows-and-digital-organizations\" class=\"anchor\" aria-label=\"Permalink: Enterprise Workflows and Digital Organizations\" href=\"#enterprise-workflows-and-digital-organizations\"><svg data-component=\"Octicon\" class=\"octicon octicon-link\" viewbox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"><path d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\/><\/svg><\/a><\/div>\n<div class=\"markdown-heading\" dir=\"auto\">\n<h3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\">General-Purpose Digital Agents and Personal Automation<\/h3>\n<p><a id=\"user-content-general-purpose-digital-agents-and-personal-automation\" class=\"anchor\" aria-label=\"Permalink: General-Purpose Digital Agents and Personal Automation\" href=\"#general-purpose-digital-agents-and-personal-automation\"><svg data-component=\"Octicon\" class=\"octicon octicon-link\" viewbox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"><path d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\/><\/svg><\/a><\/div>\n<div class=\"markdown-heading\" dir=\"auto\">\n<h3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\">Social and Economic Simulation<\/h3>\n<p><a id=\"user-content-social-and-economic-simulation\" class=\"anchor\" aria-label=\"Permalink: Social and Economic Simulation\" href=\"#social-and-economic-simulation\"><svg data-component=\"Octicon\" class=\"octicon octicon-link\" viewbox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"><path d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\/><\/svg><\/a><\/div>\n<p dir=\"auto\">If you find this repository useful, please cite the accompanying survey:<\/p>\n<div class=\"highlight highlight-text-bibtex notranslate position-relative overflow-auto\" dir=\"auto\" data-snippet-clipboard-copy-content=\"@misc{feng2026graphengineeringerallm,&#10;      title={Graph Engineering in the Era of LLM Agents: From Individual Intelligence to System Intelligence},&#10;      author={Yuyuan Feng and Zhishang Xiang and Chaobin Yang and Qichao Ma and Zerui Chen and Yujing Zhang and Ke Huang and Chuanjie Wu and Zhaoxu Liu and Yili Wang and Xin He and Jiapu Wang and Zijin Hong and Hao Chen and Yuanchen Bei and Kun Wang and Shengyuan Chen and Ningyu Zhang and Enyan Dai and Linhao Luo and Qingyi Pan and Qi Wang and Wenqi Fan and Guangjing Wang and Na Zou and Yangqiu Song and Xin Wang and Zechao Li and Xia Hu and Qing Li and Xiao Huang and Zhihong Zhang and Jinsong Su and Qinggang Zhang and Yi Chang},&#10;      year={2026},&#10;      eprint={2608.21156},&#10;      archivePrefix={arXiv},&#10;      primaryClass={cs.IR},&#10;      url={https:\/\/arxiv.org\/abs\/2608.21156},&#10;}\">\n<pre><span class=\"pl-k\">@misc<\/span>{<span class=\"pl-en\">feng2026graphengineeringerallm<\/span>,\n      <span class=\"pl-s\">title<\/span>=<span class=\"pl-s\"><span class=\"pl-pds\">{<\/span>Graph Engineering in the Era of LLM Agents: From Individual Intelligence to System Intelligence<span class=\"pl-pds\">}<\/span><\/span>,\n      <span class=\"pl-s\">author<\/span>=<span class=\"pl-s\"><span class=\"pl-pds\">{<\/span>Yuyuan Feng and Zhishang Xiang and Chaobin Yang and Qichao Ma and Zerui Chen and Yujing Zhang and Ke Huang and Chuanjie Wu and Zhaoxu Liu and Yili Wang and Xin He and Jiapu Wang and Zijin Hong and Hao Chen and Yuanchen Bei and Kun Wang and Shengyuan Chen and Ningyu Zhang and Enyan Dai and Linhao Luo and Qingyi Pan and Qi Wang and Wenqi Fan and Guangjing Wang and Na Zou and Yangqiu Song and Xin Wang and Zechao Li and Xia Hu and Qing Li and Xiao Huang and Zhihong Zhang and Jinsong Su and Qinggang Zhang and Yi Chang<span class=\"pl-pds\">}<\/span><\/span>,\n      <span class=\"pl-s\">year<\/span>=<span class=\"pl-s\"><span class=\"pl-pds\">{<\/span>2026<span class=\"pl-pds\">}<\/span><\/span>,\n      <span class=\"pl-s\">eprint<\/span>=<span class=\"pl-s\"><span class=\"pl-pds\">{<\/span>2608.21156<span class=\"pl-pds\">}<\/span><\/span>,\n      <span class=\"pl-s\">archivePrefix<\/span>=<span class=\"pl-s\"><span class=\"pl-pds\">{<\/span>arXiv<span class=\"pl-pds\">}<\/span><\/span>,\n      <span class=\"pl-s\">primaryClass<\/span>=<span class=\"pl-s\"><span class=\"pl-pds\">{<\/span>cs.IR<span class=\"pl-pds\">}<\/span><\/span>,\n      <span class=\"pl-s\">url<\/span>=<span class=\"pl-s\"><span class=\"pl-pds\">{<\/span>https:\/\/arxiv.org\/abs\/2608.21156<span class=\"pl-pds\">}<\/span><\/span>,\n}<\/pre>\n<\/div>\n<p dir=\"auto\">This list is maintained by the authors and community contributors. We thank the authors of all referenced works and open-source projects.<\/p>\n<\/div>\n<p><a href=\"https:\/\/github.com\/DEEP-JLU\/Awesome-Graph-Engineering?utm_source=tldrai\">Source link <\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>A curated collection of research papers, benchmarks, and open-source projects on Graph Engineering in the era of LLM Agents. This repository accompanies the survey Graph Engineering in the Era of LLM Agents: From Individual Intelligence to System Intelligence and will be continuously updated. Graph Engineering studies how explicit, dynamic, and evolving graph structures can organize [&hellip;]<\/p>\n","protected":false},"author":16,"featured_media":23498,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[143],"tags":[],"class_list":["post-23497","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-ai"],"_links":{"self":[{"href":"https:\/\/scannn.com\/lv\/wp-json\/wp\/v2\/posts\/23497","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/scannn.com\/lv\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/scannn.com\/lv\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/scannn.com\/lv\/wp-json\/wp\/v2\/users\/16"}],"replies":[{"embeddable":true,"href":"https:\/\/scannn.com\/lv\/wp-json\/wp\/v2\/comments?post=23497"}],"version-history":[{"count":0,"href":"https:\/\/scannn.com\/lv\/wp-json\/wp\/v2\/posts\/23497\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/scannn.com\/lv\/wp-json\/wp\/v2\/media\/23498"}],"wp:attachment":[{"href":"https:\/\/scannn.com\/lv\/wp-json\/wp\/v2\/media?parent=23497"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/scannn.com\/lv\/wp-json\/wp\/v2\/categories?post=23497"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/scannn.com\/lv\/wp-json\/wp\/v2\/tags?post=23497"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}