arXivDaily arXiv每日学术速递 周一至周五更新
重置
全部学科分类 2070
2606.10150 2026-06-11 quant-ph hep-ex physics.comp-ph 版本更新

Towards the implementation of a quantum classifier

迈向量子分类器的实现

Lorenzo Confalonieri

AI总结 研究量子电路作为二元分类模型,使用Qibo框架设计分类器,在MNIST和高能碰撞数据集上测试,与经典CNN比较性能。

Comments Bachelor's Thesis in Physics, Lorenzo Confalonieri, supervised by Adrián Pérez-Salinas and Stefano Carrazza, Università degli Studi di Milano (July 2021). 55 pages, 28 figures. Code implementations utilize the Qibo framework

详情
AI中文摘要

在这项工作中,我们研究了在量子机器学习背景下使用量子电路作为二元分类模型。我们将此模型称为二元量子分类器。首先,我们描述了量子计算的基本概念,并介绍了所使用的计算工具:Qibo,一个用于高效量子模拟和量子硬件控制的开源框架。然后,我们通过展示如何将数据输入电路、定义具有可训练参数的量子电路模型Ansatz和损失函数,以及实现多个最小化器,描述了如何设计用于图像和小型变量数组分类的二元量子分类器。我们用两个数据集测试了我们的量子分类器。第一个是MNIST数据集,由手写数字组成(为二元分类简化为手写0和1)。我们通过增加Ansatz的层数来研究不同最小化器的行为。第二个数据集代表在LHC(CERN)等对撞机上可能发生的两种不同的高能碰撞。由于同时发生的质子-质子相互作用(称为堆积),我们区分了两个不同的数据集:“无堆积”和“有堆积”。这些碰撞可以用32x32大小的图像或六个高级变量(我们称之为特征)来表示。通过增加训练数据集的大小和Ansatz的层数,我们寻找最佳最小化器。将数据集分为训练集和测试集后,我们计算了ROC曲线、AUC分数、混淆矩阵和测试集准确率。对于“有堆积”图像,我们将量子分类器获得的结果与一个小型卷积神经网络进行了比较。我们得出结论,可以用量子电路构建二元量子分类器,并强调了其与经典技术相比的性能和局限性。

英文摘要

In this work, we investigate the use of a quantum circuit as a binary classification model in the context of quantum machine learning. We call this model, binary quantum classifier. First, we describe fundamental concepts of quantum computing and introduce the computational tool used: Qibo, an open-source framework for efficient quantum simulations and quantum hardware control. Then, we describe how to design a binary quantum classifier for the classification of images and small arrays of variables by showing how to input data in the circuit, defining a quantum circuit model Ansatz with trainable parameters and a loss function, and implementing multiple minimizers. We test our quantum classifier with two data sets. The first one is the MNIST data set which is composed of handwritten digits (reduced to only handwritten zeros and handwritten ones for binary classification). We study the behavior of different minimizers by increasing the number of layers of the Ansatz. The second data set represents two different high energy collisions that can occur at colliders such as LHC (CERN). Due to in-time proton-proton interactions known as pile-up, we distinguish two different data sets: "without pile-up" and "with pile-up". These collisions can be represented by images of size 32x32 or by six high-level variables that we call features. By increasing the size of the training data set and the number of layers of the Ansatz, we search for the best minimizer. Splitting the data set in training set and test set, we compute: ROC curve, AUC score, confusion matrices and test set accuracy. For "with pile-up" images, we compare the results obtained with the quantum classifier with a small convolutional neural network. We conclude that is possible to build a binary quantum classifier with a quantum circuit and we highlight its performances and limitations in comparison with classical technologies.

2606.10816 2026-06-11 astro-ph.SR astro-ph.EP 版本更新

Analysis of the young disk around WRAY 15-1880: does it contain a primitive planetary system?

WRAY 15-1880周围年轻盘的分析:它包含一个原始行星系统吗?

Elisabetta Rigliaco, Raffaele Gratton, Silvano Desidera, Gabriele Columba, Enrico Grippi

AI总结 通过VLT-SPHERE、MUSE和ALMA数据,在WRAY 15-1880的盘间隙中发现一个候选木星质量伴星(0.3-7.6 MJup),并识别出可能由该行星激发的涡旋/尘埃陷阱,但未检测到行星吸积。

Comments Accepted for publication by A&A on June 8th 2026, 15 pages, 13 figures

详情
AI中文摘要

观测在其诞生环境中吸积物质的(巨)行星对于约束其形成模型至关重要。Corona Australis(CrA)复合体中的WRAY 15-1880(又名RX J1842.9-3532)拥有一个显著的前过渡盘,其年龄通过使用从盘运动学得出的精确动力学质量与等时线比较计算得到,约为2.8±0.7 Myr。因此,这颗恒星处于盘演化的晚期阶段,可能拥有正在吸积的行星。我们获取了VLT-SPHERE的新偏振成像数据,并分析了VLT-SPHERE、VLT-MUSE和ALMA的存档观测,在高对比度成像中发现了盘间隙内的一个候选木星类似伴星。从各种方法得出的候选伴星质量估计与0.3-7.6 MJup范围内的天体一致。候选伴星的光谱与T3光谱类型一致,符合对几倍木星质量天体的预期。我们在ALMA数据中发现了一个位于恒星西北方向的发射团块,与候选伴星共同旋转,这可以解释为行星m=1 Lindblad共振处的涡旋/尘埃陷阱。从VLT-MUSE存档数据中未检测到候选行星上的吸积。这可能是由于对比度不足、观测几何不利于观测行星表面,或者可能表明我们只是在观测盘内的不规则性。最后,我们在这些数据中识别出一个从恒星垂直延伸到盘的微喷流。

英文摘要

Observations of (giant) planets accreting material within their natal environment are crucial to constrain models for their formation. WRAY 15-1880 (aka RX J1842.9-3532) in the Corona Australis (CrA) complex has a prominent pre-transitional disk, and an age of ~2.8+-0.7 Myr, computed by comparison with isochrones using the accurate dynamical mass derived from disk kinematics. Hence, this star is in the late phases of disk evolution and might host accreting planets. We acquire new polarimetric imaging data with VLT-SPHERE and analyze archive observations taken with VLT-SPHERE, VLT-MUSE, and ALMA, finding a candidate Jupiter-like companion within the disk gap from high-contrast imaging. The mass estimates of the candidate companion, derived from various methods, are consistent with an object in the range of 0.3-7.6 MJup. The spectrum of the candidate companion is consistent with a T3 spectral type, in agreement with expectations of an object of a few Jupiter masses. We find an emission blob North-West of the star in the ALMA data rotating solidly with the candidate companion, that can be interpreted as a vortex/dust trap at the m=1 Lindblad resonance of the planet. Accretion on the candidate planet is not detected from the VLT-MUSE archival data. This may be due to insufficient contrast, an observational geometry that is unfavorable for viewing the planet's surface, or it could indicate that we are merely observing irregularities within the disk. Finally, we identify a microjet extending from the star perpendicular to the disk in these data.

2606.10739 2026-06-11 astro-ph.HE 版本更新

Potential detection of ~ 4.2 keV emission line from GRS 1747-312

从 GRS 1747-312 潜在探测到约 4.2 keV 发射线

Amom Lanchenbi Chanu, Akash Garg, Ranjeev Misra, A. Senorita Devi

AI总结 利用 AstroSat 数据对中子星低质量 X 射线双星 GRS 1747-312 进行宽带能谱分析,发现一条 4.2 keV 发射线,可能来自中子星表面的反射,为测量引力红移和约束致密物质状态方程提供直接手段。

Comments Accepted for publication in Journal of High Energy Astrophysics

详情
AI中文摘要

我们利用约 40 ks 的 AstroSat 数据对中子星低质量 X 射线双星 GRS 1747-312 进行了宽带能谱分析。源在 2017 年爆发的衰减阶段被观测到,吸收后的 1.0--5.5 keV 流量为 $1.67^{+0.04}*{-0.07} \times 10^{-11}$ erg s$^{-1}$ cm$^{-2}$,对应光度约 $\sim (0.9-1.80) \times 10^{35}$ erg s$^{-1}$。连续谱用黑体辐射的热康普顿化和星际吸收建模。在约 6.4 keV 处的一条轻微展宽的铁线用盘反射成分拟合。低于 2 keV 的窄线用 XSPEC 模型 APEC 描述的热等离子体解释。此外,在 $4.19^{+0.12}*{-0.10}$ keV 处有一条潜在探测到的发射线,宽度 $\sigma = 0.2 \pm 0.2~\mathrm{keV}$,线流量 = $13^{+10}*{-9} \times 10^{-5}$ erg s$^{-1}$ cm$^{-2}$。对几次短时标(约几千秒)的 Swift 观测(流量为 AstroSat 源流量的几倍)的检查给出了线流量的上限 $< 30 \times 10^{-5}$ erg s$^{-1}$ cm$^{-2}$。4.2 keV 线很可能起源于中子星表面的反射。将中性 Fe $K*\alpha$ 线从其静止能量 6.4 keV 移动到 4.2 keV 需要红移 $z \sim 0.6$,这与从非自旋的 $1.4 M_\odot$、半径 10 km 的中子星表面预期的红移一致。如果得到确认,这一特征提供了引力红移的直接测量,使我们能够对中子星的质量-半径比施加强约束,并获得对致密物质状态方程(EOS)的宝贵见解。

英文摘要

