arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2603.26990hep-ph
收藏

代理图示学:迈向高能物理中自主符号计算

Agentic Diagrammatica: Towards Autonomous Symbolic Computation in High Energy Physics

University of Alabama(阿拉巴马大学);Fermi National Accelerator Laboratory(费米国家加速器实验室)

Tony Menzo, Alexander Roman, George T. Fleming, Sergei Gleyzer, Konstantin T. Matchev, Stephen Mrenna

AI总结:

本文提出Diagrammatica,通过HEPTAPOD框架扩展实现LLM代理的多步骤理论计算。通过工具约束计算和知识接地方法,实现符号计算的精确性与可验证性,验证了在高能物理中的应用效果。

摘要:

我们提出了Diagrammatica,一种符号计算扩展,用于HEPTAPOD代理框架,使LLM代理能够规划和执行多步骤理论计算。符号计算对LLM代理而言具有独特的可靠性挑战,因为正确性由隐含的数学惯例控制,这些惯例未以可检查的形式编码在计算后端中。我们识别出两种互补的解决方案,即工具约束计算和目标知识接地,并追求前者作为主要架构。具体而言,我们将代理的动作分布集中于具有惯例修正语义的工具调用上,在其中代理指定一个紧凑、可由人类审核的图谱规范,并由可信的后端执行符号或数值操作。工具包提供两种互补的计算路径,消耗共享的图谱规范:Naive Dimensional Analysis(NDA)用于量级速率估计,Exact Diagrammatic Analysis(EDA)通过自动FeynCalc代码生成进行树级符号计算,两者均辅以自动费曼图枚举和可导航的理论知识库。该架构在两个基准上得到验证:(1)一个涵盖所有树级、单顶点1→2部分衰变宽度的完整目录,包括标量、费米子和矢量父体的完整无质量极限和标准模型验证;(2)对μ+衰变多重性μ+→ν_μν_e + n(e^+e^-) + e^-的NDA敏感性研究,确定当前和计划中的μ子实验中可观测的最大n值。

英文摘要:

We present Diagrammatica, a symbolic computation extension to the HEPTAPOD agentic framework, which enables LLM agents to plan and execute multi-step theoretical calculations. Symbolic computation poses a distinctive reliability challenge for LLM agents, as correctness is governed by implicit mathematical conventions that are not encoded in a form that can be easily checked in the computational backend. We identify two complementary remedies, tool-constrained computation and targeted knowledge grounding, and pursue the first as the primary architecture. Concretely, we concentrate the agent's action distribution onto tool calls with convention-fixing semantics, in which the agent specifies a compact, human-auditable diagram specification and a trusted backend performs the symbolic or numerical manipulations exactly. The toolkit provides two complementary calculation paths consuming a shared diagram specification: Naive Dimensional Analysis (NDA) for order-of-magnitude rate estimates and Exact Diagrammatic Analysis (EDA) for tree-level symbolic calculations via automatic FeynCalc code generation, both supplemented by automatic Feynman diagram enumeration and a navigable theory knowledge base. The architecture is validated on two benchmarks: (1) an exhaustive catalog of all tree-level, single-vertex $1\to 2$ partial decay widths across scalar, fermion, and vector parents, with complete massless and threshold limits and Standard Model validation; and (2) an NDA sensitivity study of the muon decay multiplicity $μ^+ \to ν_μ\barν_e + n(e^+e^-) + e^-$, determining the maximum observable $n$ at current and planned muon experiments.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