We present a broadband spectral analysis of the neutron star LMXB GRS 1747-312 using $\sim$ 40 ks AstroSat data. The source was observed during the decay phase of the 2017 outburst, with an absorbed 1.0-5.5 keV flux of 1.67$^{+0.04}_{-0.07}\times$10$^{-11}$ erg s$^{-1}$ cm$^{-2}$, corresponding to a luminosity of $\sim$(0.9-1.80)$\times$10$^{35}$ erg s$^{-1}$. The continuum is modeled with thermal Comptonization of blackbody emission and interstellar absorption. A mildly broad iron line at $\sim$6.4 keV is fitted with a disc reflection component. Narrow lines below 2 keV are described by a hot plasma using the XSPEC model APEC. Additionally, there is a potential detection of an emission line at 4.19$^{+0.12}_{-0.10}$ keV with width $σ$ = 0.2 $\pm$ 0.2 keV and line flux of 13$^{+10}_{-9}\times$10$^{-5}$ erg s$^{-1}$ cm$^{-2}$. Examination of several short-duration ($\sim$ few kiloseconds) Swift observations at a few times the AstroSat source flux provided upper limits to the line flux of $<$30$\times$10$^{-5}$ erg s$^{-1}$ cm$^{-2}$. The 4.2 keV line likely originates from reflection off the neutron star surface. Shifting the neutral Fe K$_α$ line from its rest energy of 6.4 keV to 4.2 keV requires a redshift of z $\sim$ 0.6, consistent with that expected from the surface of a non-spinning 1.4 M$_\odot$, 10 km radius neutron star. If confirmed, this feature provides a potential direct measurement of gravitational redshift, allowing us to place strong constraints on the neutron star's mass-to-radius ratio and gain valuable insights into the equation of state (EOS) of dense matter.

2606.10036 2026-06-11 astro-ph.GA 版本更新

Learning the Universe at High Redshifts: Impact of Accretion Modeling on Early Black Hole Growth

学习高红移宇宙:吸积模型对早期黑洞增长的影响

Jonathan Kho, Aklant K. Bhowmick, Rainer Weinberger, Paul Torrey, Laura Blecha, Lars Hernquist, Greg L. Bryan, Alex M. Garcia, Niusha Ahvazi, Alejandro Saravia, Boon Kiat Oh

AI总结 本研究比较了三种吸积模型(Bondi-Hoyle和两种自由落体模型)对早期超大质量黑洞增长的影响,发现Bondi模型在重种子下易失控增长,而自由落体模型在轻种子下增长更强,但均受反馈抑制;通过并合或弱反馈可解释JWST观测到的早期大质量黑洞。

Comments This is a Learning the Universe publication. 19 pages, 7 figures, submitted to ApJ

详情
AI中文摘要

JWST对最早($z \gtrsim 9$)的超大质量黑洞(BHs,$M_\bullet \gtrsim 10^6\\,\rm{M}_\odot$)的发现挑战了大多数宇宙学模拟的黑洞种子和吸积模型。在这项工作中,我们比较了由三种不同吸积模型产生的早期黑洞增长,这些模型的特征在于吸积率($\dot{M}_{\rm \bullet}$)与黑洞质量($M_{\rm \bullet}$)之间的不同标度关系:常用的Bondi-Hoyle模型($\dot{M}_{\rm \bullet}\propto M_{\rm \bullet}^2$),以及两个具有较浅标度关系的自由落体模型($\dot{M}_{\rm \bullet}\propto M_{\rm \bullet}^{1/2}$和$M_{\rm \bullet}$)。当使用重种子($\sim10^5\\,\rm{M}_\odot$)时,由于更陡的$M_\bullet$标度,Bondi吸积倾向于产生比自由落体模型更强的失控增长,但其对局部气体声速的敏感性使其更容易受到AGN和恒星反馈导致的温度升高抑制。自由落体模型对于低质量种子($\sim10^{3-4}\\,\rm{M}_\odot$)倾向于产生更强的增长,因为它们对黑洞质量的有效吸积依赖性较小,然而在这种状态下,在存在标准恒星反馈的情况下,所有吸积模型的黑洞增长仍然可以忽略不计。通过许多黑洞-黑洞并合增强早期黑洞增长,由于更陡的$M_{\rm \bullet}$依赖性,会不成比例地增强后续Bondi吸积驱动的增长。因此,我们的模拟可以在两种情况下组装质量约为$\sim10^6-10^7 M_{\odot}$的黑洞,如JWST所推断的:1)丰富的重种子形成驱动黑洞-黑洞并合,或2)具有弱反馈的Bondi吸积。

英文摘要

JWST discoveries of the earliest ($z \gtrsim 9$) supermassive black holes (BHs, $M_\bullet \gtrsim 10^6\,\rm{M}_\odot$) challenge the BH seeding and accretion models of most cosmological simulations. In this work, we compare early BH growth arising from three different accretion prescriptions characterized by distinct scalings between the accretion rate ($\dot{M}_{\rm \bullet}$) and the BH mass ($M_{\rm \bullet}$): the commonly used Bondi-Hoyle model ($\dot{M}_{\rm \bullet}\propto M_{\rm \bullet}^2$), and two free-fall models with shallower scalings ($\dot{M}_{\rm \bullet}\propto M_{\rm \bullet}^{1/2}$ and $M_{\rm \bullet}$). Bondi accretion tends to produce stronger runaway growth than the free-fall models when using heavy ($\sim10^5\,\rm{M}_\odot$) seeds in extreme environments owing to the steeper $M_\bullet$ scaling, but its sensitivity to the local gas sound speed makes it more susceptible to suppression from temperature increases due to AGN and stellar feedback. The free-fall models tend to produce stronger growth for lower-mass seeds ($\sim10^{3-4}\,\rm{M}_\odot$) in moderate environments as they are less dependent on the BH's mass to accrete effectively, however in this regime BH growth remains negligible for all accretion models in the presence of fiducial stellar feedback. Enhancing early BH growth via many BH-BH mergers disproportionately enhances subsequent accretion-driven growth for Bondi due to the steeper $M_{\rm \bullet}$ dependence. Our simulations can thus assemble BHs with masses of $\sim10^6-10^7~M_{\odot}$ at $z\gtrsim9$, as inferred by JWST, under two circumstances: 1) abundant heavy-seed formation that drives BH-BH mergers, or 2) Bondi accretion with weak feedback.

2606.09824 2026-06-11 cs.DB 版本更新

TSseek: Regular Expression-Based Similarity Search for Distributed Time Series Datasets

TSseek: 基于正则表达式的分布式时间序列数据集相似性搜索

Xiaoshuai Li, Khalid Alnuaim, Mohamed Y. Eltabakh, Elke A. Rundensteiner

AI总结 提出TSseek框架,通过正则表达式查询语言支持趋势、值范围和通配符模式搜索,并构建分布式空间索引TSseek-X实现高效精确匹配。

Comments Extended version with full ablation studies and additional experiments

详情
AI中文摘要

相似性搜索是时间序列分析中的基本操作。然而,大多数现有技术要求用户提供精确的值序列(通常是整个时间序列对象)作为查询输入。这种严格的要求限制了实际应用,用户更希望表达模式、趋势或值范围。灵活的基于模式的搜索已在文本检索和复杂事件处理中得到探索,但在大规模分布式时间序列中仍未得到充分研究。为弥补这一差距,我们提出TSseek,一个基于正则表达式的分布式时间序列数据集搜索框架。TSseek的查询语言使用户能够组合包含趋势、值范围和通配符片段的模式。我们表明,传统的近似技术(如PAA和SAX)及其索引结构不适合此类查询,因为它们无法对正则表达式查询构造进行操作。在TSseek中,我们通过将时间序列对象近似为保留趋势(斜率方向)和值范围的线段序列,并将查询构造转换为边界矩形,将时间序列对象和查询构造映射到同一空间。为支持高效处理,我们构建了TSseek-X,一个基于时间序列片段的分布式空间索引。TSseek支持两种基本查询类型:全匹配查询(针对整个序列)和子序列匹配查询(针对序列内的任意窗口)。在基准和真实数据集上,全扫描、基于模型和基于SAX的基线方法要么牺牲准确性,要么牺牲速度,而TSseek能高效地返回精确答案。此外,对于子序列工作负载,它比最先进的子序列匹配引擎实现了显著的加速。

英文摘要

Similarity search is a fundamental operation in time series analysis. Most existing techniques, however, require users to supply a precise sequence of values (typically an entire time series object) as the query input. This rigid requirement limits real-world applications, where users instead want to express patterns, trends, or value ranges. Flexible, pattern-based search has been explored in text retrieval and complex event processing, but remains underexplored for large-scale distributed time series. To close this gap, we propose TSseek, a regular-expression-powered search framework for distributed time series datasets. TSseek's query language enables users to compose patterns encompassing trends, value ranges, and wildcard segments. We show that conventional approximation techniques (e.g., PAA and SAX) and their index structures are ill-suited for such queries because they cannot operate on regular-expression query constructs. In TSseek, we map the time series objects and the query constructs into the same space by approximating time series objects as sequences of line segments that retain both trend (slope direction) and value range, and translating query constructs into bounding rectangles. To support efficient processing, we build TSseek-X, a distributed spatial index over the time series segments. TSseek supports two fundamental query types, namely whole-matching queries (over entire series) and subsequence-matching queries (over arbitrary windows within a series). Across benchmark and real-world datasets, full-scan, model-based, and SAX-based baselines all sacrifice either accuracy or speed, whereas TSseek returns exact answers efficiently. Also, for subsequence workloads, it achieves significant speedups over state-of-the-art subsequence matching engines.

2606.09799 2026-06-11 physics.flu-dyn 版本更新

A fast and consistent sharp-interface immersed boundary method for moving bodies of arbitrary thickness

一种用于任意厚度运动物体的快速一致锐利界面浸入边界法

Giovanni Vagnoli, Martino Andrea Scarpolini, Roberto Verzicco, Francesco Viola

AI总结 提出一种结合快速标记算法、双侧欧拉强迫策略和一致质量校正的锐利界面浸入边界法,用于模拟包含运动、变形及任意厚度物体的不可压缩流动,在保持直接泊松求解器效率的同时实现二阶无滑移精度。

详情
AI中文摘要

浸入边界法(IBMs)被广泛用于模拟复杂几何形状和运动物体周围的流动,但通常需要在精度和计算效率之间进行权衡。欧拉公式需要对运动壁面进行特殊处理,并可能产生虚假力振荡,而拉格朗日公式可能在浸入表面出现滑移误差。我们提出了一种新颖的锐利界面IBM,用于涉及运动、变形和任意厚度物体的不可压缩流动。该方法结合了快速标记算法、双侧欧拉强迫策略和一致质量校正,减少了分数步格式的分裂误差,同时保持了离散拉普拉斯算子的结构。该公式保留了直接泊松求解器的效率,从而避免了切割单元、多重网格和投影方法的开销。该方法自然地处理运动边界,并在无滑移条件的强制执行中产生较小的透射误差,具有二阶精度。使用刚性、变形、湍流和生物启发流动的数值测试证明了该方法的准确性、鲁棒性和效率,且不增加计算成本。

英文摘要

Immersed boundary methods (IBMs) are widely used to simulate flows around complex geometries and moving bodies, but they often involve a trade-off between precision and computational efficiency. Eulerian formulations require special treatments for moving walls and may generate spurious force oscillations, whereas Lagrangian formulations can suffer from slip errors at the immersed surfaces. We propose a novel sharp-interface IBM for incompressible flows involving moving, deformable, and arbitrary-thickness bodies. The method combines a fast tagging algorithm, a two-sided Eulerian forcing strategy, and a consistent mass correction that reduces the splitting error of fractional-step schemes, while preserving the structure of the discrete Laplacian operator. This formulation retains the efficiency of direct Poisson solvers, thus avoiding the overhead of cut-cell, multigrid, and projection-based approaches. The method naturally handles moving boundaries, and yields small transpiration errors with second-order accuracy in the enforcement of the no-slip condition. Numerical tests using rigid, deformable, turbulent, and biologically inspired flows demonstrate the accuracy, robustness, and efficiency of the method, without compromising computational cost.

2606.09440 2026-06-11 cond-mat.mtrl-sci 版本更新

First-principles description of pumped inelastic X-ray scattering: example of K-edge RIXS in graphite

泵浦非弹性X射线散射的第一性原理描述:以石墨K边RIXS为例

Elias Richter, Benedikt Maurer, Claudia Draxl

AI总结 提出基于第一性原理的框架,结合BSE和RT-TDDFT,预测光泵浦材料中RIXS信号,以石墨K边为例验证了角度依赖性与实验一致。

Comments 10 pages, 8 figures

详情
AI中文摘要

我们提出了一个用于预测光泵浦材料中共振非弹性X射线散射(RIXS)的\textit{ab initio}框架。该方法基于Kramers-Heisenberg公式的双微分截面,该公式利用多体微扰理论中Bethe-Salpeter方程(BSE)的结果构建。为了将该方法扩展到时间域,我们引入了从实时含时密度泛函理论(RT-TDDFT)获得的非平衡载流子分布。通过将RIXS实现推广到任意偏振,我们可以考虑入射和出射光的不同取向。我们通过研究石墨K边在不同非平衡载流子分布下的RIXS来展示该方法的能力,这些分布代表光泵浦后的不同延迟时间。我们的结果揭示了$π$和$σ$轨道衍生光谱区域的角度依赖性,与实验吻合良好。

英文摘要

We present an $\textit{ab initio}$ framework for predicting resonant inelastic X-ray scattering (RIXS) in optically pumped materials. Our methodology is based on the Kramers-Heisenberg formula for the double-differential cross section formulated using the results of the Bethe-Salpeter equation (BSE) from many-body perturbation theory. To extend this approach to the time domain, we incorporate non-equilibrium charge-carrier distributions obtained from real-time, time-dependent density-functional theory (RT-TDDFT). Generalizing the RIXS implementation with respect to arbitrary polarizations, allows us to consider different orientations of incoming and outgoing light. We demonstrate our method's capabilities by studying RIXS at the K-edge of graphite for various non-equilibrium charge-carrier distributions, representing different delay times after optical pumping. Our results reveal angular dependencies in $π$- and $σ$-orbital-derived spectral regions, in good agreement with experiment.

2606.09397 2026-06-11 hep-ph 版本更新

Searching for the pseudoscalar partner of $G(3900)$ via radiative $Y(4230)$ decays

通过辐射衰变 $Y(4230)$ 寻找 $G(3900)$ 的赝标量伙伴

Vitor C. Premoli, Pedro Brandão, Ya-Wen Pan, Li-Sheng Geng, Luciano M. Abreu

AI总结 通过辐射衰变Y(4230)→γG0(3900)研究G(3900)的赝标量伙伴G0(3900)的产生,将其解释为P波分子态,利用三角形机制计算分支比在3.8×10^{-5}到3.3×10^{-4}范围,为实验搜索提供途径并检验分子描述。

Comments 17 pages, 5 figures; figs. 1 and 2 corrected

详情
AI中文摘要

受最近观测到的矢量态 $G(3900)$ 的 $P$ 波分子解释启发,我们通过辐射衰变 $Y(4230) \to \gamma G_0(3900)$ 分析了其可能的赝标量伙伴(此处记为 $G_0(3900)$)的产生。$G_0(3900)$ 被解释为量子数 $J^{PC}=0^{-+}$ 的 $P$ 波分子态,主要成分为 $D\bar{D}^{\ast}/\bar{D}D^{\ast}$。尽管尚未在实验上确立,但预期这种结构出现在 $D\bar{D}^*$ 阈值附近,并表现出特征性的产生模式。该衰变被认为通过三角形机制进行。根据模型参数和 $G_0(3900)$ 的结合能,所得分支比位于 $\mathcal{B}(Y(4230) \to \gamma G_0(3900)) = 3.8 \times 10^{-5} - 3.3 \times 10^{-4}$ 范围内。我们的结果为在辐射道中搜索 $G_0(3900)$ 的信号提供了途径,同时也检验了圈诱导辐射衰变与 $Y(4230)$ 分子描述的相容性。

英文摘要

Inspired by the $P$-wave molecular interpretation of the recently observed vector state $G(3900)$, we analyze the production of its possible pseudoscalar partner, denoted here as $G_0(3900)$, via the radiative decay $Y(4230) \to γG_0(3900)$. The $G_0(3900)$ is interpreted as a $P$-wave molecular state with quantum numbers $J^{PC}=0^{-+}$, dominated by the $D\bar{D}^{\ast}/\bar{D}D^{\ast}$ components. Although not yet experimentally established, such a structure is expected to appear near the $D\bar{D}^*$ threshold and to exhibit characteristic production patterns. The decay is assumed to proceed through a triangle mechanism. Depending on the model parameters and the binding energy of $G_0(3900)$, the resulting branching fraction lies in the range $\mathcal{B}(Y(4230) \to γG_0(3900)) = 3.8 \times 10^{-5} - 3.3 \times 10^{-4}$. Our results offer a pathway to search for signatures of $G_0(3900)$ in radiative channels and also provide a test of the consistency of loop-mediated radiative decays with a molecular description of the $Y(4230)$.

2606.09394 2026-06-11 hep-ph quant-ph 版本更新

Strong-field control of the $Z$-boson resonance in $e^+e^-$ collisions

强场控制 $e^+e^-$ 碰撞中 $Z$ 玻色子共振

Fengye Chen, Qingzheng Lv, Libin Fu

AI总结 研究强激光场对 $e^+e^-$ 碰撞中 $Z$ 玻色子共振的影响,发现非微扰处理下激光修饰改变有效碰撞运动学并打开多光子交换通道,导致共振轮廓出现强度依赖的饱和与增强,并重新分布 $Z$ 玻色子极化,高强场下可补偿电弱相互作用的固有手征不对称性。

Comments The incorrect summation of the spin and polarization indices in Equations (23) and (30) in the supplementary materials has been removed

详情
AI中文摘要

共振 $Z$ 玻色子产生是精密电弱物理的基石,其真空线形由 $Z$ 质量、宽度和碰撞运动学决定。我们表明强激光场可以显著改变这一图景。通过非微扰处理场,我们发现入射费米子的激光修饰改变了有效碰撞运动学,并在 $e^+e^-$ 碰撞中打开了激光光子交换通道,包括多光子过程。结果,$Z$ 共振轮廓发展出不同的强度依赖区域,从真空极限演变到中等场强下的饱和,再到更高强度下的近似二次增强。此外,产生的 $Z$ 玻色子的极化组成被重新分布。特别地,在高强度下,激光诱导的贡献可以补偿电弱相互作用的内在手征不对称性,导致近乎宇称平衡的 $Z$ 玻色子产生。我们的结果确定强经典场可以动态控制电弱共振现象,为强场 QED 和高能对撞机物理之间架起桥梁。

英文摘要

Resonant $Z$-boson production is a cornerstone of precision electroweak physics, with its vacuum line shape set by the $Z$ mass, width, and collision kinematics. We show that a strong laser field can significantly alter this picture. By treating the field nonperturbatively, we find that laser dressing of the incoming fermions alters the effective collision kinematics and opens laser-photon exchange channels, including multiphoton processes, in $e^{+}e^{-}$ collisions. As a result, the $Z$-resonance profile develops distinct intensity-dependent regimes, evolving from the vacuum limit to saturation at intermediate field strengths and to an approximately quadratic enhancement at higher intensities. Additionally, the polarization composition of the produced $Z$ bosons is redistributed. In particular, at high intensities the laser-induced contribution can compensate the intrinsic chiral asymmetry of the electroweak interaction, leading to nearly parity-balanced $Z$-boson production. Our results identify that strong classical fields can dynamically control electroweak resonance phenomena, opening a bridge between strong-field QED and high-energy collider physics.

2606.09358 2026-06-11 math.SP math.AP 版本更新

Schroedinger operators with generic potentials achieve maximal resonance density

具有一般势的薛定谔算子达到最大共振密度

Travis Cunningham

AI总结 本文证明对于一般紧支撑势,薛定谔算子的积分共振计数函数达到最优渐近上界,并给出偶维度的新结果。

Comments 21 pages, 0 figures

详情
AI中文摘要

我们证明,对于一般实值或复值紧支撑势,相应的薛定谔算子达到最大共振密度,即其积分共振计数函数达到最优渐近上界。在奇数维情形,这可由Dinh-Vu的结果通过适配Christiansen-Hislop的一个论证得到。偶数维的证明构成了本文的主体,我们证明了几个在奇数维情形有类似结果的新共振结论。这包括:任何紧支撑势的积分共振计数函数的尖锐上界;球的特征函数的共振计数函数达到最优上界的证明;以及关于解析势族的多极子集补集的共振计数函数渐近的Dinh-Vu结果的偶数维类比。我们利用共振作为与散射矩阵相关的某些Fredholm行列式函数的零点的刻画,从而应用单复变和多复变理论的技术与结果。我们证明球的特征函数的计数函数达到最优上界时,使用了Bessel函数的一致渐近,并遵循了Zworski、Christiansen-Hislop和Dinh-Vu的思想。

英文摘要

We show that for a generic real or complex-valued compactly supported potential, the corresponding Schroedinger operator achieves maximal resonance density, in the sense that its integrated resonance counting function achieves the optimal asymptotic upper bound. For odd dimensions this follows from results of Dinh-Vu once we adapt an argument of Christiansen Hislop. The proof for even dimensions constitutes the bulk of the paper, and we prove several new results on resonances which have analogues in the odd dimensional case. This includes a sharp upper bound on the integrated resonance counting function for any compactly support potential, a proof that the characteristic function of a ball has resonance counting function which achieves the optimal upper bound, and an even-dimensional analogue of the result of Dinh-Vu on asymptotics of the resonance counting functions for complements of pluripolar subsets of analytic families of potentials. We use the characterization of resonances as zeros of certain Fredholm determinant functions related to the scattering matrix, allowing us to apply techniques and results from the theories of one and several complex variables. Our proof that the characteristic function of a ball has counting function achieving the optimal upper bound uses the uniform asymptotics of Bessel functions and follows ideas of Zworski, Christiansen-Hislop, and Dinh-Vu.

2606.09321 2026-06-11 math.CO 版本更新

Proof of Conjecture 19 of Ballantine, Beck, Merca, and Sagan on Elementary Symmetric Partitions

Ballantine, Beck, Merca 和 Sagan 关于初等对称划分的猜想 19 的证明

Arnav Garg

AI总结 本文证明了Ballantine等人关于整数划分上pre_k映射像与OEIS序列关联的猜想19,无条件证明了(i)(iii)部分,在单射假设下证明(iv)并证明等价性,部分证明(ii)并归约为Hickerson猜想,同时修正了(iii)中的符号错误。

Comments 5 pages

详情
AI中文摘要

Ballantine, Beck, Merca 和 Sagan (arXiv:2409.11268) 提出了四个恒等式,统称为猜想 19,这些恒等式将整数划分上的映射 pre_k 的像与四个 OEIS 序列联系起来。我们无条件证明了 (i) 和 (iii) 部分,在假设 pre_2 在 n 的划分上是单射(同一篇论文的猜想 1)的条件下证明了 (iv) 部分,并证明了这个假设实际上与 (iv) 等价;对于 (ii) 部分,我们无条件证明了划分论的一半,并将剩余内容归约为 Dean Hickerson 在 2006 年关于 OEIS 中 Huffman 编码的一个猜想。我们还纠正了 (iii) 部分已发表陈述中的一个符号错误:正确的恒等式是 chi(ImP_3(n)) = A213213(n) - 1,而不是所述的 1 + A213213(n)。

英文摘要

Ballantine, Beck, Merca, and Sagan conjectured four identities, collectively Conjecture 19, relating the image of the map pre_k on integer partitions to four OEIS sequences. We prove parts (i) and (iii) unconditionally, prove part (iv) unconditionally using the injectivity of pre_2 on partitions of n (Conjecture 1 of the same paper, proved by Li in arXiv:2508.00971), and show that this injectivity is in fact equivalent to part (iv). For part (ii) we prove the partition-theoretic half unconditionally and reduce the remaining content to a 2006 conjecture of Dean Hickerson on the OEIS concerning Huffman coding. We also correct a sign error in the published statement of part (iii): the correct identity is chi(ImP_3(n)) = A213213(n) - 1, not 1 + A213213(n) as stated.

2606.09174 2026-06-11 cs.HC 版本更新

Demonstrating chart-plot: Closing the Last Mile of Academic Chart Generation

展示chart-plot:弥合学术图表生成的最后一英里

Yinghao Tang, Yupeng Xie, Yingchaojie Feng, Jiale Lao, Tingfeng Lan, Wei Chen

AI总结 提出chart-plot系统,通过风格感知代码生成、部署感知渲染循环和结构化编辑层,解决学术图表从代码到发表的质量差距问题。

Comments 7 pages, 6 figures. Submitted to the VLDB ADS 2026 Workshop: The Joint Workshop on Agentic Data Systems and Data-Centric AI

详情
AI中文摘要

大型语言模型可以将研究者的意图转化为可运行的matplotlib代码,但生成的图表很少能不经多轮手动修改就直接用于论文。我们认为,开放的问题不是图表代码生成,而是图表发表:使输出看起来像顶级会议中的图表,适应目标布局,并响应精确的作者编辑。我们提出了chart-plot,一个通过三个组件弥合这最后一英里的智能体框架:(1) 一个风格感知的代码生成器,基于从目标会议已接受图表中提炼的文本风格技能;(2) 一个部署感知的渲染循环,在目标LaTeX上下文中编译图表并反复修改直到满足布局约束;(3) 一个结构化编辑层,将每个图表元素暴露为可直接操作的控制点。我们报告了三种图表类型案例研究(分组柱状图、缩放折线图、配对分布图)的初步结果和一个小型用户研究。

英文摘要

Large language models can translate a researcher's intent into runnable matplotlib code, yet the resulting chart rarely lands in a paper without multiple rounds of manual revision. We argue that the open problem is not chart code generation but chart publication: making the output look like a top-venue figure, survive the target layout, and respond to precise author edits. We present chart-plot, an agentic harness that closes this last mile through three components: (1) a style-aware code generator conditioned on a textual style skill distilled from accepted figures at the target venue, (2) a deployment-aware render loop that compiles the chart inside the target LaTeX context and revises until layout constraints are met, and (3) a structured edit layer that exposes every chart element as a directly manipulable handle. We report early results on three chart-type case studies (grouped bar, scaling line, paired distributions) and a small user study.

2606.08972 2026-06-11 physics.soc-ph nlin.CG 版本更新

Three-dimensional Fundamental Diagrams of Five-neighbor Particle Cellular Automata

五邻居粒子元胞自动机的三维基本图

Kazuya Okamoto, Daisuke Takahashi

AI总结 针对二维基本图多值的五邻居粒子元胞自动机,通过引入第二密度使平均流唯一确定,构建三维基本图,并验证实值最大-加扩展下单值结构的保持性。

Comments 17 pages

详情
AI中文摘要

我们分析了五邻居粒子元胞自动机,其传统的二维基本图是多值的,但通过引入第二密度,平均流被唯一确定。我们首先考虑第二密度守恒的二元规则,然后检查第二密度不守恒但渐近收敛的规则。这些例子给出了三维基本图,其中平均流由粒子密度和第二密度决定。然后我们研究这种单值结构是否在实值最大-加扩展下保持不变。存在一些规则引入了两种不同的最大-加扩展,数值模拟表明两种扩展都保持相同的单值三维基本图。这些观察意味着,在构造实值最大-加扩展时,一致地选择流量函数和第二密度是重要的。

英文摘要

We analyze five-neighbor particle cellular automata whose conventional two-dimensional fundamental diagrams are multivalued, but whose mean flow is uniquely determined by introducing a second density. We first consider binary rules for which the second density is conserved, and then examine rules for which the second density is not conserved but converges asymptotically. These examples give three-dimensional fundamental diagrams in which the mean flow is determined by the particle density and the second density. We then investigate whether this single-valued structure is preserved under real-valued max-plus extensions. There are some rules where two different max-plus extensions are introduced, and numerical simulations show that both extensions preserve the same single-valued three-dimensional fundamental diagram. These observations imply that, in constructing real-valued max-plus extensions, it is important to choose the flux function and the second density consistently.

2606.08651 2026-06-11 math.CV 版本更新

The Four-Point Picard Theorem for Quaternionic Slice Regular Functions

四元数切片正则函数的四点Picard定理

Guangbin Ren, Xin Zhao

AI总结 证明非常数整切片正则函数可省略四个值当且仅当它们仿射相关,排除Bisi-Winkelmann Picard定理中仿射无关的边界情况,利用平方判别式恒等式和Noguchi-Winkelmann-Yamanoi第二基本定理。

详情
AI中文摘要

设 $a_0,a_1,a_2,a_3\in\mathbb H$。我们证明,$\mathbb H$ 上的非常数整切片正则函数可以省略这四个值当且仅当它们仿射相关。因此,仿射无关的情况——Bisi--Winkelmann Picard 定理留下的四点边界情况——不可能发生。证明将省略转化为四个与茎函数相关的无零点整函数 $Q_j$。对于仿射无关的目标点,垂直于其仿射跨度的坐标由平方判别式恒等式 $T^2=\Delta_A(Q_0,Q_1,Q_2,Q_3)$ 控制。有限阶 $Q$-数据被一个初等单变量论证排除。一般情况下,对数 Bloch--Ochiai 将无零点 $Q$-曲线置于一个平移代数环面中,其中判别式成为洛朗多项式。洛朗平方情形归约到有限阶;在剩余情形中,平方恒等式迫使沿无平方分支除子的偶分歧,这与 Noguchi--Winkelmann--Yamanoi 的截断一级第二基本定理矛盾。

英文摘要

An entire slice regular function $f:\mathbb H\to\mathbb H$ can omit four prescribed quaternionic values only in the affine-dependent case. More precisely, four affinely independent omitted values force $f$ to be constant, while the converse follows from the plane-omission theorem of Bisi--Winkelmann. The proof passes to the real-symmetric stem function. For each omitted value a quadratic zero-divisor criterion gives a zero-free entire function $Q_j$, and the component normal to the affine span is governed by a square-discriminant identity. Finite-order data are excluded by Hadamard factorization and a rigidity argument on the real axis. In the general case, logarithmic Bloch--Ochiai places the $Q$-curve in a translated algebraic torus. The Laurent-square case reduces to the finite-order contradiction, and the nonsquare case is excluded by an even-ramification argument together with the level-one truncated Second Main Theorem of Noguchi--Winkelmann--Yamanoi.

2606.08506 2026-06-11 math.CO cs.DM 版本更新

Almost balanced ordered biclique covering of graphs

图的几乎平衡有序双团覆盖

Anand Babu, Ervin Ranjan, Maddipati Deshith Sai, Jatla Naga Sidhartha, Anagh Indu Suresh, Sreedhara Vishwas

AI总结 研究完全图K_n的最小双团覆盖大小f(n,k),要求每条边被覆盖1到k次且有序计数平衡,对一般k给出了几乎紧的界。

Comments 9 pages

详情
AI中文摘要

设 $f(n,k)$ 是双团集合的最小大小,满足 (i) 完全图 $K_n$ 的每条边被集合中至少一个且至多 $k$ 个双团覆盖,且 (ii) 对于每条边 $\{u,v\}$,$u$ 出现在第一类而 $v$ 出现在第二类的双团个数,与 $u$ 出现在第二类而 $v$ 出现在第一类的双团个数相差至多一。对于 $k=1$,$f(n,k)$ 退化为 $K_n$ 的双团划分数,Graham--Pollak 定理给出 $f(n,1)=n-1$。对于 $k=2$,$f(n,k)$ 是 $K_n$ 的有序双团划分数,已知存在正常数 $c_1$ 和 $c_2$ 使得 $c_1 n^{1/2} \le f(n,2) \le c_2 n^{1/2+o(1)}$。本文中,我们对一般 $k$ 建立了 $f(n,k)$ 的几乎紧的界。

英文摘要

Let $f(n,k)$ be the minimum size of a collection of bicliques such that (i) every edge of the complete graph $K_n$ is covered by at least one and at most $k$ bicliques in the collection, and (ii) for each edge $\{u,v\}$, the number of bicliques in which $u$ appears in the first class and $v$ in the second class differs by at most one from the number of bicliques in which $u$ appears in the second class and $v$ in the first class. For $k=1$, $f(n,k)$ reduces to the biclique partition number of $K_n$, and the Graham-Pollak theorem gives $f(n,1)=n-1$. For $k=2$, $f(n,k)$ is the ordered biclique partition number of $K_n$, for which it is known that $c_1 n^{1/2} \le f(n,2) \le c_2 n^{1/2+o(1)}$ for some positive constants $c_1$ and $c_2$. In this note, we give almost tight bounds for $f(n,k)$ for fixed $k \ge 2$: \[ (1+o(1))c_1(k)\cdot n^{\frac{1}{\lceil k/2\rceil+1}} \le f(n,k) \le (1+o(1))c_2(k)\cdot n^{\frac{1}{\lfloor k/2\rfloor+1}+o(1)}, \] where $c_1(k)$ and $c_2(k)$ are positive constants.

2606.08472 2026-06-11 cs.CR 版本更新

Digital White Spaces: A Cyberpsychology-Informed Framework to Mobile Phone Addiction

数字空白空间:一个基于网络心理学的手机成瘾框架

Leandros Maglaras, Helge Janicke, Konstantinos Karantzalos

AI总结 针对手机过度使用和注意力碎片化问题,本文提出“数字空白空间”框架,结合隐私保护监控、AI成瘾循环检测、设备模式干预和物理信号限制区,以恢复认知自主性。

详情
AI中文摘要

手机过度使用和注意力碎片化已成为紧迫的社会和公共卫生问题。网络心理学研究强调由间歇性奖励、说服性设计和习惯养成驱动的成瘾性参与循环。在这篇社论中,我综合了当前关于手机成瘾的证据,并提出了“数字空白空间”(DWS),这是一个结合隐私保护监控、AI驱动的成瘾循环检测、设备模式干预和物理信号限制区的社会技术框架,以恢复认知自主性。

英文摘要

Mobile phone overuse and attention fragmentation have become pressing societal and public health concerns. Cyberpsychology research highlights addictive engagement loops driven by intermittent rewards, persuasive design, and habit formation. In this article, we use current evidence on mobile-phone addiction and propose "Digital White Spaces" (DWS), a socio-technical framework that combines privacy-preserving monitoring, AI-driven detection of addictive loops, device-mode interventions, and physical signal-limited zones to minimize digital stimulation and internet addiction.

2606.08339 2026-06-11 cs.MS cs.NA math.NA 版本更新

Floating-point autotuning with customized precisions

自定义精度的浮点自动调优

Xinye Chen, Thibault Hilaire, Fabienne Jézéquel

AI总结 提出一种通过自定义浮点格式实现自动精度调优的方法,结合数值验证与系统搜索生成满足精度要求的程序变体,并在线性求解器和Rodinia基准测试中验证了大部分变量可安全降精度。

详情
AI中文摘要

降低精度算术在保持数值精度的前提下,为提高数值应用的性能、内存使用和能效提供了重要机会。本文研究了通过用户定义的指数和尾数大小的自定义浮点格式进行自动精度调优,从而在统一的混合精度框架内模拟新兴的低精度格式并探索非标准精度配置。所提出的方法在PROMISE精度自动调优工具中实现,将数值验证与系统搜索相结合,生成满足用户定义精度要求的程序变体。为解决这种探索的计算成本,一个容器化基准测试框架支持跨多个算法和参数配置的并行执行。该方法在一组数值程序上进行评估,包括线性求解器和Rodinia基准测试中的应用。结果表明,大部分变量可以安全地降低到较低精度而保持准确性,表明标准双精度通常过度配置。这些发现凸显了自动精度调优在根据应用特定精度要求推导高效混合精度配置方面的潜力。

英文摘要

Reduced-precision arithmetic offers significant opportunities to improve performance, memory usage, and energy efficiency in numerical applications, provided that numerical accuracy is preserved. This work investigates automated precision tuning through customized floating-point formats with user-defined exponent and significand sizes, enabling the emulation of emerging low-precision formats and the exploration of non-standard precision configurations within a unified mixed-precision framework. The proposed methodology, implemented in the PROMISE precision autotuning tool, combines numerical validation with a systematic search to generate program variants that satisfy user-defined accuracy requirements. To address the computational cost of this exploration, a containerized benchmarking framework supports parallel execution across multiple algorithms and parameter configurations. The approach is evaluated on a suite of numerical programs, including linear solvers and applications from the Rodinia benchmark. Results show that a substantial proportion of variables can be safely reduced to lower precision while preserving accuracy, indicating that standard double precision is often over-provisioned. These findings highlight the potential of automated precision tuning to derive efficient mixed-precision configurations tailored to application-specific accuracy requirements.

2606.08163 2026-06-11 math.CO 版本更新

A spectral threshold for triangle counting

三角形计数的谱阈值

Yuhan Zhang, Mingqing Zhai

AI总结 研究在谱半径条件下图所含三角形的最小数量,证明了当谱半径满足特定不等式时,图至少包含s个三角形,并刻画了极图。

Comments 14 pp

详情
AI中文摘要

1970年,Nosal证明了Mantel定理的谱推广:每个有m条边且谱半径ρ_1>√m的图至少包含一个三角形。后来Ning和Zhai的定量改进指出,任何有m条边且谱半径ρ_1≥√m的图至少包含⌊(√m-1)/2⌋个三角形,除非该图是完全二部图。本文进一步研究在加强的谱条件ρ_1≥√m+c(c为正常数)下保证的最小三角形数量。我们证明,对于任意常数c∈(0,1/2]和所有足够大的m,如果s=s(m)是满足lim_{m→∞} s/m=c的实值函数,那么每个有m条边且谱半径ρ_1满足ρ_1^2≥m-1+2s/(ρ_1-1)的图G至少包含s个三角形。此外,我们刻画了达到最小三角形数量的极图。特别地,当s=(m-1)/2时,我们的结果解决了Li、Feng和Peng提出的一个猜想。

英文摘要

The 1970 spectral extension of Mantel's theorem, proved by Nosal, states that every graph with $m$ edges and spectral radius $ρ_1>\sqrt{m}$ contains at least one triangle. Its quantitative refinement by Ning and Zhai later established that any graph $G$ with $m$ edges and spectral radius $ρ_1\geq\sqrt{m}$ contains at least $\lfloor\frac{\sqrt{m}-1}{2}\rfloor$ triangles, unless $G$ is a complete bipartite graph. In this paper, we further investigate the minimum number of triangles guaranteed under the strengthened spectral condition $ρ_1\geq\sqrt{m}+c$, where $c$ is a positive constant. We prove that for any constant $c\in (0,\frac{1}{2}]$ and all sufficiently large $m$, if $s=s(m)$ is a real-valued function satisfying $\lim_{m\to\infty} \frac{s}{m}=c$, then every $m$-edge graph $G$ with spectral radius $ρ_1$ satisfying $ρ_1^2\geq m-1+\frac{2s}{ρ_1-1}$ contains at least $s$ triangles. Moreover, we characterize the extremal graph achieving the minimal number of triangles. In particular, when $s=\frac{m-1}2$, our result settles a conjecture proposed by Li, Feng, and Peng.

2606.07751 2026-06-11 astro-ph.GA astro-ph.SR 版本更新

A Colour-colour Fingerprint Links the UV Upturn in Early-type Galaxies to Second-generation Stars from Dissolved Globular Clusters

颜色-颜色指纹将早型星系中的紫外超与溶解球状星团的第二代恒星联系起来

Paul Goudfrooij, Andrea Bellini, Thomas M. Brown, Thomas H. Puzia

AI总结 通过HST/WFC3观测,发现F275W-F390W颜色梯度与紫外超强度相关,支持富金属球状星团溶解产生的第二代恒星(高氦、高氮)是紫外超起源的假说。

Comments 7 pages, 4 figures, accepted for publication as a MNRAS Letter

详情
AI中文摘要

我们探讨了早型星系(ETGs)中两个与质量相关的性质:(1)丰度比[N/Fe]和[Na/Fe],以及(2)远紫外(FUV)波段中心集中的“紫外超”,这很可能由具有超太阳氦丰度的极端水平分支星产生。利用HST/WFC3对一个FUV弱和一个FUV强的ETG的新观测,我们检验了Goudfrooij提出的“MP情景”,该情景认为紫外超以及ETG内部和之间N和Na随质量变化的丰度差异在物理上相关,并由富金属球状星团的溶解产生——这是已知唯一发生He、N和Na质量依赖增丰的星系环境(即“多重星族”现象的第二代恒星)。我们表明,当结合F475W和F850LP的存档数据时,F275W和F390W波段对积分光测中$Y$和[N/Fe]的相关变化特别敏感。虽然F475W-F850LP在两个星系中都随半径增加而减小(与已知的金属丰度梯度一致),但F275W-F390W随半径增加而增大,正如紫外超由具有超太阳$Y$和[N/Fe]的第二代恒星引起所预期的那样。此外,F275W-F390W的径向梯度以及He和N增强星的隐含比例在FUV强的ETG中显著大于FUV弱的ETG,这与MP情景的预测一致。

英文摘要

We address two mass-dependent properties among early-type galaxies (ETGs): (1) abundance ratios [N/Fe] and [Na/Fe], and (2) the centrally concentrated "UV upturn" at far-UV (FUV) wavelengths, which is likely produced by extreme horizontal branch stars with supersolar helium abundances. Using new HST/WFC3 observations of one FUV-weak and one FUV-bright ETG, we probe the "MP scenario" by Goudfrooij who posited that the UV upturn and the mass-dependent abundance variations of N and Na within and among ETGs are physically connected and produced by dissolution of metal-rich globular clusters, which represent the only galactic environment where mass-dependent enrichment of He, N, and Na is known to occur (i.e., second-generation stars of the "multiple stellar populations" (MPs) phenomenon). We show that passbands F275W and F390W are uniquely sensitive to correlated changes in $Y$ and [N/Fe] in integrated-light photometry when combined with archival data in F475W and F850LP. While F475W-F850LP is found to decrease with increasing radius in both galaxies, consistent with known metallicity gradients, F275W-F390W increases with increasing radius, as expected if the UV upturn is caused by second-generation stars with supersolar $Y$ and [N/Fe]. Furthermore, the radial gradient in F275W-F390W and the implied fractions of He- and N-enhanced stars are found to be significantly larger in the FUV-bright ETG than in the FUV-weak one, consistent with the predictions of the MP scenario.

2606.07075 2026-06-11 cs.IR 版本更新

Beyond Matching: Category-Guided Latent Intent Reasoning for Generative Retrieval in E-Commerce

超越匹配:类别引导的潜在意图推理在电商生成式检索中的应用

Fuwei Zhang, Xiaoyu Liu, Jiajie Jin, Jiale Mao, Wei Chen, Dongbo Xi, Yifan Yang, Peng Yan, Zichao Hao, Zhao Zhang, Fuzhen Zhuang

AI总结 提出CaLIR框架,通过类别引导的潜在意图推理,在生成式检索中弥合查询与商品标识的表示差距,平衡检索效果与推理效率。

详情
AI中文摘要

生成式检索通过将用户查询直接映射到产品语义标识符(SID),为电商搜索提供了新范式。然而,电商查询通常简短、嘈杂、属性密集,并与多个类别一致的产品相关联,导致自然语言购物意图与人工构建的商品SID之间存在显著的表示差距。显式的思维链(CoT)推理有助于弥合这一差距,但其额外的生成成本难以与电商在线系统的低延迟要求相协调。为应对这一挑战,我们提出了CaLIR(类别引导的潜在意图推理),一种用于电商生成式检索的类别引导潜在意图推理框架。CaLIR不生成显式的文本理由,而是在SID解码之前学习连续的潜在意图状态,并利用产品类别层次结构作为从粗到细的意图推理的自然支架。具体来说,我们引入层次化语义推理以将潜在状态与类别级购物意图对齐,以及查询级推理增强以建模多正例查询下的多样意图路径。CaLIR进一步将查询特定的动态前缀字典树(由预索引的类别级字典树组装而成)与推理感知的约束解码相结合。在多语言电商搜索数据集上的实验表明,CaLIR在检索效果和推理效率之间取得了比现有方法更好的平衡,同时在诱导层次结构和不同生成骨干上展现出可迁移性和鲁棒性。

英文摘要

Generative retrieval offers a new paradigm for e-commerce search by mapping user queries directly to product Semantic Identifiers (SIDs). However, e-commerce queries are often short, noisy, attribute-heavy, and associated with multiple category-consistent products, creating a substantial representation gap between natural-language shopping intent and artificially constructed item SIDs. Explicit Chain-of-Thought (CoT) reasoning can help bridge this gap, but its extra generation cost is difficult to reconcile with the low-latency requirements of online e-commerce systems. To address this challenge, we propose CaLIR (Category-guided Latent Intent Reasoning), a category-guided latent intent reasoning framework for e-commerce generative retrieval. Rather than generating explicit textual rationales, CaLIR learns continuous latent intent states before SID decoding and uses product category hierarchies as a natural scaffold for coarse-to-fine intent reasoning. Specifically, we introduce hierarchical semantic reasoning to align latent states with category-level shopping intent, and query-wise reasoning enhancement to model diverse intent paths under multi-positive queries. CaLIR further combines a query-specific dynamic prefix trie, assembled from pre-indexed category-level tries, with reasoning-aware constrained decoding. Experiments on multilingual e-commerce search datasets show that CaLIR achieves a better balance between retrieval effectiveness and inference efficiency than existing methods, while also demonstrating transferability and robustness across induced hierarchies and different generative backbones.

2606.06582 2026-06-11 quant-ph hep-th 版本更新

Fun with Graph States: Nonlocal Bell Pairs and the Arf Invariant

图态趣谈:非局域贝尔对与Arf不变量

Bartlomiej Czech, Yichen Feng, Xianlai Wu, Minjun Xie

AI总结 研究图态内积和部分振幅,发现其大小由邻接矩阵秩决定,相位由Arf不变量确定,从而将图态分解为贝尔对与未纠缠辅助态的乘积。

Comments v2: improved Discussion, stylistic edits

详情
AI中文摘要

我们研究了图态——一种由图指定的常用量子态类——的内积和部分振幅。我们发现这些量的大小简单地与图在F_2上的邻接矩阵的秩相关,而相位由其二次细化的Arf不变量决定。这些事实促使了希尔伯特空间的一种非局域张量分解,相对于该分解,所有图态都是贝尔对与未纠缠辅助态的乘积。这些结果可能阐明基于测量的量子计算框架中的量子优势,并表明图态可以用代数拓扑的语言有效地可视化。此外,我们开发了一种专门技术来计算图态中量子比特置换的期望值,这对于计算多重不变量很有用。

英文摘要

We study inner products and partial amplitudes of graph states--a commonly employed class of quantum states, which are specified by graphs. We find that the magnitudes of these quantities are simply related to the rank of the adjacency matrix of the graph over F_2 while the phase is determined by the Arf invariant of its quadratic refinement. These facts motivate a nonlocal tensor factorization of the Hilbert space, with respect to which all graph states are products of Bell pairs with unentangled ancillae. These results may illuminate the quantum advantage in the framework of Measurement-Based Quantum Computation and suggest that graph states can be usefully visualized in the language of algebraic topology. In addition, we develop a specialized technique for computing expectation values of qubit-wise permutations in graph states, which is useful for calculating multi-invariants.

2606.07327 2026-06-11 cond-mat.mtrl-sci cond-mat.dis-nn physics.app-ph physics.comp-ph 版本更新

Six Open Questions in Machine-Learned Interatomic Potential Foundation Models

机器学习原子间势基础模型中的六个开放问题

Isabel Creed, Tim Rein, Ingvars Vitenburgs, Wojciech G. Stark, Viktor Ellingsson, Ahmed Y. Ismail, Guangyu Liu, Yuchen Lou, Bradley A. A. Martin, Cyprien Bone, Matthew A. H. Walker, Mueen Taj, Shirui Wang, Kelvin Wong, Ruiqi Wu, Prakriti Kayastha, Bingqing Cheng, Aditi Krishnapriyan, Michele Ceriotti, Marcel F. Langer, Jarvist Moore Frost, Alex M. Ganose, Venkat Kapil, Keith T. Butler

AI总结 本文定义机器学习原子间势基础模型,并探讨六个关键开放问题,包括数据多样性、模型泛化、可迁移性、不确定性量化、计算效率与物理一致性,以指引未来研究。

详情
AI中文摘要

近年来,机器学习原子间势(MLIPs)对分子建模产生了深远影响,有望解决模拟规模与精度之间长期存在的矛盾。随着新模型和设计的不断涌现,“基础”MLIPs的范式已变得普遍。广义上,基础模型在大型多样化数据集上训练,并承诺以最小更新即可适用于新系统。然而,在这个快速发展的新领域,仍有许多未解之谜。本文旨在阐述并探讨我们认为其中最重要的问题。我们首先为基础MLIPs制定一个工作定义,并利用该定义来框定后续的开放问题。尽管MLIP模型领域进展迅速,但我们相信这些基本问题将在未来几年继续定义MLIPs的前沿研究。

英文摘要

Machine-learned interatomic potentials (MLIPs) have had a profound impact on molecular modelling in recent years, promising to resolve the long-standing tension between the scale and accuracy of simulations. There has been a proliferation of new models and designs, and recently the paradigm of ``foundational'' MLIPs has become prevalent. Broadly speaking, foundation models are trained on large diverse datasets and promise to work well for new systems with minimal updates required. However, in such a new and fast moving field, there are many unanswered questions. In this article, we set out to articulate and explore what we see as the most important among these questions. We start by developing a working definition for foundational MLIPs and use this definition to frame the subsequent open questions. Despite the rapid progress in the field of MLIP models, we believe that these are fundamental questions which will continue to define cutting edge research in MLIPs in the years to come.

2606.07274 2026-06-11 cond-mat.dis-nn 版本更新

Topological Anderson insulators and reentrant topological transitions in a quasiperiodic long-range Su-Schrieffer-Heeger model

准周期长程Su-Schrieffer-Heeger模型中的拓扑安德森绝缘体和重入拓扑相变

Fang-Ming Meng, Qi-Bo Zeng

AI总结 研究具有第三近邻跳跃和准周期无序的一维长程Su-Schrieffer-Heeger模型,发现无序诱导不同绕数的拓扑安德森绝缘体相和阶梯状重入拓扑相变。

Comments 9 pages, 6 figures

详情
AI中文摘要

我们研究了一个具有第三近邻跳跃并受准周期无序影响的一维长程Su-Schrieffer-Heeger模型。在干净极限下,该模型具有绕数$W=-1,0,1$和$2$的相。准周期无序的引入深刻改变了相图,并引发了一系列拓扑相变。由于拓扑二聚化和局域化之间的竞争,具有不同绕数的拓扑安德森绝缘体(TAI)相出现,并且即使在强无序区域中谱隙几乎闭合时也能持续存在。此外,我们发现了通过改变准周期无序强度或跳跃振幅诱导的多次重入拓扑相变。值得注意的是,系统表现出阶梯状的拓扑安德森转变,其中实空间绕数随着无序强度的增加通过连续的量子化步骤演化。我们的结果表明,长程跳跃和准周期无序之间的相互作用产生了丰富的无序诱导拓扑相和重入拓扑相变现象。

英文摘要

We study a one-dimensional long-range Su-Schrieffer-Heeger model with third-nearest-neighbor hopping and subject to quasiperiodic disorder. In the clean limit, the model hosts phases characterized by winding numbers $W=-1,0,1$ and $2$. The introduction of quasiperiodic disorder profoundly modifies the phase diagram and induces a series of topological phase transitions. Owing to the competition between topological dimerization and localization, topological Anderson insulating (TAI) phases with different winding numbers emerge and can persist even when the spectral gap becomes nearly closed in the strong-disorder regime. In addition, we uncover multiple reentrant topological phase transitions induced by varying either the quasiperiodic disorder strength or the hopping amplitudes. Remarkably, the system exhibits staircase-like topological Anderson transitions, where the real-space winding number evolves through successive quantized steps with increasing disorder strength. Our results demonstrate that the interplay between long-range hopping and quasiperiodic disorder generates a rich landscape of disorder-induced topological phases and reentrant topological transition phenomena.

2606.06452 2026-06-11 quant-ph cond-mat.quant-gas nlin.PS 版本更新

Energy-Modulated Time-Asymmetric Spontaneous Collapse: Forward-Backward Dynamics from Stochastic Ito Reversal and Bright Solitons

能量调制的非对称时间自发塌缩:来自随机伊藤反转和前向-后向动力学与亮孤子

Ikechukwu C. Okoro, Mike O. Osiele, Godfrey E. Akpojotor

AI总结 本文通过立方-五次非线性薛定谔方程中的随机伊藤场反转,建立了一个严格的对称破缺和量子不可逆性理论框架,并得到了准一维吸引性锂-7原子玻色-爱因斯坦凝聚中的精确亮孤子解。

Comments 19 pages, 5 figures, Bibliography corrected.Submitted to Journal of Physics A: Mathematical and Theoretical. The authors thank Dr.M.Carlesso for feedback that prompted a bibliography correction in v2

详情
AI中文摘要

我们提出了一个严格的理论框架,用于描述在立方-五次非线性薛定谔方程(CQ-NLSE)形式中,由随机伊藤场反转引起的对称破缺和量子不可逆性。从三个物理动机出发,通过伊藤微积分推导出前向和后向非线性随机微分方程。运动学时间反转被证明与伊藤随机结构根本不相容,产生了普适的非对称耦合参数2/3。引入了一个能量驱动的塌缩算符,该算符与噪声强度、局域概率密度和激发能平方的乘积成正比,从而在高密度、高激发区域放大塌缩。对于准一维的吸引性锂-7原子玻色-爱因斯坦凝聚,获得了精确的亮孤子解,其前向和后向振幅比为1.870。参数平面的热图分析表明,前向塌缩算符随时间单调增长,而后向塌缩算符衰减,比值达到约10^30,这使该框架与传统的对称塌缩模型截然不同。

英文摘要

We present a rigorous theoretical framework for symmetry breaking and quantum irreversibility arising from stochastic Ito field reversal within a cubic-quintic nonlinear Schrodinger equation (CQ-NLSE) formalism. Starting from three physically motivated considerations, forward and backward nonlinear stochastic differential equations are derived via the Ito calculus. Kinematic time-reversal is shown to be fundamentally incompatible with the Ito stochastic structure, yielding the universal asymmetry-coupling parameter of 2/3. An energy-driven collapse operator proportional to the product of noise strength, local probability density, and excitation energy squared is introduced, amplifying the collapse in high-density, high-excitation regions. Exactly bright soliton solutions are obtained for a quasi-one-dimensional BEC of attractive Li-7 atoms, with forward and backward amplitude ratio of 1.870. Heat map analysis of the parameter planes reveals that the forward collapse operator grows monotonically in time while the backward counterpart decays, achieving a ratio approximately 1030, sharply distinguishing this framework from conventional symmetric collapse models.

2606.05540 2026-06-11 astro-ph.GA 版本更新

A linear residual structure across galaxy rotation curves

星系旋转曲线中的线性残差结构

Hosik Lee

AI总结 通过分析SPARC和LITTLE THINGS巡天的星系数据,发现扣除重子物质贡献后的残差遵循共同的线性模式,分为质量耦合和几乎质量无关两部分,为星系动力学理论提供新约束。

Comments 8 pages 3 figures, SI for 175 SPARC galaxies and 22 LITTLE THINGS galaxies are included

详情
AI中文摘要

星系旋转曲线长期以来表明,观测到的恒星和气体运动不能完全由可见物质解释。这里我们研究扣除重子贡献后剩余的残差分量。利用SPARC和LITTLE THINGS巡天的星系,我们发现残差并非随机分布,而是在不同星系群体中遵循共同的线性模式。残差结构分为质量耦合分量和几乎质量无关的分量。这些经验规律为星系动力学理论提供了新的约束。

英文摘要

Galaxy rotation curves exhibit systematic discrepancies between the observed dynamics and the gravitational contribution expected from baryonic matter. Identifying empirical regularities in these discrepancies may provide insight into the organization of galaxy dynamics. We investigate whether the residual component of galaxy rotation curves contains a common structure across galaxies spanning a broad range of masses and morphologies. Using rotation-curve data from the SPARC and LITTLE THINGS surveys, we analyze residual velocity-squared profiles after accounting for the baryonic contribution and allowing for uncertainties in the baryonic normalization. We find that the residuals are not randomly distributed but instead follow a common linear pattern across a diverse galaxy population. Population-level analysis shows that the data preferentially select this linear residual structure over alternative radial dependences. The residual component separates into a mass-coupled contribution and a second contribution that remains nearly independent of galaxy mass. These empirical trends are observed across both spiral and dwarf galaxy samples. The existence of a common residual structure across galaxies spanning a broad range of masses and morphologies provides a new empirical constraint on theories of galaxy dynamics.

2606.04717 2026-06-11 cs.CR cs.CY 版本更新

Auditing CoT Answer-Hijack Patches: Source-Control Certificates with Type-I Guarantees

链式思维答案劫持的选择感知诊断

Jianwei Tai

AI总结 针对链式思维答案劫持攻击,提出选择感知诊断方法,通过激活修补定位脆弱区域,并验证恢复依赖于同问题干净源。

详情
AI中文摘要

我们研究了一个受控的数值代理,用于链式思维(CoT)答案劫持,其动机是攻击中看似合理的推理引导出有害的最终答案。GSM8K和MATH-500上的CoT包装器将最终答案从真实标签翻转。我们不将激活修补视为干净痕迹恢复,而是询问劫持轨迹在何处脆弱,以及恢复是否依赖于同问题的干净源。在Qwen2.5-7B和Llama3-8B上,针对GSM8K的少样本、谜题和谄媚劫持,经过Bonferroni校正后,三个少样本/谜题单元格通过了确认性$K{=}1$定位。选择感知的50/50频带验证保留了保留集内带内与带外差距:Qwen-谜题、Llama3-少样本和Llama3-谜题分别为+32.6、+45.1和+17.7点,而精确$\Lstar$一致性则不稳定得多。Qwen-少样本仍处于探索阶段,谄媚单元格在短修补下呈现时间扩散。BF16 Qwen-谜题全频带扫描保留了频带信号($n{=}30$,$K{=}1$时扩散0.33,峰值层20),支持频带不仅是INT4伪影的结论。固定钩子的GSM8K重运行在两个主要谜题单元格中保留了恢复:Qwen-谜题在$n{=}100$时恢复47.0%(47/100;Wilson 95% CI [37.5%, 56.7%]),而Llama3-谜题在$n{=}100$时恢复39.0%(39/100;[30.0%, 48.8%])。冻结迁移到MATH-500在最大固定迁移运行中恢复了26.0%的合格案例(13/50;Wilson 95% CI [15.9%, 39.6%])。源控制改变了机制解释。配对自助法在Qwen-少样本(+3.0点,95% CI [-18.2, +27.3])和扩展$n{=}60$的Llama3-谜题(干净-随机 -8.3 [-21.7, +5.0])中给出了干净源与随机源之间的有限样本非分离,而Llama3-少样本是内容介导的(+40.0 [+16.7, +60.0])。

英文摘要

Chain-of-thought (CoT) answer-hijack templates can flip the final numeric answer of a 7B-8B language model on GSM8K or MATH-500 even when the visible reasoning trace looks fluent. Activation patching is the standard probe for locating where this hijack can be undone, and a successful clean-source patch is often read as evidence that the patched activation carries the recovered content. We show that this reading is unsound: clean-only localization profiles (peak, spread, thresholded band) underidentify the frozen-hook source contrast, and the clean-only profile is an intervention map, not a mediation certificate. We then construct an audit that turns each candidate patch into a source-control certificate with a pre-registered Type-I guarantee. The certificate runs in three stages: SELECT (clean-source band sweep with permutation calibration and held-out validation), FREEZE (lock the hook), and AUDIT (paired-bootstrap source contrasts at the frozen hook). It emits an incorrect mechanism label with probability at most alpha = alpha_sel + alpha_audit under sample-split disjointness. A matching-rate sample-complexity theorem (n_star = Theta(Delta^{-2} log(1/alpha))) bounds the audit cost. On Qwen2.5-7B and Llama3-8B, three few-shot/puzzle cells pass confirmatory K=1 localization with held-out gaps +32.6, +45.1, +17.7; fixed-hook reruns recover 47.0% (Qwen-puzzle) and 39.0% (Llama3-puzzle) at n=100; frozen MATH-500 transfer recovers 26.0%. After audit, Llama3-PZ and Qwen-PZ are identity-light with moderate magnitude (Qwen-PZ also layer-sensitive); Llama3-FS is a single-seed moderate-positive candidate (multi-seed replication queued); Qwen-FS is exploratory non-separation with a layer-sensitive flag. The method is a diagnostic auditing protocol, not an adaptive safety defense.

2606.04586 2026-06-11 math.DG math.AP 版本更新

Calibration energy and mean curvature flow

校准能量与平均曲率流

Tatsuya Miura, Fabian Rupp

AI总结 本文引入校准能量量化定向浸入与校准几何的偏差,证明其在平均曲率流下的精确耗散恒等式,并应用于孤子刚性和二维永恒解的收敛性。

Comments 43 pages, comments welcome! Minor changes, replacing Corollary 2.5 by Remark 2.5

详情
AI中文摘要

我们为欧几里得空间中的定向浸入引入了校准能量,量化了与校准几何的偏差。一个关键性质是,对于无限体积的浸入,该能量可能保持有限,而零拉格朗日结构确保其与体积泛函具有相同的一阶变分。在温和的局部体积界下,我们建立了沿任意维数和余维数的定向、适定平均曲率流的校准能量的精确耗散恒等式。这为有限体积环境之外的平均曲率流提供了一个新的、有限的变分框架。我们的结果产生了若干应用,包括孤子的刚性和二维永恒解的收敛性。特别地,在所有维数和余维数中,具有有限常系数校准能量的每个适定自扩张子必须是平面。

英文摘要

We introduce the calibration energy for oriented immersions into Euclidean space, quantifying the deviation from calibrated geometry. A key property is that this energy may remain finite for infinite-volume immersions, while a null-Lagrangian structure ensures that it has the same first variation as the volume functional. We establish an exact dissipation identity for the calibration energy along oriented, proper mean curvature flows in arbitrary dimensions and codimensions, under a mild local-volume bound. This provides a new, finite variational framework for mean curvature flow beyond the finite-volume setting. Our result yields several applications, including rigidity for solitons and convergence for two-dimensional immortal solutions. In particular, every proper self-expander with finite constant-coefficient calibration energy must be a plane in all dimensions and codimensions.

2606.04571 2026-06-11 hep-ph 版本更新

Rolling Down the Leptonic BSM Landscape Using Machine Learning Techniques

利用机器学习技术探索轻子领域的BSM景观

Alfredo Aranda, Raymundo Ramos, Alexander J. Stuart

AI总结 本文通过机器学习中的初始化和优化技术,最小化描述中微子质量矩阵纹理或条件的损失函数,以探索轻子领域中的标准模型外物理,并得到近似符合所需形式的矩阵及其优化参数。

Comments 39 pages, 12 figures. References added

详情
AI中文摘要

在这项工作中,我们调整并应用机器学习技术来探索轻子领域中标准模型之外的物理。即,我们采用机器学习中应用的初始化和优化方法,最小化描述中微子质量矩阵中所需纹理或条件的损失函数。在优化过程中探索模型自由参数,经过若干优化步骤的训练后,我们获得近似遵循所需形式的矩阵及其相应的优化参数。我们还讨论了本文提出的思想与其他基于人工智能的方法相结合的扩展和额外应用。

英文摘要

In this work, we adapt and apply techniques from machine learning to the exploration of physics beyond the Standard Model in the leptonic sector. Namely, we employ initialization and optimization, as they are applied in machine learning, to minimize a loss function that describes textures or conditions which we want in the neutrino mass matrix. The model free parameters are explored during the optimization, and after training for a number of optimization steps, we obtain matrices that approximately follow the desired forms, as well as their corresponding optimized parameters. We also discuss extensions and additional applications of the ideas presented here in conjunction with other methods based on artificial intelligence.

2606.03308 2026-06-11 cs.CR 版本更新

The Security Budget of Code-LLM Prompt Hardening: Provable Limits Under Pass-Only Acceptance

代码大语言模型的安全预算:一种信息论容量-安全界限

Jianwei Tai

AI总结 本文提出一种信息论框架,通过容量-安全界限量化代码大语言模型在提示扰动下的功能容量与扰动保留之间的权衡,并利用输出隐藏状态进行实证验证。

详情
AI中文摘要

AI编程助手将自然语言提示作为软件开发接口,因此小的提示扰动会带来可用性和安全风险。我们研究了代码大语言模型在功能容量 $\Cap= mI(c^*;c_\pi)$ 和扰动保留 $\Sec= mI(c_\pi; ilde c_\pi)$ 之间的信息论权衡。这里 $\Sec$ 是一个保留信道量,并非对利用成功或脆弱代码生成的直接度量。对于建模为 $p o c_\pi$ 且带有扰动提示 $ ilde p$ 的代码补全,我们证明了 $\Cap+\Sec\le mH(c^*)+ mI(p; ilde p)$,将预算分解为任务熵和提示泄露。一个确定性嵌入推论给出了隐藏状态版本,而一个分词器/gzip伴随界限给出了序列级任务熵的模型无关上限。实验上,我们从仅输出最后一个令牌的隐藏状态估计嵌入的 $\Cap$ 和 $\Sec$,排除了 $\Sec$ 信道中的提示上下文。两个模型、两个数据集、INT4/BF16精度以及估计器消融实验中的六个独立验证行满足嵌入检查 $(\Cap+\max_T\Sec)/( mH(z^*)+\max_T mI(p; ilde p))\le1$。饱和度为0.27–0.92,定理松弛为2.36–26.94 nats;一个单独的三种子稳定性诊断的平均饱和度为0.87。一个上下文混合余弦(仅用作每个问题的生成-提示对齐信号)与CodeLlama-HumanEval ($ ho{=}0.36$, $p{<}10^{-4}$)、Qwen-HumanEval ($ ho{=}0.22$, $p{=}0.005$)和CodeLlama-MBPP ($ ho{=}0.225$, $p{=}0.0038$; 所有 $n{=}164$) 上的pass@1相关。使用23个扰动的池、固定通用后缀和提示嵌入PGD的自适应压力测试均留下正松弛。

英文摘要

We give a quantitative impossibility result for pass-only prompt hardening of code LLMs. For any deterministic prompt filter $h$ and a registered family of finite executable-equivalence task variables $\mathcal Y_{\mathrm{exec}}$, the shared filtered-prompt channel $\rmI(h(p);h(\tilde p))$ is lower-bounded by a worst-$Y$ Fano floor; on HumanEval and MBPP the universal pass-only floor evaluates to $\mathcal F^{\mathrm{op}}\ge 0.84$ and $1.20$ nats at $η=0.05$ task-collapse tolerance, and the identity row realizes $\mathcal F^{\mathrm{id}}\ge 1.67$ and $1.80$ nats. An estimator-invariance corollary lifts the floor to any deterministic embedding pipeline; a dataset-agnostic corollary states the floor in visible-spec entropy and is empirically witnessed by $164/164$ HumanEval+ and $224/224$ MBPP+ $V(p)$-invariance. We operationalize the floor as the \emph{Tri-Audit Protocol}, a two-axis reporting protocol that separates a prompt-side deductive registry attribute (Shannon nats on the visible-spec representation) from a model-side empirical proxy (KSG-1 primary, MINE secondary, on hidden states). A constrained best-of-family search over deterministic and guarded learned filters on CodeLlama-7B, Qwen2.5-Coder-7B/1.5B and DeepSeek-Coder-6.7B at $n=164$ yields the \emph{Cross-Model Tri-Audit Invariance}: of twenty-eight pass-preserving rows, twelve antecedent-preserving deterministic rows fail proxy-axis leakage reduction on every backbone with sign-invariant positive deviations, twelve antecedent-changed-of-record learned-canonicalizer rows fail proxy-axis leakage on every backbone, and four antecedent-violating rows are reported as registered-family collapse; no filter produces a shared Tri-pass on a nine-cell gate-sensitivity sweep. Pass@1 alone cannot certify code-LLM prompt hardening.

2606.03537 2026-06-11 math.NA cs.NA physics.optics 版本更新

Boundedness of Left Half-Plane Eigenvalues for Non-Selfadjoint Indefinite Sturm--Liouville Problems with Applications to Fourier Modal Methods

非自伴不定Sturm-Liouville问题左半平面特征值的有界性及其在Fourier模态方法中的应用

Ehsan Faghihifar

AI总结 研究一类非自伴不定Sturm-Liouville问题,证明左半平面特征值有界从而有限,并应用于TM偏振光栅衍射问题中识别非物理伪模。

Comments 26 pages, 10 figures

详情
AI中文摘要

我们研究一类一般形式的非自伴不定Sturm-Liouville问题:在有限区间上,系数为复值函数,$$ -(p\,y')' + q\,y = \lambda\, p\, y, $$ 其中$p$分段属于$W^{2,\infty}$,非零且满足非退化界面条件,$q$有界。我们证明开左半平面中的所有特征值包含在一个有界集中,由经典Sturm-Liouville理论,这意味着它们的有限性。该类问题的一个突出实例出现在横磁(TM)极化的层状光栅衍射问题中,其中$p=\epsilon(x)^{-1}$是空间变化介电常数分布的倒数。我们的结果为低损耗金属光栅中识别非物理伪模提供了一个简单而严格的标准——这是Fourier模态方法中一个臭名昭著的不稳定性来源。数值例子说明了该标准的实用性。

英文摘要

We study a class of Sturm--Liouville problems of the form $$ -(p\,y')' + q\,y = λ\, p\, y, $$ on a finite interval with complex-valued coefficients, where $p$ is piecewise smooth and $q$ is bounded. We prove that all eigenvalues in the open left half-plane are contained in a bounded set, which implies that only finitely many eigenvalues lie in this region. A canonical instance of this class arises in transverse-magnetic (TM) diffraction by metallic lamellar gratings, a benchmark problem in computational photonics that has been central to the development of Fourier modal methods. These methods exhibit long-standing convergence difficulties in this setting, associated with the loss of definiteness of the underlying operator and the emergence of spurious modes. Our result yields a rigorous criterion for identifying such non-physical modes in low-loss metallic gratings. Numerical examples illustrate the practical utility of the criterion.